}
            }
            if (dns_forest.buffer != null) {
                _dst = _dst.deferred;
                int _dns_forest_bufferl = dns_forest.length / 2;
                int _dns_forest_buffers = dns_forest.maximum_length / 2;
                _dst.enc_ndr_long(_dns_forest_buffers);
                _dst.enc_ndr_long(0);
                _dst.enc_ndr_long(_dns_forest_bufferl);

            }
            if ( this.dns_forest.buffer != null ) {
                _dst = _dst.deferred;
                int _dns_forest_bufferl = this.dns_forest.length / 2;
                int _dns_forest_buffers = this.dns_forest.maximum_length / 2;
                _dst.enc_ndr_long(_dns_forest_buffers);
                _dst.enc_ndr_long(0);
                _dst.enc_ndr_long(_dns_forest_bufferl);

   * node(s) to any node reachable from the start node(s), and has no paths from any start node to
   * any other start node, such as a tree or forest.
   *
   * <p>{@code forTree()} is especially useful (versus {@code forGraph()}) in cases where the data
   * structure being traversed is, in addition to being a tree/forest, also defined <a
   * href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursively</a>.