|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Represents type TGInterfaceListEnumerator. |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Represents type TIFixedList. |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Represents type TIFixedListEnumerator. |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
• Add or delete the interfaces in the table. • Locate and access interfaces in the table. |
|
|---|
For a small numbers of items, this class may be slower than a TList because its retrieval time constant is larger. It also consumes more memory than a TList. |
Represents type TIHashtableEntry.
|
|---|
Deprecated since Delphi XE4. Please use the RSInterfaceCollections|TIHashTable class instead. |
The TIHashtableEnumerator class provides an enumeration of all the values in a InterfaceCollections.TIHashTable object, it implements the CommonInterfaces.IInterfaceIterator interfaces. The TGHashtableEnumerator provides access to all the keys or items stored in the TGCustomHashTable object. The object provides functionality similar to an Enumeration in java.
To use the enumerator is simple, set the Keys property to True (return Keys) or False (return items) and then keep calling the NextElement method until the HasMoreElements method returns False. The enumerator works by giving you the next element until the end of the list, there is no provision for getting the previous element. The enumerator manages its own memory and will free itself when it is completely dereferenced (as long as you use an interface to access it).
|
|---|
The enumeration guarantees no ordering in the manner that the next element returns items. It just guarantees all items will be returned eventually, with no item appearing twice. |
|
|---|
Deprecated since Delphi XE4. Please use the RSInterfaceCollections|TIList class instead. |
• Add or delete the objects in the list.
• Rearrange the objects in the list.
• Locate and access objects in the list.
• Sort the objects in the list.
Represents type TIListEnumerator.
Represents type TInterfaceListIterator.
|
|---|
Deprecated since Delphi XE4. Please use the RSInterfaceCollections|TIQueue class instead. |
|
|---|
Deprecated since Delphi XE4. Please use the RSInterfaceCollections|TIStack class instead. |
|
|---|
Deprecated since Delphi XE4. Please use the RSInterfaceCollections|TIStringHashTable class instead. |
The TIStringHashTable class implements and manages a hash table of string-interface associations. It stores interfaces (IUnknown and its descendants) indexed by a string key.
Hash tables provide constant time O(C) search access to any value in the table (using the key) as the table grows (unlike a TList where to search for an item is O(n) (or O(log n) for sorted TStrings). The TIStringHashTable object provides properties and methods to:
• Add or delete the interfaces in the table.
• Locate and access interfaces in the table.
Represents type TIStringHashtableEntry.
Represents type TIStringHashtableEnumerator.
|
|---|
Deprecated since Delphi XE4. Please use the RSInterfaceCollections|TIStringList class instead. |
The TIStringList object maintains a list of strings and their associated objects and interfaces. TIStringList is similar to TStringList but also adds a field for interfaces. Use a string list object to store and manipulate a list of strings with interfaces.
TIStringList implements the abstract properties and methods introduced by TStrings, and introduces new properties, events, and methods to:
• Add or delete strings at specified positions in the list.
• Rearrange the strings in the list.
• Access the string at a particular location.
• Read the strings from or write the strings to a file or stream.
• Associate an object with each string in the list and, optionally free it when the string is deleted.
• Sort the strings in the list.
• Prohibit duplicate strings in sorted lists.
• Respond to changes in the contents of the list.
Represents type TListIterator.
Represents type TStringsIterator.
