Home
last modified time | relevance | path

Searched refs:n_nodes (Results 1 – 10 of 10) sorted by relevance

/third_party/glib/glib/
Dgbsearcharray.h56 guint n_nodes; member
91 #define g_bsearch_array_get_n_nodes(barray) (((GBSearchArray*) (barray))->n_nodes)
150 guint n_nodes = barray->n_nodes, offs = 0; in g_bsearch_array_lookup_fuzzy() local
154 while (offs < n_nodes) in g_bsearch_array_lookup_fuzzy()
156 guint i = (offs + n_nodes) >> 1; in g_bsearch_array_lookup_fuzzy()
163 n_nodes = i; in g_bsearch_array_lookup_fuzzy()
176 return (G_LIKELY (nth < barray->n_nodes) ? in g_bsearch_array_get_nth()
187 g_return_val_if_fail (node_in_array != NULL, barray->n_nodes); in g_bsearch_array_get_index()
191 return MIN (distance, barray->n_nodes + 1); /* may return one after end */ in g_bsearch_array_get_index()
198 guint old_size = barray->n_nodes * bconfig->sizeof_node; in g_bsearch_array_grow()
[all …]
Dgsequence.c122 gint n_nodes; member
1611 node->n_nodes = 1; in node_new()
1695 #define N_NODES(n) ((n)? (n)->n_nodes : 0)
1703 n_smaller = node->left->n_nodes; in node_get_pos()
1823 return node->n_nodes; in node_get_length()
1854 int n_nodes = 1; in node_update_fields() local
1856 n_nodes += N_NODES (node->left); in node_update_fields()
1857 n_nodes += N_NODES (node->right); in node_update_fields()
1859 node->n_nodes = n_nodes; in node_update_fields()
Dgslice.c1757 unsigned int n_nodes = branch->n_entries, offs = 0; in smc_tree_branch_lookup_nearest_L() local
1760 while (offs < n_nodes) in smc_tree_branch_lookup_nearest_L()
1762 unsigned int i = (offs + n_nodes) >> 1; in smc_tree_branch_lookup_nearest_L()
1768 n_nodes = i; in smc_tree_branch_lookup_nearest_L()
/third_party/boost/boost/geometry/srs/projections/proj/
Drobin.hpp64 static const int n_nodes = 18; variable
157 if (i >= n_nodes) i = n_nodes - 1; in fwd()
184 lp_lon /= coefs_x[n_nodes].c0; in inv()
188 i = int_floor(lp_lat * n_nodes); in inv()
189 if( i < 0 || i >= n_nodes ) { in inv()
/third_party/python/Lib/test/test_peg_generator/
Dtest_pegen.py596 self.n_nodes = 0
599 self.n_nodes += 1
611 self.assertEqual(visitor.n_nodes, 6)
628 self.assertEqual(visitor.n_nodes, 14)
640 self.assertEqual(visitor.n_nodes, 7)
653 self.assertEqual(visitor.n_nodes, 7)
667 self.assertEqual(visitor.n_nodes, 12)
/third_party/iowow/src/utils/
Dkbtree.h52 int n_keys, n_nodes; \
69 ++b->n_nodes; \
181 ++b->n_nodes; \
217 ++b->n_nodes; \
320 --b->n_nodes; \
/third_party/glib/gobject/
Dgsignal.c553 for (i = 0; i < hlbsa->n_nodes; i++) in handler_lookup()
649 for (i = 0; i < hlbsa->n_nodes; i++) in handlers_find()
835 if (bsa == NULL || bsa->n_nodes == 0) in node_update_single_va_closure()
837 else if (bsa->n_nodes == 1) in node_update_single_va_closure()
1349 guint n_nodes; in g_signal_list_ids() local
1357 n_nodes = g_bsearch_array_get_n_nodes (g_signal_key_bsa); in g_signal_list_ids()
1360 for (i = 0; i < n_nodes; i++) in g_signal_list_ids()
1367 if (!n_nodes) in g_signal_list_ids()
2029 for (i = 0; i < node.class_closure_bsa->n_nodes; i++) in signal_destroy_R()
2786 for (i = 0; i < hlbsa->n_nodes; i++) in g_signal_handlers_destroy()
/third_party/glib/glib/tests/
Dsequence.c18 guint n_nodes; member
48 …g_assert (node->n_nodes == 1 + (node->left ? node->left->n_nodes : 0) + (node->right ? node->right… in check_node()
/third_party/libxml2/
Dtestapi.c5377 int n_nodes; in test_xmlC14NDocDumpMemory() local
5388 for (n_nodes = 0;n_nodes < gen_nb_xmlNodeSetPtr;n_nodes++) { in test_xmlC14NDocDumpMemory()
5395 nodes = gen_xmlNodeSetPtr(n_nodes, 1); in test_xmlC14NDocDumpMemory()
5405 des_xmlNodeSetPtr(n_nodes, nodes, 1); in test_xmlC14NDocDumpMemory()
5416 printf(" %d", n_nodes); in test_xmlC14NDocDumpMemory()
5446 int n_nodes; in test_xmlC14NDocSave() local
5459 for (n_nodes = 0;n_nodes < gen_nb_xmlNodeSetPtr;n_nodes++) { in test_xmlC14NDocSave()
5467 nodes = gen_xmlNodeSetPtr(n_nodes, 1); in test_xmlC14NDocSave()
5478 des_xmlNodeSetPtr(n_nodes, nodes, 1); in test_xmlC14NDocSave()
5490 printf(" %d", n_nodes); in test_xmlC14NDocSave()
[all …]
/third_party/ffmpeg/libavformat/
Ddashdec.c517 static char *get_val_from_nodes_tab(xmlNodePtr *nodes, const int n_nodes, const char *attrname) in get_val_from_nodes_tab() argument
522 for (i = 0; i < n_nodes; ++i) { in get_val_from_nodes_tab()