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

pkg text/template/parse, method (BreakNode) Type() NodeType
pkg text/template/parse, method (ContinueNode) Position() Pos
pkg text/template/parse, method (ContinueNode) Type() NodeType
pkg text/template/parse, type BreakNode struct
pkg text/template/parse, type BreakNode struct, Line int
pkg text/template/parse, type BreakNode struct, embedded NodeType
pkg text/template/parse, type BreakNode struct, embedded Pos

        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

        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
    }

        NbtAddress nbtAddress1 = new NbtAddress(mockName, testAddressInt, false, NbtAddress.H_NODE);
        NbtAddress nbtAddress2 = new NbtAddress(mockName2, testAddressInt, true, NbtAddress.B_NODE); // Different name, group, nodeType
        assertEquals(nbtAddress1.hashCode(), nbtAddress2.hashCode());
        assertEquals(testAddressInt, nbtAddress1.hashCode());
    }

    @Test
    void testEquals() {
        // Test equals method

# CL 130620043 text/template: add back pointer to Nodes for better error generation, Rob Pike <******@****.***>
pkg text/template/parse, type DotNode struct, embedded NodeType
pkg text/template/parse, type NilNode struct, embedded NodeType
pkg text/template/parse, method (*BranchNode) Copy() Node
pkg text/template/parse, method (*IdentifierNode) SetTree(*Tree) *IdentifierNode
pkg html/template, type Error struct, Node parse.Node

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...

:n:e?e.ownerDocument.documentElement:document.documentElement}function s(e){var t=e.nodeName;return'BODY'!==t&&('HTML'===t||p(e.firstElementChild)===e)}function d(e){return null===e.parentNode?e:d(e.parentNode)}function a(e,t){if(!e||!e.nodeType||!t||!t.nodeType)return document.documentElement;var o=e.compareDocumentPosition(t)&Node.DOCUMENT_POSITION_FOLLOWING,n=o?e:t,i=o?t:e,r=document.createRange();r.setStart(n,0),r.setEnd(i,0);var l=r.commonAncestorContainer;if(e!==l&&t!==l||n.contains(i))return...

    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.