Module | Source File | Description |
---|---|---|
abstract_container_mod | abstract_container.F90 | Provides an abstract container derived type which can be used as a sort of unlimited polymorphic entity whose contents are retrievable with type-guards. Different subclasses are created in order to hold different data-types. See container for instructions on creating concrete subclasses. See container_mod for subclasses containing the built-in data-types. |
array_list_mod | array_list.f90 | Provides a concrete implementation of the list abstract data type. This implementation, the array_list, stores values in an array and thus fast to read from. |
bidir_node_mod | bidir_node.f90 | Implements a node which contains a pointer to two other (the next and previous) nodes, allowing a chain to be formed. This can be used to, for example, build a doubly-linked lists. |
container_mod | container.f90 | Provides implementations of the container abstract derived type for all of the intrinsic variable types. |
countable_mod | countable.f90 | Provides the countable abstract type. For a type to be countable, the number of individual pieces of data stored within must be known in advance. |
data_set_mod | data_set.f90 | Provides an abstract type for the set data structure. Such sets support similar operations to their mathematical counterparts. This class, and its descendents, have a comparable set of methods to those in the Python frozenset type. |
deque_mod | deque.f90 | Provides a doubled ended queue abstract data type. This is a first in first out data structure which can be added to or taken from at either end. |
dictionary_mod | dictionary.f90 | Provides an abstract type for mapping data structures. These are data structures which consist of key-value pairs. |
dynamic_set_mod | dynamic_set.F90 | Provides an abstract type for a dynamic set data structures. This data structure is similar to a normal data_set structure, but new items can be added to the set. It is similar to the set type in Python. |
iterable_mod | iterable.f90 | Provides the iterable abstract type. All of FIATs more complex public data structures are descendants of this type. |
iterator_mod | iterator.f90 | Provides the iterator data type which can be used to access a collection of data. |
linked_node_mod | linked_node.f90 | Implements a node which contains a pointer to another (the next) node, allowing a chain to be formed. This can be used to, for example, build linked lists. |
list_mod | list.f90 | Provides an abstract data type representing a list. This interface provides a derived type with many of the same abilities as lists in higher-level languages such as Python. |
map_mod | map.f90 | Provides an abstract type for a standard map data structures. These are data structures which consist of key-value pairs, with only one value per key. It is similar to the dictionary type in Python. |
multimap_mod | multimap.f90 | Provides an abstract type for a multiple map data structure. These are data structures which consist of key-value pairs, potentially holding multiple values per key. |
multiset_mod | multiset.f90 | Provides an abstract type for a multi-set data structure. These behave like a normal set, except they keep count of the number of times which an item has been added. |
node_mod | node.f90 | Provides a node data type, for holding some sort of contents. While a node itself is unlikely to be very useful, various type extensions are also made which are then used to build more complex data structures. |
ordered_mod | ordered.F90 | Provides the ordered abstract type. This is a data structure for which the order of the elements is known. One of the effects of this is that order in which items are retrieved is determined by the order in which they are added to the data structure. |
queue_mod | queue.f90 | Provides an abstract data type representing a queue (first in first out) data structure. |