base/common/src/main/com/thesett/common/util/maps/CircularArrayMap.java
public V put(Integer key, V value)
    {
        if (keyTooLarge(key))
        {
            expand(key);
        }

        int offset = offset(key);
        V oldValue = (V) data[offset];
        data[offset] = value;

        // If the key is beyond the current end of the array, then move the end up.
        if (key >= end)
        {
            end = key + 1;
        }

        // Increment the count only if a new value was inserted.
        if (oldValue == null)
        {
            count++;
        }

        return oldValue;
    }
public V put(Integer key, V value)
    {
        if (keyTooLarge(key))
        {
            expand(key);
        }

        int offset = offset(key);
        V oldValue = (V) data[offset];
        data[offset] = value;

        // If the key is beyond the current end of the array, then move the end up.
        if (key >= end)
        {
            end = key + 1;
        }

        // Increment the count only if a new value was inserted.
        if (oldValue == null)
        {
            count++;
        }

        return oldValue;
    }
public V put ( Integer key , V value ) { if ( keyTooLarge ( key ) ) { expand ( key ) ; } int offset = offset ( key ) ; V oldValue = ( V ) data [ offset ] ; data [ offset ] = value ; // If the key is beyond the current end of the array, then move the end up. if ( key >= end ) { end = key + 1 ; } // Increment the count only if a new value was inserted. if ( oldValue == null ) { count ++ ; } return oldValue ; }
{@inheritDoc}
{