/dports/math/polymake/polymake-4.5/bundled/singular/apps/ideal/cpperl/ |
H A D | SingularIdeal.cpperl | 1 {"app": "ideal", 3 …polymake/ideal/singularIdeal.h"], "pkg": "Polymake::ideal::SingularIdeal", "wrapper_file": "bundle… 4 …ymake/Array.h", "polymake/Polynomial.h", "polymake/Rational.h", "polymake/ideal/singularIdeal.h"],… 5 …make/Polynomial.h", "polymake/Rational.h", "polymake/Vector.h", "polymake/ideal/singularIdeal.h"],… 6 …make/Matrix.h", "polymake/Polynomial.h", "polymake/Rational.h", "polymake/ideal/singularIdeal.h"],… 7 …olynomial.h", "polymake/Rational.h", "polymake/SparseMatrix.h", "polymake/ideal/singularIdeal.h"],…
|
/dports/sysutils/p5-MogileFS-Server/MogileFS-Server-2.73/lib/MogileFS/ReplicationPolicy/ |
H A D | MultipleHosts.pm | 95 my @ideal = grep { ! $skip_host{$_->hostid} } @all_dests; 98 return TEMP_NO_ANSWER if $already_on >= $min && @ideal == 0; 100 $self->sort_devices(\@ideal, \@desp, $fid); 103 ideal => \@ideal, 120 my ($self, $ideal, $desp, $fid) = @_; 125 @{ $ideal } = weighted_list(map { [$_, 100 * $_->percent_free] } 126 splice(@{ $ideal }, 0, 20));
|
/dports/math/gap/gap-4.11.0/lib/ |
H A D | smgideal.gi | 58 local i, ideal, new; 106 local i, ideal, new; 108 ideal:= UnderlyingCollection(enum); 135 if not HasAsSSortedList(ideal) then 153 local i, j, new, onleft, ideal; 155 ideal:= UnderlyingCollection(enum); 190 if not HasAsSSortedList(ideal) then 375 "for a left semigroup ideal", 382 "for a semigroup ideal", 415 "for a semigroup ideal", [all …]
|
/dports/cad/ghdl/ghdl-1.0.0/testsuite/vests/vhdl-ams/ashenden/compliant/analog-modeling/ |
H A D | tb_quad_opamp.vhd | 46 R4 : entity work.resistor(ideal) 54 v4 : entity work.v_pulse(ideal) 67 R5 : entity work.resistor(ideal) 75 R6 : entity work.resistor(ideal) 83 R7 : entity work.resistor(ideal) 91 v5 : entity work.v_pulse(ideal) 104 v6 : entity work.v_pulse(ideal) 117 v7 : entity work.v_pulse(ideal) 130 R8 : entity work.resistor(ideal) 138 R9 : entity work.resistor(ideal) [all …]
|
/dports/math/singular/Singular-Release-4-2-1/IntegerProgramming/ |
H A D | ideal_stuff.cc | 12 ideal& ideal::eliminate() in eliminate() 114 ideal& ideal::pseudo_eliminate() in pseudo_eliminate() 220 ideal& ideal::change_term_ordering_to(const term_ordering& _w) in change_term_ordering_to() 316 ideal& ideal::swap_variables_unsafe(const int& i, const int& j) in swap_variables_unsafe() 395 ideal& ideal::swap_variables(const int& i, const int& j) in swap_variables() 409 ideal& ideal::flip_variable_unsafe(const int& i) in flip_variable_unsafe()
|
/dports/math/polymake/polymake-4.5/apps/tropical/rules/ |
H A D | gfan.rules | 55 # Calls gfan_tropicalintersection for a homogeneous ideal. 56 # @param ideal::Ideal I homogeneous ideal 58 user_function gfan_tropicalintersection(ideal::Ideal) { 71 my $I = new ideal::Ideal(GENERATORS => [$g]); 79 # Calls gfan_tropicalstartingcone | gfan_tropicaltraverse for a homogeneous prime ideal. 81 # @param ideal::Ideal I homogeneous prime ideal 83 user_function gfan_tropicalvariety_of_prime(ideal::Ideal) { 90 # Calls gfan_tropicalbruteforce for a homogeneous ideal. 91 # If the ideal contains a monomial, gfan will return an empty object. We do not catch this for you. 92 # @param ideal::Ideal I homogeneous ideal [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/groebner/ |
H A D | ideals.tex | 35 An ideal is represented by a basis (set of polynomials) tagged 48 have to be used for ideal arithmetic: 51 .+ ideal sum (infix) 52 .* ideal product (infix) 53 .: ideal quotient (infix) 54 ./ ideal quotient (infix) 55 .= ideal equality test (infix) 56 subset ideal inclusion test (infix) 57 intersection ideal intersection (prefix,binary) 58 member test for membership in an ideal [all …]
|
/dports/math/gap/gap-4.11.0/pkg/NumericalSgps-1.2.1/gap/ |
H A D | good-ideals.gd | 13 ## The representation of an ideal of a good semigroup. 43 ## returns the ideal of S generated by l. 55 ## Returns a set of generators of the ideal I. 68 ## Returns the ambient semigroup of the ideal I. 76 ## Detects if the ideal i is contained in its ambient semigroup 86 ## Tests if the integer n belongs to the ideal I. 104 ## The argument I is an ideal of a good semigroup 116 ## Returns the list of elements in the ideal I 135 ## Every good ideal has a minimum 144 ## Computes a canonical ideal of <s>
|
/dports/math/brial/BRiAl-1.2.10/sage-brial/brial/ |
H A D | cluster.py | 25 def __init__(self, ideal, determination_modifier=1): argument 26 if len(ideal) == 0: 29 self.ideal = ideal 33 self.used_variables_ideal = used_vars_set(ideal) 37 [(p, set(p.vars_as_monomial().variables())) for p in ideal]) 109 if len(self.cluster) == len(self.ideal): 114 def find_cluster(ideal): argument 115 algorithm = ClusterAlgorithm(ideal)
|
/dports/math/py-brial/BRiAl-1.2.10/sage-brial/brial/ |
H A D | cluster.py | 25 def __init__(self, ideal, determination_modifier=1): argument 26 if len(ideal) == 0: 29 self.ideal = ideal 33 self.used_variables_ideal = used_vars_set(ideal) 37 [(p, set(p.vars_as_monomial().variables())) for p in ideal]) 109 if len(self.cluster) == len(self.ideal): 114 def find_cluster(ideal): argument 115 algorithm = ClusterAlgorithm(ideal)
|
/dports/math/singular/Singular-Release-4-2-1/Singular/dyn_modules/gfanlib/ |
H A D | tropicalDebug.cc | 41 bool areIdealsEqual(ideal I, ring r, ideal J, ring s) in areIdealsEqual() 43 ideal Is = idInit(IDELEMS(I)); in areIdealsEqual() 51 ideal stdI = gfanlib_kStd_wrapper(Is,s); in areIdealsEqual() 52 ideal stdJ = gfanlib_kStd_wrapper(J,s); in areIdealsEqual() 53 ideal NF1 = kNF(stdI,s->qideal,stdJ); in areIdealsEqual() 54 ideal NF2 = kNF(stdJ,s->qideal,stdI); in areIdealsEqual() 74 bool checkWeightVector(const ideal I, const ring r, const gfan::ZVector &weightVector, bool checkBo… in checkWeightVector() 110 bool checkPolynomialInput(const ideal I, const ring r) in checkPolynomialInput()
|
/dports/math/cocoalib/CoCoALib-0.99712/include/CoCoA/ |
H A D | SparsePolyOps-RadicalMembership.H | 27 class ideal; // fwd decl -- defined in ideal.H variable 29 bool IsInRadical(ConstRefRingElem f, const ideal& I); 30 bool IsInRadical(const ideal& I, const ideal& J); 31 long MinPowerInIdeal(RingElem f, const ideal& J);
|
/dports/math/giacxcas/CoCoALib-0.99700/include/CoCoA/ |
H A D | SparsePolyOps-RadicalMembership.H | 27 class ideal; // fwd decl -- defined in ideal.H variable 29 bool IsInRadical(ConstRefRingElem f, const ideal& I); 30 bool IsInRadical(const ideal& I, const ideal& J); 31 long MinPowerInIdeal(RingElem f, const ideal& J);
|
/dports/math/singular/Singular-Release-4-2-1/kernel/combinatorics/ |
H A D | hilb.cc | 388 static ideal SortByDeg(ideal I) in SortByDeg() 395 ideal res; in SortByDeg() 409 ideal idQuotMon(ideal Iorig, ideal p) in idQuotMon() 471 static void idAddMon(ideal I, ideal p) in idAddMon() 982 ideal p; in rouneslice() 1130 void slicehilb(ideal I) in slicehilb() 1483 static int comapreMonoIdBases(ideal J, ideal Ob) in comapreMonoIdBases() 1779 static ideal minimalMonomialGenSet(ideal I) in minimalMonomialGenSet() 1939 static ideal colonIdeal(ideal S, poly w, int lV, ideal Jwi, int trunDegHs) in colonIdeal() 2037 ideal Jwi; in HilbertSeries_OrbitData() [all …]
|
/dports/math/gap/gap-4.11.0/pkg/sonata-2.9.1/tst/ |
H A D | tfms.tst | 117 [ < nearring ideal >, < nearring ideal > ] 161 [ < nearring ideal >, < nearring ideal >, < nearring ideal >, 162 < nearring ideal >, < nearring ideal >, < nearring ideal >, 163 < nearring ideal >, < nearring ideal >, < nearring ideal >, 164 < nearring ideal >, < nearring ideal >, < nearring ideal >, 165 < nearring ideal > ] 222 < nearring ideal > 228 < nearring ideal >
|
/dports/math/cocoalib/CoCoALib-0.99712/src/tests/ |
H A D | test-toric1.C | 77 ideal I = ideal(x*z-y*y, x*w-y*z); in program() 78 CoCoA_ASSERT_ALWAYS(SequentialToric_C(I,indices) == ideal(y*y+x*z, w*x+y*z, w*y+z*z)); in program() 82 CoCoA_ASSERT_ALWAYS(SequentialToric_C(P, M0CC) == ideal(w*w +y, w*w*w +x)); in program() 86 CoCoA_ASSERT_ALWAYS(SequentialToric_C(P, M1CC) == ideal(power(w,16) +x*x*power(y,5))); in program() 88 ideal T = SequentialToric_C(P, M1CC); in program() 92 CoCoA_ASSERT_ALWAYS(SequentialToric_C(P, M2CC) == ideal(w*0)); in program() 96 CoCoA_ASSERT_ALWAYS(SequentialToric_C(P, M2CC) == ideal(w*0)); in program()
|
/dports/math/giacxcas/CoCoALib-0.99700/src/tests/ |
H A D | test-toric1.C | 77 ideal I = ideal(x*z-y*y, x*w-y*z); in program() 78 CoCoA_ASSERT_ALWAYS(SequentialToric_C(I,indices) == ideal(y*y+x*z, w*x+y*z, w*y+z*z)); in program() 82 CoCoA_ASSERT_ALWAYS(SequentialToric_C(P, M0CC) == ideal(w*w +y, w*w*w +x)); in program() 86 CoCoA_ASSERT_ALWAYS(SequentialToric_C(P, M1CC) == ideal(power(w,16) +x*x*power(y,5))); in program() 88 ideal T = SequentialToric_C(P, M1CC); in program() 92 CoCoA_ASSERT_ALWAYS(SequentialToric_C(P, M2CC) == ideal(w*0)); in program() 96 CoCoA_ASSERT_ALWAYS(SequentialToric_C(P, M2CC) == ideal(w*0)); in program()
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/iio/adc/ |
H A D | twl6030-gpadc.c | 427 const struct twl6030_ideal_code *ideal = pdata->ideal; in twl6030_channel_calibrated() local 432 return pdata->ideal[i].code2; in twl6030_channel_calibrated() 438 const struct twl6030_ideal_code *ideal = gpadc->pdata->ideal; in twl6030_gpadc_make_correction() local 478 const struct twl6030_ideal_code *ideal = gpadc->pdata->ideal; in twl6030_gpadc_get_processed() local 564 const struct twl6030_ideal_code *ideal = gpadc->pdata->ideal; in twl6030_calibrate_channel() local 569 gain = ((ideal[i].volt2 - ideal[i].volt1) * 1000) / in twl6030_calibrate_channel() 570 (ideal[i].code2 - ideal[i].code1); in twl6030_calibrate_channel() 572 x1 = ideal[i].code1; in twl6030_calibrate_channel() 573 x2 = ideal[i].code2; in twl6030_calibrate_channel() 837 .ideal = twl6030_ideal, [all …]
|
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/iio/adc/ |
H A D | twl6030-gpadc.c | 427 const struct twl6030_ideal_code *ideal = pdata->ideal; in twl6030_channel_calibrated() local 432 return pdata->ideal[i].code2; in twl6030_channel_calibrated() 438 const struct twl6030_ideal_code *ideal = gpadc->pdata->ideal; in twl6030_gpadc_make_correction() local 478 const struct twl6030_ideal_code *ideal = gpadc->pdata->ideal; in twl6030_gpadc_get_processed() local 564 const struct twl6030_ideal_code *ideal = gpadc->pdata->ideal; in twl6030_calibrate_channel() local 569 gain = ((ideal[i].volt2 - ideal[i].volt1) * 1000) / in twl6030_calibrate_channel() 570 (ideal[i].code2 - ideal[i].code1); in twl6030_calibrate_channel() 572 x1 = ideal[i].code1; in twl6030_calibrate_channel() 573 x2 = ideal[i].code2; in twl6030_calibrate_channel() 837 .ideal = twl6030_ideal, [all …]
|
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/iio/adc/ |
H A D | twl6030-gpadc.c | 427 const struct twl6030_ideal_code *ideal = pdata->ideal; in twl6030_channel_calibrated() local 432 return pdata->ideal[i].code2; in twl6030_channel_calibrated() 438 const struct twl6030_ideal_code *ideal = gpadc->pdata->ideal; in twl6030_gpadc_make_correction() local 478 const struct twl6030_ideal_code *ideal = gpadc->pdata->ideal; in twl6030_gpadc_get_processed() local 564 const struct twl6030_ideal_code *ideal = gpadc->pdata->ideal; in twl6030_calibrate_channel() local 569 gain = ((ideal[i].volt2 - ideal[i].volt1) * 1000) / in twl6030_calibrate_channel() 570 (ideal[i].code2 - ideal[i].code1); in twl6030_calibrate_channel() 572 x1 = ideal[i].code1; in twl6030_calibrate_channel() 573 x2 = ideal[i].code2; in twl6030_calibrate_channel() 837 .ideal = twl6030_ideal, [all …]
|
/dports/math/fricas/fricas-1.3.7/src/algebra/ |
H A D | ideal.spad | 44 ++ I^n computes the nth power of the ideal I. 48 ++ one?(I) tests whether the ideal I is the unit ideal, 51 ++ zero?(I) tests whether the ideal I is the zero ideal 54 ++ the ideal I. 56 ++ in?(I, J) tests if the ideal I is contained in the ideal J. 59 ++ belongs to the ideal I. 99 ++ ideal(polyList) constructs the ideal generated by the list 263 empty?(Jdl) => ideal [1] 274 ---- power of an ideal ---- 320 ---- dimension of an ideal ---- [all …]
|
/dports/math/singular/Singular-Release-4-2-1/kernel/GBEngine/ |
H A D | kutil.h | 548 void initS (ideal F, ideal Q,kStrategy strat); 549 void initSL (ideal F, ideal Q,kStrategy strat); 550 void initSLSba (ideal F, ideal Q,kStrategy strat); 576 void initBuchMora (ideal F, ideal Q,kStrategy strat); 580 void updateResult(ideal r,ideal Q,kStrategy strat); 675 ideal bba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat); 676 ideal sba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat); 678 ideal kNF2 (ideal F,ideal Q,ideal q, kStrategy strat, int lazyReduce); 680 ideal kNF2Bound (ideal F,ideal Q,ideal q,int bound, kStrategy strat, int lazyReduce); 821 poly preIntegerCheck(ideal F, ideal Q); [all …]
|
/dports/math/cocoalib/CoCoALib-0.99712/examples/ |
H A D | ex-ideal2.C | 23 void IdealOperations(const ideal& I) in IdealOperations() 42 cout << "Is I contained in ideal(0)? " << IsContained(I, ideal(zero(R))) << endl; in IdealOperations() 67 ideal I1 = ideal(f); in program() 70 ideal I2 = ideal(f,g); in program() 73 IdealOperations(ideal(one(P))); in program()
|
/dports/math/giacxcas/CoCoALib-0.99700/examples/ |
H A D | ex-ideal2.C | 23 void IdealOperations(const ideal& I) in IdealOperations() 42 cout << "Is I contained in ideal(0)? " << IsContained(I, ideal(zero(R))) << endl; in IdealOperations() 67 ideal I1 = ideal(f); in program() 70 ideal I2 = ideal(f,g); in program() 73 IdealOperations(ideal(one(P))); in program()
|
/dports/textproc/texi2html/texi2html-5.0/test/singular_manual/d2t_singular/ |
H A D | rinvar_lib.tex | 119 ImageVariety(ideal I, F [, w]);ideal I; F is a list/ideal, intvec w. 141 ideal I = x4 - y4; 142 ideal F = x2, y2, x*y; 194 ideal G = s(1)^3-1, s(2)^10-1; 244 ideal G = -s(1)+s(2)^3, s(1)^4-1; 477 ideal of the null cone of G. 489 ideal action = s(1)*x, s(2)*y; 490 ideal inv = NullCone(G, action); 541 @*- 'ROelements' is a list of ideal, each ideal represents a 564 simplify ideal I to the ideal I', do not change the names of the [all …]
|