sortedQ()
query.
Sequence
1. Creation
SequenceBase<Item,Impl> | s; |
SequenceBase<Item,Impl> | s( (Collection<Item>&) c); |
SequenceBase<Item,Impl> | s( (SequenceBase<Item,Impl>&) ss); |
Sequence<Item> | s( (Collection<Item>&) c); |
Sequence<Item> | s( (Sequence<Item>&) ss); |
2. Operations
void | insertAfter (Item e, Item after_item); |
store
is greater
than 1, then other collection objects are also
using
it as their implementation. Rather than changing
its contents, a copy will be made (O(n)),
and the reference
counts will be updated. Finally,
insert e after the first occurrence of
after\_item
. If there is no such
occurrence, a NULL pointer is passed to
the Container's
insertAfter(Item,ContainerNode*) method.
Complexity depends on the storage medium.
void | insertBefore (Item e, Item before_item); |
before\_item
.
void | prepend (Item e); |
Item | element (int i); |
SequenceBase<Item,Impl> | subsequence (int i, int j); |