Projects tagged ‘data-structures’

Standard Haskell arrays library.

Stxxl - Standard Template Library for Extra Large Data Sets. Stxxl is an implementation of the C++ standard template library STL for external memory (out-of-core) computations, containers, and ... [More] algorithms that can process huge volumes of data that only fit on disks. [Less]

This package provides the standard Haskell list library reimplemented to allow stream fusion. This should in general provide faster list operations, and faster code for list-heavy programs. See the ... [More] paper Stream Fusion: From Lists to Streams to Nothing at All, Coutts, Leshchinskiy and Stewart, 2007. To use, simply import Data.List.Stream in place of Data.List, and hide list functions from the Prelude. [Less]

A C-compatible array library for Haskell. Provides both an immutable and mutable (in the IO monad) interface. Includes utilities for multi-dimensional arrays, slicing and norms. Memory is 16-byte ... [More] aligned by default to enable use of SIMD instructions. [Less]

Data structures and algorithms for tile-based game maps.

Boost.Bimap is a bidirectional maps library for C++. With Boost.Bimap you can create associative containers in which both types can be used as key. A bimap can be thought of as a combination of a ... [More] std::map and a std::map. The learning curve of bimap is almost flat if you know how to use standard containers. A great deal of effort has been put into mapping the naming scheme of the STL in Boost.Bimap. The library is designed to match the common STL containers. [Less]

HList is a record system providing strongly typed heterogenous lists, records, type-indexed products (TIP) and co-products.

A generic implementation of STL containers and some STL algorithms. It is absolutly independent from external types it use only types declared in type_traits. So containers can be used with any poiner types which satisfies PointerConcept.

This package provides strict versions of some standard Haskell data types (pairs, Maybe and Either). It also contains strict IO operations.

This package provides the core Edison data structure implementations, including multiple sequence, set, bag, and finite map concrete implementations with various performance characteristics. The ... [More] implementations in this package have no dependencies other than those commonly bundled with Haskell compilers. [Less]