Copyright (C) 2000-2012 |
Whole document tree Front Insertion Sequence
DescriptionA Front Insertion Sequence is a Sequence where it is possible to insert an element at the beginning, or to access the first element, in amortized constant time. Front Insertion Sequences have special member functions as a shorthand for those operations.Refinement ofSequenceAssociated typesNone, except for those of Sequence.Notation
DefinitionsValid expressionsIn addition to the expressions defined in Sequence, the following expressions must be valid.
Expression semantics
Complexity guaranteesFront, push front, and pop front are amortized constant time. [2]Invariants
ModelsNotes[1] Front is actually defined in Sequence, since it is always possible to implement it in amortized constant time. Its definition is repeated here, along with push front and pop front, in the interest of clarity. [2] This complexity guarantee is the only reason that front(), push_front(), and pop_front() are defined: they provide no additional functionality. Not every sequence must define these operations, but it is guaranteed that they are efficient if they exist at all. See alsoContainer, Sequence, Back Insertion Sequence, deque, list, slistCopyright © 1999 Silicon Graphics, Inc. All Rights Reserved. TrademarkInformation
|