eu.bandm.tools.ops

Class RtArraySet2<D>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractSet<D>

eu.bandm.tools.ops.RtArraySet2<D>

All Implemented Interfaces:

Iterable<D>, Collection<D>, Set<D>

public class RtArraySet2<D>
extends AbstractSet<D>

"Lock-Free" variant of a "Real-Time Array Set".
DISCUSS: not yet clear whether the old dynamic form for "size()" is more efficient, -- it needs one "atomic" variable less. (!?)
ATTENTION: This class restricts the contract of "Iterator": Once "hasNext()==false" has returned, all following behaviour is unspecified and further usage forbidden. (The Iterator object will be recycled.)

Constructor Summary

Constructors

Constructor and Description
RtArraySet2(int capacity)
RtArraySet2(int capacity, int iterators)

Method Summary

Modifier and Type	Method and Description
boolean	add(D obj)
D	any() Get one arbitrarily chosen element and remove it.
int	capacity()
void	clear()
void	forEach(Consumer<? super D> acc) Apply code to all elements.
Iterator<D>	iterator()
boolean	remove(Object obj)
int	size() ATTENTION however implemented, there is always a race condition between the result of "size()" and the following number of contained elements, unless ADDITIONALLY enclosed in some "critical section", or sim.

Methods inherited from class java.util.AbstractSet

equals, hashCode, removeAll

Methods inherited from class java.util.AbstractCollection

addAll, contains, containsAll, isEmpty, retainAll, toArray, toArray, toString

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Set

addAll, contains, containsAll, isEmpty, retainAll, spliterator, toArray, toArray

Methods inherited from interface java.util.Collection

parallelStream, removeIf, stream

Constructor Detail

RtArraySet2

public RtArraySet2(int capacity)

RtArraySet2

public RtArraySet2(int capacity,
                   int iterators)

Method Detail

add

public boolean add(D obj)

Specified by:

add in interface Collection<D>

Specified by:

add in interface Set<D>

Overrides:

add in class AbstractCollection<D>

capacity

public int capacity()

size

public int size()

ATTENTION however implemented, there is always a race condition between the result of "size()" and the following number of contained elements, unless ADDITIONALLY enclosed in some "critical section", or sim.

Specified by:

size in interface Collection<D>

Specified by:

size in interface Set<D>

Specified by:

size in class AbstractCollection<D>

clear

public void clear()

Specified by:

clear in interface Collection<D>

Specified by:

clear in interface Set<D>

Overrides:

clear in class AbstractCollection<D>

iterator

public Iterator<D> iterator()

Specified by:

iterator in interface Iterable<D>

Specified by:

iterator in interface Collection<D>

Specified by:

iterator in interface Set<D>

Specified by:

iterator in class AbstractCollection<D>

remove

public boolean remove(Object obj)

Specified by:

remove in interface Collection<D>

Specified by:

remove in interface Set<D>

Overrides:

remove in class AbstractCollection<D>

any

@Opt
public D any()

Get one arbitrarily chosen element and remove it.
Additional method not in "Set" interface.

forEach

public void forEach(Consumer<? super D> acc)

Apply code to all elements.
Additional method not in "Set" interface.