133     assert(!LeftOf(0) && !RightOf(0));  in HuffmanCodec()
188       if (!RightOf(node) && !LeftOf(node)) {
193         if (LeftOf(node)) queue.emplace(LeftOf(node), code + "0");
229       if (!RightOf(node) && !LeftOf(node)) {  in DecodeFromStream()
240         node = LeftOf(node);  in DecodeFromStream()
252   uint32_t LeftOf(uint32_t node) const { return nodes_.at(node).left; }  in LeftOf()  function
303     if (!RightOf(node) && !LeftOf(node)) {  in PrintTreeInternal()
314       if (LeftOf(node)) {  in PrintTreeInternal()
318               << WeightOf(LeftOf(node));  in PrintTreeInternal()
320         PrintTreeInternal(out, LeftOf(node), depth + 1);  in PrintTreeInternal()
349       if (!RightOf(node) && !LeftOf(node)) {  in CreateEncodingTable()
355         if (LeftOf(node)) queue.emplace(LeftOf(node), bits, depth + 1);  in CreateEncodingTable()