Searched refs:new_node_index (Results 1 – 7 of 7) sorted by relevance
112 unsigned long new_node_index; in bt_node_add() local130 new_node_index = GET_NODE_HANDLE(temp); in bt_node_add()131 return new_node_index; in bt_node_add()134 new_node_index = t->size + 1; in bt_node_add()136 while (new_node_index != 1) { in bt_node_add()137 if (new_node_index & 1) { in bt_node_add()159 new_node_index >>= 1; in bt_node_add()
130 unsigned long new_node_index; in bt_node_add() local157 new_node_index = GET_NODE_HANDLE(temp); in bt_node_add()159 return new_node_index; in bt_node_add()162 new_node_index = t->size + 1; in bt_node_add()164 while (new_node_index != 1) { in bt_node_add()165 if (new_node_index & 1) { in bt_node_add()189 new_node_index >>= 1; in bt_node_add()
72 const std::vector<int>& new_node_index);277 const std::vector<int>& new_node_index) { in RemapGraph() argument278 DCHECK(IsValidPermutation(new_node_index)) << "Invalid permutation"; in RemapGraph()280 CHECK_EQ(new_node_index.size(), num_nodes); in RemapGraph()286 new_graph->AddArc(new_node_index[node], in RemapGraph()287 new_node_index[old_graph.Head(arc)]); in RemapGraph()300 std::vector<NodeIndex> new_node_index(old_graph.num_nodes(), -1); in GetSubgraphOfNodes()302 new_node_index[nodes[new_index]] = new_index; in GetSubgraphOfNodes()309 if (new_node_index[old_graph.Head(arc)] != -1) ++num_arcs; in GetSubgraphOfNodes()320 const NodeIndex new_head = new_node_index[old_graph.Head(arc)]; in GetSubgraphOfNodes()
468 int new_node_index = 0; in ProcessCore() local476 (*nodes)[new_node_index] = (*nodes)[index]; in ProcessCore()477 ++new_node_index; in ProcessCore()489 (*nodes)[new_node_index] = (*nodes)[index]; in ProcessCore()490 ++new_node_index; in ProcessCore()495 (*nodes)[new_node_index] = (*nodes)[index]; in ProcessCore()496 ++new_node_index; in ProcessCore()498 nodes->resize(new_node_index); in ProcessCore()
684 std::vector<int> new_node_index(graph->num_nodes(), -1); in FindLinearBooleanProblemSymmetries() local693 new_node_index[node] = next_index_by_class[equivalence_classes[node]]++; in FindLinearBooleanProblemSymmetries()695 std::unique_ptr<Graph> remapped_graph = RemapGraph(*graph, new_node_index); in FindLinearBooleanProblemSymmetries()
29 cdef np.intp_t new_node_index45 new_node_index = np.argmin(current_distances)46 new_node = current_labels[new_node_index]49 result[i - 1, 2] = current_distances[new_node_index]
282 int new_node_index = num_corner_nodes; in add_mid_volume_nodes() local283 new_node_index += edge_factor * CN::mConnectivityMap[this_type][0].num_sub_elements; in add_mid_volume_nodes()284 new_node_index += face_factor * CN::mConnectivityMap[this_type][1].num_sub_elements; in add_mid_volume_nodes()312 mMB->create_vertex(sum_coords, element[new_node_index]); in add_mid_volume_nodes()315 mHONodeAddedRemoved->node_added(element[new_node_index], curr_handle); in add_mid_volume_nodes()