Open Source C++ Algorithms

Threading Building Blocks offers a rich and complete approach to expressing parallelism in a C++ program. It is a library that helps you leverage multi-core processors for performance and scalability without having to be a threading expert.

A bignum library written in the C++ programming language as templates. It provides standard mathematical operations like add, sub, mul, div, pow etc. with the big integer and big floating point numbers.

AMMORIA (ARAB) is an object oriented programming language uses Arabic words instead of English words, to make learning programming for Arab children easy and fast, it's planned to support Urdo and Farsi too, AMMORIA has its won IDE and Visual stuff.

The EXT Library is set of various useful classes, templates and macros that extend functionality provided by ISO C++ (ext sub-library), standard C and C++ library (lib), to abstract parts of Windows API (win) and access PE file resources (res).

General Toolkit Library is a general purpose toolkit written in C++ designed to make it easier for developers to produce applications. It provides classes and templates that implement several data structures like Arrays, Lists, Heaps, Sets, Files, etc.

CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. Each module is provided with an example program.

Dieser Parser, soll arithmetische Ausdrücke, die als String vorliegen, ausrechnen, bzw. diverse Funktionen darauf anwenden können. Bis jetzt kann er nur Audrücke wie "4^(5+2)-23*4/cos(3)" ausrechnen. er unterstützt auch vergleichsoperatoren

A C++ library for Bayesian computation, including a collection of more generally-applicable utilities.

Complex list management with an extremely versatile interface. Built-in sorting (with abstract variants), finding, iteration, and element manipulation. Supports const-interface elements. Transparent 'virtual array storage' (VAS) for large element types

Celluster is an easy adaptable producer/consumer software for distributed computing on a cluster of Cell B.E. processors

The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.

Evolutionary computation library and benchmark utility. Integer encoded genetic algorithm.

A C++ RAII ( Resource Allocation Is Initialization ) implementation of an automatic pointer/reference. Pointable/Referenced objects are handled in a manner similar to Python. Strives to have the simplest syntax possible.

Institute of Technology, Blanchardstown Computer Science code by the class of 2007-2011 on course BN104. In this project we are open sourcing all of our project work to the public in the hopes it can be reused, built-upon, and used in education.

JPortForwarder Project JPortForwarder is a multithreaded TCP Port Forwarder application. The following feature have been developed: - Generic TCP Port Forwarging. Listen for a port and forward to an ip:port. - Multihoming TCP Port Forwarding.

Easy To Use Collection Classes For C And C++ The Memory Structures Library (MemSL) has implementations of structures (i.e. AVL trees, threaded trees, dynamic hashing, ...) that are extremely hard to find and far harder to implement.

Generic System for Data Processing

This library is meant to offer an array of general purpose data structures and algorithms for a multitude of uses. Each structure must be examined for its specific usefulness to be determined. Please see the API documentation for more details.

STLshm provides an C++ STL Allocator implementation for creating and using STL containers (and any other allocator aware types) in shared memory regions. It supports multiple shared region implementations.

A library with implementation of algorithms for solving Lot Sizing problems. The main focus of the library is on ease of use, while also attempting to keep it as efficient as possible.

HOOPLE is a portable collection of C++ source code, featuring thread-safe objects for collections and event processing, RPC-style plugin-based encrypted networking (CROMP / octopus), bookmark collection management utilities, and a lot of other cool stuff. This is the project page for HOOPLE version 1, which was retired on September 25 2010. The code supposedly still builds on both Linux (with gnu gcc) and on Windows (with ms visual studio). Most of the code from hoople1 has moved into the Feisty Meow® Concerns Ltd codebase, available at http://feistymeow.org for your enjoyment.

The SFTL (Simple Functional Template Library) is a C++ library that attempts to leverage the use of the C++ STL through functional programming concepts.

Vincent Radio {Adrix.NT} presents Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT} also contains - Little Docs about Paged Lists (docx, pdf) - VR Basic Common Utils Sources (Array List ...) - VR Generic Multi Dim Array Class - VR Generic MDArray List Mgr Class - VR Generic Adjacency (List | Matrix) Direct Graph Classes - VR List Interface with STL Support with some nice implementations (ArrayList, Paged-LIst) - Env Var Notes for sources for C++ Builder (Embarcadero) - Special DLLs Build - Embarcadero C++Builder VCL Test Application for Paged List - Dev-C++, Visual Studio Build Projects have fun another fine SunStorm release for more products write to ... Vincent Radio {Adrix.NT} adrixnt@hotmail.it

A LGPL library to handle xml documents in a DOM-like style. It's designed for LOW-performance systems (like embedded ones) and for lightly handle very large documents, automatically speeding up memory management in a user tunable style.

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.