A queue data structure, for string data only, which looks like a File object. This class takes care of the list.append and "".join mess, which is needed for fast string concatenation.
A simple to use general purpose Tree data structure implementation in Ruby. Provides easy access methods for navigating the hierarchy, as well as for accessing the nodes. Also provides ability to marshal the entire tree structure.
Data structure: Builing Linked-List Class is an article in which author describes the method of generating Linked-List with the help of functionalities of framework Class library. The author gives details about the process of utilizing...
This code serializes Python data structure into XML.
This is one part of a trio of recipes:
Simple API XML2Py De-serialization Py2XML Serialization
For more information
See XML to...
This code de-serializes XML into a Python data structure.
This is one part of a trio of recipes:
Simple API XML2Py De-serialization Py2XML Serialization
For more information
See XML...
The union find data structure is primarily used for Kruskal's Minimum Spanning Tree algorithm, though can be used whenever one only needs to determine of two items are in the same set, and be able to combine sets quickly.
In some applications, it's advantageous to be able to define a circular data structure (a structure in which the last element is a pointer to the first). Python lists make it easy to make such a beast. A list is an ordered sequence of elements,...
Intent: Provides a useful 1D data structure (or container) for storing an ordered heterogeneous set of elements.
Motivation: MATLABdlT« R2009a provides the "containers.Map" data structure for storing an unordered...
This class provides a simple key/value data structure for character keys and values of any MatLab data type.
Supports direct referencing like d('mykey') = 'myvalue'.
Also check out the dict class at #19647.
A per-value class that implements a generic tree data structure. A tree is a hierarchical data structure where every node has exactly one parent (expect the root) and no or several children.
Along with this relational structure,...
Just another data-structure library for Java.
The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.
Provides a data structure for a queue of integers whose get() method returns the median element. The interface is similar to the standard Queue module, with an added method top() to retrieve the median without removing it.
An easy First-In-First-Out queue class based on Python's List data structure.
Implements a data structure for sets of natural numbers, represented by a single integer. The interface is similar to the built-in structure 'set'.
A simple example of a heap data structure as a C extension. This data structure can store and sort any python object that has a comparison function (i.e. strings, numbers, etc.).
A data structure that holds a sorted collection of values, and supports efficient insertion, deletion, sorted iteration, and min/max finding. Values may sorted either based on their natural ordering, or on a key function (specified as an argument...
In anticipation of creating large data structure, it appeared to be helpful if the users could get an idea of how much memory (RAM in particular) would be used while attempting to create a large, multidimensional array. In order to convert the...
A heap data structure that allows efficient merging of two heaps into one. See http://en.wikipedia.org/wiki/Binomial_heap
This is a simple implementation of an octree data structure in python. Its use is primarily for fast collision or view frustrum culling in interactive 3d environments, but its possible uses are quite open-ended. It was originally written for use... |