Home
last modified time | relevance | path

Searched refs:ideal (Results 101 – 125 of 6634) sorted by relevance

12345678910>>...266

/dports/math/giacxcas/CoCoALib-0.99700/src/CoCoA-5/tests/
H A Dtut-CoCoLA4.cocoa57 -- ring for 0-dimensional ideal
16 ideal(x^2-1, y^2-1, x+y+z)
54 J := I; -- S contains just the ideal I
108 -- L := Kt/ideal(f);
124 -- ideal(x^2-1, y^2-1, x+y+z)
141 -- J := ideal(Gtx) + ideal(ReadExpr(Ktx, sprint(f)));
158 I := ideal(f1, f2, f3);
170 NewS := [ ideal(ReducedGBasis(J + ideal(f))) | f in EF ];
179 J := ideal(apply(phi, gens(S[1])));
195 Jr := ideal(diff(RGB, [gz])) + ideal(z-r);
[all …]
H A Dwhatiscocoa.cocoa520 PolySystem := ideal(x-y+z-2, 3*x-z+6, x+y-1);
34 I1 := ideal(a, b-1);
35 I2 := ideal(a-1, b);
37 I3 := ideal(b, c-1);
38 I4 := ideal(b-1, c);
40 I5 := ideal(a, b, c-1);
41 I6 := ideal(b-1, a, c);
42 I7 := ideal(b, a-1, c);
43 I8 := ideal(b-1, a-1, c);
56 I := ideal(VerticesEq) + ideal(EdgesEq) + ideal(x[1]-1, x[2]);
[all …]
/dports/math/frobby/frobby-0.9.1/src/
H A DGenerateIdealAction.cpp66 BigIdeal ideal; in perform() local
71 generator.generateIdeal(ideal, in perform()
76 generator.generateListIdeal(ideal, _variableCount); in perform()
78 generator.generateEdgeIdeal(ideal, _variableCount, _generatorCount); in perform()
80 generator.generateKingChessIdeal(ideal, _variableCount); in perform()
82 generator.generateKnightChessIdeal(ideal, _variableCount); in perform()
84 generator.generateRookChessIdeal(ideal, _variableCount, _generatorCount); in perform()
86 generator.generateMatchingIdeal(ideal, _variableCount); in perform()
88 generator.generateTreeIdeal(ideal, _variableCount); in perform()
95 ioFacade.writeIdeal(ideal, output.get(), stdout); in perform()
H A DrandomDataGenerators.cpp35 ideal.newLastTerm(); in generateLinkedListIdeal()
97 ideal.sortReverseLex(); in generateChessIdeal()
98 bigIdeal.insert(ideal); in generateChessIdeal()
163 ideal.newLastTerm(); in generateTreeIdeal()
179 Ideal ideal(varCount); in generateRookChessIdeal() local
209 ideal.insert(term); in generateRookChessIdeal()
220 bigIdeal.insert(ideal); in generateRookChessIdeal()
388 bigIdeal.insert(ideal); in generateMatchingIdeal()
410 ideal.insert(term); in generateRandomEdgeIdeal()
422 bigIdeal.insert(ideal); in generateRandomEdgeIdeal()
[all …]
H A DDeformer.cpp30 void deform(Ideal& ideal, in deform() argument
38 Ideal::const_iterator end = ideal.end(); in deform()
46 Term tmp(ideal.getVarCount()); in deform()
68 if (!ideal.strictlyContains(tmp)) { in deform()
85 Deformer::Deformer(Ideal& ideal, in Deformer() argument
88 _undeform(ideal.getVarCount()) { in Deformer()
90 orderer.order(ideal); in Deformer()
92 for (size_t var = 0; var < ideal.getVarCount(); ++var) in Deformer()
93 deform(ideal, _undeform[var], var, stronglyGeneric); in Deformer()
95 ASSERT(!stronglyGeneric || ideal.isStronglyGeneric()); in Deformer()
[all …]
H A DRawSquareFreeIdeal.cpp98 p->insert(ideal); in construct()
105 p->insert(ideal); in construct()
141 if (this == &ideal) { in setToTransposeOf()
616 return Ops::lexLess(ideal->getGenerator(a), ideal->getGenerator(b), in operator ()()
619 RawSquareFreeIdeal* ideal; member
629 cmp.ideal = this; in sortLexAscending()
803 ASSERT(ideal->isValid()); in newRawSquareFreeIdeal()
804 return ideal; in newRawSquareFreeIdeal()
814 p->insert(ideal); in newRawSquareFreeIdeal()
833 ideal->insert(term); in newRawSquareFreeIdealParse()
[all …]
H A DCanonicalTermConsumer.cpp50 auto_ptr<Ideal> ideal(new Ideal(_varCount)); in beginConsuming() local
51 exceptionSafePushBack(_ideals, ideal); in beginConsuming()
96 auto_ptr<Ideal> ideal(_ideals.back()); in passLastIdeal() local
99 canonicalizeIdeal(*ideal); in passLastIdeal()
103 Ideal::const_iterator end = ideal->end(); in passLastIdeal()
104 for (Ideal::const_iterator it = ideal->begin(); it != end; ++it) { in passLastIdeal()
108 ideal.reset(0); in passLastIdeal()
113 void CanonicalTermConsumer::canonicalizeIdeal(Ideal& ideal) { in canonicalizeIdeal() argument
115 ideal.sortReverseLex(); in canonicalizeIdeal()
118 sort(ideal.begin(), ideal.end(), comparator); in canonicalizeIdeal()
/dports/math/singular/Singular-Release-4-2-1/Singular/dyn_modules/gfanlib/
H A Dwitness.h14 matrix divisionDiscardingRemainder(const poly f, const ideal G, const ring r);
23 matrix divisionDiscardingRemainder(const ideal F, const ideal G, const ring r);
31 poly witness(const poly m, const ideal I, const ideal inI, const ring r);
41 ideal witness(const ideal inI, const ideal J, const ring r);
/dports/math/singular/Singular-Release-4-2-1/kernel/
H A Dpolys.cc71 ideal R; matrix U; in p_Divide()
82 id_Delete((ideal *)&T,r); in p_Divide()
83 id_Delete((ideal *)&U,r); in p_Divide()
94 ideal I=idInit(comps,1); in p_Divide()
129 ideal R; matrix U; in p_Divide()
209 ideal R; matrix U; in pp_Divide()
233 ideal I=idInit(comps,1); in pp_Divide()
269 ideal R; matrix U; in pp_Divide()
356 ideal R; matrix U; in p_DivRem()
367 id_Delete((ideal *)&T,r); in p_DivRem()
[all …]
/dports/devel/hyperscan/hyperscan-5.4.0/src/fdr/
H A Dfdr_engine_description.cpp138 u32 ideal; in chooseEngine() local
141 ideal = 8; in chooseEngine()
146 ideal = 10; in chooseEngine()
148 ideal = 11; in chooseEngine()
150 ideal = 12; in chooseEngine()
152 ideal = 13; in chooseEngine()
154 ideal = 15; in chooseEngine()
158 ideal += 1; in chooseEngine()
162 ideal -= 2; in chooseEngine()
166 ideal++; in chooseEngine()
[all …]
/dports/math/giacxcas/CoCoALib-0.99700/src/tests/
H A Dtest-ideal2.C51 ideal Z = ideal(zero(ZZ)); in TestZZ()
52 ideal J3 = ideal(RingElem(ZZ,3)); in TestZZ()
53 ideal J35 = ideal(RingElem(ZZ,3), RingElem(ZZ,5)); in TestZZ()
54 ideal J46 = ideal(RingElem(ZZ,4), RingElem(ZZ,6)); in TestZZ()
55 ideal J6 = ideal(RingElem(ZZ,6)); in TestZZ()
77 ideal I(power(f1,i)*power(f2,j)); in TestIsPrimary_PID()
/dports/math/cocoalib/CoCoALib-0.99712/src/tests/
H A Dtest-ideal2.C51 ideal Z = ideal(zero(ZZ)); in TestZZ()
52 ideal J3 = ideal(RingElem(ZZ,3)); in TestZZ()
53 ideal J35 = ideal(RingElem(ZZ,3), RingElem(ZZ,5)); in TestZZ()
54 ideal J46 = ideal(RingElem(ZZ,4), RingElem(ZZ,6)); in TestZZ()
55 ideal J6 = ideal(RingElem(ZZ,6)); in TestZZ()
77 ideal I(power(f1,i)*power(f2,j)); in TestIsPrimary_PID()
/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/
H A DExternalLibs-Frobby.C91 myIdeals.back() += ideal(m); in consume()
94 std::vector<ideal>& getIdealsRef() { return myIdeals; } in getIdealsRef()
98 std::vector<ideal> myIdeals;
187 void MustHaveMonomialGens(const ideal& I, in MustHaveMonomialGens()
200 ideal FrbAlexanderDual(const ideal& I, ConstRefPPMonoidElem pp) in FrbAlexanderDual()
235 ideal FrbAlexanderDual(const ideal& I) in FrbAlexanderDual()
248 void FrbIrreducibleDecomposition(std::vector<ideal>& components, const ideal& I) in FrbIrreducibleDecomposition()
261 void FrbPrimaryDecomposition(std::vector<ideal>& components, const ideal& I) in FrbPrimaryDecomposition()
274 ideal FrbMaximalStandardMonomials(const ideal& I) in FrbMaximalStandardMonomials()
287 long FrbDimension(const ideal& I) { in FrbDimension()
[all …]
/dports/math/giacxcas/CoCoALib-0.99700/src/AlgebraicCore/
H A DExternalLibs-Frobby.C91 myIdeals.back() += ideal(m); in consume()
94 std::vector<ideal>& getIdealsRef() { return myIdeals; } in getIdealsRef()
98 std::vector<ideal> myIdeals;
187 void MustHaveMonomialGens(const ideal& I, in MustHaveMonomialGens()
200 ideal FrbAlexanderDual(const ideal& I, ConstRefPPMonoidElem pp) in FrbAlexanderDual()
235 ideal FrbAlexanderDual(const ideal& I) in FrbAlexanderDual()
248 void FrbIrreducibleDecomposition(std::vector<ideal>& components, const ideal& I) in FrbIrreducibleDecomposition()
261 void FrbPrimaryDecomposition(std::vector<ideal>& components, const ideal& I) in FrbPrimaryDecomposition()
274 ideal FrbMaximalStandardMonomials(const ideal& I) in FrbMaximalStandardMonomials()
287 long FrbDimension(const ideal& I) { in FrbDimension()
[all …]
/dports/x11-fm/wcmcommander/WCMCommander-release-0.20.0/src/swl/
H A Dswl_layout.h13 int minimal, maximal, ideal; member
15 LSRange(): minimal( 0 ), maximal( 0 ), ideal( 0 ) {} in LSRange()
16 LSRange( int mi, int mx, int id ): minimal( mi ), maximal( mx ), ideal( id ) {} in LSRange()
17 …void Check() { if ( ideal < minimal ) { ideal = minimal; } if ( maximal < ideal ) { maximal = idea… in Check()
18 void Plus( const LSRange& a ) { minimal += a.minimal; maximal += a.maximal; ideal += a.ideal; } in Plus()
22 return minimal != Other.minimal || maximal != Other.maximal || ideal != Other.ideal;
31 if ( ideal < a.ideal ) { ideal = a.ideal; } in Max()
49 x.minimal = x.maximal = x.ideal = rect.Width(); in Set()
50 y.minimal = y.maximal = y.ideal = rect.Height(); in Set()
54 x.minimal = x.maximal = x.ideal = point.x; in Set()
[all …]
/dports/math/gap/gap-4.11.0/pkg/sonata-2.9.1/lib/
H A Dnrid.gi36 "ideal",
46 "ideal",
56 "ideal",
66 "ideal",
76 "ideal",
86 "ideal",
100 "ideal",
110 "ideal",
120 "ideal",
216 "ideal <-> not ideal",
[all …]
/dports/math/singular/Singular-Release-4-2-1/libpolys/polys/
H A Dsimpleideals.cc39 ideal hh = (ideal)omAllocBin(sip_sideal_bin); in idInit()
413 ideal id_Copy(ideal h1, const ring r) in id_Copy()
607 ideal id_SimpleAdd (ideal h1,ideal h2, const ring R) in id_SimpleAdd()
723 ideal id_Add (ideal h1,ideal h2, const ring r) in id_Add()
736 ideal id_Mult (ideal h1,ideal h2, const ring R) in id_Mult()
815 BOOLEAN id_HomIdeal (ideal id, ideal Q, const ring r) in id_HomIdeal()
1143 ideal id_Power(ideal given,int exp, const ring r) in id_Power()
1193 ideal id_Head(ideal h,const ring r) in id_Head()
1204 ideal id_Homogen(ideal h, int varnum,const ring r) in id_Homogen()
1536 ideal id_Jet(const ideal i,int d, const ring R) in id_Jet()
[all …]
/dports/math/singular/Singular-Release-4-2-1/Singular/dyn_modules/cohomo/
H A Dcohomo.cc474 ideal idmodulo(ideal h1,ideal h2) in idmodulo()
736 ideal idMinus(ideal h1,ideal h2) in idMinus()
808 ideal id_sfmon(ideal h) in id_sfmon()
877 ideal qringadd(ideal h1, ideal h2, int deg) in qringadd()
910 ideal idsrRing(ideal h) in idsrRing()
965 ideal idadda(ideal h1, ideal h2) in idadda()
990 ideal IsSimplex(ideal h) in IsSimplex()
1076 ideal findb(ideal h) in findb()
1572 ideal p_a(ideal h) in p_a()
3849 ideal c_New(ideal Io, ideal sig) in c_New()
[all …]
H A Dcohomo.h14 void gradedpiece1(ideal h,poly a,poly b);
15 void gradedpiece2(ideal h,poly a,poly b);
16 intvec *gradedpiece1n(ideal h,poly a,poly b);
18 void Tlink(ideal h,poly a,poly b,int n);
19 void T1(ideal h);
20 void T2(ideal h);
23 ideal idsrRing(ideal h);
/dports/games/openjk/OpenJK-07675e2/codemp/cgame/
H A Dcg_turret.c39 angle_ideal = (int)ideal[YAW]; in CreepToPosition()
64 if (current[YAW] < ideal[YAW] && (current[YAW]+(max_degree_switch*2)) >= ideal[YAW]) in CreepToPosition()
66 current[YAW] = ideal[YAW]; in CreepToPosition()
78 if (current[YAW] > ideal[YAW] && (current[YAW]-(max_degree_switch*2)) <= ideal[YAW]) in CreepToPosition()
80 current[YAW] = ideal[YAW]; in CreepToPosition()
89 if (ideal[PITCH] < 0) in CreepToPosition()
91 ideal[PITCH] += 360; in CreepToPosition()
94 angle_ideal = (int)ideal[PITCH]; in CreepToPosition()
121 if (current[PITCH] < ideal[PITCH] && (current[PITCH]+(max_degree_switch*2)) >= ideal[PITCH]) in CreepToPosition()
123 current[PITCH] = ideal[PITCH]; in CreepToPosition()
[all …]
/dports/math/cocoalib/CoCoALib-0.99712/src/CoCoA-5/tests/
H A Dwhatiscocoa.cocoa520 PolySystem := ideal(x-y+z-2, 3*x-z+6, x+y-1);
34 I1 := ideal(a, b-1);
35 I2 := ideal(a-1, b);
37 I3 := ideal(b, c-1);
38 I4 := ideal(b-1, c);
40 I5 := ideal(a, b, c-1);
41 I6 := ideal(b-1, a, c);
42 I7 := ideal(b, a-1, c);
43 I8 := ideal(b-1, a-1, c);
56 I := ideal(VerticesEq) + ideal(EdgesEq) + ideal(x[1]-1, x[2]);
[all …]
/dports/math/singular/Singular-Release-4-2-1/kernel/GBEngine/
H A Dsyz.h72 resolvente sySchreyerResolvente(ideal arg, int maxlength, int * length,
75 syStrategy sySchreyer(ideal arg, int maxlength);
77 resolvente syResolvente(ideal arg, int maxlength, int * length,
87 ideal syMinBase(ideal arg);
89 BOOLEAN syTestOrder(ideal i);
93 resolvente syLaScala1(ideal arg,int * length);
94 syStrategy syLaScala3(ideal arg,int * length);
98 syStrategy syHilb(ideal arg,int * length);
99 syStrategy syKosz(ideal arg,int * length);
125 SRes syInitRes(ideal arg,int * length, intvec * Tl, intvec * cw=NULL);
[all …]
/dports/math/singular/Singular-Release-4-2-1/kernel/maps/
H A Dgen_maps.cc16 static void find_subst_for_map(const ring preimage_r, const ring image_r, const ideal image, int &v… in find_subst_for_map()
87 ideal maMapIdeal(const ideal map_id, const ring preimage_r,const ideal image_id, const ring image_r… in maMapIdeal()
97 return (ideal)m; in maMapIdeal()
149 m->m[i]=maEval((map)image_id, map_id->m[i], preimage_r, nMap, (ideal)cache, image_r); in maMapIdeal()
153 idDelete((ideal *)&cache); in maMapIdeal()
154 ideal ii=(ideal)m; in maMapIdeal()
155 ii->rank=((ideal)map_id)->rank; in maMapIdeal()
156 return (ideal)m; in maMapIdeal()
162 poly p=maEval((map)image_id, map_p, map_r, nMap, (ideal)s, image_r); in maMapPoly()
163 id_Delete((ideal*)&s,image_r); in maMapPoly()
[all …]
/dports/misc/vxl/vxl-3.3.2/core/vgl/
H A Dvgl_homg_point_3d.hxx45 if (!p1.ideal() && !p2.ideal() && !p3.ideal()) in collinear()
47 if (!p1.ideal() && !p2.ideal() && p3.ideal()) in collinear()
49 if (!p1.ideal() && p2.ideal() && !p3.ideal()) in collinear()
51 if (p1.ideal() && !p2.ideal() && !p3.ideal()) in collinear()
53 if (p1.ideal() && p2.ideal() && !p3.ideal()) in collinear()
55 if (p1.ideal() && !p2.ideal() && p3.ideal()) in collinear()
57 if (!p1.ideal() && p2.ideal() && p3.ideal()) in collinear()
/dports/math/cocoalib/CoCoALib-0.99712/src/CoCoA-5/
H A DBuiltInFunctions-Frobby.C47 std::vector<ideal> FrbPrimaryDecomposition_forC5(const ideal& I)
49 std::vector<ideal> v;
54 std::vector<ideal> FrbIrreducibleDecomposition_forC5(const ideal& I)
56 std::vector<ideal> v;
61 std::vector<ideal> FrbAssociatedPrimes_forC5(const ideal& I)
63 std::vector<ideal> v;
68 ideal FrbAlexanderDual_forC5(const ideal& I, ConstRefRingElem t)

12345678910>>...266