Home
last modified time | relevance | path

Searched refs:FindRoot (Results 1 – 4 of 4) sorted by relevance

/external/tensorflow/tensorflow/compiler/xla/
Dunion_find.h31 int Size() { return FindRoot()->size_; } in Size()
39 T& Get() { return FindRoot()->value_; } in Get()
43 UnionFind* FindRoot();
53 UnionFind<T>* a = FindRoot(); in Merge()
54 UnionFind<T>* b = other->FindRoot(); in Merge()
71 UnionFind<T>* UnionFind<T>::FindRoot() { in FindRoot() function
75 parent_ = parent_->FindRoot(); in FindRoot()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
Dunion_find.h161 int Size() { return FindRoot()->size_; } in Size()
165 const P& Property() { return FindRoot()->property_; } in Property()
173 const T& ParentValue() { return FindRoot()->value_; } in ParentValue()
181 UnionFind* FindRoot();
191 UnionFind<T>* a = FindRoot(); in Merge()
192 UnionFind<T>* b = other->FindRoot(); in Merge()
204 UnionFind<T, P>* UnionFind<T, P>::FindRoot() { in FindRoot() function
208 parent_ = parent_->FindRoot(); in FindRoot()
/external/tensorflow/tensorflow/core/common_runtime/
Dcolocation_graph.h78 static int FindRoot(const std::vector<Member>& tree, int node_id);
364 int FindRoot(int node_id) const { in FindRoot() function
365 return Member::FindRoot(members_, node_id); in FindRoot()
Dcolocation_graph.cc360 int Member::FindRoot(const std::vector<Member>& tree, int node_id) { in FindRoot() function in tensorflow::Member
365 return FindRoot(tree, member.parent_); in FindRoot()
1317 int node_root = FindRoot(node->id()); in DebugString()
1345 if (FindRoot(id) != node_root) { in DebugInfo()