| /third_party/boost/libs/mpi/src/ |
| D | graph_communicator.cpp | 53 int nnodes, nedges; in edges() local
54 BOOST_MPI_CHECK_RESULT(MPI_Graphdims_get, ((MPI_Comm)comm, &nnodes, &nedges)); in edges()
56 shared_array<int> indices(new int[nnodes]); in edges()
59 ((MPI_Comm)comm, nnodes, nedges, in edges()
68 int nnodes, nedges; in num_edges() local
69 BOOST_MPI_CHECK_RESULT(MPI_Graphdims_get, ((MPI_Comm)comm, &nnodes, &nedges)); in num_edges()
|
| /third_party/gettext/libtextstyle/gnulib-local/lib/glib/ |
| D | ghash.c | 71 gint nnodes; member
82 if ((hash_table->size >= 3 * hash_table->nnodes && \
84 (3 * hash_table->size <= hash_table->nnodes && \
161 hash_table->nnodes = 0; in g_hash_table_new_full()
384 hash_table->nnodes++; in g_hash_table_insert()
430 hash_table->nnodes++;
465 hash_table->nnodes--;
502 hash_table->nnodes = 0;
531 hash_table->nnodes--;
563 hash_table->nnodes = 0;
[all …]
|
| /third_party/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
| D | LigatureTree.java | 127 Lignode[] nnodes = new Lignode[subnodes.length + 1]; in insert() local
130 System.arraycopy(subnodes, 0, nnodes, 0, i); in insert()
133 nnodes[i] = new Lignode(c); in insert()
136 System.arraycopy(subnodes, i, nnodes, i + 1, subnodes.length - i); in insert()
139 subnodes = nnodes; in insert()
|
| /third_party/ltp/testcases/kernel/mem/cpuset/ |
| D | cpuset01.c | 42 static int nnodes; variable
63 for (i = 0; i < nnodes; i++) { in test_cpuset()
85 if (get_allowed_nodes_arr(NH_MEMS | NH_CPUS, &nnodes, &nodes) < 0) in setup()
87 if (nnodes <= 1) in setup()
|
| /third_party/boost/libs/spirit/classic/test/ |
| D | switch_problem.cpp | 44 uint nnodes; member
66 uint_p[var(nnodes) = arg1] >> in definition()
69 var(index) <= var(nnodes), in definition()
|
| /third_party/glib/gio/ |
| D | gsettingsbackend.c | 624 gsize nnodes; in g_settings_backend_flatten_tree() local
626 nnodes = g_tree_nnodes (tree); in g_settings_backend_flatten_tree()
628 *keys = state.keys = g_new (const gchar *, nnodes + 1); in g_settings_backend_flatten_tree()
629 state.keys[nnodes] = NULL; in g_settings_backend_flatten_tree()
633 *values = state.values = g_new (GVariant *, nnodes + 1); in g_settings_backend_flatten_tree()
634 state.values[nnodes] = NULL; in g_settings_backend_flatten_tree()
638 g_return_if_fail (*keys + nnodes == state.keys); in g_settings_backend_flatten_tree()
641 while (nnodes--) in g_settings_backend_flatten_tree()
|
| /third_party/glib/glib/ |
| D | ghash.c | 261 gint nnodes; member
549 hash_table->nnodes--; in g_hash_table_remove_node()
628 if (hash_table->nnodes == 0) in g_hash_table_remove_all_nodes()
631 hash_table->nnodes = 0; in g_hash_table_remove_all_nodes()
871 g_hash_table_set_shift_from_size (hash_table, hash_table->nnodes * 1.333); in DEFINE_RESIZE_FUNC()
895 hash_table->noccupied = hash_table->nnodes; in DEFINE_RESIZE_FUNC()
913 if ((size > hash_table->nnodes * 4 && size > 1 << HASH_TABLE_MIN_SHIFT) || in g_hash_table_maybe_resize()
1073 hash_table->nnodes = 0; in g_hash_table_new_full()
1335 hash_table->nnodes++; in g_hash_table_insert_node()
1879 if (hash_table->nnodes != 0) in g_hash_table_remove_all()
[all …]
|
| D | gtree.c | 85 guint nnodes; member
223 tree->nnodes = 0; in g_tree_new_full()
362 g_assert (tree->nnodes > 0); in g_tree_remove_all()
363 tree->nnodes--; in g_tree_remove_all()
370 g_assert (tree->nnodes == 0); in g_tree_remove_all()
375 tree->nnodes = 0; in g_tree_remove_all()
578 tree->nnodes++; in g_tree_insert_internal()
630 tree->nnodes++; in g_tree_insert_internal()
653 tree->nnodes++; in g_tree_insert_internal()
964 tree->nnodes--; in g_tree_remove_internal()
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | csr_graph_test.cpp | 367 void graph_test(int nnodes, double density, int seed) in graph_test() argument
370 std::cout << "Testing " << nnodes << " density " << density << std::endl; in graph_test()
371 GraphT g(ERGen(gen, nnodes, density), ERGen(), nnodes); in graph_test()
|
| /third_party/optimized-routines/math/tools/ |
| D | remez.jl | 820 nnodes = 16 * (n+d+1)
822 grid = [ mid - halfwid * cos(pi*i/nnodes) for i=0:1:nnodes ]
|
| /third_party/glib/glib/tests/ |
| D | hash.c | 1353 gint nnodes; member
1433 g_assert_cmpint (occupied, ==, h->nnodes); in check_consistency()
1443 g_assert_cmpint (occupied, ==, h->nnodes); in check_counts()
|