Home
last modified time | relevance | path

Searched refs:RightOf (Results 1 – 8 of 8) sorted by relevance

/external/deqp-deps/SPIRV-Tools/source/comp/
Dmove_to_front.cpp198 node = RightOf(node); in ValueFromRank()
256 iter = right_child ? RightOf(iter) : LeftOf(iter); in InsertNode()
278 if (RightOf(parent) == node) { in InsertNode()
309 if (LeftOf(node) && RightOf(node)) { in RemoveNode()
313 const uint32_t scapegoat = SizeOf(LeftOf(node)) >= SizeOf(RightOf(node)) in RemoveNode()
315 : LeftestDescendantOf(RightOf(node)); in RemoveNode()
325 assert(!RightOf(node) || !LeftOf(node)); in RemoveNode()
328 uint32_t child = RightOf(node) ? RightOf(node) : LeftOf(node); in RemoveNode()
362 if (RightOf(parent) == node) { in RemoveNode()
374 const uint32_t sibling = RightOf(parent); in RemoveNode()
[all …]
Dhuffman_codec.h133 assert(!LeftOf(0) && !RightOf(0)); in HuffmanCodec()
188 if (!RightOf(node) && !LeftOf(node)) {
195 if (RightOf(node)) queue.emplace(RightOf(node), code + "1");
229 if (!RightOf(node) && !LeftOf(node)) { in DecodeFromStream()
238 node = RightOf(node); in DecodeFromStream()
255 uint32_t RightOf(uint32_t node) const { return nodes_.at(node).right; } in RightOf() function
303 if (!RightOf(node) && !LeftOf(node)) { in PrintTreeInternal()
306 if (RightOf(node)) { in PrintTreeInternal()
309 << WeightOf(RightOf(node)); in PrintTreeInternal()
311 PrintTreeInternal(out, RightOf(node), depth + 1); in PrintTreeInternal()
[all …]
Dmove_to_front.h138 uint32_t RightOf(uint32_t node) const { return nodes_.at(node).right; } in RightOf() function
206 return RightOf(ParentOf(node)) == node; in IsRightChild()
212 return !ParentOf(node) && !LeftOf(node) && !RightOf(node); in IsOrphan()
223 return int(HeightOf(RightOf(node))) - int(HeightOf(LeftOf(node))); in BalanceOf()
245 node = RightOf(node); in RightestDescendantOf()
/external/swiftshader/third_party/SPIRV-Tools/source/comp/
Dmove_to_front.cpp198 node = RightOf(node); in ValueFromRank()
256 iter = right_child ? RightOf(iter) : LeftOf(iter); in InsertNode()
278 if (RightOf(parent) == node) { in InsertNode()
309 if (LeftOf(node) && RightOf(node)) { in RemoveNode()
313 const uint32_t scapegoat = SizeOf(LeftOf(node)) >= SizeOf(RightOf(node)) in RemoveNode()
315 : LeftestDescendantOf(RightOf(node)); in RemoveNode()
325 assert(!RightOf(node) || !LeftOf(node)); in RemoveNode()
328 uint32_t child = RightOf(node) ? RightOf(node) : LeftOf(node); in RemoveNode()
362 if (RightOf(parent) == node) { in RemoveNode()
374 const uint32_t sibling = RightOf(parent); in RemoveNode()
[all …]
Dhuffman_codec.h133 assert(!LeftOf(0) && !RightOf(0)); in HuffmanCodec()
188 if (!RightOf(node) && !LeftOf(node)) {
195 if (RightOf(node)) queue.emplace(RightOf(node), code + "1");
229 if (!RightOf(node) && !LeftOf(node)) { in DecodeFromStream()
238 node = RightOf(node); in DecodeFromStream()
255 uint32_t RightOf(uint32_t node) const { return nodes_.at(node).right; } in RightOf() function
303 if (!RightOf(node) && !LeftOf(node)) { in PrintTreeInternal()
306 if (RightOf(node)) { in PrintTreeInternal()
309 << WeightOf(RightOf(node)); in PrintTreeInternal()
311 PrintTreeInternal(out, RightOf(node), depth + 1); in PrintTreeInternal()
[all …]
Dmove_to_front.h138 uint32_t RightOf(uint32_t node) const { return nodes_.at(node).right; } in RightOf() function
206 return RightOf(ParentOf(node)) == node; in IsRightChild()
212 return !ParentOf(node) && !LeftOf(node) && !RightOf(node); in IsOrphan()
223 return int(HeightOf(RightOf(node))) - int(HeightOf(LeftOf(node))); in BalanceOf()
245 node = RightOf(node); in RightestDescendantOf()
/external/deqp-deps/SPIRV-Tools/test/
Dmove_to_front_test.cpp99 PrintTreeInternal(out, RightOf(node), depth + 1, print_timestamp); in PrintTreeInternal()
/external/swiftshader/third_party/SPIRV-Tools/test/
Dmove_to_front_test.cpp99 PrintTreeInternal(out, RightOf(node), depth + 1, print_timestamp); in PrintTreeInternal()