Inheritance diagram for javolution.util.internal.bitset.BitSetServiceImpl:

Collaboration diagram for javolution.util.internal.bitset.BitSetServiceImpl:

Public Member Functions
	BitSetServiceImpl ()

boolean	add (Index index)

void	and (BitSetService that)

void	andNot (BitSetService that)

int	cardinality ()

void	clear ()

void	clear (int bitIndex)

void	clear (int fromIndex, int toIndex)

Equality<? super Index >	comparator ()

boolean	contains (Object index)

void	flip (int bitIndex)

void	flip (int fromIndex, int toIndex)

boolean	get (int bitIndex)

BitSetServiceImpl	get (int fromIndex, int toIndex)

boolean	getAndSet (int bitIndex, boolean value)

boolean	intersects (BitSetService that)

Iterator< Index >	iterator ()

int	length ()

int	nextClearBit (int fromIndex)

int	nextSetBit (int fromIndex)

void	or (BitSetService that)

int	previousClearBit (int fromIndex)

int	previousSetBit (int fromIndex)

boolean	remove (Object index)

void	set (int bitIndex)

void	set (int bitIndex, boolean value)

void	set (int fromIndex, int toIndex)

void	set (int fromIndex, int toIndex, boolean value)

int	size ()

long[]	toLongArray ()

void	xor (BitSetService that)

SetService< E >	threadSafe ()

abstract boolean	add (E element)

boolean	addAll (Collection<? extends E > c)

FastCollection< E >	addAll (E... elements)

FastCollection< E >	addAll (FastCollection<? extends E > that)

CollectionView< E >	clone ()

boolean	containsAll (Collection<?> c)

boolean	equals (Object o)

int	hashCode ()

boolean	isEmpty ()

void	perform (Consumer< CollectionService< E >> action, CollectionService< E > view)

void	perform (Consumer<? extends Collection< E >> action)

void	perform (Consumer< T > action, T part)

boolean	removeAll (Collection<?> c)

boolean	retainAll (Collection<?> c)

CollectionService< E >[]	split (int n)

Object[]	toArray ()

void	update (Consumer< CollectionService< E >> action, CollectionService< E > view)

void	update (Consumer<? extends Collection< E >> action)

void	update (Consumer< T > action, T part)

FastCollection< E >	atomic ()

FastCollection< E >	shared ()

FastCollection< E >	parallel ()

FastCollection< E >	sequential ()

FastCollection< E >	unmodifiable ()

FastCollection< E >	filtered (Predicate<? super E > filter)

FastCollection< E >	sorted ()

FastCollection< E >	sorted (Comparator<? super E > cmp)

FastCollection< E >	reversed ()

FastCollection< E >	distinct ()

void	forEach (final Consumer<? super E > consumer)

boolean	removeIf (final Predicate<? super E > filter)

E	reduce (Reducer< E > reducer)

E	min ()

E	max ()

String	toString ()

SetService< E >	threadSafe ()

Protected Member Functions
SetService< E >	target ()

CollectionService< E >	service ()

Static Protected Member Functions
static< E > CollectionService< E >	serviceOf (FastCollection< E > collection)

Package Functions
public< T > T[]	toArray (T[] a)

public< R > FastCollection< R >	mapped (Function<? super E, ? extends R > function)

public< T extends E > T	any (Class< T > type)

public< T extends Collection< E > > Immutable< T >	toImmutable ()

Private Member Functions
void	setLength (int newLength)

void	trim ()

Private Attributes
long[]	bits

Static Private Attributes
static final long	serialVersionUID = 0x600L

Detailed Description

A table of indices implemented using packed bits (long[]).

Definition at line 24 of file BitSetServiceImpl.java.

Constructor & Destructor Documentation

◆ BitSetServiceImpl()

javolution.util.internal.bitset.BitSetServiceImpl.BitSetServiceImpl ( )

Creates a bit set (all bits are cleared).

Definition at line 32 of file BitSetServiceImpl.java.

                                {
         super(null); // Root.
         bits = new long[0];
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits.

Referenced by javolution.util.internal.bitset.BitSetServiceImpl.get(), javolution.util.internal.bitset.BitSetServiceImpl.or(), and javolution.util.internal.bitset.BitSetServiceImpl.xor().

Here is the caller graph for this function:

Member Function Documentation

◆ add() [1/2]

abstract boolean javolution.util.internal.collection.CollectionView< E >.add ( E element )

abstractinherited

Adds the specified element to this collection

Reimplemented from javolution.util.FastCollection< E >.

Referenced by javolution.util.internal.collection.CollectionView< R >.addAll().

Here is the caller graph for this function:

◆ add() [2/2]

boolean javolution.util.internal.bitset.BitSetServiceImpl.add ( Index index )

Definition at line 38 of file BitSetServiceImpl.java.

                                     {
         return !getAndSet(index.intValue(), true);
     }

References javolution.util.internal.bitset.BitSetServiceImpl.getAndSet(), and javolution.util.Index.intValue().

Here is the call graph for this function:

◆ addAll() [1/3]

boolean javolution.util.internal.collection.CollectionView< E >.addAll ( Collection<? extends E > that )

inherited

Adds all the specified elements to this collection.

Reimplemented from javolution.util.FastCollection< E >.

Reimplemented in javolution.util.internal.collection.SharedCollectionImpl< E >, and javolution.util.internal.collection.AtomicCollectionImpl< E >.

Definition at line 46 of file CollectionView.java.

                                                      {
         boolean changed = false;
         Iterator<? extends E> it = c.iterator();
         while (it.hasNext()) {
             if (add(it.next())) changed = true;
         }
         return changed;
     }

◆ addAll() [2/3]

FastCollection<E> javolution.util.FastCollection< E >.addAll ( E... elements )

inherited

Returns this collection with the specified element added.

Parameters

elements the elements to be added.

Returns: this

Reimplemented in javolution.util.FastTable< E >, javolution.util.FastSortedSet< E >, javolution.util.FastSet< E >, and javolution.util.FastSortedTable< E >.

Definition at line 552 of file FastCollection.java.

                                                    {
         for (E e : elements) {
             add(e);
         }
         return this;
     }

◆ addAll() [3/3]

FastCollection<E> javolution.util.FastCollection< E >.addAll ( FastCollection<? extends E > that )

inherited

Returns this collection with the specified collection's elements added in sequence.

Reimplemented in javolution.util.FastTable< E >, javolution.util.FastSortedSet< E >, javolution.util.FastSet< E >, and javolution.util.FastSortedTable< E >.

Definition at line 564 of file FastCollection.java.

                                                                       {
         addAll((Collection<? extends E>) that);
         return this;
     }

◆ and()

void javolution.util.internal.bitset.BitSetServiceImpl.and ( BitSetService that )

See FastBitSet#and(FastBitSet)

Implements javolution.util.service.BitSetService.

Definition at line 43 of file BitSetServiceImpl.java.

                                         {
         long[] thatBits = that.toLongArray();
         int n = MathLib.min(this.bits.length, thatBits.length);
         for (int i = 0; i < n; i++) {
             this.bits[i] &= thatBits[i];
         }
         for (int i = n; i < bits.length; i++) {
             this.bits[i] = 0L;
         }
         trim();
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, javolution.lang.MathLib.min(), javolution.util.service.BitSetService.toLongArray(), and javolution.util.internal.bitset.BitSetServiceImpl.trim().

Here is the call graph for this function:

◆ andNot()

void javolution.util.internal.bitset.BitSetServiceImpl.andNot ( BitSetService that )

See FastBitSet#andNot(FastBitSet)

Implements javolution.util.service.BitSetService.

Definition at line 56 of file BitSetServiceImpl.java.

                                            {
         long[] thatBits = that.toLongArray();
         int n = MathLib.min(this.bits.length, thatBits.length);
         for (int i = 0; i < n; i++) {
             this.bits[i] &= ~thatBits[i];
         }
         trim();
     }

References javolution.lang.MathLib.min(), javolution.util.service.BitSetService.toLongArray(), and javolution.util.internal.bitset.BitSetServiceImpl.trim().

Here is the call graph for this function:

◆ any()

public<T extends E> T javolution.util.FastCollection< E >.any ( Class< T > type )

packageinherited

Returns any non-null element of the specified type (convenience method).

Parameters

type	the element type searched for.

Returns: reduce(Reducers.any(type))

See also: Reducers::any

Definition at line 515 of file FastCollection.java.

                                               {
         return (T) reduce((Reducer<E>) Reducers.any(type));
     }

References javolution.util.function.Reducers.any().

Here is the call graph for this function:

◆ atomic()

FastCollection<E> javolution.util.FastCollection< E >.atomic ( )

inherited

Returns an atomic view over this collection. All operations that write or access multiple elements in the collection (such as addAll(), retainAll()) are atomic. Iterators on atomic collections are thread-safe (no ConcurrentModificationException possible).

Reimplemented in javolution.util.FastTable< E >, javolution.util.FastSet< E >, javolution.util.FastSortedTable< E >, and javolution.util.FastSortedSet< E >.

Definition at line 187 of file FastCollection.java.

                                       {
         return new AtomicCollectionImpl<E>(service());
     }

◆ cardinality()

int javolution.util.internal.bitset.BitSetServiceImpl.cardinality ( )

See FastBitSet#cardinality()

Implements javolution.util.service.BitSetService.

Definition at line 66 of file BitSetServiceImpl.java.

                              {
         int sum = 0;
         for (int i = 0; i < bits.length; i++) {
             sum += MathLib.bitCount(bits[i]);
         }
         return sum;
     }

References javolution.lang.MathLib.bitCount(), and javolution.util.internal.bitset.BitSetServiceImpl.bits.

Referenced by javolution.util.internal.bitset.BitSetServiceImpl.size().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ clear() [1/3]

void javolution.util.internal.bitset.BitSetServiceImpl.clear ( )

Removes all elements from this collection.

Reimplemented from javolution.util.internal.collection.CollectionView< E >.

Definition at line 75 of file BitSetServiceImpl.java.

                         {
         bits = new long[0];
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits.

Referenced by javolution.util.internal.bitset.BitSetServiceImpl.get(), and javolution.util.internal.bitset.BitSetServiceImpl.set().

Here is the caller graph for this function:

◆ clear() [2/3]

void javolution.util.internal.bitset.BitSetServiceImpl.clear ( int bitIndex )

See FastBitSet#clear(int)

Implements javolution.util.service.BitSetService.

Definition at line 80 of file BitSetServiceImpl.java.

                                     {
         int longIndex = bitIndex >> 6;
         if (longIndex >= bits.length)
             return;
         bits[longIndex] &= ~(1L << bitIndex);
         trim();
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, and javolution.util.internal.bitset.BitSetServiceImpl.trim().

Here is the call graph for this function:

◆ clear() [3/3]

void javolution.util.internal.bitset.BitSetServiceImpl.clear	(	int	fromIndex,
		int	toIndex
	)

See FastBitSet#clear(int, int)

Implements javolution.util.service.BitSetService.

Definition at line 89 of file BitSetServiceImpl.java.

                                                   {
         if ((fromIndex < 0) || (toIndex < fromIndex))
             throw new IndexOutOfBoundsException();
         int i = fromIndex >>> 6;
         if (i >= bits.length)
             return; // Ensures that i < _length
         int j = toIndex >>> 6;
         if (i == j) {
             bits[i] &= ((1L << fromIndex) - 1) | (-1L << toIndex);
             return;
         }
         bits[i] &= (1L << fromIndex) - 1;
         if (j < bits.length) {
             bits[j] &= -1L << toIndex;
         }
         for (int k = i + 1; (k < j) && (k < bits.length); k++) {
             bits[k] = 0;
         }
         trim();
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, and javolution.util.internal.bitset.BitSetServiceImpl.trim().

Here is the call graph for this function:

◆ clone()

CollectionView<E> javolution.util.internal.collection.CollectionView< E >.clone ( )

inherited

Returns a copy of this collection; updates of the copy should not impact the original.

Implements javolution.util.service.CollectionService< E >.

Reimplemented in javolution.util.internal.table.FastTableImpl< E >, javolution.util.internal.collection.SharedCollectionImpl< E >, and javolution.util.internal.collection.AtomicCollectionImpl< E >.

Definition at line 66 of file CollectionView.java.

                                      {
         try {
             CollectionView<E> copy = (CollectionView<E>) super.clone();
             if (target != null) { // Not a root class.
                 copy.target = target.clone();
             }
             return copy;
         } catch (CloneNotSupportedException e) {
             throw new Error("Should not happen since target is cloneable");
         }
     }

Referenced by javolution.util.internal.collection.CollectionView< R >.clone(), and javolution.util.internal.collection.CollectionView< R >.split().

Here is the caller graph for this function:

◆ comparator()

Equality<? super Index> javolution.util.internal.bitset.BitSetServiceImpl.comparator ( )

Returns the comparator uses by this collection for equality and/or ordering if this collection is sorted.

Reimplemented from javolution.util.internal.collection.CollectionView< E >.

Definition at line 111 of file BitSetServiceImpl.java.

                                                 {
         return Equalities.IDENTITY;
     }

References javolution.util.function.Equalities.IDENTITY.

◆ contains()

boolean javolution.util.internal.bitset.BitSetServiceImpl.contains ( Object searched )

Indicates if this collection contains the specified element.

Reimplemented from javolution.util.internal.set.SetView< E >.

Definition at line 116 of file BitSetServiceImpl.java.

                                           {
         return get(((Index)index).intValue());
     }

◆ containsAll()

boolean javolution.util.internal.collection.CollectionView< E >.containsAll ( Collection<?> that )

inherited

Indicates if this collection contains all the specified elements.

Reimplemented from javolution.util.FastCollection< E >.

Reimplemented in javolution.util.internal.collection.SharedCollectionImpl< E >, and javolution.util.internal.collection.AtomicCollectionImpl< E >.

Definition at line 93 of file CollectionView.java.

                                                 {
         for (Object e : c) {
             if (!contains(e)) return false;
         }
         return true;
     }

Referenced by javolution.util.internal.collection.CollectionView< R >.equals().

Here is the caller graph for this function:

◆ distinct()

FastCollection<E> javolution.util.FastCollection< E >.distinct ( )

inherited

Returns a view exposing only distinct elements (it does not iterate twice over the same elements). Adding elements already in the collection through this view has no effect. If this collection is initially empty, using a distinct view to add new elements ensures that this collection has no duplicate.

Definition at line 293 of file FastCollection.java.

                                         {
         return new DistinctCollectionImpl<E>(service());
     }

◆ equals()

boolean javolution.util.internal.collection.CollectionView< E >.equals ( Object obj )

inherited

Compares the specified object with this collection for equality. This method follows the Collection#equals(Object) specification if this collection comparator is Equalities#STANDARD (default). Otherwise, only collections using the same comparator can be considered equals.

Parameters

obj	the object to be compared for equality with this collection

Returns: true if both collections are considered equals; false otherwise.

Reimplemented from javolution.util.FastCollection< E >.

Reimplemented in javolution.util.internal.collection.SharedCollectionImpl< E >, and javolution.util.internal.collection.AtomicCollectionImpl< E >.

Definition at line 102 of file CollectionView.java.

                                     {
         // Follow Collection.equals specification if this comparator is standard.        
         if (this == o) return true;
         // Check comparators consistency.
         if (o instanceof CollectionService) {
             if (!comparator().equals(((CollectionService<E>) o).comparator())) return false; // Different comparators.
         } else {
             if (!comparator().equals(Equalities.STANDARD)) return false;
         }
         // Collection.equals contract.
         if (this instanceof Set) {
             if (!(o instanceof Set)) return false;
             Set<E> set = (Set<E>) o;
             return (size() == set.size()) && containsAll(set);
         } else if (this instanceof List) {
             if (!(o instanceof List)) return false;
             List<E> list = (List<E>) o;
             if (size() != list.size()) return false; // Short-cut.
             Equality<? super E> cmp = comparator();
             Iterator<E> it1 = this.iterator();
             Iterator<E> it2 = list.iterator();
             while (it1.hasNext()) {
                 if (!it2.hasNext()) return false;
                 if (!cmp.areEqual(it1.next(), it2.next())) return false;
             }
             if (it2.hasNext()) return false;
             return true;
         } else {
             return false;
         }
     }

Referenced by javolution.util.internal.collection.CollectionView< R >.equals().

Here is the caller graph for this function:

◆ filtered()

FastCollection<E> javolution.util.FastCollection< E >.filtered ( Predicate<? super E > filter )

inherited

Returns a view exposing only the elements matching the specified filter. Adding elements not matching the specified filter has no effect. If this collection is initially empty, using a filtered view to add new elements ensure that this collection has only elements satisfying the filter predicate.

Reimplemented in javolution.util.FastSet< E >.

Definition at line 250 of file FastCollection.java.

                                                                    {
         return new FilteredCollectionImpl<E>(service(), filter);
     }

◆ flip() [1/2]

void javolution.util.internal.bitset.BitSetServiceImpl.flip ( int bitIndex )

See FastBitSet#flip(int)

Implements javolution.util.service.BitSetService.

Definition at line 121 of file BitSetServiceImpl.java.

                                    {
         int i = bitIndex >> 6;
         setLength(i + 1);
         bits[i] ^= 1L << bitIndex;
         trim();
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, javolution.util.internal.bitset.BitSetServiceImpl.setLength(), and javolution.util.internal.bitset.BitSetServiceImpl.trim().

Here is the call graph for this function:

◆ flip() [2/2]

void javolution.util.internal.bitset.BitSetServiceImpl.flip	(	int	fromIndex,
		int	toIndex
	)

See FastBitSet#flip(int, int)

Implements javolution.util.service.BitSetService.

Definition at line 129 of file BitSetServiceImpl.java.

                                                  {
         if ((fromIndex < 0) || (toIndex < fromIndex))
             throw new IndexOutOfBoundsException();
         int i = fromIndex >>> 6;
         int j = toIndex >>> 6;
         setLength(j + 1);
         if (i == j) {
             bits[i] ^= (-1L << fromIndex) & ((1L << toIndex) - 1);
             return;
         }
         bits[i] ^= -1L << fromIndex;
         bits[j] ^= (1L << toIndex) - 1;
         for (int k = i + 1; k < j; k++) {
             bits[k] ^= -1;
         }
         trim();
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, javolution.util.internal.bitset.BitSetServiceImpl.setLength(), and javolution.util.internal.bitset.BitSetServiceImpl.trim().

Here is the call graph for this function:

◆ forEach()

void javolution.util.FastCollection< E >.forEach ( final Consumer<? super E > consumer )

inherited

Iterates over all this collection elements applying the specified consumer (convenience method). Iterations are performed concurrently if the collection is parallel.

Parameters

consumer the functional consumer applied to the collection elements.

Definition at line 346 of file FastCollection.java.

                                                             {
         perform(new Consumer<Collection<E>>() {
             public void accept(Collection<E> view) {
                 Iterator<E> it = view.iterator();
                 while (it.hasNext()) {
                     consumer.accept(it.next());
                 }
             }
         });
     }

References javolution.util.function.Consumer< T >.accept().

Here is the call graph for this function:

◆ get() [1/2]

boolean javolution.util.internal.bitset.BitSetServiceImpl.get ( int bitIndex )

See FastBitSet#get(int)

Implements javolution.util.service.BitSetService.

Definition at line 148 of file BitSetServiceImpl.java.

                                      {
         int i = bitIndex >> 6;
         return (i >= bits.length) ? false : (bits[i] & (1L << bitIndex)) != 0;
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits.

◆ get() [2/2]

BitSetServiceImpl javolution.util.internal.bitset.BitSetServiceImpl.get	(	int	fromIndex,
		int	toIndex
	)

See FastBitSet#get(int, int)

Implements javolution.util.service.BitSetService.

Definition at line 154 of file BitSetServiceImpl.java.

                                                              {
         if (fromIndex < 0 || fromIndex > toIndex)
             throw new IndexOutOfBoundsException();
         BitSetServiceImpl bitSet = new BitSetServiceImpl();
         int length = MathLib.min(bits.length, (toIndex >>> 6) + 1);
         bitSet.bits = new long[length];
         System.arraycopy(bits, 0, bitSet.bits, 0, length);
         bitSet.clear(0, fromIndex);
         bitSet.clear(toIndex, length << 6);
         return bitSet;
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, javolution.util.internal.bitset.BitSetServiceImpl.BitSetServiceImpl(), javolution.util.internal.bitset.BitSetServiceImpl.clear(), javolution.util.internal.bitset.BitSetServiceImpl.length(), and javolution.lang.MathLib.min().

Here is the call graph for this function:

◆ getAndSet()

boolean javolution.util.internal.bitset.BitSetServiceImpl.getAndSet	(	int	bitIndex,
		boolean	value
	)

Sets the specified bit, returns true if previously set.

Implements javolution.util.service.BitSetService.

Definition at line 168 of file BitSetServiceImpl.java.

                                                           {
         int i = bitIndex >> 6;
         if (i >= bits.length) {
             setLength(i + 1);
         }
         boolean previous = (bits[i] & (1L << bitIndex)) != 0;
         if (value) { 
             bits[i] |= 1L << bitIndex;
         } else {
             bits[i] &= ~(1L << bitIndex);
         }
         trim();
         return previous;
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, javolution.util.internal.bitset.BitSetServiceImpl.setLength(), and javolution.util.internal.bitset.BitSetServiceImpl.trim().

Referenced by javolution.util.internal.bitset.BitSetServiceImpl.add(), and javolution.util.internal.bitset.BitSetServiceImpl.remove().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ hashCode()

int javolution.util.internal.collection.CollectionView< E >.hashCode ( )

inherited

Returns the hash code of this collection. This method follows the Collection#hashCode() specification if this collection comparator is Equalities#STANDARD.

Returns: this collection hash code.

Reimplemented from javolution.util.FastCollection< E >.

Reimplemented in javolution.util.internal.collection.SharedCollectionImpl< E >, and javolution.util.internal.collection.AtomicCollectionImpl< E >.

Definition at line 135 of file CollectionView.java.

                           {
         // Follow Collection.equals specification if this comparator is standard.        
         Equality<? super E> cmp = comparator();
         Iterator<E> it = this.iterator();
         int hash = 0;
         if (this instanceof Set) {
             while (it.hasNext()) {
                 hash += cmp.hashCodeOf(it.next());
             }
         } else if (this instanceof List) {
             while (it.hasNext()) {
                 hash += 31 * hash + cmp.hashCodeOf(it.next());
             }
         } else {
             hash = super.hashCode();
         }
         return hash;
     }

◆ intersects()

boolean javolution.util.internal.bitset.BitSetServiceImpl.intersects ( BitSetService that )

See FastBitSet#intersects(FastBitSet)

Implements javolution.util.service.BitSetService.

Definition at line 184 of file BitSetServiceImpl.java.

                                                   {
         long[] thatBits = that.toLongArray();
         int i = MathLib.min(this.bits.length, thatBits.length);
         while (--i >= 0) {
             if ((bits[i] & thatBits[i]) != 0) return true; 
         }
         return false;
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, javolution.lang.MathLib.min(), and javolution.util.service.BitSetService.toLongArray().

Here is the call graph for this function:

◆ isEmpty()

boolean javolution.util.internal.collection.CollectionView< E >.isEmpty ( )

inherited

Indicates if this collection is empty.

Reimplemented from javolution.util.FastCollection< E >.

Definition at line 155 of file CollectionView.java.

                              {
         return iterator().hasNext();
     }

◆ iterator()

Iterator<Index> javolution.util.internal.bitset.BitSetServiceImpl.iterator ( )

Returns an iterator over this collection elements. For shared/atomic collections the iterator is immune to concurrent modifications. In other words the elements iterated over may or may not reflect the current state of the collection.

Reimplemented from javolution.util.internal.collection.CollectionView< E >.

Definition at line 194 of file BitSetServiceImpl.java.

                                       {
         return new BitSetIteratorImpl(this, 0);
     }

◆ length()

int javolution.util.internal.bitset.BitSetServiceImpl.length ( )

See FastBitSet#length()

Implements javolution.util.service.BitSetService.

Definition at line 199 of file BitSetServiceImpl.java.

                         {
         if (bits.length == 0) return 0;
         return (bits.length << 6) - MathLib.numberOfLeadingZeros(bits[bits.length -1]);
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, and javolution.lang.MathLib.numberOfLeadingZeros().

Referenced by javolution.util.internal.bitset.BitSetServiceImpl.get().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ mapped()

public<R> FastCollection<R> javolution.util.FastCollection< E >.mapped ( Function<? super E, ? extends R > function )

packageinherited

Returns a view exposing elements through the specified mapping function. The returned view does not allow new elements to be added.

Definition at line 258 of file FastCollection.java.

                                                        {
         return new MappedCollectionImpl<E, R>(service(), function);
     }

Referenced by javolution.xml.internal.stream.EntitiesImpl.setEntitiesMapping().

Here is the caller graph for this function:

◆ max()

E javolution.util.FastCollection< E >.max ( )

inherited

Returns the largest element of this collection using this collection comparator (convenience method). Returns

null

if this collection is empty.

Returns: reduce(Reducers.max(comparator()))

See also: Reducers::max

Definition at line 541 of file FastCollection.java.

                    {
         return reduce(Reducers.max(comparator()));
     }

References javolution.util.function.Reducers.max().

Here is the call graph for this function:

◆ min()

E javolution.util.FastCollection< E >.min ( )

inherited

Returns the smallest element of this collection using this collection comparator (convenience method). Returns

null

if this collection is empty.

Returns: reduce(Reducers.min(comparator()))

See also: Reducers::min

Definition at line 528 of file FastCollection.java.

                    {
         return reduce(Reducers.min(comparator()));
     }

References javolution.util.function.Reducers.min().

Here is the call graph for this function:

◆ nextClearBit()

int javolution.util.internal.bitset.BitSetServiceImpl.nextClearBit ( int fromIndex )

See FastBitSet#nextClearBit(int)

Implements javolution.util.service.BitSetService.

Definition at line 205 of file BitSetServiceImpl.java.

                                            {
         int offset = fromIndex >> 6;
         long mask = 1L << fromIndex;
         while (offset < bits.length) {
             long h = bits[offset];
             do {
                 if ((h & mask) == 0) { return fromIndex; }
                 mask <<= 1;
                 fromIndex++;
             } while (mask != 0);
             mask = 1;
             offset++;
         }
         return fromIndex;
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits.

◆ nextSetBit()

int javolution.util.internal.bitset.BitSetServiceImpl.nextSetBit ( int fromIndex )

See FastBitSet#nextSetBit(int)

Implements javolution.util.service.BitSetService.

Definition at line 222 of file BitSetServiceImpl.java.

                                          {
         int offset = fromIndex >> 6;
         long mask = 1L << fromIndex;
         while (offset < bits.length) {
             long h = bits[offset];
             do {
                 if ((h & mask) != 0)
                     return fromIndex;
                 mask <<= 1;
                 fromIndex++;
             } while (mask != 0);
             mask = 1;
             offset++;
         }
         return -1;
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits.

◆ or()

void javolution.util.internal.bitset.BitSetServiceImpl.or ( BitSetService that )

See FastBitSet#or(FastBitSet)

Implements javolution.util.service.BitSetService.

Definition at line 240 of file BitSetServiceImpl.java.

                                        {
         long[] thatBits = (that instanceof BitSetServiceImpl) ? ((BitSetServiceImpl) that).bits
                 : that.toLongArray();
         if (thatBits.length > this.bits.length) {
             setLength(thatBits.length);
         }
         for (int i = thatBits.length; --i >= 0;) {
             bits[i] |= thatBits[i];
         }
         trim();
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, javolution.util.internal.bitset.BitSetServiceImpl.BitSetServiceImpl(), javolution.util.internal.bitset.BitSetServiceImpl.setLength(), javolution.util.service.BitSetService.toLongArray(), and javolution.util.internal.bitset.BitSetServiceImpl.trim().

Here is the call graph for this function:

◆ parallel()

FastCollection<E> javolution.util.FastCollection< E >.parallel ( )

inherited

Returns a parallel collection. Parallel collections affect only closure-based operations, all others operations behaving the same. Parallel actions are performed concurrently using Javolution ConcurrentContext. The number of parallel views is derived from the context concurrency (

number of parallel views = concurrency + 1

). Parallel views do not require this collection to be thread-safe (internal synchronization).

See also: #perform(Consumer); #update(Consumer); #forEach(Consumer); #removeIf(Predicate); #reduce(Reducer)

Definition at line 222 of file FastCollection.java.

                                         {
         return new ParallelCollectionImpl<E>(service());
     }

◆ perform() [1/3]

void javolution.util.internal.collection.CollectionView< E >.perform	(	Consumer< CollectionService< E >>	action,
		CollectionService< E >	view
	)

inherited

Reimplemented in javolution.util.internal.collection.ParallelCollectionImpl< E >, javolution.util.internal.collection.SharedCollectionImpl< E >, and javolution.util.internal.collection.SequentialCollectionImpl< E >.

Definition at line 163 of file CollectionView.java.

                                                                                           {
         if (target == null) {
             action.accept(view);
         } else {
             target.perform(action, view);
         }
     }

◆ perform() [2/3]

void javolution.util.function.Splittable< T >.perform	(	Consumer< T >	action,
		T	part
	)

inherited

Executes a read-only action on the specified part of this object.

Parameters

action	the read-only action.
part	this object or a part of it.

Exceptions

UnsupportedOperationException if the action tries to update the specified part.

◆ perform() [3/3]

void javolution.util.FastCollection< E >.perform ( Consumer<? extends Collection< E >> action )

inherited

Executes the specified read-only action on this collection. That logic may be performed concurrently on sub-collections if this collection is parallel.

Parameters

action the read-only action.

Exceptions

UnsupportedOperationException	if the action tries to update this collection and this collection is thread-safe.
ClassCastException	if the action type is not compatible with this collection (e.g. action on set and this is a list).

See also: #update(Consumer)

Definition at line 315 of file FastCollection.java.

                                                                   {
         service().perform((Consumer<CollectionService<E>>) action, service());
     }

◆ previousClearBit()

int javolution.util.internal.bitset.BitSetServiceImpl.previousClearBit ( int fromIndex )

See FastBitSet#previousClearBit(int)

Implements javolution.util.service.BitSetService.

Definition at line 253 of file BitSetServiceImpl.java.

                                                {
         int offset = fromIndex >> 6;
         long mask = 1L << fromIndex;
         while (offset >= 0) {
             long h = bits[offset];
             do {
                 if ((h & mask) == 0)
                     return fromIndex;
                 mask >>= 1;
                 fromIndex--;
             } while (mask != 0);
             mask = 1L << 63;
             offset--;
         }
         return -1;
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits.

◆ previousSetBit()

int javolution.util.internal.bitset.BitSetServiceImpl.previousSetBit ( int fromIndex )

See FastBitSet#previousSetBit(int)

Implements javolution.util.service.BitSetService.

Definition at line 271 of file BitSetServiceImpl.java.

                                              {
         int offset = fromIndex >> 6;
         long mask = 1L << fromIndex;
         while (offset >= 0) {
             long h = bits[offset];
             do {
                 if ((h & mask) != 0)
                     return fromIndex;
                 mask >>= 1;
                 fromIndex--;
             } while (mask != 0);
             mask = 1L << 63;
             offset--;
         }
         return -1;
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits.

◆ reduce()

E javolution.util.FastCollection< E >.reduce ( Reducer< E > reducer )

inherited

Performs a reduction of the elements of this collection using the specified reducer. This may not involve iterating over all the collection elements, for example the reducers: Reducers#any, Reducers#and and Reducers#or may stop iterating early. Reduction is performed concurrently if this collection is parallel.

Parameters

reducer the collection reducer.

Returns: the reduction result.

Definition at line 396 of file FastCollection.java.

                                         {
         perform(reducer);
         return reducer.get();
     }

◆ remove()

boolean javolution.util.internal.bitset.BitSetServiceImpl.remove ( Object searched )

Removes the specified element from this collection.

Reimplemented from javolution.util.internal.set.SetView< E >.

Definition at line 289 of file BitSetServiceImpl.java.

                                         {
         return getAndSet(((Index)index).intValue(), false);
     }

References javolution.util.internal.bitset.BitSetServiceImpl.getAndSet().

Here is the call graph for this function:

◆ removeAll()

boolean javolution.util.internal.collection.CollectionView< E >.removeAll ( Collection<?> that )

inherited

Removes all the specified element from this collection.

Reimplemented from javolution.util.FastCollection< E >.

Reimplemented in javolution.util.internal.collection.SharedCollectionImpl< E >, and javolution.util.internal.collection.AtomicCollectionImpl< E >.

Definition at line 186 of file CollectionView.java.

                                               {
         boolean changed = false;
         Iterator<? extends E> it = iterator();
         while (it.hasNext()) {
             if (c.contains(it.next())) {
                 it.remove();
                 changed = true;
             }
         }
         return changed;
     }

◆ removeIf()

boolean javolution.util.FastCollection< E >.removeIf ( final Predicate<? super E > filter )

inherited

Removes from this collection all the elements matching the specified functional predicate (convenience method). Removals are performed concurrently if this collection is parallel and atomically if this collection is atomic.

Parameters

filter

a predicate returning

true

for elements to be removed.

Returns: true

if at least one element has been removed;
false

otherwise.

Definition at line 368 of file FastCollection.java.

                                                                {
         final boolean[] removed = new boolean[1];
         update(new Consumer<Collection<E>>() {
             public void accept(Collection<E> view) {
                 Iterator<E> it = view.iterator();
                 while (it.hasNext()) {
                     if (filter.test(it.next())) {
                         it.remove(); // Ok mutable iteration.
                         removed[0] = true;
                     }
                 }
             }
         });
         return removed[0];
     }

◆ retainAll()

boolean javolution.util.internal.collection.CollectionView< E >.retainAll ( Collection<?> that )

inherited

Removes all the elements except those in the specified collection.

Reimplemented from javolution.util.FastCollection< E >.

Reimplemented in javolution.util.internal.collection.SharedCollectionImpl< E >, and javolution.util.internal.collection.AtomicCollectionImpl< E >.

Definition at line 199 of file CollectionView.java.

                                               {
         boolean changed = false;
         Iterator<? extends E> it = iterator();
         while (it.hasNext()) {
             if (!c.contains(it.next())) {
                 it.remove();
                 changed = true;
             }
         }
         return changed;
     }

◆ reversed()

FastCollection<E> javolution.util.FastCollection< E >.reversed ( )

inherited

Returns a view exposing elements in reverse iterative order.

Reimplemented in javolution.util.FastTable< E >.

Definition at line 282 of file FastCollection.java.

                                         {
         return new ReversedCollectionImpl<E>(service());
     }

◆ sequential()

FastCollection<E> javolution.util.FastCollection< E >.sequential ( )

inherited

Returns a sequential view of this collection. Using this view, all closure-based iterations are performed sequentially.

Definition at line 230 of file FastCollection.java.

                                           {
         return new SequentialCollectionImpl<E>(service());
     }

◆ service()

CollectionService<E> javolution.util.internal.collection.CollectionView< E >.service ( )

protectedinherited

Returns the service implementation of this collection (for sub-classes).

Reimplemented from javolution.util.FastCollection< E >.

Definition at line 274 of file CollectionView.java.

                                              {
         return this;
     }

◆ serviceOf()

static <E> CollectionService<E> javolution.util.FastCollection< E >.serviceOf ( FastCollection< E > collection )

staticprotectedinherited

Returns the service implementation of any fast collection (for sub-classes).

Definition at line 647 of file FastCollection.java.

                                           {
         return collection.service();
     }

References javolution.util.FastCollection< E >.service().

Here is the call graph for this function:

◆ set() [1/4]

void javolution.util.internal.bitset.BitSetServiceImpl.set ( int bitIndex )

See FastBitSet#set(int)

Implements javolution.util.service.BitSetService.

Definition at line 294 of file BitSetServiceImpl.java.

                                   {
         int i = bitIndex >> 6;
         if (i >= bits.length) {
             setLength(i + 1);
         }
         bits[i] |= 1L << bitIndex;
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, and javolution.util.internal.bitset.BitSetServiceImpl.setLength().

Here is the call graph for this function:

◆ set() [2/4]

void javolution.util.internal.bitset.BitSetServiceImpl.set	(	int	bitIndex,
		boolean	value
	)

See FastBitSet#set(int, boolean)

Implements javolution.util.service.BitSetService.

Definition at line 303 of file BitSetServiceImpl.java.

                                                  {
         if (value) {
             set(bitIndex);
         } else {
             clear(bitIndex);
         }
     }

References javolution.util.internal.bitset.BitSetServiceImpl.clear().

Here is the call graph for this function:

◆ set() [3/4]

void javolution.util.internal.bitset.BitSetServiceImpl.set	(	int	fromIndex,
		int	toIndex
	)

See FastBitSet#set(int, int)

Implements javolution.util.service.BitSetService.

Definition at line 312 of file BitSetServiceImpl.java.

                                                 {
         int i = fromIndex >>> 6;
         int j = toIndex >>> 6;
         setLength(j + 1);
         if (i == j) {
             bits[i] |= (-1L << fromIndex) & ((1L << toIndex) - 1);
             return;
         }
         bits[i] |= -1L << fromIndex;
         bits[j] |= (1L << toIndex) - 1;
         for (int k = i + 1; k < j; k++) {
             bits[k] = -1;
         }
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, and javolution.util.internal.bitset.BitSetServiceImpl.setLength().

Here is the call graph for this function:

◆ set() [4/4]

void javolution.util.internal.bitset.BitSetServiceImpl.set	(	int	fromIndex,
		int	toIndex,
		boolean	value
	)

See FastBitSet#set(int, int, boolean)

Implements javolution.util.service.BitSetService.

Definition at line 328 of file BitSetServiceImpl.java.

                                                                {
         if (value) {
             set(fromIndex, toIndex);
         } else {
             clear(fromIndex, toIndex);
         }
     }

References javolution.util.internal.bitset.BitSetServiceImpl.clear().

Here is the call graph for this function:

◆ setLength()

void javolution.util.internal.bitset.BitSetServiceImpl.setLength ( int newLength )

private

Sets the new length of the bit set.

Definition at line 362 of file BitSetServiceImpl.java.

                                           {
         long[] tmp = new long[newLength];
         if (newLength >= bits.length) {
             System.arraycopy(bits, 0, tmp, 0, bits.length);
         } else { // Truncates.
             System.arraycopy(bits, 0, tmp, 0, newLength);
         }
         bits = tmp;
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits.

Referenced by javolution.util.internal.bitset.BitSetServiceImpl.flip(), javolution.util.internal.bitset.BitSetServiceImpl.getAndSet(), javolution.util.internal.bitset.BitSetServiceImpl.or(), javolution.util.internal.bitset.BitSetServiceImpl.set(), javolution.util.internal.bitset.BitSetServiceImpl.trim(), and javolution.util.internal.bitset.BitSetServiceImpl.xor().

Here is the caller graph for this function:

◆ shared()

FastCollection<E> javolution.util.FastCollection< E >.shared ( )

inherited

Returns a thread-safe view over this collection. The shared view allows for concurrent read as long as there is no writer. The default implementation is based on readers-writers locks giving priority to writers. Iterators on shared collections are thread-safe (no ConcurrentModificationException possible).

Reimplemented in javolution.util.FastTable< E >, javolution.util.FastSet< E >, javolution.util.FastSortedTable< E >, and javolution.util.FastSortedSet< E >.

Definition at line 201 of file FastCollection.java.

                                       {
         return new SharedCollectionImpl<E>(service());
     }

◆ size()

int javolution.util.internal.bitset.BitSetServiceImpl.size ( )

Returns the size of this collection.

Reimplemented from javolution.util.internal.set.SetView< E >.

Definition at line 337 of file BitSetServiceImpl.java.

                       {
         return cardinality();
     }

References javolution.util.internal.bitset.BitSetServiceImpl.cardinality().

Here is the call graph for this function:

◆ sorted() [1/2]

FastCollection<E> javolution.util.FastCollection< E >.sorted ( )

inherited

Returns a view exposing elements sorted according to the collection order.

Definition at line 267 of file FastCollection.java.

                                       {
         return new SortedCollectionImpl<E>(service(), comparator());
     }

Referenced by javolution.util.internal.collection.SortedCollectionImpl< E >.IteratorImpl.IteratorImpl().

Here is the caller graph for this function:

◆ sorted() [2/2]

FastCollection<E> javolution.util.FastCollection< E >.sorted ( Comparator<? super E > cmp )

inherited

Returns a view exposing elements sorted according to the specified comparator.

Definition at line 275 of file FastCollection.java.

                                                                {
         return new SortedCollectionImpl<E>(service(), cmp);
     }

◆ split()

CollectionService<E> [] javolution.util.internal.collection.CollectionView< E >.split ( int n )

inherited

Returns

n

distinct parts of this object. This method may return an array of size less than

n

(e.g. an array of size one if this object cannot split).

Parameters

n	the number of parts.

Returns: the distinct parts (or views) for this object.

Exceptions

IllegalArgumentException

if

n <= 1

Implements javolution.util.function.Splittable< T >.

Reimplemented in javolution.util.internal.table.SharedTableImpl< E >, javolution.util.internal.table.TableView< E >, javolution.util.internal.collection.SharedCollectionImpl< E >, javolution.util.internal.table.AtomicTableImpl< E >, javolution.util.internal.collection.AtomicCollectionImpl< E >, and javolution.util.internal.map.MapView< K, V >.EntrySet.

Definition at line 224 of file CollectionView.java.

                                                {
         if (target == null) return new CollectionService[] { this }; // No split.
         CollectionService<E>[] subTargets = target.split(n);
         CollectionService<E>[] result = new CollectionService[subTargets.length];
         for (int i = 0; i < subTargets.length; i++) {
             CollectionView<E> copy = this.clone();
             copy.target = subTargets[i];
             result[i] = copy;
         }
         return result;
     }

◆ target()

SetService<E> javolution.util.internal.set.SetView< E >.target ( )

protectedinherited

Returns the actual target

Reimplemented from javolution.util.internal.collection.CollectionView< E >.

Reimplemented in javolution.util.internal.set.sorted.SortedSetView< E >.

Definition at line 45 of file SetView.java.

                                      {
         return (SetService<E>) super.target();
     }

Referenced by javolution.util.internal.set.SetView< Index >.SetView().

Here is the caller graph for this function:

◆ threadSafe() [1/2]

SetService<E> javolution.util.service.SetService< E >.threadSafe

inherited

Returns a thread-safe version of this service (used during parallel updates).

◆ threadSafe() [2/2]

SetService<E> javolution.util.internal.set.SetView< E >.threadSafe ( )

inherited

Returns a thread-safe version of this service (used during parallel updates).

Reimplemented from javolution.util.internal.collection.CollectionView< E >.

Reimplemented in javolution.util.internal.set.sorted.SortedSetView< E >.

Definition at line 39 of file SetView.java.

                                       {
         return new SharedSetImpl<E>(this);
     }

◆ toArray() [1/2]

Object [] javolution.util.internal.collection.CollectionView< E >.toArray ( )

inherited

Returns an array holding this collection elements.

Reimplemented from javolution.util.FastCollection< E >.

Reimplemented in javolution.util.internal.collection.SharedCollectionImpl< E >, and javolution.util.internal.collection.AtomicCollectionImpl< E >.

Definition at line 243 of file CollectionView.java.

                               {
         return toArray(new Object[size()]);
     }

Referenced by javolution.util.internal.collection.CollectionView< R >.toArray().

Here is the caller graph for this function:

◆ toArray() [2/2]

public<T> T [] javolution.util.internal.collection.CollectionView< E >.toArray ( T[] array )

packageinherited

Returns the specified array holding this collection elements if enough capacity.

Reimplemented from javolution.util.FastCollection< E >.

Reimplemented in javolution.util.internal.collection.SharedCollectionImpl< E >, and javolution.util.internal.collection.AtomicCollectionImpl< E >.

Definition at line 249 of file CollectionView.java.

                                   {
         final int size = size();
         final T[] result = (size <= a.length) ? a
                 : (T[]) java.lang.reflect.Array.newInstance(a.getClass()
                         .getComponentType(), size);
         int i = 0;
         Iterator<E> it = iterator();
         while (it.hasNext()) {
             result[i++] = (T) it.next();
         }
         if (result.length > size) {
             result[size] = null; // As per Collection contract.
         }
         return result;
     }

◆ toImmutable()

public<T extends Collection<E> > Immutable<T> javolution.util.FastCollection< E >.toImmutable ( )

packageinherited

Returns an immutable reference over this collection. The immutable value is an unmodifiable view of this collection. The caller must guarantees that the original collection is never going to be updated (e.g. there is no reference left of the original collection).

Definition at line 585 of file FastCollection.java.

                                                                 {
         return new Immutable<T>() {
             @SuppressWarnings("unchecked")
             final T value = (T) unmodifiable();
  
             @Override
             public T value() {
                 return value;
             }
  
         };
     }

◆ toLongArray()

long [] javolution.util.internal.bitset.BitSetServiceImpl.toLongArray ( )

Returns the minimal length long[] representation of this bitset.

Implements javolution.util.service.BitSetService.

Definition at line 342 of file BitSetServiceImpl.java.

                                 {
         return bits;
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits.

◆ toString()

String javolution.util.FastCollection< E >.toString ( )

inherited

Returns the string representation of this collection using its default format.

Definition at line 634 of file FastCollection.java.

                              {
         return TextContext.getFormat(FastCollection.class).format(this);
     }

References javolution.text.TextContext.getFormat().

Here is the call graph for this function:

◆ trim()

void javolution.util.internal.bitset.BitSetServiceImpl.trim ( )

private

Removes the tails words if cleared.

Definition at line 375 of file BitSetServiceImpl.java.

                         {
         int n = bits.length;
         while ((--n >= 0) && (bits[n] == 0L)) {}
         if (++n < bits.length) setLength(n);   
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, and javolution.util.internal.bitset.BitSetServiceImpl.setLength().

Referenced by javolution.util.internal.bitset.BitSetServiceImpl.and(), javolution.util.internal.bitset.BitSetServiceImpl.andNot(), javolution.util.internal.bitset.BitSetServiceImpl.clear(), javolution.util.internal.bitset.BitSetServiceImpl.flip(), javolution.util.internal.bitset.BitSetServiceImpl.getAndSet(), javolution.util.internal.bitset.BitSetServiceImpl.or(), and javolution.util.internal.bitset.BitSetServiceImpl.xor().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ unmodifiable()

FastCollection<E> javolution.util.FastCollection< E >.unmodifiable ( )

inherited

Returns an unmodifiable view over this collection. Any attempt to modify the collection through this view will result into a java.lang.UnsupportedOperationException being raised.

Reimplemented in javolution.util.FastTable< E >, javolution.util.FastSet< E >, javolution.util.FastSortedTable< E >, and javolution.util.FastSortedSet< E >.

Definition at line 239 of file FastCollection.java.

                                             {
         return new UnmodifiableCollectionImpl<E>(service());
     }

◆ update() [1/3]

void javolution.util.internal.collection.CollectionView< E >.update	(	Consumer< CollectionService< E >>	action,
		CollectionService< E >	view
	)

inherited

Reimplemented in javolution.util.internal.collection.ParallelCollectionImpl< E >, javolution.util.internal.collection.AtomicCollectionImpl< E >, and javolution.util.internal.collection.SequentialCollectionImpl< E >.

Definition at line 266 of file CollectionView.java.

                                                                                          {
         if (target == null) {
             action.accept(view);
         } else {
             target.perform(action, view);
         }
     }

◆ update() [2/3]

void javolution.util.function.Splittable< T >.update	(	Consumer< T >	action,
		T	part
	)

inherited

Executes an update action on the specified part of this object. Any change to the part is reflected in the whole (this object).

Parameters

action	the action authorized to update this object part.
part	this object or a part of it.

◆ update() [3/3]

void javolution.util.FastCollection< E >.update ( Consumer<? extends Collection< E >> action )

inherited

Executes the specified update action on this collection. That logic may be performed concurrently on sub-collections if this collection is parallel. For atomic collections the update is atomic (either concurrent readers see the full result of the action or nothing).

Parameters

action the update action.

Exceptions

ClassCastException if the action type is not compatible with this collection (e.g. action on set and this is a list).

See also: #perform(Consumer)

Definition at line 334 of file FastCollection.java.

                                                                  {
         service().update((Consumer<CollectionService<E>>) action, service());
     }

Referenced by javolution.util.FastTable< javolution.xml.internal.stream.XMLStreamReaderImpl >.sort().

Here is the caller graph for this function:

◆ xor()

void javolution.util.internal.bitset.BitSetServiceImpl.xor ( BitSetService that )

See FastBitSet#xor(FastBitSet)

Implements javolution.util.service.BitSetService.

Definition at line 347 of file BitSetServiceImpl.java.

                                         {
         long[] thatBits = (that instanceof BitSetServiceImpl) ? ((BitSetServiceImpl) that).bits
                 : that.toLongArray();
         if (thatBits.length > this.bits.length) {
             setLength(thatBits.length);
         }
         for (int i = thatBits.length; --i >= 0;) {
             bits[i] ^= thatBits[i];
         }
         trim();
     }

References javolution.util.internal.bitset.BitSetServiceImpl.bits, javolution.util.internal.bitset.BitSetServiceImpl.BitSetServiceImpl(), javolution.util.internal.bitset.BitSetServiceImpl.setLength(), javolution.util.service.BitSetService.toLongArray(), and javolution.util.internal.bitset.BitSetServiceImpl.trim().

Here is the call graph for this function:

Member Data Documentation

◆ bits

long [] javolution.util.internal.bitset.BitSetServiceImpl.bits

private

Holds the bits (64 bits per long), trimmed.

Definition at line 29 of file BitSetServiceImpl.java.

◆ serialVersionUID

final long javolution.util.internal.bitset.BitSetServiceImpl.serialVersionUID = 0x600L

staticprivate

Definition at line 26 of file BitSetServiceImpl.java.

The documentation for this class was generated from the following file:

BitSetServiceImpl.java

Public Member Functions

Protected Member Functions

Static Protected Member Functions

Package Functions

Private Member Functions

Private Attributes

Static Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ BitSetServiceImpl()

Member Function Documentation

◆ add() [1/2]

◆ add() [2/2]

◆ addAll() [1/3]

◆ addAll() [2/3]

◆ addAll() [3/3]

◆ and()

◆ andNot()

◆ any()

◆ atomic()

◆ cardinality()

◆ clear() [1/3]

◆ clear() [2/3]

◆ clear() [3/3]

◆ clone()

◆ comparator()

◆ contains()

◆ containsAll()

◆ distinct()

◆ equals()

◆ filtered()

◆ flip() [1/2]

◆ flip() [2/2]

◆ forEach()

◆ get() [1/2]

◆ get() [2/2]

◆ getAndSet()

◆ hashCode()

◆ intersects()

◆ isEmpty()

◆ iterator()

◆ length()

◆ mapped()

◆ max()

◆ min()

◆ nextClearBit()

◆ nextSetBit()

◆ or()

◆ parallel()

◆ perform() [1/3]

◆ perform() [2/3]

◆ perform() [3/3]

◆ previousClearBit()

◆ previousSetBit()

◆ reduce()

◆ remove()

◆ removeAll()

◆ removeIf()

◆ retainAll()

◆ reversed()

◆ sequential()

◆ service()

◆ serviceOf()

◆ set() [1/4]

◆ set() [2/4]

◆ set() [3/4]

◆ set() [4/4]

◆ setLength()

◆ shared()

◆ size()

◆ sorted() [1/2]

◆ sorted() [2/2]

◆ split()

◆ target()

◆ threadSafe() [1/2]

◆ threadSafe() [2/2]

◆ toArray() [1/2]

◆ toArray() [2/2]

◆ toImmutable()

◆ toLongArray()