Searched refs:nodes (Results 1 – 5 of 5) sorted by relevance
961 Node* nodes[kMaxPossibleHeight];965 nodes[i] = head_;967 while (nodes[0] != nullptr) {968 Node* l0_next = nodes[0]->Next(0);972 assert(nodes[0] == head_ || compare_(nodes[0]->Key(), l0_next->Key()) < 0);973 nodes[0] = l0_next;977 Node* next = nodes[i]->Next(i);981 auto cmp = compare_(nodes[0]->Key(), next->Key());984 assert(next == nodes[0]);985 nodes[i] = next;[all …]
52 …nodes are buckets of hash table and there is an edge from bucket _A_ to bucket _B_ if the element …
23 to other nodes in the cluster.
108 … of hosting super large scale graphs with dozens of billions of vertices (nodes) and trillions of …
3357 bitmask* nodes = numa_allocate_nodemask(); in RunBenchmark() local3358 numa_bitmask_clearall(nodes); in RunBenchmark()3359 numa_bitmask_setbit(nodes, numa_node); in RunBenchmark()3363 numa_bind(nodes); in RunBenchmark()3365 numa_free_nodemask(nodes); in RunBenchmark()