| 
|
Topic: ordered data types
topics >
computer science >
data >
data type >
enumerated data types
Topic:
iterator
Topic:
index sequence for array access
Topic:
range data type
Summary
An ordered type is any type with successor and predecessor functions. They can be used in range types, for loops, and index sequences. An ordered type can be indexed by the signed integers. (cbb 5/80)
Subtopic: ordered type
Quote: an ordering relation has three properties: x not y<x; x<y and y x<z; and, either x<y or y<x [»russB_1919, OK]
Subtopic: unbounded type
Quote: a data type is ordered if it includes functions pred and succ [»abraH12_1977] Quote: all enumerated and subrange types have standard set of accessing functions such as 'first' and 'pred' [»veneT3_1978] Quote: Simula provides safe reference by separating reference from the thing itself; e.g., queue elements have succ, pred, out, and into [»nygaK10_1983, OK]
Subtopic: lattice type
Quote: if a count reaches its limit, reduce by half, increment an overflow count in a hashed table, and set a flag; reverse for decrementing [»lampBW10_1983]
Subtopic: order not needed
Quote: a lattice is a partially ordered set in which every pair has a greatest lower bound and least upper bound; meet and join [»simmGF_1963] Quote: implement lattice operations in almost constant time by encoding the lattice in binary; greatest lower bound, l.u.b., and relative complement [»aitkH1_1989]
Quote: relations, joins, and group-by deliberately ignore the notion of order; called "area", "bundling", and "glumping"
[»bosaR4_1962]
Topic: enumerated data types (17 items)
Topic: iterator (13 items)
Topic: index sequence for array access (16 items)
Topic: range data type
(17 items)