ViewSelection

String rw backgroundColor

The background color of the receiver in hex format (e.g. blue would be "#0000FF").


boolean ro empty

Returns true if this list contains no elements.
Specified by:
isEmpty in interface  Collection<E>
Returns:
true if this list contains no elements



boolean rw fontBold

True if font is bold.


String rw fontFace

The font family name.


boolean rw fontItalic

True if font is italic.


float rw fontSize

The point size of the font.


boolean rw fontStrikethrough

True if font is strikethrough.


boolean rw fontUnderline

True if font is underlined.


String rw foregroundColor

The foreground color of the receiver in hex format (e.g. blue would be "#0000FF").


boolean contains(Object o)

Returns true if this list contains the specified element. More formally, returns true if and only if this list contains at least one element e such that (o==null ? e==null : o.equals(e)).
Specified by:
contains in interface  Collection<E>
Parameters:
o - element whose presence in this list is to be tested
Returns:
true if this list contains the specified element
Throws:
ClassCastException - if the type of the specified element is incompatible with this list (optional)
NullPointerException - if the specified element is null and this list does not permit null elements (optional)



boolean containsAll(Collection<Object> c)

Returns true if this list contains all of the elements of the specified collection.
Specified by:
containsAll in interface  Collection<E>
Parameters:
c - collection to be checked for containment in this list
Returns:
true if this list contains all of the elements of the specified collection
Throws:
ClassCastException - if the types of one or more elements in the specified collection are incompatible with this list (optional)
NullPointerException - if the specified collection contains one or more null elements and this list does not permit null elements (optional), or if the specified collection is null
See Also:
contains(Object)



void each(Closure block)

Executes the code in block on each View in this list.


Parameters:
block 


void forEach(Consumer<Object> action)

Performs the given action for each element of the Iterable until all elements have been processed or the action throws an exception. Unless otherwise specified by the implementing class, actions are performed in the order of iteration (if an iteration order is specified). Exceptions thrown by the action are relayed to the caller.
Implementation Requirements:

The default implementation behaves as if:


     for (T t : this)
         action.accept(t);
 
Parameters:
action - The action to be performed for each element
Throws:
NullPointerException - if the specified action is null
Since:
1.8



View get(int index)

Returns the element at the specified position in this list.
Parameters:
index - index of the element to return
Returns:
the element at the specified position in this list
Throws:
IndexOutOfBoundsException - if the index is out of range ( index < 0 || index >= size())



int indexOf(Object o)

Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element. More formally, returns the lowest index i such that (o==null ? get(i)==null : o.equals(get(i))), or -1 if there is no such index.
Parameters:
o - element to search for
Returns:
the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element
Throws:
ClassCastException - if the type of the specified element is incompatible with this list (optional)
NullPointerException - if the specified element is null and this list does not permit null elements (optional)



Iterator<View> iterator()

Returns an iterator over the elements in this list in proper sequence.
Specified by:
iterator in interface  Collection<E>
Specified by:
iterator in interface  Iterable<E>
Returns:
an iterator over the elements in this list in proper sequence



int lastIndexOf(Object o)

Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element. More formally, returns the highest index i such that (o==null ? get(i)==null : o.equals(get(i))), or -1 if there is no such index.
Parameters:
o - element to search for
Returns:
the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element
Throws:
ClassCastException - if the type of the specified element is incompatible with this list (optional)
NullPointerException - if the specified element is null and this list does not permit null elements (optional)



ListIterator<View> listIterator(int index next)

Returns a list iterator over the elements in this list (in proper sequence), starting at the specified position in the list. The specified index indicates the first element that would be returned by an initial call to next. An initial call to previous would return the element with the specified index minus one.
Parameters:
index - index of the first element to be returned from the list iterator (by a call to next)
Returns:
a list iterator over the elements in this list (in proper sequence), starting at the specified position in the list
Throws:
IndexOutOfBoundsException - if the index is out of range ( index < 0 || index > size())



ListIterator<View> listIterator()

Returns a list iterator over the elements in this list (in proper sequence).
Returns:
a list iterator over the elements in this list (in proper sequence)



Stream<View> parallelStream()

Returns a possibly parallel Stream with this collection as its source. It is allowable for this method to return a sequential stream.

This method should be overridden when the spliterator() method cannot return a spliterator that is IMMUTABLE, CONCURRENT, or late-binding. (See spliterator() for details.)

Implementation Requirements:
The default implementation creates a parallel Stream from the collection's Spliterator.
Returns:
a possibly parallel Stream over the elements in this collection
Since:
1.8



boolean removeIf(Predicate<Object> filter true)

Removes all of the elements of this collection that satisfy the given predicate. Errors or runtime exceptions thrown during iteration or by the predicate are relayed to the caller.
Implementation Requirements:
The default implementation traverses all elements of the collection using its iterator(). Each matching element is removed using Iterator.remove(). If the collection's iterator does not support removal then an UnsupportedOperationException will be thrown on the first matching element.
Parameters:
filter - a predicate which returns true for elements to be removed
Returns:
true if any elements were removed
Throws:
NullPointerException - if the specified filter is null
UnsupportedOperationException - if elements cannot be removed from this collection. Implementations may throw this exception if a matching element cannot be removed or if, in general, removal is not supported.
Since:
1.8



void replaceAll(UnaryOperator<View> operator)

Replaces each element of this list with the result of applying the operator to that element. Errors or runtime exceptions thrown by the operator are relayed to the caller.
Implementation Requirements:
The default implementation is equivalent to, for this list:

     final ListIterator<E> li = list.listIterator();
     while (li.hasNext()) {
         li.set(operator.apply(li.next()));
     }
 
If the list's list-iterator does not support the set operation then an UnsupportedOperationException will be thrown when replacing the first element.
Parameters:
operator - the operator to apply to each element
Throws:
UnsupportedOperationException - if this list is unmodifiable. Implementations may throw this exception if an element cannot be replaced or if, in general, modification is not supported
NullPointerException - if the specified operator is null or if the operator result is a null value and this list does not permit null elements (optional)
Since:
1.8



int size()

Returns the number of elements in this list. If this list contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.
Specified by:
size in interface  Collection<E>
Returns:
the number of elements in this list



void sort(Comparator<Object> c Comparator null)

Sorts this list according to the order induced by the specified Comparator.

All elements in this list must be mutually comparable using the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the list).

If the specified comparator is null then all elements in this list must implement the Comparable interface and the elements' natural ordering should be used.

This list must be modifiable, but need not be resizable.

Implementation Requirements:
The default implementation obtains an array containing all elements in this list, sorts the array, and iterates over this list resetting each element from the corresponding position in the array. (This avoids the n 2 log(n) performance that would result from attempting to sort a linked list in place.)
Implementation Note:
This implementation is a stable, adaptive, iterative mergesort that requires far fewer than n lg(n) comparisons when the input array is partially sorted, while offering the performance of a traditional mergesort when the input array is randomly ordered. If the input array is nearly sorted, the implementation requires approximately n comparisons. Temporary storage requirements vary from a small constant for nearly sorted input arrays to n/2 object references for randomly ordered input arrays.

The implementation takes equal advantage of ascending and descending order in its input array, and can take advantage of ascending and descending order in different parts of the same input array. It is well-suited to merging two or more sorted arrays: simply concatenate the arrays and sort the resulting array.

The implementation was adapted from Tim Peters's list sort for Python ( TimSort). It uses techniques from Peter McIlroy's "Optimistic Sorting and Information Theoretic Complexity", in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 467-474, January 1993.

Parameters:
c - the Comparator used to compare list elements. A null value indicates that the elements' natural ordering should be used
Throws:
ClassCastException - if the list contains elements that are not mutually comparable using the specified comparator
UnsupportedOperationException - if the list's list-iterator does not support the set operation
IllegalArgumentException - (optional) if the comparator is found to violate the Comparator contract
Since:
1.8



Spliterator<View> spliterator()

Creates a Spliterator over the elements in this list.

The Spliterator reports Spliterator.SIZED and Spliterator.ORDERED. Implementations should document the reporting of additional characteristic values.

Specified by:
spliterator in interface  Collection<E>
Specified by:
spliterator in interface  Iterable<E>
Implementation Requirements:
The default implementation creates a late-binding spliterator from the list's Iterator. The spliterator inherits the fail-fast properties of the list's iterator.
Implementation Note:
The created Spliterator additionally reports Spliterator.SUBSIZED.
Returns:
a Spliterator over the elements in this list
Since:
1.8



Stream<View> stream()

Returns a sequential Stream with this collection as its source.

This method should be overridden when the spliterator() method cannot return a spliterator that is IMMUTABLE, CONCURRENT, or late-binding. (See spliterator() for details.)

Implementation Requirements:
The default implementation creates a sequential Stream from the collection's Spliterator.
Returns:
a sequential Stream over the elements in this collection
Since:
1.8



List<View> subList(int fromIndex, int toIndex)

Returns a view of the portion of this list between the specified fromIndex, inclusive, and toIndex, exclusive. (If fromIndex and toIndex are equal, the returned list is empty.) The returned list is backed by this list, so non-structural changes in the returned list are reflected in this list, and vice-versa. The returned list supports all of the optional list operations supported by this list.

This method eliminates the need for explicit range operations (of the sort that commonly exist for arrays). Any operation that expects a list can be used as a range operation by passing a subList view instead of a whole list. For example, the following idiom removes a range of elements from a list:


      list.subList(from, to).clear();
 
Similar idioms may be constructed for indexOf and lastIndexOf, and all of the algorithms in the Collections class can be applied to a subList.

The semantics of the list returned by this method become undefined if the backing list (i.e., this list) is structurally modified in any way other than via the returned list. (Structural modifications are those that change the size of this list, or otherwise perturb it in such a fashion that iterations in progress may yield incorrect results.)

Parameters:
fromIndex - low endpoint (inclusive) of the subList
toIndex - high endpoint (exclusive) of the subList
Returns:
a view of the specified range within this list
Throws:
IndexOutOfBoundsException - for an illegal endpoint index value ( fromIndex < 0 || toIndex > size || fromIndex > toIndex)



Object[] toArray()

Returns an array containing all of the elements in this list in proper sequence (from first to last element).

The returned array will be "safe" in that no references to it are maintained by this list. (In other words, this method must allocate a new array even if this list is backed by an array). The caller is thus free to modify the returned array.

This method acts as bridge between array-based and collection-based APIs.

Specified by:
toArray in interface  Collection<E>
Returns:
an array containing all of the elements in this list in proper sequence
See Also:
Arrays.asList(Object[])



Object[] toArray(Object[] arg0)


Parameters:
arg0