Home
last modified time | relevance | path

Searched refs:n_items (Results 1 – 25 of 1474) sorted by relevance

12345678910>>...59

/dports/graphics/blender/blender-2.91.0/extern/draco/dracoenc/src/draco/compression/attributes/
H A Dpoint_d_vector_test.cc27 for (uint32_t n_items = 0; n_items <= 10; ++n_items) { in TestSize() local
31 ASSERT_EQ(n_items, var.size()); in TestSize()
38 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestContentsContiguous() local
49 for (PT val = 0; val < n_items; val += 1) { in TestContentsContiguous()
71 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestContentsDiscrete() local
107 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestContentsCopy() local
146 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestIterator() local
200 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestPoint3Iterator() local
214 std::vector<draco::Point3ui> att3(n_items); in TestPoint3Iterator()
215 for (PT val = 0; val < n_items; val += 1) { in TestPoint3Iterator()
[all …]
/dports/archivers/draco/draco-1.4.3/src/draco/compression/attributes/
H A Dpoint_d_vector_test.cc28 for (uint32_t n_items = 0; n_items <= 10; ++n_items) { in TestSize() local
32 ASSERT_EQ(n_items, var.size()); in TestSize()
39 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestContentsContiguous() local
50 for (PT val = 0; val < n_items; val += 1) { in TestContentsContiguous()
72 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestContentsDiscrete() local
108 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestContentsCopy() local
147 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestIterator() local
201 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestPoint3Iterator() local
215 std::vector<draco::Point3ui> att3(n_items); in TestPoint3Iterator()
216 for (PT val = 0; val < n_items; val += 1) { in TestPoint3Iterator()
[all …]
/dports/multimedia/assimp/assimp-5.1.3/contrib/draco/src/draco/compression/attributes/
H A Dpoint_d_vector_test.cc28 for (uint32_t n_items = 0; n_items <= 10; ++n_items) { in TestSize() local
32 ASSERT_EQ(n_items, var.size()); in TestSize()
39 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestContentsContiguous() local
50 for (PT val = 0; val < n_items; val += 1) { in TestContentsContiguous()
72 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestContentsDiscrete() local
108 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestContentsCopy() local
147 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestIterator() local
201 for (uint32_t n_items = 1; n_items <= 1000; n_items *= 10) { in TestPoint3Iterator() local
215 std::vector<draco::Point3ui> att3(n_items); in TestPoint3Iterator()
216 for (PT val = 0; val < n_items; val += 1) { in TestPoint3Iterator()
[all …]
/dports/x11-toolkits/gtk40/gtk-4.4.1/gtk/
H A Dgtksortlistmodel.c92 guint n_items; member
272 guint pos, n_items; in gtk_sort_list_model_sort_cb() local
276 if (n_items) in gtk_sort_list_model_sort_cb()
471 n_items = self->n_items; in gtk_sort_list_model_update_items()
472 start = n_items; in gtk_sort_list_model_update_items()
473 end = n_items; in gtk_sort_list_model_update_items()
547 self->n_items = n_items - removed + added; in gtk_sort_list_model_update_items()
574 self->n_items = self->n_items - removed + added; in gtk_sort_list_model_items_changed_cb()
614 n_items = self->n_items - start - end; in gtk_sort_list_model_items_changed_cb()
728 if (n_items > 0) in gtk_sort_list_model_sorter_changed_cb()
[all …]
H A Dgtklistitemmanager.c87 aug->n_items = item->n_items; in G_DEFINE_TYPE()
93 aug->n_items += left_aug->n_items; in G_DEFINE_TYPE()
100 aug->n_items += right_aug->n_items; in G_DEFINE_TYPE()
365 if (item->n_items > n_items) in gtk_list_item_manager_remove_items()
367 item->n_items -= n_items; in gtk_list_item_manager_remove_items()
377 n_items -= item->n_items; in gtk_list_item_manager_remove_items()
401 item->n_items += n_items; in gtk_list_item_manager_add_items()
415 first->n_items += second->n_items; in gtk_list_item_manager_merge_list_items()
750 if (item->n_items - offset > n_items) in gtk_list_item_manager_model_selection_changed_cb()
753 n_items -= item->n_items - offset; in gtk_list_item_manager_model_selection_changed_cb()
[all …]
H A Dgtkmaplistmodel.c73 guint n_items; member
79 guint n_items; member
183 node->n_items -= before->n_items; in gtk_map_list_model_get_item()
190 after->n_items = node->n_items - 1; in gtk_map_list_model_get_item()
397 aug->n_items = node->n_items; in gtk_map_list_model_augment()
402 aug->n_items += left_aug->n_items; in gtk_map_list_model_augment()
407 aug->n_items += right_aug->n_items; in gtk_map_list_model_augment()
475 if (n_items) in gtk_map_list_model_init_items()
514 guint n_items; in gtk_map_list_model_set_map_func() local
537 n_items = 0; in gtk_map_list_model_set_map_func()
[all …]
H A Dgtklistlistmodel.c36 guint n_items; member
62 return self->n_items; in gtk_list_list_model_get_n_items()
120 self->n_items = 0; in G_DEFINE_TYPE_WITH_CODE()
148 guint n_items; in gtk_list_list_model_new() local
151 n_items = 0; in gtk_list_list_model_new()
155 n_items++; in gtk_list_list_model_new()
186 result->n_items = n_items; in gtk_list_list_model_new_with_size()
300 guint n_items; in gtk_list_list_model_clear() local
304 n_items = self->n_items; in gtk_list_list_model_clear()
309 self->n_items = 0; in gtk_list_list_model_clear()
[all …]
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/src/perf/
H A Dtime_hash_map.cpp106 int n_items; member
119 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
124 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
130 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
135 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
141 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
155 int n_items; member
167 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
173 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
180 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
[all …]
/dports/devel/tbb/oneTBB-2020.3/src/perf/
H A Dtime_hash_map.cpp106 int n_items; member
119 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
124 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
130 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
135 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
141 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
155 int n_items; member
167 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
173 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
180 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
[all …]
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/src/perf/
H A Dtime_hash_map.cpp106 int n_items; member
119 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
124 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
130 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
135 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
141 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
155 int n_items; member
167 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
173 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
180 for(int i = t*n_items, e = (t+1)*n_items; i < e; i++) { in test()
[all …]
/dports/net-p2p/transmission-cli/transmission-3.00/libtransmission/
H A Dptrarray.c46 *size = t->n_items; in tr_ptrArrayPeek()
52 if (t->n_items >= t->n_alloc) in tr_ptrArrayInsert()
60 pos = t->n_items; in tr_ptrArrayInsert()
68 t->n_items++; in tr_ptrArrayInsert()
76 if (t->n_items != 0) in tr_ptrArrayPop()
88 end = t->n_items; in tr_ptrArrayErase()
93 TR_ASSERT(end <= t->n_items); in tr_ptrArrayErase()
97 t->n_items -= end - begin; in tr_ptrArrayErase()
109 if (t->n_items == 0) in tr_ptrArrayLowerBound()
116 int last = t->n_items - 1; in tr_ptrArrayLowerBound()
[all …]
/dports/net-p2p/transmission-qt/transmission-3.00/libtransmission/
H A Dptrarray.c46 *size = t->n_items; in tr_ptrArrayPeek()
52 if (t->n_items >= t->n_alloc) in tr_ptrArrayInsert()
60 pos = t->n_items; in tr_ptrArrayInsert()
68 t->n_items++; in tr_ptrArrayInsert()
76 if (t->n_items != 0) in tr_ptrArrayPop()
88 end = t->n_items; in tr_ptrArrayErase()
93 TR_ASSERT(end <= t->n_items); in tr_ptrArrayErase()
97 t->n_items -= end - begin; in tr_ptrArrayErase()
109 if (t->n_items == 0) in tr_ptrArrayLowerBound()
116 int last = t->n_items - 1; in tr_ptrArrayLowerBound()
[all …]
/dports/net-p2p/transmission-daemon/transmission-3.00/libtransmission/
H A Dptrarray.c46 *size = t->n_items; in tr_ptrArrayPeek()
52 if (t->n_items >= t->n_alloc) in tr_ptrArrayInsert()
60 pos = t->n_items; in tr_ptrArrayInsert()
68 t->n_items++; in tr_ptrArrayInsert()
76 if (t->n_items != 0) in tr_ptrArrayPop()
88 end = t->n_items; in tr_ptrArrayErase()
93 TR_ASSERT(end <= t->n_items); in tr_ptrArrayErase()
97 t->n_items -= end - begin; in tr_ptrArrayErase()
109 if (t->n_items == 0) in tr_ptrArrayLowerBound()
116 int last = t->n_items - 1; in tr_ptrArrayLowerBound()
[all …]
/dports/net-p2p/transmission-gtk/transmission-3.00/libtransmission/
H A Dptrarray.c46 *size = t->n_items; in tr_ptrArrayPeek()
52 if (t->n_items >= t->n_alloc) in tr_ptrArrayInsert()
60 pos = t->n_items; in tr_ptrArrayInsert()
68 t->n_items++; in tr_ptrArrayInsert()
76 if (t->n_items != 0) in tr_ptrArrayPop()
88 end = t->n_items; in tr_ptrArrayErase()
93 TR_ASSERT(end <= t->n_items); in tr_ptrArrayErase()
97 t->n_items -= end - begin; in tr_ptrArrayErase()
109 if (t->n_items == 0) in tr_ptrArrayLowerBound()
116 int last = t->n_items - 1; in tr_ptrArrayLowerBound()
[all …]
/dports/net-p2p/transmission-utils/transmission-3.00/libtransmission/
H A Dptrarray.c46 *size = t->n_items; in tr_ptrArrayPeek()
52 if (t->n_items >= t->n_alloc) in tr_ptrArrayInsert()
60 pos = t->n_items; in tr_ptrArrayInsert()
68 t->n_items++; in tr_ptrArrayInsert()
76 if (t->n_items != 0) in tr_ptrArrayPop()
88 end = t->n_items; in tr_ptrArrayErase()
93 TR_ASSERT(end <= t->n_items); in tr_ptrArrayErase()
97 t->n_items -= end - begin; in tr_ptrArrayErase()
109 if (t->n_items == 0) in tr_ptrArrayLowerBound()
116 int last = t->n_items - 1; in tr_ptrArrayLowerBound()
[all …]
/dports/www/transmission-web/transmission-3.00/libtransmission/
H A Dptrarray.c46 *size = t->n_items; in tr_ptrArrayPeek()
52 if (t->n_items >= t->n_alloc) in tr_ptrArrayInsert()
60 pos = t->n_items; in tr_ptrArrayInsert()
68 t->n_items++; in tr_ptrArrayInsert()
76 if (t->n_items != 0) in tr_ptrArrayPop()
88 end = t->n_items; in tr_ptrArrayErase()
93 TR_ASSERT(end <= t->n_items); in tr_ptrArrayErase()
97 t->n_items -= end - begin; in tr_ptrArrayErase()
109 if (t->n_items == 0) in tr_ptrArrayLowerBound()
116 int last = t->n_items - 1; in tr_ptrArrayLowerBound()
[all …]
/dports/math/pspp/pspp-1.4.1/src/language/stats/
H A Dreliability.c44 size_t n_items; member
60 for (i = 0 ; i < s->n_items; ++i)
309 reliability.sc[1].n_items = in cmd_reliability()
312 reliability.sc[2].n_items = s->n_items - reliability.sc[1].n_items; in cmd_reliability()
317 reliability.sc[2].n_items); in cmd_reliability()
322 while (i < s->n_items) in cmd_reliability()
346 s->n_items = reliability.sc[0].n_items - 1; in cmd_reliability()
677 double tmp = (1.0 - r1*r1) * rel->sc[1].n_items * rel->sc[2].n_items / in reliability_statistics()
682 rel->sc[1].n_items, in reliability_statistics()
684 rel->sc[2].n_items, in reliability_statistics()
[all …]
/dports/misc/rump/buildrump.sh-b914579/src/external/cddl/osnet/sys/kern/
H A Dddi.c274 if (n_items < MIN_N_ITEMS) in ddi_soft_state_init()
275 ss->n_items = MIN_N_ITEMS; in ddi_soft_state_init()
279 if ((bitlog = ddi_fls(n_items)) == ddi_ffs(n_items)) in ddi_soft_state_init()
281 ss->n_items = 1 << bitlog; in ddi_soft_state_init()
284 ASSERT(ss->n_items >= n_items); in ddi_soft_state_init()
337 if (item >= ss->n_items) { in ddi_soft_state_zalloc()
359 new_n_items = ss->n_items; in ddi_soft_state_zalloc()
377 dirty->n_items = ss->n_items; in ddi_soft_state_zalloc()
382 ss->n_items = new_n_items; in ddi_soft_state_zalloc()
458 msg, item, ss->n_items - 1); in ddi_soft_state_free()
[all …]
/dports/cad/netgen-lvs/netgen-1.5.211/dbug/
H A Danalyze.c212 DBUG_RETURN (n_items++);
218 if (n_items >= MAXPROCS) {
224 s_table[n_items].pos = s_table[ind].lchild = n_items;
225 s_table[n_items].lchild = s_table[n_items].rchild = MAXPROCS;
228 modules[n_items].m_time = modules[n_items].m_calls = 0;
229 DBUG_RETURN (n_items++);
245 s_table[n_items].pos = s_table[ind].rchild = n_items;
246 s_table[n_items].lchild = s_table[n_items].rchild = MAXPROCS;
249 modules[n_items].m_time = modules[n_items].m_calls = 0;
250 DBUG_RETURN (n_items++);
[all …]
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/rtdb/
H A Dmisc.h18 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
20 __FILE__, __LINE__, err_msg,(n_items)*sizeof(type)); \
22 pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
25 if (!pointer && n_items) \
26 error(err_msg, (int) (n_items)); }
37 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
38 { pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
39 if (!pointer && n_items) \
40 error(err_msg, (int) n_items); }
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/smd/graveyard/smd-rtdb/
H A Dmisc.h18 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
20 __FILE__, __LINE__, err_msg,(n_items)*sizeof(type)); \
22 pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
25 if (!pointer && n_items) \
26 error(err_msg, (int) (n_items)); }
37 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
38 { pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
39 if (!pointer && n_items) \
40 error(err_msg, (int) n_items); }
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/rtdb/db/
H A Drjhmisc.h18 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
20 __FILE__, __LINE__, err_msg,(n_items)*sizeof(type)); \
22 pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
25 if (!pointer && n_items) \
26 error(err_msg, n_items); }
37 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
38 { pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
39 if (!pointer && n_items) \
40 error(err_msg, n_items); }
/dports/science/nwchem-data/nwchem-7.0.2-release/src/smd/graveyard/smd-rtdb/
H A Dmisc.h18 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
20 __FILE__, __LINE__, err_msg,(n_items)*sizeof(type)); \
22 pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
25 if (!pointer && n_items) \
26 error(err_msg, (int) (n_items)); }
37 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
38 { pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
39 if (!pointer && n_items) \
40 error(err_msg, (int) n_items); }
/dports/science/nwchem-data/nwchem-7.0.2-release/src/rtdb/
H A Dmisc.h18 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
20 __FILE__, __LINE__, err_msg,(n_items)*sizeof(type)); \
22 pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
25 if (!pointer && n_items) \
26 error(err_msg, (int) (n_items)); }
37 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
38 { pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
39 if (!pointer && n_items) \
40 error(err_msg, (int) n_items); }
/dports/science/nwchem-data/nwchem-7.0.2-release/src/rtdb/db/
H A Drjhmisc.h18 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
20 __FILE__, __LINE__, err_msg,(n_items)*sizeof(type)); \
22 pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
25 if (!pointer && n_items) \
26 error(err_msg, n_items); }
37 #define ALLOCATE(pointer, n_items, type, err_msg) \ argument
38 { pointer = (type *) malloc((unsigned) ((n_items)*sizeof(type))); \
39 if (!pointer && n_items) \
40 error(err_msg, n_items); }

12345678910>>...59