Home
last modified time | relevance | path

Searched refs:intvec (Results 1 – 25 of 429) sorted by relevance

12345678910>>...18

/dports/math/singular/Singular-Release-4-2-1/Singular/
H A Dwalk.h16 intvec* MwalkNextWeight(intvec* curr_weight,intvec* target_weight, ideal G);
18 int MivSame(intvec* u , intvec* v);
19 int M3ivSame(intvec* next_weight, intvec* u , intvec* v);
26 intvec* MivMatrixOrder(intvec* iv);
28 intvec* MPertVectors(ideal G, intvec* ivtarget, int pdeg);
34 intvec* Mfpertvector(ideal G, intvec* iv);
37 intvec* MivWeightOrderlp(intvec* ivstart);
38 intvec* MivWeightOrderdp(intvec* ivstart);
46 intvec* MkInterRedNextWeight(intvec* iva, intvec* ivb, ideal G);
47 intvec* MPertNextWeight(intvec* iva, ideal G, int deg);
[all …]
H A Dwalk.cc505 static void MivString(intvec* iva, intvec* ivb, intvec* ivc) in MivString()
861 static intvec* MivSub(intvec* a, intvec* b) in MivSub()
865 intvec* result = new intvec(n); in MivSub()
880 intvec* result = new intvec(nR); in MExpPol()
893 int MivSame(intvec* u , intvec* v) in MivSame()
914 int M3ivSame(intvec* temp, intvec* u , intvec* v) in M3ivSame()
983 intvec* MivMatrixOrderRefine(intvec* iv, intvec* iw) in MivMatrixOrderRefine()
1010 intvec* ivm = new intvec(nR); in Mivdp()
1024 intvec* ivm = new intvec(nR); in Mivlp()
1499 intvec* ivM = new intvec(nV); in MivUnit()
[all …]
H A Dextra.cc1490 intvec* arg1 = (intvec*) h->Data(); in jjSYSTEM()
1513 intvec* arg1 = (intvec*) h->Data(); in jjSYSTEM()
1619 intvec* arg1 = (intvec*) h->Data(); in jjSYSTEM()
1648 intvec* arg1 = (intvec*) h->Data(); in jjSYSTEM()
1693 intvec* arg1 = (intvec*) h->Data(); in jjSYSTEM()
1785 intvec* arg1 = (intvec*) h->Data(); in jjSYSTEM()
1802 intvec* arg1 = (intvec*) h->Data(); in jjSYSTEM()
1841 intvec* arg1 = (intvec*) h->Data(); in jjSYSTEM()
1864 intvec* arg1 = (intvec*) h->Data(); in jjSYSTEM()
2331 intvec *v=(intvec *)h->Data(); in jjEXTENDED_SYSTEM()
[all …]
H A Diparith.inc23 // operation: - (intvec) -> intvec
114 // operation: intvec (intmat) -> intvec
115 // operation: intvec (intvec) -> intvec
271 // operation: + (intvec, int) -> intvec
272 // operation: + (int, intvec) -> intvec
275 // operation: + (intvec, intvec) -> intvec
296 // operation: - (intvec, int) -> intvec
298 // operation: - (intvec, intvec) -> intvec
334 // operation: * (intvec, int) -> intvec
335 // operation: * (int, intvec) -> intvec
[all …]
/dports/math/singular/Singular-Release-4-2-1/libpolys/misc/
H A Dintvec.h19 class intvec
38 intvec(int s, int e);
40 intvec(const intvec* iv) in intvec() function
105 inline ~intvec() in ~intvec()
135 inline intvec * ivCopy(const intvec * o) in ivCopy()
142 intvec * ivAdd(intvec * a, intvec * b);
143 intvec * ivSub(intvec * a, intvec * b);
144 intvec * ivTranp(intvec * o);
146 intvec * ivMult(intvec * a, intvec * b);
149 intvec * ivSolveKern(intvec * imat, int ready);
[all …]
H A Dintvec.cc21 intvec::intvec(int s, int e) in intvec() function in intvec
43 intvec::intvec(int r, int c, int init) in intvec() function in intvec
249 intvec * ivAdd(intvec * a, intvec * b) in ivAdd()
279 intvec * ivSub(intvec * a, intvec * b) in ivSub()
309 intvec * ivTranp(intvec * o) in ivTranp()
331 intvec * ivMult(intvec * a, intvec * b) in ivMult()
374 static void ivKernFromRow(intvec *, intvec *, intvec *,
378 static void ivOptRecursive(intvec *, intvec *, intvec *,
654 intvec *res=new intvec(c); in ivOptimizeKern()
675 static void ivOptRecursive(intvec *res, intvec *w, intvec *kern, in ivOptRecursive()
[all …]
/dports/math/singular/Singular-Release-4-2-1/libpolys/polys/nc/
H A Dsca.h65 const intvec *wx, const intvec *wy,
66 const intvec *wCx, const intvec *wCy,
76 const intvec *wx, const intvec *wy,
77 const intvec *wCx, const intvec *wCy,
88 intvec *ivGetSCAXVarWeights(const ring r);
97 const intvec *wCx, const intvec *wCy, in p_IsSCAHomogeneous()
101 intvec *wx = ivGetSCAXVarWeights(r); in p_IsSCAHomogeneous()
102 intvec *wy = ivGetSCAYVarWeights(r); in p_IsSCAHomogeneous()
116 const intvec *wCx, const intvec *wCy, in id_IsSCAHomogeneous()
120 intvec *wx = ivGetSCAXVarWeights(r); in id_IsSCAHomogeneous()
[all …]
H A Dgb_hack.h13 ideal k_gnc_gr_bba(const ideal, const ideal, const intvec *, const intvec *, kStrategy, const ring …
14 ideal k_gnc_gr_mora(const ideal, const ideal, const intvec *, const intvec *, kStrategy, const ring…
16 ideal k_sca_gr_bba(const ideal, const ideal, const intvec *, const intvec *, kStrategy, const ring …
19 ideal k_sca_bba(const ideal, const ideal, const intvec *, const intvec *, kStrategy, const ring _cu…
22 ideal k_sca_mora(const ideal, const ideal, const intvec *, const intvec *, kStrategy, const ring _c…
24 ideal k_sca_gr_bba(const ideal, const ideal, const intvec *, const intvec *, kStrategy, const ring …
/dports/math/singular/Singular-Release-4-2-1/kernel/combinatorics/
H A Dhilb.h14 intvec * hHstdSeries(ideal S, intvec *modulweight, intvec *wdegree, ideal Q=NULL, ring tailRing = c…
15 intvec * hFirstSeries(ideal S, intvec *modulweight, ideal Q=NULL, intvec *wdegree=NULL, ring tailRi…
17 intvec * hSecondSeries(intvec *hseries1);
19 void hLookSeries(ideal S, intvec *modulweight, ideal Q=NULL, intvec *wdegree=NULL, ring tailRing = …
/dports/math/singular/Singular-Release-4-2-1/kernel/GBEngine/
H A Dkstd1.h12 ideal mora (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat);
35 ideal kSba(ideal F,ideal Q, tHomog h, intvec ** mw, int incremental=0, int arri=0, intvec *hilb=NUL…
36 int syzComp=0,int newIdeal=0, intvec *vw=NULL);
38 ideal kStd(ideal F, ideal Q, tHomog h, intvec ** mw,intvec *hilb=NULL,
41 ideal kStdShift(ideal F, ideal Q, tHomog h,intvec ** mw, intvec *hilb=NULL,
42 int syzComp=0, int newIdeal=0, intvec *vw=NULL, BOOLEAN rightGB=FALSE);
62 ideal stdred(ideal F, ideal Q, tHomog h,intvec ** w);
64 ideal kMin_std(ideal F, ideal Q, tHomog h,intvec ** w, ideal &M,
65 intvec *hilb=NULL, int syzComp=0,int reduced=0);
69 EXTERN_VAR intvec * kModW;
[all …]
H A Dsyz.h45 intvec ** weights;
46 intvec ** hilb_coeffs;
50 intvec * Tl;
51 intvec * resolution;
52 intvec * cw;
53 intvec * betti;
78 intvec *** weights, BOOLEAN minim);
84 intvec * syBetti(resolvente res,int length, int * regularity,
85 intvec* weights=NULL,BOOLEAN tomin=TRUE, int * row_shift=NULL);
106 intvec * syBettiOfComputation(syStrategy syzstr, BOOLEAN minim=TRUE,int * row_shift=NULL, intvec *w…
[all …]
H A Dsyz.cc25 static intvec * syPrepareModComp(ideal arg,intvec ** w) in syPrepareModComp()
27 intvec *w1 = NULL; in syPrepareModComp()
358 intvec *dummy; in syMinimizeResolvente()
408 intvec **wtmp = (intvec**)omAlloc0((*length)*sizeof(intvec*)); in syResolvente()
447 *weights = (intvec**)omAlloc0((*length)*sizeof(intvec*)); in syResolvente()
496 tempW = (intvec**)omAlloc0((*length+5)*sizeof(intvec*)); in syResolvente()
743 intvec * degrees,intvec * tocancel) in syDetect()
789 intvec * result; in syBetti()
798 intvec *w=NULL; in syBetti()
988 intvec * exactresult=new intvec(j+1,k+1,0); in syBetti()
[all …]
/dports/math/singular/Singular-Release-4-2-1/kernel/groebner_walk/
H A DwalkSupport.h9 int getMaxPosOfNthRow(intvec *v,int n);
10 int64 getInvEps64(ideal G,intvec *targm,int pertdeg);
11 int invEpsOk64(ideal I, intvec *targm, int pertdeg, int64 inveps64);
12 intvec* getNthRow(intvec *v, int n);
13 int64vec* getNthRow64(intvec *v, int n);
19 intvec* DIFF(ideal G);
22 void getTaun64(ideal G,intvec* targm,int pertdeg, int64vec** v64, int64 & i64);
36 inline int ivSize(intvec* v){ return((v->rows())*(v->cols())); } in ivSize()
38 intvec* leadExp(poly p);
40 void setPosOfIM(intvec* im,int i,int j,int val);
[all …]
/dports/devel/csmith/csmith-2.3.0/src/
H A Dutil.cpp86 vector<intvec> permute(intvec in) in permute()
88 vector<intvec> out; in permute()
98 intvec tail = in; in permute()
100 vector<intvec> tails = permute(tail); in permute()
103 intvec one_tail = tails[i]; in permute()
105 intvec tmp = one_tail; in permute()
120 int expand_within_ranges(vector<unsigned int> in, vector<intvec>& out) in expand_within_ranges()
124 intvec limits(dimension); in expand_within_ranges()
134 intvec tmp; in expand_within_ranges()
/dports/math/singular/Singular-Release-4-2-1/libpolys/polys/
H A Dclapsing.h36 ideal singclap_factorize ( poly f, intvec ** v , int with_exps, const ring r);
38 ideal singclap_sqrfree ( poly f, intvec ** v , int with_exps, const ring r );
41 intvec* singntl_HNF(intvec* A);
44 intvec* singntl_LLL(intvec* A);
46 ideal singclap_absFactorize ( poly f, ideal & mipos, intvec ** exps, int & n, const ring r);
52 int singclap_det_i( intvec * m, const ring r );
/dports/math/singular/Singular-Release-4-2-1/misc/
H A Dpartition.cc11 L->m[idpowerpoint].data=(char *)new intvec(vars); in makepartition()
23 intvec *v=(intvec*)L->m[idpowerpoint].data; in makepartition()
30 intvec *v=(intvec*)L->m[idpowerpoint].data; in makepartition()
31 intvec *vv=ivCopy(v); in makepartition()
37 intvec *v=(intvec*)L->m[idpowerpoint].data; in makepartition()
/dports/science/erkale-pseudopotentials/erkale-870e772f09631b3dbdd99a18e4f3d4786d684a01/src/external/
H A Dstorage.cpp37 intvec.push_back(val); in add()
74 for(size_t i=0;i<intvec.size();i++) in get_int_vec()
75 if(intvec[i].name==name) in get_int_vec()
76 return intvec[i].val; in get_int_vec()
142 for(size_t i=0;i<intvec.size();i++) in set_int_vec()
143 if(intvec[i].name==name) { in set_int_vec()
144 intvec[i].val=val; in set_int_vec()
207 for(size_t i=0;i<intvec.size();i++) in find_int_vec()
209 ret.push_back(intvec[i].name); in find_int_vec()
245 if(intvec.size()) in print()
[all …]
/dports/science/erkale/erkale-8297aefe5aac9dbbb291e04c07661f3cff94a99a/src/external/
H A Dstorage.cpp37 intvec.push_back(val); in add()
74 for(size_t i=0;i<intvec.size();i++) in get_int_vec()
75 if(intvec[i].name==name) in get_int_vec()
76 return intvec[i].val; in get_int_vec()
142 for(size_t i=0;i<intvec.size();i++) in set_int_vec()
143 if(intvec[i].name==name) { in set_int_vec()
144 intvec[i].val=val; in set_int_vec()
207 for(size_t i=0;i<intvec.size();i++) in find_int_vec()
209 ret.push_back(intvec[i].name); in find_int_vec()
245 if(intvec.size()) in print()
[all …]
/dports/textproc/texi2html/texi2html-5.0/test/singular_manual/d2t_singular/
H A Dintprog_lib.tex33 solve_IP(A,bx,c,alg); A intmat, bx intvec, c intvec, alg string.
34 solve_IP(A,bx,c,alg); A intmat, bx list of intvec, c intvec,
36 @*solve_IP(A,bx,c,alg,prsv); A intmat, bx intvec, c intvec,
37 alg string, prsv intvec.
38 @*solve_IP(A,bx,c,alg,prsv); A intmat, bx list of intvec, c intvec,
39 alg string, prsv intvec.
82 single intvec.
91 intvec b1=1,1;
92 intvec c=2,2,1;
98 intvec b2=-1,1;
[all …]
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/g++.old-deja/g++.brendan/
H A Dtemplate5.C35 Vector<int> intvec(3); in main()
37 intvec[0] = 1; in main()
38 intvec[1] = 2; in main()
39 intvec[2] = 3; in main()
42 intvec[i]; in main()
/dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/g++.old-deja/g++.brendan/
H A Dtemplate5.C35 Vector<int> intvec(3); in main()
37 intvec[0] = 1; in main()
38 intvec[1] = 2; in main()
39 intvec[2] = 3; in main()
42 intvec[i]; in main()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/testsuite/g++.old-deja/g++.brendan/
H A Dtemplate5.C35 Vector<int> intvec(3); in main()
37 intvec[0] = 1; in main()
38 intvec[1] = 2; in main()
39 intvec[2] = 3; in main()
42 intvec[i]; in main()
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/testsuite/g++.old-deja/g++.brendan/
H A Dtemplate5.C35 Vector<int> intvec(3); in main()
37 intvec[0] = 1; in main()
38 intvec[1] = 2; in main()
39 intvec[2] = 3; in main()
42 intvec[i]; in main()
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/g++.old-deja/g++.brendan/
H A Dtemplate5.C35 Vector<int> intvec(3); in main()
37 intvec[0] = 1; in main()
38 intvec[1] = 2; in main()
39 intvec[2] = 3; in main()
42 intvec[i]; in main()
/dports/lang/gnat_util/gcc-6-20180516/gcc/testsuite/g++.old-deja/g++.brendan/
H A Dtemplate5.C35 Vector<int> intvec(3); in main()
37 intvec[0] = 1; in main()
38 intvec[1] = 2; in main()
39 intvec[2] = 3; in main()
42 intvec[i]; in main()

12345678910>>...18