aGrUM  0.13.2

A Sequence<Key> is quite similar to a vector<Key> in that it stores an ordered set of elements. More...

+ Collaboration diagram for Sequences:

Detailed Description

A Sequence<Key> is quite similar to a vector<Key> in that it stores an ordered set of elements.

The main difference between these two data structures lies in the fact that, given a key, it is possible to retrieve from a Sequence<Key> the index in the vector where the key lies in O(1). As a result, it is not possible to insert a given element twice in the sequence, that is, all the Keys must be different.

Classes

class  gum::SequenceImplementation< Key, Alloc, Gen >
 The internal class for storing (ordered) sequences of objects. More...
 
class  gum::Sequence< Key, Alloc >
 The generic class for storing (ordered) sequences of objects. More...
 
class  gum::SequenceIteratorSafe< Key >
 Safe iterators for Sequence. More...