Class Specialization
External String
String that is stored in external memory.
Parameters
The value type, that is the type of the items/characters stored in the string. Remarks: Use Value to get the value type for a given class. | |
A structure to configure the external string. Default: ExternalConfig |
Specialization of
Implements
Metafunctions
The default overflow strategy for explicit resize. (String) | |
The default overflow strategy for implicit resize. (String) | |
Infix sequence type. (String) | |
Determines whether a container stores its elements in sequential order. (String) | |
Type of iterator objects that are used to traverse the container. (String) | |
Type of an object that represents a position in a container. (String) | |
Prefix sequence type. (String) | |
The default alphabet type of a suffix array, i.e. the type to store a position of a string or string set. (String) | |
The spec of a class. (String) | |
Suffix sequence type. (String) |
Member Functions
Constructor |
Functions
Concatenate two containers. (String) | |
Assigns one object to another object. (String) | |
Assigns value to item. (Container) | |
Tests whether iterator is at nil position. (String) | |
The last item in container. (Container) | |
The begin of a container. (String) | |
Begin position of object in host. (String) | |
Test whether an automaton can parse a string completely. (String) | |
The maximal length. (String) | |
Resets an object. (String) | |
Closes a file. | |
Returns all leaves underneath a given vertex. (String) | |
Creates a factor oracle. (String) | |
Creates a factor oracle for the reversed string. (String) | |
Creates a trie of all suffixes of a text. (String) | |
Creates a trie. (String) | |
Creates a trie for all reversed keywords. (String) | |
Determines the consensus pattern of a given profile. (String) | |
Test a container for being empty. (String) | |
The end of a container. (String) | |
End position of object in host. (String) | |
Erases a part of a container (String) | |
Extends a seed. (String) | |
Extenstion of seeds. (String) | |
Resizes and fills a container. (String) | |
Waits for all open requests to complete. | |
The first item in container. (Container) | |
Constructs a alignment from a ChainedSeed. (String) | |
Computes a pairwise distance matrix from an alignment graph. (String) | |
Gets the successor for a given vertex and an edge label. For an automaton a single character is required whereas for a word graph getSuccessor takes a string. (String) | |
Access to the value. (Container) | |
Iterates down one edge or a path in a tree. (String) | |
Moves iterator to nil position. (String) | |
Computes the heaviest increasing subsequence. (String) | |
A value that identifies the underlying sequence. (String) | |
Creates infix object. (String) | |
Creates infix object. (String) | |
Iterator to item at given position. (String) | |
The number of items/characters. (String) | |
Computes the longest common subsequence. (String) | |
Computes the longest increasing subsequence. (String) | |
Assigns value to item. (Container) | |
Opens a file. | |
Opens a temporary file. | |
Parses a string one character at a time and moves accordingly in the automaton. (String) | |
Position of an iterator. (Container) | |
Creates prefix object. (String) | |
Replaces a part of a container with another container. (String) | |
Changes the length. (String) | |
Makes free space in container (String) | |
Calculates the score of a seed. (String) | |
Sets the haystack of a Finder object. (String) | |
Sets the needle of a Pattern object and optionally induces preprocessing. (String) | |
Determines whether two sequences share the same resource. (String) | |
Computes a guide tree from a distance matrix. (String) | |
Retrieves a string of delimiter positions of a StringSet which is needed for local<->global position conversions. (String) | |
Takes a shape given as a string of '1' (relevant position) and '0' (irrelevant position) and converts it into a Shape object. (String) | |
Creates suffix object. (String) | |
Access sequence as c-style string. (String) | |
Performs a topological sort on a directed acyclic graph (DAG). (String) | |
Computes a guide tree from a distance matrix. (String) | |
Reference to the value. (String) |
Remarks
The External String enables to access sequences larger than the available internal memory (RAM) by using
external memory (e.g. Hard disk, Network storage, ...) via a File object.
Sequences of nearly arbitrary size can be accessed, they can in particular contain more than 2^32 elements on a 32bit system (see Tag.ExternalConfigLarge).
See the constructor for more details.
This String also supports fast appending and removing of values at the end (see Block String, appendValue)
The External String implements a LRU mechanism to swap out pages.
The External String's Iterator detects a forward or backward iteration and asynchronously prefetches pages that
certainly will be accessed and automatically swaps out pages that certainly won't be accessed any more in the iteration
process.
The String is implemented like a virtual memory manager.
It divides its character sequence into pages of a fixed length (e.g. 1MB) and maintains a
page table with information for each page (e.g. resides in memory or was swapped out, is dirty and needs to be saved, ...).
Besides the page table the String also contains a size-limited list of page frames. A page frame is reserved internal
memory for a page. When accessing values of a page that is stored in external memory, the page is loaded to a page frame
first. In case that there is no page frame free, another page is swapped out before to free a page frame.
Example Programs
SeqAn - Sequence Analysis Library - www.seqan.de