HomeSort by relevance Sort by last modified time
    Searched refs:neighbor_list (Results 1 - 3 of 3) sorted by null

  /external/bcc/examples/networking/neighbor_sharing/
tc_neighbor_sharing.py 44 neighbor_list = []
51 neighbor_list.append(ret)
59 for x in neighbor_list:
  /external/tensorflow/tensorflow/core/graph/
collective_order.cc 121 std::vector<Node*> neighbor_list(neighbor_set.begin(), neighbor_set.end());
122 // For all n1, n2 in `neighbor_list` if there is a path from n1 -> n2 then
123 // eliminate n2 from `neighbor_set` and `neighbor_list`. We remove from
124 // `neighbor_list` by replacing with a `nullptr`, hence the `nullptr` checks
126 for (int j = 0; j < neighbor_list.size(); ++j) {
127 Node* n1 = neighbor_list[j];
130 for (int k = 0; k < neighbor_list.size(); ++k) {
131 Node* n2 = neighbor_list[k];
135 neighbor_list[k] = nullptr;
  /external/autotest/server/
site_linux_router.py     [all...]

Completed in 618 milliseconds