Home
last modified time | relevance | path

Searched refs:ninterior (Results 1 – 25 of 26) sorted by relevance

12

/dports/net/wireshark/wireshark-3.6.1/epan/dissectors/
H A Dpacket-igrp.c60 guint16 ninterior,nsystem,nexterior; in dissect_igrp() local
103 ninterior = tvb_get_ntohs(tvb,4); in dissect_igrp()
115 for( ; ninterior>0 ; ninterior-- ) { in dissect_igrp()
/dports/net/wireshark-lite/wireshark-3.6.1/epan/dissectors/
H A Dpacket-igrp.c60 guint16 ninterior,nsystem,nexterior;
103 ninterior = tvb_get_ntohs(tvb,4);
115 for( ; ninterior>0 ; ninterior-- ) {
/dports/net/tshark-lite/wireshark-3.6.1/epan/dissectors/
H A Dpacket-igrp.c60 guint16 ninterior,nsystem,nexterior;
103 ninterior = tvb_get_ntohs(tvb,4);
115 for( ; ninterior>0 ; ninterior-- ) {
/dports/net/tshark/wireshark-3.6.1/epan/dissectors/
H A Dpacket-igrp.c60 guint16 ninterior,nsystem,nexterior; in dissect_igrp() local
103 ninterior = tvb_get_ntohs(tvb,4); in dissect_igrp()
115 for( ; ninterior>0 ; ninterior-- ) { in dissect_igrp()
/dports/astro/astrometry/astrometry.net-0.85/libkd/
H A Dkdtree.c56 printf(" Ninterior %i\n", kd->ninterior); in kdtree_print()
120 return get_tree_size(kd->treetype) * kd->ninterior; in kdtree_sizeof_split()
124 return sizeof(u8) * kd->ninterior; in kdtree_sizeof_splitdim()
166 n = kd->ninterior; in kdtree_memory_report()
173 n = kd->ninterior; in kdtree_memory_report()
383 kd->ninterior = kd->nbottom - 1; in kdtree_new()
384 assert(kd->nbottom + kd->ninterior == kd->nnodes); in kdtree_new()
466 int leafid = nodeid - kd->ninterior; in kdtree_leaf_left()
477 int leafid = nodeid - kd->ninterior; in kdtree_leaf_right()
H A Dkdtree_internal_fits.c82 chunk.nrows = kd->ninterior; in MANGLE()
92 chunk.nrows = kd->ninterior; in MANGLE()
259 chunk.nrows = kd->ninterior; in MANGLE()
296 chunk.nrows = kd->ninterior; in MANGLE()
H A Dtest_libkd.c76 int R1 = kdtree_right(kd, kd->ninterior + i); in tst_1()
511 CuAssertIntEquals(tc, lr[i-1]+1, kdtree_left(kd, i + kd->ninterior)); in run_test_lr()
512 CuAssertIntEquals(tc, lr[i], kdtree_right(kd, i + kd->ninterior)); in run_test_lr()
H A Dchecktree.c70 printf("Non-leaf nodes: %i\n", kd->ninterior); in main()
H A Dtest_libkd_io.c38 CuAssertIntEquals(ct, kd->ninterior, kd2->ninterior); in assert_kdtrees_equal()
H A Dfix-bb.c103 printf("Non-leaf nodes: %i\n", kd->ninterior); in main()
H A Dkdtree_internal.c2242 kd->split.any = MALLOC(kd->ninterior * sizeof(ttype)); in MANGLE()
2247 kd->splitdim = MALLOC(kd->ninterior * sizeof(u8)); in MANGLE()
2269 for (i = 0; i < kd->ninterior; i++) { in MANGLE()
2303 c -= kd->ninterior; in MANGLE()
2448 c -= kd->ninterior; in MANGLE()
2465 assert(L == kdtree_leaf_left(kd, i + kd->ninterior)); in MANGLE()
2466 assert(R == kdtree_leaf_right(kd, i + kd->ninterior)); in MANGLE()
2468 save_bb(kd, i + kd->ninterior, lo, hi); in MANGLE()
2477 int nodeid = i + kd->ninterior; in MANGLE()
H A Dkdtree_fits_io.c291 kd->ninterior = nnodes - kd->nbottom; in kdtree_fits_read_tree()
/dports/astro/stellarsolver/stellarsolver-1.8/stellarsolver/astrometry/libkd/
H A Dkdtree.c56 printf(" Ninterior %i\n", kd->ninterior); in kdtree_print()
120 return get_tree_size(kd->treetype) * kd->ninterior; in kdtree_sizeof_split()
124 return sizeof(u8) * kd->ninterior; in kdtree_sizeof_splitdim()
166 n = kd->ninterior; in kdtree_memory_report()
173 n = kd->ninterior; in kdtree_memory_report()
383 kd->ninterior = kd->nbottom - 1; in kdtree_new()
384 assert(kd->nbottom + kd->ninterior == kd->nnodes); in kdtree_new()
466 int leafid = nodeid - kd->ninterior; in kdtree_leaf_left()
477 int leafid = nodeid - kd->ninterior; in kdtree_leaf_right()
H A Dkdtree_internal_fits.c82 chunk.nrows = kd->ninterior; in MANGLE()
92 chunk.nrows = kd->ninterior; in MANGLE()
259 chunk.nrows = kd->ninterior; in MANGLE()
296 chunk.nrows = kd->ninterior; in MANGLE()
H A Dkdtree_internal.c2297 kd->split.any = MALLOC(kd->ninterior * sizeof(ttype)); in MANGLE()
2302 kd->splitdim = MALLOC(kd->ninterior * sizeof(u8)); in MANGLE()
2324 for (i = 0; i < kd->ninterior; i++) { in MANGLE()
2358 c -= kd->ninterior; in MANGLE()
2503 c -= kd->ninterior; in MANGLE()
2520 assert(L == kdtree_leaf_left(kd, i + kd->ninterior)); in MANGLE()
2521 assert(R == kdtree_leaf_right(kd, i + kd->ninterior)); in MANGLE()
2523 save_bb(kd, i + kd->ninterior, lo, hi); in MANGLE()
2532 int nodeid = i + kd->ninterior; in MANGLE()
H A Dkdtree_fits_io.c291 kd->ninterior = nnodes - kd->nbottom; in kdtree_fits_read_tree()
/dports/graphics/blender/blender-2.91.0/source/blender/editors/uvedit/
H A Duvedit_parametrizer.c2407 int ninterior, nfaces, nangles; member
2437 for (i = 0; i < sys->ninterior; i++) { in p_abf_setup_system()
2576 sys->bInterior[sys->ninterior + v->u.id] = -glength; in p_abf_compute_gradient()
2588 int i, j, ninterior = sys->ninterior, nvar = 2 * sys->ninterior; in p_abf_matrix_invert() local
2642 vid[3] = ninterior + v1->u.id; in p_abf_matrix_invert()
2663 vid[4] = ninterior + v2->u.id; in p_abf_matrix_invert()
2684 vid[5] = ninterior + v3->u.id; in p_abf_matrix_invert()
2801 for (i = 0; i < ninterior; i++) { in p_abf_matrix_invert()
2822 sys.ninterior = sys.nfaces = sys.nangles = 0; in p_chart_abf_solve()
2827 v->u.id = sys.ninterior++; in p_chart_abf_solve()
[all …]
/dports/astro/astrometry/astrometry.net-0.85/include/astrometry/
H A Dkdtree.h237 int ninterior; /* Number of internal nodes */ member
418 #define KD_IS_LEAF(kd, i) ((i) >= ((kd)->ninterior))
/dports/astro/stellarsolver/stellarsolver-1.8/stellarsolver/astrometry/include/astrometry/
H A Dkdtree.h237 int ninterior; /* Number of internal nodes */ member
418 #define KD_IS_LEAF(kd, i) ((i) >= ((kd)->ninterior))
/dports/science/madness/madness-ebb3fd7/src/madness/mra/
H A Dmraimpl.h920 long nleaf=0, ninterior=0; in print_info() local
927 ++ninterior; in print_info()
929 this->send(0, &implT::put_in_box, world.rank(), nleaf, ninterior); in print_info()
/dports/games/simutrans-pak128/simutrans/pak128/text/
H A Dpt.tab128 Igreja\n\nEsta igreja � famosa pelas\npinturas que est�o em seu\ninterior, al�m de seu\nagrad�vel e…
H A Des.tab424 … ofrece una\npista de atletismo al aire\nlibre en el quinto piso. En el\ninterior del edificio, en…
1148 …vir aqu�, ya que los\napartamentos se crearon\nsin cambiar demasiado el\ninterior. Imagina: puedes…
/dports/games/simutrans-pak64/simutrans/pak/text/
H A Den.tab335 Live less ordinary! The\ninterior is unique as well:\nPower outlets are for\nthree-phase-power only…
/dports/games/frogatto/frogatto-1.3.1/modules/frogatto/po/
H A Des.po5121 msgstr "Esto significa que toma tu energía física \ninterior, y te permite canalizarla directamente…
/dports/databases/mariadb105-client/mariadb-10.5.15/mysql-test/std_data/
H A Dmysql_database_10.4.dump334 …ninterior\nof the other.\n \nExamples\n-------- \nSET @g1 = GeomFromText(\'Polygon((0 0,0 3,3 3,3 …
335 …oundary of one of the geometries intersects either\nthe boundary or the\ninterior of the other.\n …

12