public LongSortedSet tailSet( final long from ) { return from > this.from ? new LongSetView( bitVector, from, to ) : this; }
public LongBidirectionalIterator iterator() { return iterator( 0 ); }
public LongSortedSet asLongSet() { return new LongSetView( this, 0, Long.MAX_VALUE ); }
public LongSortedSet headSet( final long to ) { return to < this.to ? new LongSetView( bitVector, from, to ) : this; }
public LongSortedSet headSet( final long to ) { return to < this.to ? new LongSetView( bitVector, from, to ) : this; }
@Override public LongSortedSet tailSet(final long from) { return from > this.from ? new LongSetView(bitVector, from, to) : this; }
@Override public LongSortedSet headSet(final long to) { return to < this.to ? new LongSetView(bitVector, from, to) : this; }
@Override public LongBidirectionalIterator iterator() { return iterator(0); }
public LongBidirectionalIterator iterator() { return iterator( 0 ); }
@Override public LongSortedSet asLongSet() { return new LongSetView(this, 0, Long.MAX_VALUE); }
public LongSortedSet tailSet( final long from ) { return from > this.from ? new LongSetView( bitVector, from, to ) : this; }
public LongSortedSet asLongSet() { return new LongSetView( this, 0, Long.MAX_VALUE ); }
public LongSortedSet subSet( long from, long to ) { to = to < this.to ? to : this.to; from = from > this.from ? from : this.from; if ( from == this.from && to == this.to ) return this; return new LongSetView( bitVector, from, to ); } }
@Override public LongSortedSet subSet(long from, long to) { to = to < this.to ? to : this.to; from = from > this.from ? from : this.from; if (from == this.from && to == this.to) return this; return new LongSetView(bitVector, from, to); } }
public LongSortedSet subSet( long from, long to ) { to = to < this.to ? to : this.to; from = from > this.from ? from : this.from; if ( from == this.from && to == this.to ) return this; return new LongSetView( bitVector, from, to ); } }