Java/core/src/main/java/com/amazon/randomcutforest/tree/NodeStoreLarge.java [154:175]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        if (pointSum != null) {
            invalidatePointSum(index);
        }
        int idx = translate(index);
        if (idx != Integer.MAX_VALUE) {
            rangeSumData[idx] = 0.0;
        }
        freeNodeManager.releaseIndex(index);
    }

    public int getMass(int index) {
        return (isLeaf(index)) ? getLeafMass(index) : mass[index] != 0 ? mass[index] : (capacity + 1);
    }

    public void spliceEdge(int parent, int node, int newNode) {
        assert (!isLeaf(newNode));
        if (node == leftIndex[parent]) {
            leftIndex[parent] = newNode;
        } else {
            rightIndex[parent] = newNode;
        }
        if (parentIndex != null && isInternal(node)) {
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



Java/core/src/main/java/com/amazon/randomcutforest/tree/NodeStoreMedium.java [158:179]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        if (pointSum != null) {
            invalidatePointSum(index);
        }
        int idx = translate(index);
        if (idx != Integer.MAX_VALUE) {
            rangeSumData[idx] = 0.0;
        }
        freeNodeManager.releaseIndex(index);
    }

    public int getMass(int index) {
        return (isLeaf(index)) ? getLeafMass(index) : mass[index] != 0 ? mass[index] : (capacity + 1);
    }

    public void spliceEdge(int parent, int node, int newNode) {
        assert (!isLeaf(newNode));
        if (node == leftIndex[parent]) {
            leftIndex[parent] = newNode;
        } else {
            rightIndex[parent] = newNode;
        }
        if (parentIndex != null && isInternal(node)) {
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -