Method treePut

src/main/java/org/mapdb/IndexTreeListJava.java:321–376

(
            int dirShift,
            long recid,
            final Store store,
            int level,
            final long index,
            long value)

    }

    static final void treePut(
            int dirShift,
            long recid,
            final Store store,
            int level,
            final long index,
            long value){
        if(CC.ASSERT && index<0)
            throw new AssertionError();
        if(CC.ASSERT && index>>>(level*dirShift)!=0)
            throw new AssertionError();


        for(;level>=0;) {
            long[] dir = store.get(recid, dirSer);
            final int slot = treePos(dirShift, level, index);
            int dirPos = dirOffsetFromSlot(dir,slot);
            if(dirPos<0){
                //empty slot, just update
                dir = dirPut(dir, slot, value, index+1);
                store.update(recid, dir, dirSer);
                return;
            }

            final long oldVal = dir[dirPos];
            final long oldIndex = dir[dirPos + 1]-1;

            if (oldIndex == -1) {
                if (oldVal == 0) {
                    throw new AssertionError(); //empty pos, but that should be already covered by dirPos<0
                } else {
                    //dive deeper
                    recid = oldVal;
                    level--;
                    continue; // recursive call to treePut (sort of)
                }
            } else if (oldIndex == index) {
                //slot is occupied by the same index
                if (oldVal == value)
                    return; //do not update if same
                dir = dir.clone();
                dir[dirPos] = value;
                store.update(recid, dir, dirSer);
            } else {
                // is occupied by the different value, must split it
                dir = dir.clone();
                //recid of subdir
                dir[dirPos] = treePutSub(dirShift, store, level-1, index, value, oldIndex, oldVal);
                //this is turning into directory
                dir[dirPos + 1] = 0;
                store.update(recid, dir, dirSer);
            }
            return;
        }
        throw new DBException.DataCorruption("level too low");
    }

    /**