M(this,function(e){return void 0===e?ce.text(this):this.empty().each(function(){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||(this.textContent=e)})},null,e,arguments.length)},append:function(){return $e(this,arguments,function(e){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||Re(this,e).appendChild(e)})},prepend:function(){return $e(this,arguments,function(e){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var t=Re(this,e);t.insertBefore(e,t.firstChild)}})},before:function(){return...

M(this,function(e){return void 0===e?ce.text(this):this.empty().each(function(){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||(this.textContent=e)})},null,e,arguments.length)},append:function(){return $e(this,arguments,function(e){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||Re(this,e).appendChild(e)})},prepend:function(){return $e(this,arguments,function(e){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var t=Re(this,e);t.insertBefore(e,t.firstChild)}})},before:function(){return...

        }
        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

        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
    }

        setSuperclassFieldsForSuccessfulParsing();

        byte[] src = new byte[10];
        int srcIndex = 0;

        // Simulate groupName = false (0x00), nodeType = 0 (0x00) -> src[srcIndex] = 0x00
        src[srcIndex] = (byte) 0x00;
        src[srcIndex + 1] = (byte) 0x00; // Reserved/padding byte

        // Simulate address = 192.168.1.1 (0xC0A80101)

        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

&void 0!==arguments[0]?arguments[0]:{},e=t.action,n=void 0===e?"copy":e,o=t.container,e=t.target,t=t.text;if("copy"!==n&&"cut"!==n)throw new Error('Invalid "action" value, use either "copy" or "cut"');if(void 0!==e){if(!e||"object"!==l(e)||1!==e.nodeType)throw new Error('Invalid "target" value, use a valid Element');if("copy"===n&&e.hasAttribute("disabled"))throw new Error('Invalid "target" attribute. Please use "readonly" instead of "disabled" attribute');if("cut"===n&&(e.hasAttribute("readonly...

 * 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