Modifier and Type	Class and Description
private class	ExclusiveRange.RangeIterator

Modifier and Type	Field and Description
private static final ListIterator<Integer>	EMPTY_LIST_ITERATOR
private final int	first
private final int	last
private final int	step

Access	Constructor and Description
public	ExclusiveRange(int the start value start, int the end value end, boolean if true, the range goes from start up to end (exclusive) if false, the range goes from end down to start (exclusive) increment) Constructs a new ExclusiveRange object.

Modifier and Type	Method and Description
public boolean	Returns: whether this sequence contains the given number or not. contains(int the number to be checked for containment. number) Checks whether this contains the given number, i.e. whether the iterator will yield the number.
public boolean	Returns: true if this range is empty. isEmpty() Returns whether this is range is empty.
public ListIterator<Integer>	Returns: a read-only `ListIterator` for this. iterator() Implements java.lang.Iterable.iterator. Returns an iterator over elements of type `T`.
public int	Returns: the number of elements in this ExclusiveRange. size() Returns the number of elements in this ExclusiveRange.

EMPTY_LIST_ITERATOR	back to summary
private static final ListIterator<Integer> EMPTY_LIST_ITERATOR

first	back to summary
private final int first

last	back to summary
private final int last

step	back to summary
private final int step

ExclusiveRange	back to summary
public ExclusiveRange(int start, int end, boolean increment) Constructs a new ExclusiveRange object. Parameters start:int the start value end:int the end value increment:boolean if true, the range goes from start up to end (exclusive) if false, the range goes from end down to start (exclusive) Annotations @Pure

contains	back to summary
public boolean contains(int number) Checks whether this contains the given number, i.e. whether the iterator will yield the number. This is different from interval containment: `0..2.by(2)` will not contain 1. Parameters number:int the number to be checked for containment. Returns:boolean whether this sequence contains the given number or not. Annotations @Pure

isEmpty	back to summary
public boolean isEmpty() Returns whether this is range is empty. Returns:boolean true if this range is empty. Annotations @Pure

iterator	back to summary
public ListIterator<Integer> iterator() Implements java.lang.Iterable.iterator. Doc from java.lang.Iterable.iterator. Returns an iterator over elements of type `T`. Returns:ListIterator<Integer> a read-only `ListIterator` for this. Annotations @Override @Pure

size	back to summary
public int size() Returns the number of elements in this ExclusiveRange. Returns:int the number of elements in this ExclusiveRange. Annotations @Pure

org.eclipse.xtext.xbase.lib back to summary

private Class ExclusiveRange.RangeIterator

Class Inheritance

extends Object
implements ListIterator<Integer>

java.lang.Object
org.eclipse.xtext.xbase.lib.ExclusiveRange.RangeIterator

All Implemented Interfaces

java.util.ListIterator, java.util.Iterator

Field Summary

Modifier and Type	Field and Description
private int	next
private int	nextIndex

Constructor Summary

Access	Constructor and Description
private	RangeIterator()

Method Summary

Modifier and Type	Method and Description
public void	add(Integer e) Implements java.util.ListIterator.add. Inserts the specified element into the list (optional operation).
public boolean	hasNext() Implements java.util.ListIterator.hasNext. Returns `true` if this list iterator has more elements when traversing the list in the forward direction.
public boolean	hasPrevious() Implements java.util.ListIterator.hasPrevious. Returns `true` if this list iterator has more elements when traversing the list in the reverse direction.
public Integer	next() Implements java.util.ListIterator.next. Returns the next element in the list and advances the cursor position.
public int	nextIndex() Implements java.util.ListIterator.nextIndex. Returns the index of the element that would be returned by a subsequent call to `next`.
public Integer	previous() Implements java.util.ListIterator.previous. Returns the previous element in the list and moves the cursor position backwards.
public int	previousIndex() Implements java.util.ListIterator.previousIndex. Returns the index of the element that would be returned by a subsequent call to `previous`.
public void	remove() Implements java.util.ListIterator.remove. Removes from the list the last element that was returned by `next` or `previous` (optional operation).
public void	set(Integer e) Implements java.util.ListIterator.set. Replaces the last element returned by `next` or `previous` with the specified element (optional operation).

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

next	back to summary
private int next

nextIndex	back to summary
private int nextIndex

Constructor Detail

RangeIterator	back to summary
private RangeIterator()

Method Detail

add back to summary

add	back to summary
public void add(Integer e) Implements java.util.ListIterator.add. Doc from java.util.ListIterator.add. Inserts the specified element into the list (optional operation). The element is inserted immediately before the element that would be returned by `next`, if any, and after the element that would be returned by `previous`, if any. (If the list contains no elements, the new element becomes the sole element on the list.) The new element is inserted before the implicit cursor: a subsequent call to `next` would be unaffected, and a subsequent call to `previous` would return the new element. (This call increases by one the value that would be returned by a call to `nextIndex` or `previousIndex`.) Annotations @Override

public void add(Integer e)

Implements java.util.ListIterator.add.

Doc from java.util.ListIterator.add.

Inserts the specified element into the list (optional operation). The element is inserted immediately before the element that would be returned by next, if any, and after the element that would be returned by previous, if any. (If the list contains no elements, the new element becomes the sole element on the list.) The new element is inserted before the implicit cursor: a subsequent call to next would be unaffected, and a subsequent call to previous would return the new element. (This call increases by one the value that would be returned by a call to nextIndex or previousIndex.)

Annotations

@Override

hasNext back to summary

hasNext	back to summary
public boolean hasNext() Implements java.util.ListIterator.hasNext. Doc from java.util.ListIterator.hasNext. Returns `true` if this list iterator has more elements when traversing the list in the forward direction. (In other words, returns `true` if `next` would return an element rather than throwing an exception.) Annotations @Override

public boolean hasNext()

Implements java.util.ListIterator.hasNext.

Doc from java.util.ListIterator.hasNext.

Returns true if this list iterator has more elements when traversing the list in the forward direction. (In other words, returns true if next would return an element rather than throwing an exception.)

Annotations

@Override

hasPrevious back to summary

hasPrevious	back to summary
public boolean hasPrevious() Implements java.util.ListIterator.hasPrevious. Doc from java.util.ListIterator.hasPrevious. Returns `true` if this list iterator has more elements when traversing the list in the reverse direction. (In other words, returns `true` if `previous` would return an element rather than throwing an exception.) Annotations @Override

public boolean hasPrevious()

Implements java.util.ListIterator.hasPrevious.

Doc from java.util.ListIterator.hasPrevious.

Returns true if this list iterator has more elements when traversing the list in the reverse direction. (In other words, returns true if previous would return an element rather than throwing an exception.)

Annotations

@Override

next back to summary

next	back to summary
public Integer next() Implements java.util.ListIterator.next. Doc from java.util.ListIterator.next. Returns the next element in the list and advances the cursor position. This method may be called repeatedly to iterate through the list, or intermixed with calls to `previous` to go back and forth. (Note that alternating calls to `next` and `previous` will return the same element repeatedly.) Annotations @Override

public Integer next()

Implements java.util.ListIterator.next.

Doc from java.util.ListIterator.next.

Returns the next element in the list and advances the cursor position. This method may be called repeatedly to iterate through the list, or intermixed with calls to previous to go back and forth. (Note that alternating calls to next and previous will return the same element repeatedly.)

Annotations

@Override

nextIndex back to summary

nextIndex	back to summary
public int nextIndex() Implements java.util.ListIterator.nextIndex. Doc from java.util.ListIterator.nextIndex. Returns the index of the element that would be returned by a subsequent call to `next`. (Returns list size if the list iterator is at the end of the list.) Annotations @Override

public int nextIndex()

Implements java.util.ListIterator.nextIndex.

Doc from java.util.ListIterator.nextIndex.

Returns the index of the element that would be returned by a subsequent call to next. (Returns list size if the list iterator is at the end of the list.)

Annotations

@Override

previous back to summary

previous	back to summary
public Integer previous() Implements java.util.ListIterator.previous. Doc from java.util.ListIterator.previous. Returns the previous element in the list and moves the cursor position backwards. This method may be called repeatedly to iterate through the list backwards, or intermixed with calls to `next` to go back and forth. (Note that alternating calls to `next` and `previous` will return the same element repeatedly.) Annotations @Override

public Integer previous()

Implements java.util.ListIterator.previous.

Doc from java.util.ListIterator.previous.

Returns the previous element in the list and moves the cursor position backwards. This method may be called repeatedly to iterate through the list backwards, or intermixed with calls to next to go back and forth. (Note that alternating calls to next and previous will return the same element repeatedly.)

Annotations

@Override

previousIndex back to summary

previousIndex	back to summary
public int previousIndex() Implements java.util.ListIterator.previousIndex. Doc from java.util.ListIterator.previousIndex. Returns the index of the element that would be returned by a subsequent call to `previous`. (Returns -1 if the list iterator is at the beginning of the list.) Annotations @Override

public int previousIndex()

Implements java.util.ListIterator.previousIndex.

Doc from java.util.ListIterator.previousIndex.

Returns the index of the element that would be returned by a subsequent call to previous. (Returns -1 if the list iterator is at the beginning of the list.)

Annotations

@Override

remove back to summary

remove	back to summary
public void remove() Implements java.util.ListIterator.remove. Doc from java.util.ListIterator.remove. Removes from the list the last element that was returned by `next` or `previous` (optional operation). This call can only be made once per call to `next` or `previous`. It can be made only if `add` has not been called after the last call to `next` or `previous`. Annotations @Override

public void remove()

Implements java.util.ListIterator.remove.

Doc from java.util.ListIterator.remove.

Removes from the list the last element that was returned by next or previous (optional operation). This call can only be made once per call to next or previous. It can be made only if add has not been called after the last call to next or previous.

Annotations

@Override

set back to summary

set	back to summary
public void set(Integer e) Implements java.util.ListIterator.set. Doc from java.util.ListIterator.set. Replaces the last element returned by `next` or `previous` with the specified element (optional operation). This call can be made only if neither `remove` nor `add` have been called after the last call to `next` or `previous`. Annotations @Override

public void set(Integer e)

Implements java.util.ListIterator.set.

Doc from java.util.ListIterator.set.

Replaces the last element returned by next or previous with the specified element (optional operation). This call can be made only if neither remove nor add have been called after the last call to next or previous.

Annotations

@Override

`new ExclusiveRange(1, 5, true)`	(1,2,3,4)
`new ExclusiveRange(0, 0, true)`	()
`new ExclusiveRange(0, -1, true)`	()
`new ExclusiveRange(-1, 0, true)`	(-1)
`new ExclusiveRange(5, 1, false)`	(4,3,2,1)
`new ExclusiveRange(0, 0, false)`	()
`new ExclusiveRange(-1, 0, false)`	()
`new ExclusiveRange(0, -1, false)`	(-1)

public Class ExclusiveRange

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class ExclusiveRange.RangeIterator

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail