Search Results for "algorithms containers"

C++ is a great language to use for embedded applications and templates are a powerful aspect. The standard library can offer a great deal of well-tested functionality, but there are some parts of the standard library that do not fit well with deterministic behavior and limited resource requirements. These limitations usually preclude the use of dynamically allocated memory and containers with open-ended sizes. What is needed is a template library where the user can declare the size, or...

(New version 1.04 is released) Dynamic Arrays is a set of useful very fast classes for data manipulating in memory. Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). Give it a try and let me know how...

STXXL is an implementation of the C++ standard template library STL for external memory (out-of-core) computations, containers, and algorithms that can process huge volumes of data that only fit on disks.

...Dynamic linear hash tables are implemented too. The main algorithms on graphs are implemented in an easy way and with good performance features. Network Flow (maximum and min cost), cut points, topological sort, spanning trees, min paths. etc. The graphs are generic in the sense that they can contain data independent of the algorithm. Several containers of the C++ STL library are implemented with Aleph-w.

CDS (Concurrent Data Structures) is a C++ template library of lock-free and fine-grained lock-based algorithms. It contains a collection of concurrent data structures: queues, stacks, sets, maps, etc, and safe memory reclamation schema for concurrent containers - Hazard Pointer and user-space RCU. See doxygen doc http://libcds.sourceforge.net/doc/cds-api/index.html. The source code repo for libcds 2.x has been moved to https://github.com/khizmax/libcds

...Additionally, Spatial's self-balancing kd-tree based containers, capable of object insertion and removal in fractional amortized time, prevent worst-case computational time on most operations. The latest release brings bug fixes and wide array of performance improvement across several algorithms. Nearest neighbor search, in particular, has been improved significantly.

Backport of C++11's std::string and std::vector to C. Other containers such as std::list, std::map, and std::set are in the works.

20 SkipList containers for C++ that work with STL. Combines set/map functionality with random access in logn time. One container is a multilist where you can order the same elements in a variety of different ways simultaneously.

A generic implementation of STL containers and some STL algorithms. The main intent is no make this STL implementation to work with any kind of pointers defined by allocator classes, e.g. memory_mgr::offset_ptr.

fxSTL is a C++ container library. fxSTL stands for the Fixed Standard Template Library. fxSTL is not a replacement for the STL, but is rather an extension of the STL that provides implementations of fixed size containers.

Open Macro Library is a library of highly reusable C macros providing a set of well-designed commonly needed functionality to C developers, like logging and debugging helpers, containers, sorting and other algorithms.

This small C package is made of an independent AVL tree library, and of an extension module for Python that builds upon it to provide objects of type 'avl_tree' in Python, which can behave as sorted containers or sequential lists.

One approach to constructing fast queues is to construct a mechanism for using shared memory appropriate containers in C++ as templates. There are three main components: the shared segment of memory, an allocator of memory chunks and the queue itself.

ObjectiveLib is a library for Objective-C that provides a full set of object containers, generic algorithms and binary streams. It provides the same services to Objective-C programmers that the Standard Template Library provides to C++ programmers.

The tree control library is a C++ container library which stores generic types in tree structures. Three containers are available in the library: tree, multitree, and unique_tree. The library usage and syntax is much like that of the STL.

NMSTL is the Networks, Messaging, Servers, and Threading Library for C++. It aims to be to systems and networks what STL is to algorithms and containers.

A project to bring elements of the std namespace from C++ to PHP 5.3. It will include common C++ includes (cstdlib,cmath,etc) as well as several classes derived from STL (containers, iterators, algorithms, etc).