Search Results for "c array"

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 ... ...

LinAsm is collection of very fast and SIMD optimized assembly written libraries for x86-64 Linux. It implements many common and widely used algorithms for array manipulations: searching, sorting, arithmetic and vector operations, unit conversions; fast mathematical and statistic functions; numbers and time converting algorithms; finite impulse response (FIR) digital filters; spectrum analysis algorithms, Fast Hartley transformation; CPU cache friendly functions and extremely fast abstract...

BTK contains C++ and Python libraries that implement speech processing and microphone array techniques such as speech feature extraction, speech enhancement, speaker tracking, beamforming, dereverberation and echo cancellation algorithms. The Millennium ASR provides C++ and python libraries for automatic speech recognition. The Millennium ASR implements a weighted finite state transducer (WFST) decoder, training and adaptation methods.

Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene.

* EpLibrary project in this site is not maintained anymore. * The project has been moved to https://github.com/juhgiyo/EpLibrary EpLibrary is a utility library for Visual C++. The features includes: - Math Framework - Enhanced Binary Search - Sort - Stream Framework - Container Framework - Simple Debugger Framework - FileSystem Framework - Other Frameworks - Server/Client Template Framework - System Framework - Thread System For detailed documentation,...

AVL Array is a sequence container (like std::vector or std::list) that allows fast insert/remove AND fast random access. Shiftable Files offers the usual file primitives plus fast insert/remove. Get the latest version via BZR in the Develop section.

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

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.

webdevlib is a open source project for develop web applications, it include general api for web develop, such as string, array, hash, cgi get and post, and template file operate.

spdict is a library of dictionary algorithms written in C++. It has support for sorted array, binary search tree, red-black tree, skip list, and balanced tree algorithms. Also include a cache class.

It is a HTML content extractor library. It is modular, so no need for using confusing regular expressions. The output is a character array, so the calling program just needs to know the file name and it gets the output in char array.

A C++ library implementing an efficient trie data structure called Double-Array.

This project is no longer supported by its creators. salgo is a C framework you can use to implement sorting algorithms. It provides different ways of filling an array and then sorting this in ascending or descending order (a stop watch is included).

C++ implementation of Hash Array Mapped Trie (HAMT). Class design follows STL principles and aims to meet the requirements and to provide the guarantees of std::hash_map.