Class LongRBTreeSet

    • Constructor Detail

      • LongRBTreeSet

        public LongRBTreeSet()
        Creates a new empty tree set.
      • LongRBTreeSet

        public LongRBTreeSet​(java.util.Comparator<? super java.lang.Long> c)
        Creates a new empty tree set with the given comparator.
        Parameters:
        c - a Comparator (even better, a type-specific comparator).
      • LongRBTreeSet

        public LongRBTreeSet​(java.util.Collection<? extends java.lang.Long> c)
        Creates a new tree set copying a given collection.
        Parameters:
        c - a collection to be copied into the new tree set.
      • LongRBTreeSet

        public LongRBTreeSet​(java.util.SortedSet<java.lang.Long> s)
        Creates a new tree set copying a given sorted set (and its Comparator).
        Parameters:
        s - a SortedSet to be copied into the new tree set.
      • LongRBTreeSet

        public LongRBTreeSet​(LongCollection c)
        Creates a new tree set copying a given type-specific collection.
        Parameters:
        c - a type-specific collection to be copied into the new tree set.
      • LongRBTreeSet

        public LongRBTreeSet​(LongSortedSet s)
        Creates a new tree set copying a given type-specific sorted set (and its Comparator).
        Parameters:
        s - a type-specific sorted set to be copied into the new tree set.
      • LongRBTreeSet

        public LongRBTreeSet​(LongIterator i)
        Creates a new tree set using elements provided by a type-specific iterator.
        Parameters:
        i - a type-specific iterator whose elements will fill the set.
      • LongRBTreeSet

        public LongRBTreeSet​(java.util.Iterator<?> i)
        Creates a new tree set using elements provided by an iterator.
        Parameters:
        i - an iterator whose elements will fill the set.
      • LongRBTreeSet

        public LongRBTreeSet​(long[] a,
                             int offset,
                             int length,
                             java.util.Comparator<? super java.lang.Long> c)
        Creates a new tree set and fills it with the elements of a given array using a given Comparator.
        Parameters:
        a - an array whose elements will be used to fill the set.
        offset - the first element to use.
        length - the number of elements to use.
        c - a Comparator (even better, a type-specific comparator).
      • LongRBTreeSet

        public LongRBTreeSet​(long[] a,
                             int offset,
                             int length)
        Creates a new tree set and fills it with the elements of a given array.
        Parameters:
        a - an array whose elements will be used to fill the set.
        offset - the first element to use.
        length - the number of elements to use.
      • LongRBTreeSet

        public LongRBTreeSet​(long[] a)
        Creates a new tree set copying the elements of an array.
        Parameters:
        a - an array to be copied into the new tree set.
      • LongRBTreeSet

        public LongRBTreeSet​(long[] a,
                             java.util.Comparator<? super java.lang.Long> c)
        Creates a new tree set copying the elements of an array using a given Comparator.
        Parameters:
        a - an array to be copied into the new tree set.
        c - a Comparator (even better, a type-specific comparator).
    • Method Detail

      • remove

        public boolean remove​(long k)
        Description copied from class: AbstractLongSet
        Removes an element from this set. Delegates to the type-specific rem() method implemented by type-specific abstract Collection superclass.
        Specified by:
        remove in interface LongSet
        Overrides:
        remove in class AbstractLongSet
        See Also:
        Collection.remove(Object)
      • clear

        public void clear()
        Specified by:
        clear in interface java.util.Collection<java.lang.Long>
        Specified by:
        clear in interface java.util.Set<java.lang.Long>
        Overrides:
        clear in class java.util.AbstractCollection<java.lang.Long>
      • size

        public int size()
        Specified by:
        size in interface java.util.Collection<java.lang.Long>
        Specified by:
        size in interface java.util.Set<java.lang.Long>
        Specified by:
        size in class java.util.AbstractCollection<java.lang.Long>
      • isEmpty

        public boolean isEmpty()
        Specified by:
        isEmpty in interface java.util.Collection<java.lang.Long>
        Specified by:
        isEmpty in interface java.util.Set<java.lang.Long>
        Overrides:
        isEmpty in class java.util.AbstractCollection<java.lang.Long>
      • firstLong

        public long firstLong()
        Description copied from interface: LongSortedSet
        Returns the first (lowest) element currently in this set.
        Specified by:
        firstLong in interface LongSortedSet
        See Also:
        SortedSet.first()
      • lastLong

        public long lastLong()
        Description copied from interface: LongSortedSet
        Returns the last (highest) element currently in this set.
        Specified by:
        lastLong in interface LongSortedSet
        See Also:
        SortedSet.last()
      • iterator

        public LongBidirectionalIterator iterator​(long from)
        Description copied from interface: LongSortedSet
        Returns a type-specific BidirectionalIterator on the elements in this set, starting from a given element of the domain (optional operation).

        This method returns a type-specific bidirectional iterator with given starting point. The starting point is any element comparable to the elements of this set (even if it does not actually belong to the set). The next element of the returned iterator is the least element of the set that is greater than the starting point (if there are no elements greater than the starting point, hasNext() will return false). The previous element of the returned iterator is the greatest element of the set that is smaller than or equal to the starting point (if there are no elements smaller than or equal to the starting point, hasPrevious() will return false).

        Note that passing the last element of the set as starting point and calling previous() you can traverse the entire set in reverse order.

        Specified by:
        iterator in interface LongSortedSet
        Parameters:
        from - an element to start from.
        Returns:
        a bidirectional iterator on the element in this set, starting at the given element.
      • headSet

        public LongSortedSet headSet​(long to)
        Description copied from interface: LongSortedSet
        Returns a view of the portion of this sorted set whose elements are strictly less than toElement.
        Specified by:
        headSet in interface LongSortedSet
        See Also:
        SortedSet.headSet(Object)
      • tailSet

        public LongSortedSet tailSet​(long from)
        Description copied from interface: LongSortedSet
        Returns a view of the portion of this sorted set whose elements are greater than or equal to fromElement.
        Specified by:
        tailSet in interface LongSortedSet
        See Also:
        SortedSet.tailSet(Object)
      • subSet

        public LongSortedSet subSet​(long from,
                                    long to)
        Description copied from interface: LongSortedSet
        Returns a view of the portion of this sorted set whose elements range from fromElement, inclusive, to toElement, exclusive.
        Specified by:
        subSet in interface LongSortedSet
        See Also:
        SortedSet.subSet(Object,Object)
      • clone

        public java.lang.Object clone()
        Returns a deep copy of this tree set.

        This method performs a deep copy of this tree set; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.

        Returns:
        a deep copy of this tree set.