lightning-core/src/main/java/org/apache/directmemory/lightning/internal/util/FastIntMap.java [181:248]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        final int index = index( key );

        Entry<V> prev = table[index];
        Entry<V> e = prev;
        while ( e != null )
        {
            Entry<V> next = e.next;
            if ( e.key == key )
            {
                size--;
                if ( prev == e )
                {
                    table[index] = next;
                }
                else
                {
                    prev.next = next;
                }
                return e.value;
            }
            prev = e;
            e = next;
        }
        return null;
    }

    public int size()
    {
        return size;
    }

    public boolean isEmpty()
    {
        return size == 0;
    }

    public void clear()
    {
        final Entry<V>[] table = this.table;
        for ( int index = table.length - 1; index >= 0; index-- )
        {
            table[index] = null;
        }
        size = 0;
    }

    @Override
    public EntryIterator iterator()
    {
        return new EntryIterator();
    }

    public class EntryIterator
        implements Iterator<Entry<V>>
    {

        private int nextIndex;

        private Entry<V> current;

        EntryIterator()
        {
            reset();
        }

        public void reset()
        {
            current = null;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



lightning-core/src/main/java/org/apache/directmemory/lightning/internal/util/FastLongMap.java [186:253]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        final int index = index( key );

        Entry<V> prev = table[index];
        Entry<V> e = prev;
        while ( e != null )
        {
            Entry<V> next = e.next;
            if ( e.key == key )
            {
                size--;
                if ( prev == e )
                {
                    table[index] = next;
                }
                else
                {
                    prev.next = next;
                }
                return e.value;
            }
            prev = e;
            e = next;
        }
        return null;
    }

    public int size()
    {
        return size;
    }

    public boolean isEmpty()
    {
        return size == 0;
    }

    public void clear()
    {
        final Entry<V>[] table = this.table;
        for ( int index = table.length - 1; index >= 0; index-- )
        {
            table[index] = null;
        }
        size = 0;
    }

    @Override
    public EntryIterator iterator()
    {
        return new EntryIterator();
    }

    public class EntryIterator
        implements Iterator<Entry<V>>
    {

        private int nextIndex;

        private Entry<V> current;

        EntryIterator()
        {
            reset();
        }

        public void reset()
        {
            current = null;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -