The domain KeyedAccessFile(S) provides files which can be used as associative tables. Data values are stored in these files and can be retrieved according to their keys. The keys must be strings so this type behaves very much like the StringTable(S) domain. The difference is that keyed access files reside in secondary storage while string tables are kept in memory. For more information on table-oriented operations, see the description of Table.
Before a keyed access file can be used, it must first be opened. A new file can be created by opening it for output.
Just as for vectors, tables or lists, values are saved in a keyed access file by setting elements.
Values are retrieved using application, in any of its syntactic forms.
Attempting to retrieve a non-existent element in this way causes an error. If it is not known whether a key exists, you should use the searchsearchKeyedAccessFile operation.
When an entry is no longer needed, it can be removed from the file.
The keyskeysKeyedAccessFile operation returns a list of all the keys for a given file.
The # #KeyedAccessFile operation gives the number of entries.
The table view of keyed access files provides safe operations. That is, if the Axiom program is terminated between file operations, the file is left in a consistent, current state. This means, however, that the operations are somewhat costly. For example, after each update the file is closed.
Here we add several more items to the file, then check its contents.
If many items are to be added to a file at the same time, then it is more efficient to use the writewriteKeyedAccessFile operation.
The readreadKeyedAccessFile operation is also available from the file view, but it returns elements in a random order. It is generally clearer and more efficient to use the keyskeysKeyedAccessFile operation and to extract elements by key.
For more information on related topics, see FileXmpPage , TextFileXmpPage , and LibraryXmpPage .