Search Results for "file structure"

A Ring-Buffer instance could be used with element types - char - long - long long - void* . Focus is on a hardened SW structure with buffer-instance-pointer check (not very fast but more secure). Some features are globally choosable on compile-time (e.g. switch multithread support off completely to have faster access). Note: User Interface is for Test and Tutor Code only.

...It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. As a by-product of training, a tree structure performs either exact or approximate quantization on trained centroids, the latter being not very precise but extremely fast. A detailed README file describes the usage of the software, including license, requirements, installation, file formats, sample data, tools, and options. With the sample data provided and the default options, it is possible to test the code immediately as a demo. ...

The ordered_tree class template is an implementation in C++ of the ordered tree data structure. It implements breadth, depth search, as well as child and leaf iterators. A single header file is needed to use the code.

XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.

PileWorks provides the organizational structure for coordinating several different projects which approach some aspect of Pile Technology. PileWorks defines a set of interfaces and implements some basic infrastructure for Pile engines and agents.