Search Results for "tables"

...Code is highly portable, and hashes are identical across all platforms (little / big endian). Performance on large data is only one part of the picture. Hashing is also very useful in constructions like hash tables and bloom filters. In these use cases, it's frequent to hash a lot of small data (starting at a few bytes). Algorithm's performance can be very different for such scenarios, since parts of the algorithm, such as initialization or finalization, become fixed cost. The impact of branch misprediction also becomes much more present.

...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 data types (ADT) such as hash tables b-trees, and much more. LinAsm libraries are written on FASM assembly language. They are stable and have appropriate benchmarks for many units. All libraries are well documented and grouped by their functionality. To get more information about this library, please visit the official web site: http://linasm.sourceforge.net

woff2 is Google’s reference implementation of the WOFF2 webfont format, the modern, highly compressed container used by browsers to ship OpenType/TrueType fonts efficiently over the network. It integrates specialized transforms for font tables (like glyf/loca and variations data) with Brotli compression to squeeze out as many bytes as possible while preserving exact font fidelity on decode. The repository includes a compact C/C++ library and small command-line tools so you can convert existing TTF/OTF files to WOFF2 and back for testing or build pipelines. Its encoder applies deterministic, spec-compliant transformations that maximize compressibility without altering rendering results, making it safe for production web delivery. ...

XanLib is a Linux library which provides data structures like hash tables, lists, pipes etc.. Each data structure exposes both synchronized and not synchronized methods.

Replace the data in the data.db file with your own data using an sqlite3 manager. Tables are read as data set names, and the values are read as the data points of the data sets. Load the application, choose an algorithm, and the program will find the pairs that best match each other.

QMC Logic Minimizer is a versatile application for fast simplifying truth and reduce lines tables. This program offers a comfortable user interface for generating and minimizing of the combinational logic functions. It is unique for its possibility of minimizing several functions at the same time. This program is intended for practical digital devices constructors as well as formal scholars and academics. Features: - You can minimize up to 16 input variables and up to 16 output variables...

A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.

Yet another container library written in C. Originally born as auxiliary library for another project it aims to be simple, dependency-free and lightweight.

This application implement an approach for doing keyword based search over semi-structured data available in HTML pages.

C++ SimpleTable is a class which enables the developer to create tables and detect design errors in compile-time

This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.

Java objects that share parts of immutable graphs. Reused subgraphs have directly or indirectly recursive Elements. Selected components get replaced by new counterparts in Context of Mirrors - translation tables. Deep copies are not involved.

The project models a Matrix in JAVA with a complete Object Oriented approach, from its values to its access and indices. There are specialized classes for tables(2), cubes(3), and arbitrary(N) dimensions matrices