133     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()
349       if (!RightOf(node) && !LeftOf(node)) {  in CreateEncodingTable()
357         if (RightOf(node))  in CreateEncodingTable()
358           queue.emplace(RightOf(node), bits | (1ULL << depth), depth + 1);  in CreateEncodingTable()