| Class DAssociative (unit SDL) |
| Constructors |
| Functions |
function allowsDuplicates : Boolean; virtual; abstract;
function countValues(value : array of const) : Integer; virtual;
function getAt(key : array of const) : DObject; virtual;
function locate(key : array of const) : DIterator; virtual;
procedure putAt(key, value : array of const); virtual;
procedure putPair(pair : array of const); virtual;
procedure removeAt(iterator : DIterator); virtual; abstract;
procedure removeIn(_start, _finish : DIterator); virtual; abstract;
procedure removeValue(value : array of const); virtual;
procedure removeValueN(value : array of const; count : Integer); virtual;
function startKey : DIterator; virtual; abstract;
function _countValues(const value : DObject) : Integer; virtual; abstract;
function _getAt(const key : DObject) : DObject; virtual; abstract;
function _locate(const key : DObject) : DIterator; virtual; abstract;
procedure _putAt(const key, value : DObject); virtual; abstract;
procedure _removeN(const key : DObject; count : Integer); virtual; abstract;
procedure _removeValueN(const value : DObject; count : Integer); virtual; abstract;| Properties |
| Events |
| Variables |
| Constructors |
| Functions |
function allowsDuplicates : Boolean; virtual; abstract;Determine if this map permits duplicates.
function countValues(value : array of const) : Integer; virtual;Return the number of pairs with values equal to the specified value.
function getAt(key : array of const) : DObject; virtual;Retrieve the value for a specified key. The key must exist in the map.
function locate(key : array of const) : DIterator; virtual;Returns an iterator positioned at the pair with the specified key. If the key is not found, the iterator is positioned at the end.
procedure putAt(key, value : array of const); virtual;Add an open array of keys and values to the map. There must be the same number of elements in each array. The first element in the key array is matched with the first in the value array; the second with the second, and so on.
procedure putPair(pair : array of const); virtual;Add a key, value pair. You must pass exactly two items in the const array.
procedure removeAt(iterator : DIterator); virtual; abstract;Removes the pair the iterator is pointing to.
procedure removeIn(_start, _finish : DIterator); virtual; abstract;Removes all pairs from start to finish.
procedure removeValue(value : array of const); virtual;Removes all pairs with the specified value.
procedure removeValueN(value : array of const; count : Integer); virtual;Removes the first pair with the specified value.
function startKey : DIterator; virtual; abstract;Returns a key oriented iterator positioned at the first pair.
function _countValues(const value : DObject) : Integer; virtual; abstract;Return the number of pairs with values equal to the specified value.
function _getAt(const key : DObject) : DObject; virtual; abstract;Retrieve the value for a specified key. The key must exist in the map.
function _locate(const key : DObject) : DIterator; virtual; abstract;Returns an iterator positioned at the pair with the specified key. If the key is not found, the iterator is positioned at the end.
procedure _putAt(const key, value : DObject); virtual; abstract;Add the specified key, value pair to the map. Copies are made of the objects.
procedure _removeN(const key : DObject; count : Integer); virtual; abstract;Removes the first count pairs with the specified key.
procedure _removeValueN(const value : DObject; count : Integer); virtual; abstract;Removes the first pair with the specified value.
| Properties |
| Events |
| Variables |