Constructor and Description |
---|
Orders()
Default constructor instantiates the container guaranteed on insert-order.
|
Orders(Orders source)
Copy constructor builds a new instance from the source.
|
Modifier and Type | Method and Description |
---|---|
boolean |
add(Order e)
Adds the specified order at the end of this sequence.
|
boolean |
addAll(Orders e)
Adds the specified sequence of orders at the end of this sequence.
|
void |
clear()
Removes all orders from this sequence.
|
boolean |
contains(Order o)
Returns
true if the specified Order is already included in the sequence. |
boolean |
equals(Object obj)
Compares the specified object with this sequence of orders for equality.
|
int |
hashCode()
Returns the hash code value for this sequence of orders.
|
boolean |
isEmpty()
Returns
true if there are no items in the sorting sequence. |
Iterator<Order> |
iterator() |
boolean |
remove(Order o)
Removes the specified order from this sequence.
|
boolean |
removeAll(Orders c)
Removes the orders from the specified sequence from this sequence.
|
boolean |
retainAll(Orders c)
Retains only the orders from the specified sequence in this sequence, removes the rest of the orders from this sequence.
|
Order[] |
toArray(Order[] a)
Returns an array representation of this sequence.
|
String |
toString()
Returns a string representation of this order.
|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
forEach, spliterator
public Orders()
public Orders(Orders source)
source
- the source instance from which the state is replicated in the new instance.public boolean isEmpty()
true
if there are no items in the sorting sequence.true
if there are no items in the sorting sequence, false
otherwise.public boolean contains(Order o)
true
if the specified Order
is already included in the sequence.o
- the order to search for.true
if the specified Order
is already included in the sequence, false
otherwise.public Order[] toArray(Order[] a)
a
- the array to populate with the array view of this sequence.public boolean add(Order e)
e
- the order to add.true
if this sequence changed as a result of the call, false
otherwise.public boolean addAll(Orders e)
e
- the sequence of orders to add.true
if this sequence changed as a result of the call, false
otherwise.public boolean remove(Order o)
o
- the order to removetrue
if this sequence changed as a result of the call, false
otherwise.public boolean removeAll(Orders c)
c
- the sequence of orders to remove.true
if this sequence changed as a result of the call, false
otherwise.public boolean retainAll(Orders c)
c
- the sequence of orders to retain.true
if this sequence changed as a result of the call, false
otherwise.public void clear()
public String toString()
The string representation is: ORDER BY
first order
THEN BY
more orders...
.
toString
in class Object
Object.toString()
public int hashCode()
The hash code of a sequence of orders is defined to be the sum of the hash codes of its elements.
This ensures that o1.equals(o2)
implies that o1.hashCode() == o2.hashCode()
for any two sequence of orders o1
and o2
, as required by the general contract of Object.hashCode()
.
hashCode
in class Object
Object.hashCode()
public boolean equals(Object obj)
Returns true
if the given object is also a sequence of orders and the two orders represent the same sequence of orders.
Two sequences of orders o1
and o2
represent the same sequence of orders if they have the same sizes and, if for
each corresponding element o1 and o2, o1.equals(o2)
returns true
.
This implementation first checks if the specified object is this sequence of orders; if so it returns true
.
Then, it checks if the specified sequence of orders have the same size as this, and their corresponding elements are equal as described above.
equals
in class Object
obj
- object to be compared for equality with this ordertrue
if the specified object is equal to this orderObject.equals(java.lang.Object)