Home
last modified time | relevance | path

Searched refs:degree1 (Results 1 – 25 of 45) sorted by relevance

12

/dports/math/linbox/linbox-1.6.3/linbox/algorithms/
H A Dsigma-basis.h199 linbox_check(degree1 < degree2); in multi_left_basis()
219 ComputeNewSerieClassic(Serie2,SigmaBase1, _Serie, degree1, degree2-degree1); in multi_left_basis()
238 linbox_check(degree1 < degree2); in multi_right_basis()
266 ComputeNewSerieClassic(Serie2,SigmaBase1, TransposedSerie, degree1, degree2-degree1); in multi_right_basis()
418 size_t degree1,degree2,shift; in PM_Basis() local
421 degree2 = degree - degree1; in PM_Basis()
950 linbox_check(degree1 < degree2); in MultiPadeApproximant()
1141 if (NN == (long)degree1 -1) { in MultiPadeApproximant()
1869 size_t degree1,degree2; in new_PM_Basis() local
1871 degree2 = degree - degree1; in new_PM_Basis()
[all …]
/dports/math/fricas/fricas-1.3.7/src/algebra/
H A Dffhom.spad68 degree1 : NNI := extensionDegree()$F1
75 if max(degree1, degree2) rem min(degree1, degree2) ~= 0 then
78 conMat1to2 : M := zero(degree2, degree1)$M
80 conMat2to1 : M := zero(degree1, degree2)$M
138 mat := zero(degree1, degree1)$M
140 for i in 1..degree1 repeat
146 --for i in 2..degree1 repeat
177 degsmall := degree1
180 degbig := degree1
325 if degree1 > degree2 then
[all …]
/dports/devel/mph/mph-1.2/arb/
H A Dgraph.c100 degree1(Graph *gp, int v) in degree1() function
117 if (degree1(gp, v = gredgenode(gp, e, i))) in cyclicdeledge()
129 if (degree1(gp, v)) in grcyclic()
/dports/devel/mph/mph-1.2/
H A Dgraph.c100 degree1(Graph *gp, int v) in degree1() function
117 if (degree1(gp, v = gredgenode(gp, e, i))) in cyclicdeledge()
129 if (degree1(gp, v)) in grcyclic()
/dports/cad/calculix/CalculiX/libSNL/src/
H A DsnlCtrlPointNetSurface.h52 double calcFlatnessU ( int indexU, int indexV, int numPoints, bool degree1 ) const;
53 double calcFlatnessV ( int indexU, int indexV, int numPoints, bool degree1 ) const;
H A DsnlCtrlPointNetSurface.cpp464 double snlCtrlPointNetSurface::calcFlatnessU ( int indexU, int indexV, int numPoints, bool degree1 … in calcFlatnessU()
476 if ( degree1 ) in calcFlatnessU()
497 double snlCtrlPointNetSurface::calcFlatnessV ( int indexU, int indexV, int numPoints, bool degree1 … in calcFlatnessV()
509 if ( degree1 ) in calcFlatnessV()
/dports/science/cdk/cdk-cdk-2.3/descriptor/qsarmolecular/src/main/java/org/openscience/cdk/qsar/descriptors/molecular/
H A DRotatableBondsCountDescriptor.java146 int degree1; in calculate() local
174 degree1 = ac.getConnectedBondsCount(atom1) - getConnectedHCount(ac, atom1); in calculate()
175 if ((degree0 == 1) || (degree1 == 1)) { in calculate()
/dports/devel/cmph/cmph-2.0/src/
H A Dgraph.c203 cmph_uint8 degree1; in cyclic_del_edge() local
207 degree1 = find_degree1_edge(g, v1, deleted, &e); in cyclic_del_edge()
208 if (!degree1) return; in cyclic_del_edge()
218 degree1 = find_degree1_edge(g, v2, deleted, &e); in cyclic_del_edge()
219 if (degree1) in cyclic_del_edge()
/dports/devel/gobject-introspection/gobject-introspection-1.70.0/girepository/cmph/
H A Dgraph.c203 cmph_uint8 degree1; in cyclic_del_edge() local
207 degree1 = find_degree1_edge(g, v1, deleted, &e); in cyclic_del_edge()
208 if (!degree1) return; in cyclic_del_edge()
218 degree1 = find_degree1_edge(g, v2, deleted, &e); in cyclic_del_edge()
219 if (degree1) in cyclic_del_edge()
/dports/science/ergo/ergo-3.8/source/integrals/
H A Dmm_limit_table.h62 ergo_real get_max_abs_mm_contrib(int degree1,
H A Dmm_limit_table.cc196 ergo_real MMLimitTable::get_max_abs_mm_contrib(int degree1, in get_max_abs_mm_contrib() argument
205 for(int l_large = degree1; l_large >= 0; l_large--) in get_max_abs_mm_contrib()
/dports/science/jstrack/jstrack/extlib/tcllib1.19/math/
H A Drational_funcs.tcl65 set degree1 [expr {[llength $num]-1}]
67 set body "expr \{([join $num +\$x*(][string repeat ) $degree1])/\
/dports/devel/tcllib/tcllib-1.20/modules/math/
H A Drational_funcs.tcl65 set degree1 [expr {[llength $num]-1}]
67 set body "expr \{([join $num +\$x*(][string repeat ) $degree1])/\
/dports/devel/tcllibc/tcllib-1.20/modules/math/
H A Drational_funcs.tcl65 set degree1 [expr {[llength $num]-1}]
67 set body "expr \{([join $num +\$x*(][string repeat ) $degree1])/\
/dports/science/openbabel/openbabel-3.1.1/src/formats/
H A Dwln-nextmove.cpp444 bool degree1(OpenBabel::OBAtom* aptr) { in degree1() function
865 if (!degree1(cyano())) in parse()
976 if (!degree1(cyano())) in parse()
990 if (!degree1(diazonio())) in parse()
997 if (!degree1(nitroso())) in parse()
1136 if (!degree1(benzene())) in parse()
1157 if (!degree1(atom(16,2))) in parse()
/dports/math/py-or-tools/or-tools-9.2/examples/cpp/
H A Dfap_parser.h495 const int degree1 = variable1.degree; in EvaluateConstraintImpact() local
497 const int max_degree = std::max(degree1, degree2); in EvaluateConstraintImpact()
498 const int min_degree = std::min(degree1, degree2); in EvaluateConstraintImpact()
/dports/math/R-cran-FrF2/FrF2/R/
H A Destimable2fis.R78 degree1 <- rev(cumsum(rev(table(deg1)))) functionVar
79 degs1 <- as.numeric(names(degree1))
83 comp <- sapply(degs2, function(obj) degree1[min(which(degs1 >=
/dports/graphics/krita/krita-4.4.8/libs/flake/
H A DKoPathSegment.cpp535 int degree1 = degree(); in intersections() local
548 if (degree1 == 1 && degree2 == 1) { in intersections()
557 if (degree1 == 1) { in intersections()
560 } else if (degree1 == 2) { in intersections()
/dports/math/cadabra2/cadabra2-2.3.6.8/core/
H A DCleanup.cc299 auto degree1 = df1->degree(k.properties, s1); in cleanup_productlike() local
301 if(degree1.is_rational() && degree2.is_rational()) { in cleanup_productlike()
302 long d1 = to_long(degree1.to_rational()); in cleanup_productlike()
/dports/editors/calligra/calligra-3.2.1/libs/flake/
H A DKoPathSegment.cpp773 int degree1 = degree(); in intersections() local
786 if (degree1 == 1 && degree2 == 1) { in intersections()
795 if (degree1 == 1) { in intersections()
798 } else if (degree1 == 2) { in intersections()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dsched-rgn.c780 int *queue, *degree1 = NULL; in haifa_find_rgns() local
799 degree1 = XNEWVEC (int, last_basic_block_for_fn (cfun)); in haifa_find_rgns()
855 memcpy (degree1, degree, in haifa_find_rgns()
1025 degree = degree1; in haifa_find_rgns()
1026 degree1 = t; in haifa_find_rgns()
1041 free (degree1); in haifa_find_rgns()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dsched-rgn.c786 int *queue, *degree1 = NULL; in haifa_find_rgns() local
805 degree1 = XNEWVEC (int, last_basic_block_for_fn (cfun)); in haifa_find_rgns()
861 memcpy (degree1, degree, in haifa_find_rgns()
1031 degree = degree1; in haifa_find_rgns()
1032 degree1 = t; in haifa_find_rgns()
1047 free (degree1); in haifa_find_rgns()
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dsched-rgn.c780 int *queue, *degree1 = NULL; in haifa_find_rgns() local
799 degree1 = XNEWVEC (int, last_basic_block_for_fn (cfun)); in haifa_find_rgns()
855 memcpy (degree1, degree, in haifa_find_rgns()
1025 degree = degree1; in haifa_find_rgns()
1026 degree1 = t; in haifa_find_rgns()
1041 free (degree1); in haifa_find_rgns()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/
H A Dsched-rgn.c786 int *queue, *degree1 = NULL; in haifa_find_rgns() local
805 degree1 = XNEWVEC (int, last_basic_block_for_fn (cfun)); in haifa_find_rgns()
861 memcpy (degree1, degree, in haifa_find_rgns()
1031 degree = degree1; in haifa_find_rgns()
1032 degree1 = t; in haifa_find_rgns()
1047 free (degree1); in haifa_find_rgns()
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dsched-rgn.c786 int *queue, *degree1 = NULL; in haifa_find_rgns() local
805 degree1 = XNEWVEC (int, last_basic_block_for_fn (cfun)); in haifa_find_rgns()
861 memcpy (degree1, degree, in haifa_find_rgns()
1031 degree = degree1; in haifa_find_rgns()
1032 degree1 = t; in haifa_find_rgns()
1047 free (degree1); in haifa_find_rgns()

12