base/common/src/main/com/thesett/common/util/priority/BucketedPriorityMap.java
public K pollKey()
    {
        // Scan through the buckets until a non empty one is found.
        int i = 0;

        for (; i < n; i++)
        {
            if (!maps[i].isEmpty())
            {
                break;
            }

            // If all maps are empty then the whole data structure is emtpy.
            if (i == (n - 1))
            {
                return null;
            }
        }

        return maps[i].keySet().iterator().next();
    }
public K pollKey()
    {
        // Scan through the buckets until a non empty one is found.
        int i = 0;

        for (; i < n; i++)
        {
            if (!maps[i].isEmpty())
            {
                break;
            }

            // If all maps are empty then the whole data structure is emtpy.
            if (i == (n - 1))
            {
                return null;
            }
        }

        return maps[i].keySet().iterator().next();
    }
Returns the first (lowest) key currently in this priority map.

@return The first (lowest) key currently in this priority map, or <tt>null</tt> if there is no first key.