java/src/main/java/com/epam/deltix/containers/ObjHashSet.java [377:405]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    public long removeAt(long iterator) throws NoSuchElementException {
        if (iterator == NO_ELEMENT) {
            throw new NoSuchElementException("You try to delete element by incorrect iterator");
        }

        if (iterator == reservedSpace) {
            allocedPlaceWasFilled = true;
        }

        int previous = -1;
        long nxt = getNext(iterator);
        int hash = getHash(iterator);
        int current = first[hash];
        int itPlace = getPlace(iterator);
        while (next[current] >= 0 && current != itPlace) {
            previous = current;
            current = next[current];
        }
        int last = head;
        head = current;
        if (itPlace == first[hash]) {
            first[hash] = next[current];
        } else {
            next[previous] = next[current];
        }
        next[current] = -last - 1;
        count--;
        return nxt;
    }
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



java/src/main/java/com/epam/deltix/containers/ObjToObjHashMap.java [486:515]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    public long removeAt(long iterator) throws NoSuchElementException {
        if (iterator == NO_ELEMENT) {
            throw new NoSuchElementException("You try to delete element by incorrect iterator");
        }

        if (iterator == reservedSpace) {
            allocedPlaceWasFilled = true;
        }

        int previous = -1;
        long nxt = getNext(iterator);
        int hash = getHash(iterator);
        int current = first[hash];
        int itPlace = getPlace(iterator);
        while (next[current] >= 0 && current != itPlace) {
            previous = current;
            current = next[current];
        }
        int last = head;
        head = current;
        if (itPlace == first[hash]) {
            first[hash] = next[current];
        } else {
            next[previous] = next[current];
        }
        next[current] = -last - 1;
        count--;

        return nxt;
    }
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -