Sorted sequence: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 3: | Line 3: | ||
== General Information == | == General Information == | ||
'''Representation invariant:''' | |||
# The abstract data structure '''sorted sequence''' implements sorted sequences as defined [[Sets and sequences|here]]. | |||
# This abstract data structure is [[Genericity|generic]] and parameterized by a fixed key type <math>\kappa</math> and a fixed [[Genericity|comparision]] <math>c</math> defined on <math>\kappa</math>. | |||
'''Constructor:''' Gets a [[Genericity|comparision]] <math>c</math> and initializes ths sequence so as to be empty. | |||
== Insert == | == Insert == | ||
Revision as of 11:00, 26 September 2014
General Information
Representation invariant:
- The abstract data structure sorted sequence implements sorted sequences as defined here.
- This abstract data structure is generic and parameterized by a fixed key type [math]\displaystyle{ \kappa }[/math] and a fixed comparision [math]\displaystyle{ c }[/math] defined on [math]\displaystyle{ \kappa }[/math].
Constructor: Gets a comparision [math]\displaystyle{ c }[/math] and initializes ths sequence so as to be empty.