Home
last modified time | relevance | path

Searched refs:base_i (Results 1 – 25 of 490) sorted by relevance

12345678910>>...20

/dports/devel/allegro/allegro-4.4.3.1/demos/skater/blender/
H A Dademo_export.py158 def make_contour(ob, base_i): argument
191 if not base_i + prev.index in edges: edges[base_i + prev.index] = {}
192 if not base_i + v.index in edges: edges[base_i + v.index] = {}
193 edges[base_i + prev.index][base_i + v.index] = 1
194 edges[base_i + v.index][base_i + prev.index] = 1
196 topmost = base_i + prev.index
208 if (base_i + f.v[i - 1].index, base_i + f.v[i].index) == edge or\
209 (base_i + f.v[i].index, base_i + f.v[i - 1].index) == edge:
307 base_i = 0
324 tri1 = [base_i + f.v[2].index, base_i + f.v[1].index, base_i +
[all …]
/dports/devel/allegro5/allegro5-5.2.7.0/demos/skater/blender/
H A Dademo_export.py158 def make_contour(ob, base_i): argument
191 if not base_i + prev.index in edges: edges[base_i + prev.index] = {}
192 if not base_i + v.index in edges: edges[base_i + v.index] = {}
193 edges[base_i + prev.index][base_i + v.index] = 1
194 edges[base_i + v.index][base_i + prev.index] = 1
196 topmost = base_i + prev.index
208 if (base_i + f.v[i - 1].index, base_i + f.v[i].index) == edge or\
209 (base_i + f.v[i].index, base_i + f.v[i - 1].index) == edge:
307 base_i = 0
324 tri1 = [base_i + f.v[2].index, base_i + f.v[1].index, base_i +
[all …]
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/2geom/src/toys/
H A Dcurvature-curve.cpp24 for(int base_i = 0; base_i < int(curve_handle.pts.size()/2) - 1; base_i++) { in draw() local
26 Geom::Point center=curve_handle.pts[1+2*i+base_i*2]; in draw()
27 Geom::Point normal=center- curve_handle.pts[2*i+base_i*2]; in draw()
52 Geom::Point A = curve_handle.pts[0+base_i*2]; in draw()
53 Geom::Point B = curve_handle.pts[2+base_i*2]; in draw()
57 Geom::Point dA = curve_handle.pts[1+base_i*2]-A; in draw()
58 Geom::Point dB = curve_handle.pts[3+base_i*2]-B; in draw()
60 … cubics_fitting_curvature(curve_handle.pts[0+base_i*2],curve_handle.pts[2+base_i*2], in draw()
/dports/math/lib2geom/lib2geom-1.1/src/toys/
H A Dcurvature-curve.cpp24 for(int base_i = 0; base_i < int(curve_handle.pts.size()/2) - 1; base_i++) { in draw() local
26 Geom::Point center=curve_handle.pts[1+2*i+base_i*2]; in draw()
27 Geom::Point normal=center- curve_handle.pts[2*i+base_i*2]; in draw()
52 Geom::Point A = curve_handle.pts[0+base_i*2]; in draw()
53 Geom::Point B = curve_handle.pts[2+base_i*2]; in draw()
57 Geom::Point dA = curve_handle.pts[1+base_i*2]-A; in draw()
58 Geom::Point dB = curve_handle.pts[3+base_i*2]-B; in draw()
60 … cubics_fitting_curvature(curve_handle.pts[0+base_i*2],curve_handle.pts[2+base_i*2], in draw()
/dports/x11/xlockmore/xlockmore-5.67/modes/
H A Dtetris.c787 if (base_i == 0) in checkWall()
791 if (base_i == WELL_WIDTH - 1) in checkWall()
1016 int base_i, base_j; in drawBox() local
1042 int xi, yj, base_i, base_j; in drawPolyomino() local
1060 base_i, base_j); in drawPolyomino()
1111 int xi, yj, base_i, base_j; in drawPolyominoDiff() local
1129 base_i, base_j); in drawPolyominoDiff()
1150 temp_base[base_j][base_i] = -temp_base[base_j][base_i]; in drawPolyominoDiff()
1280 int base_i, base_j; in putBox() local
1284 base_i, base_j); in putBox()
[all …]
/dports/devel/pyside2-tools/pyside-setup-opensource-src-5.15.2/sources/shiboken2/libshiboken/
H A Dtypespec.cpp464 PyTypeObject *base, *winner, *candidate, *base_i; in best_base() local
482 base_i = (PyTypeObject *)base_proto; in best_base()
483 if (base_i->tp_dict == NULL) { in best_base()
484 if (PyType_Ready(base_i) < 0) in best_base()
487 if (!PyType_HasFeature(base_i, Py_TPFLAGS_BASETYPE)) { in best_base()
490 base_i->tp_name); in best_base()
493 candidate = solid_base(base_i); in best_base()
496 base = base_i; in best_base()
502 base = base_i; in best_base()
/dports/devel/pyside2/pyside-setup-opensource-src-5.15.2/sources/shiboken2/libshiboken/
H A Dtypespec.cpp464 PyTypeObject *base, *winner, *candidate, *base_i; in best_base() local
482 base_i = (PyTypeObject *)base_proto; in best_base()
483 if (base_i->tp_dict == NULL) { in best_base()
484 if (PyType_Ready(base_i) < 0) in best_base()
487 if (!PyType_HasFeature(base_i, Py_TPFLAGS_BASETYPE)) { in best_base()
490 base_i->tp_name); in best_base()
493 candidate = solid_base(base_i); in best_base()
496 base = base_i; in best_base()
502 base = base_i; in best_base()
/dports/devel/shiboken2/pyside-setup-opensource-src-5.15.2/sources/shiboken2/libshiboken/
H A Dtypespec.cpp464 PyTypeObject *base, *winner, *candidate, *base_i; in best_base() local
482 base_i = (PyTypeObject *)base_proto; in best_base()
483 if (base_i->tp_dict == NULL) { in best_base()
484 if (PyType_Ready(base_i) < 0) in best_base()
487 if (!PyType_HasFeature(base_i, Py_TPFLAGS_BASETYPE)) { in best_base()
490 base_i->tp_name); in best_base()
493 candidate = solid_base(base_i); in best_base()
496 base = base_i; in best_base()
502 base = base_i; in best_base()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/src/3rdparty/opennurbs/
H A Dopennurbs_array.cpp1317 int base_i; in ON_BinarySearch2dexArray() local
1331 base_i = base[0].i; in ON_BinarySearch2dexArray()
1332 if ( key_i < base_i ) in ON_BinarySearch2dexArray()
1334 if ( key_i == base_i ) in ON_BinarySearch2dexArray()
1337 base_i = base[nel-1].i; in ON_BinarySearch2dexArray()
1338 if ( key_i > base_i ) in ON_BinarySearch2dexArray()
1340 if ( key_i == base_i ) in ON_BinarySearch2dexArray()
1346 base_i = base[i].i; in ON_BinarySearch2dexArray()
1347 if ( key_i < base_i ) in ON_BinarySearch2dexArray()
1351 else if ( key_i > base_i ) in ON_BinarySearch2dexArray()
/dports/math/gismo/gismo-21.12.0/external/onurbs/
H A Dopennurbs_array.cpp1400 int base_i; in ON_BinarySearch2dexArray() local
1414 base_i = base[0].i; in ON_BinarySearch2dexArray()
1415 if ( key_i < base_i ) in ON_BinarySearch2dexArray()
1417 if ( key_i == base_i ) in ON_BinarySearch2dexArray()
1420 base_i = base[nel-1].i; in ON_BinarySearch2dexArray()
1421 if ( key_i > base_i ) in ON_BinarySearch2dexArray()
1423 if ( key_i == base_i ) in ON_BinarySearch2dexArray()
1429 base_i = base[i].i; in ON_BinarySearch2dexArray()
1430 if ( key_i < base_i ) in ON_BinarySearch2dexArray()
1434 else if ( key_i > base_i ) in ON_BinarySearch2dexArray()
/dports/math/py-Diofant/Diofant-0.13.0/diofant/combinatorics/
H A Dtensor_can.py757 base_i, gens_i, n_i, sym_i = vi
761 if not _is_minimal_bsgs(base_i, gens_i):
762 mbsgs = get_minimal_bsgs(base_i, gens_i)
766 base_i, gens_i = mbsgs
767 v1.append((base_i, gens_i, [[]] * n_i, sym_i))
801 base_i, gens_i, n_i, sym_i = vi
814 v1[i] = (base_i, gens_i, free_i, sym_i)
H A Dtestutil.py220 base_i, gens_i, n_i, sym_i = vi
221 v1.append((base_i, gens_i, [[]]*n_i, sym_i))
/dports/math/py-sympy/sympy-1.9/sympy/combinatorics/
H A Dtensor_can.py780 base_i, gens_i, n_i, sym_i = v[i]
784 if not _is_minimal_bsgs(base_i, gens_i):
785 mbsgs = get_minimal_bsgs(base_i, gens_i)
789 base_i, gens_i = mbsgs
790 v1.append((base_i, gens_i, [[]] * n_i, sym_i))
824 base_i, gens_i, n_i, sym_i = v[i]
837 v1[i] = (base_i, gens_i, free_i, sym_i)
H A Dtestutil.py246 base_i, gens_i, n_i, sym_i = v[i]
247 v1.append((base_i, gens_i, [[]]*n_i, sym_i))
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/doc/
H A Dfact.tex47 $\expt$ of type \code{int}. Let in the following $(\base_i, \expt_i)$ denote the $i$-th vector
52 f = \sign \cdot \prod_{i = 0}^{l-1} \base_i^{\expt_i} \enspace.
55 The value of $\sign$ is either $1$ or $-1$. The values of the bases $\base_i$ are always
58 Different bases $\base_i$, $\base_j$ ($i \neq j$) of the vector are not equal, but not
152 returns $\base_i$. If $i < 0$ or if $i$ is greater or equal than the number of components of
230 returns \TRUE if $\base_i$ is probably a prime number, otherwise \FALSE. For checking
252 refines the factorization $a$ by computing the greatest common divisor of $x$ with $\base_i$
258 tries to find factors of $\base_i$. A combination of \emph{TD}, \emph{ECM} and \emph{QS} is
301 tries to factor the element $\base_i$ of $a$ by using \emph{TD} with all primes $p$ with
339 found factors of $\base_i$ can be composite. If the value of $\upperbound$ is $34$, then
[all …]
/dports/science/afni/afni-AFNI_21.3.16/src/scripts_install/
H A D@align_partial_oblique178 set base_i = $base
215 rm -f ${anat_i}_aa_all*.???? ${base_i}_all*.???? >& /dev/null
217 3dTcat -prefix ${base_i}_all $ilst
/dports/math/py-nevergrad/nevergrad-0.4.3.post2/nevergrad/functions/images/
H A Dcore.py108 base_i = i // factor
119 * np.expand_dims(x[base_i], 0)
120 / (1e-10 + np.linalg.norm(x[base_i]))
/dports/games/simutrans/simutrans-121.0/display/
H A Dviewport.cc183 …const int base_i = (screen_pos.x/2 + screen_pos.y + tile_raster_scale_y((hgt*TILE_HEIGHT_STEP),r… in get_ground_on_screen_coordinate() local
186 found_i = (base_i + i_off) / rw4;; in get_ground_on_screen_coordinate()
/dports/biology/emboss/EMBOSS-6.6.0/nucleus/
H A Dembest.h151 base_a, base_c, base_g, base_t, base_n, base_i, base_o, nucleotides, anybase enumerator
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/include/deal.II/numerics/
H A Dvector_tools_interpolate.templates.h698 const unsigned int base_i = in get_position_vector() local
701 degree == fe_system->base_element(base_i).degree, in get_position_vector()
703 Assert(fe_system->base_element(base_i).is_primitive(), in get_position_vector()
705 degree = fe_system->base_element(base_i).degree; in get_position_vector()
/dports/textproc/bbe/bbe-0.2.2/doc/
H A DMakefile.in286 base_i=`echo "$$base" | sed 's|\.info$$||;s|$$|.i|'`; \
287 …for file in $$d/$$base $$d/$$base-[0-9] $$d/$$base-[0-9][0-9] $$d/$$base_i[0-9] $$d/$$base_i[0-9][…
/dports/devel/bnf/bnf-1.6.10/doc/
H A DMakefile.in325 base_i=`echo "$$base" | sed 's|\.info$$||;s|$$|.i|'`; \
326 …for file in $$d/$$base $$d/$$base-[0-9] $$d/$$base-[0-9][0-9] $$d/$$base_i[0-9] $$d/$$base_i[0-9][…
/dports/lang/eisl/eisl-2.35/nana/doc/
H A DMakefile472 …for file in $$d/$$base $$d/$$base-[0-9] $$d/$$base-[0-9][0-9] $$d/$$base_i[0-9] $$d/$$base_i[0-9][…
/dports/lang/spidermonkey78/firefox-78.9.0/browser/components/translation/cld2/internal/
H A Dscoreonescriptspan.cc878 int base_i = 0; in LinearizeAll() local
891 while ((base_i < base_limit) || (delta_i < delta_limit) || in LinearizeAll()
893 int base_off = hitbuffer->base[base_i].offset; in LinearizeAll()
926 int indirect = hitbuffer->base[base_i].indirect; in LinearizeAll()
933 ++base_i; in LinearizeAll()
/dports/games/xpilot-ng-server/xpilot-ng-4.7.3/src/server/
H A Dxpmap.c365 int wormhole_i = 0, treasure_i = 0, target_i = 0, base_i = 0, cannon_i = 0; in Xpmap_init_setup() local
500 if (base_i >= Num_bases()) { in Xpmap_init_setup()
505 team = Base_by_index(base_i)->team; in Xpmap_init_setup()
508 dir = Base_by_index(base_i)->dir; in Xpmap_init_setup()
509 base_i++; in Xpmap_init_setup()

12345678910>>...20