}
        final boolean groupName = ((src[srcIndex] & 0x80) == 0x80) == true;
        final int nodeType = (src[srcIndex] & 0x60) >> 5;
        srcIndex += 2;
        final int address = readInt4(src, srcIndex);
        if (address != 0) {
            addrEntry[addrIndex] = new NbtAddress(recordName, address, groupName, nodeType);
        } else {
            addrEntry[addrIndex] = null;
        }

        return 6;
    }

        }
        final boolean groupName = ((src[srcIndex] & 0x80) == 0x80) == true;
        final int nodeType = (src[srcIndex] & 0x60) >> 5;
        srcIndex += 2;
        final int address = readInt4(src, srcIndex);
        if (address != 0) {
            this.addrEntry[this.addrIndex] = new NbtAddress(this.recordName, address, groupName, nodeType);
        } else {
            this.addrEntry[this.addrIndex] = null;
        }

        this.nodeType = nodeType;
    }

    NbtAddress(final Name hostName, final int address, final boolean groupName, final int nodeType, final boolean isBeingDeleted,
            final boolean isInConflict, final boolean isActive, final boolean isPermanent, final byte[] macAddress) {

        /*
         * The NodeStatusResponse.readNodeNameArray method may also set this

        this.nodeType = nodeType;
    }

    NbtAddress(final Name hostName, final int address, final boolean groupName, final int nodeType, final boolean isBeingDeleted,
            final boolean isInConflict, final boolean isActive, final boolean isPermanent, final byte[] macAddress) {

        /* The NodeStatusResponse.readNodeNameArray method may also set this

        NbtAddress[] addresses = (NbtAddress[]) addressArrayField.get(response);

        assertEquals(0, addresses[0].nodeType); // B-node
        assertEquals(1, addresses[1].nodeType); // P-node
        assertEquals(2, addresses[2].nodeType); // M-node
        assertEquals(3, addresses[3].nodeType); // H-node
    }

 * implement it:
 *
 * {@snippet :
 * // won't work
 * TreeTraverser<NodeType> traverser = node -> node.getChildNodes();
 * }
 *
 * Instead, you can pass a lambda expression to the {@code using} factory method:
 *
 * {@snippet :
 * TreeTraverser<NodeType> traverser = TreeTraverser.using(node -> node.getChildNodes());
 * }
 *
 * @author Louis Wasserman
 * @since 15.0

e))return At(e),!0;const n=ft(e.nodeName);if(Rt(de.uponSanitizeElement,e,{tagName:n,allowedTags:Ne}),ze&&e.hasChildNodes()&&!Dt(e.firstElementChild)&&b(/<[/\w!]/g,e.innerHTML)&&b(/<[/\w!]/g,e.textContent))return At(e),!0;if(e.nodeType===ee)return At(e),!0;if(ze&&e.nodeType===te&&b(/<[/\w]/g,e.data))return At(e),!0;if(!(ke.tagCheck instanceof Function&&ke.tagCheck(n))&&(!Ne[n]||Oe[n])){if(!Oe[n]&&Ot(n)){if(Ce.tagNameCheck instanceof RegExp&&b(Ce.tagNameCheck,n))return!1;if(Ce.tagNameCheck instanceof...

                    this.queryAddress.hostName = new Name(this.config, n, hexCode, scope);
                }
                this.queryAddress.groupName = groupName;
                this.queryAddress.nodeType = ownerNodeType;
                this.queryAddress.isBeingDeleted = isBeingDeleted;
                this.queryAddress.isInConflict = isInConflict;
                this.queryAddress.isActive = isActive;

    return absl::OkStatus();
  }

  tensorflow::FullTypeDef FullType() const override {
    const FullTypeDef* ft;
    mutex_lock l(graph_->mu);
    graph_->graph.NodeType(output_.oper->node.name(), &ft);
    if (ft == nullptr) {
      return FullTypeDef();
    } else {
      return *ft;
    }
  }

  TF_Output output_;

  // For LLVM style RTTI.

					continue
				}
				return err
			}

			// Ignore symlinked directories.
			if typ&os.ModeSymlink == os.ModeSymlink && fi.IsDir() {
				continue
			}

			typ = fi.Mode() & os.ModeType
		}
		if err = fn(string(name), typ); err == errDoneForNow {
			// fn() requested to return by caller.
			return nil
		}
	}

	return err
}