IntSet
interface to minimize the effort required to implement this interface.clone() of Objectclone() of Objectclone() of ObjectIterator-like interface that allows to "skip" some elements of
the setn % 31
This method of finding modulus division by an integer that is one less
than a power of 2 takes at most O(lg(32)) time.n * 31IntSet.IntIterator.next() gives the given element or, if it does not exist, the
element immediately after according to the sorting provided by this
set.Copyright © 2011–2020 The Apache Software Foundation. All rights reserved.