Search Results for "data structures c" - Page 2

libdry is a C++44 shared library containing public domain implementations of data structures and algorithms.

This C++ library contains the 'PdfPageCount' class that performs the single task of finding the number of pages in a given PDF document. While the PdfPageCount class is very simple to use, the contained code is complex because the page count can be hidden in any number of places, quite often within compressed data.

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.

Pre-projetos_MLCM - É um conjunto de Programas e códigos fonte dos mesmos, com finalidade educacionais para a área de TI. Sendo eles programas simples que foram desenvolvidos para a aquisição de nota no curso de BCC. Os programas em si, estão ainda em desenvolvimento sendo disponibilizado uma prévia dos progressivos resultados, não se tendo uma data de finalização do projeto definida. Fica a disposição os códigos deles sobre a licença GPL para que estudantes e interessados possam fazer uso e...

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

Java library for operations with Iterables and other data structures in functional way.

A library of standard data structures in C, similar to STL in C++. Includes variable-length arrays, deques, hashtables, avl trees, binary heaps, and many other useful structures, with a simple and intuitive interface.

Provides bitwise, context-based 2nd generation data compression for large FASTQ-based files

Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.

clibutils is collection of common data structures , This library supports any type, Following are the datastructures currently implemented. 1. Dynamic Array 2. Single Linked List 3. Heap 4. Map 4. Set.

ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.

breve is a free, open-source 3D multi-agent simulation package designed for simulating decentralized systems and artificial life.

Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.

TypeRecognizer is C++ class which enables the developer to recognize data types in compile-time

XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.

Generic System for Data Processing

Libgxl++ is a library based on the libxml++ and libxml2 to provide a complete and efficient API to parse and manipulate the GXL format.

Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.

Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.

The MemSL for C and C++ includes a complete data structures/collection classes library, memory tracing, memory debugging, logging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.

Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys

This library implements several locality sensitive hashing(LSH) based algorithms, including indexing data structure for high dimensional spaces and metric spaces, sketch constructions and set embedding algorithms.

The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.

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.