Search Results for "double-entry"

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

AhoCorasickDoubleArrayTrie is a Java implementation of the Aho–Corasick multi-pattern matching algorithm that is optimized using a Double-Array Trie data structure. It is designed for fast keyword scanning across large texts, where you want to search for many patterns simultaneously and efficiently. The core idea is to build an automaton from a dictionary of patterns, then stream through input text to emit matches with minimal overhead. By using a double-array trie representation, the project emphasizes performance and memory efficiency compared to simpler pointer-heavy trie structures, which can matter a lot for large dictionaries or latency-sensitive services. ...

A light-weight Regular Expression (regex) C library, using double-recursion. (command prompt tester included)

This is showcase program, with source code and sample data included for fast peak detection algorithm. It is great tool for entry level, automated analisys, to discard empty and junk curves and save only ones matching required criteria. Assuming that only 1% of data is worth reviewing, and that manual selection takes approx. 3 seconds per curve, you can save up to 8 hours per every 10000 curves (like 2 days every week!). Force amplitude analisys for single curve takes from 1 to 4 milliseconds on low-end intel dual core. ...

...Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large)

...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, please download this full document (EPLibrary Documentation.chm) from the "Downloads" Section. * If the documentation file is not visible after finishing download. Solution 1. ** Double-click the .chm file. ** In the Open File-Security Warning dialog box, click to clear the Always ask before opening this file check box. ** Click Open. Solution 2. ** Right-click the CHM file, and then click Properties. ** Click Unblock. ** Double-click the .chm file to open the file.

Belkerda is a simple Python AI program that takes a user's input, builds a log of random numbers, picks a random entry, and displays it. If it is correct, then it reenters that number back into the log several times, overwriting the original, random numbers. If it is not, however, it overwrites a lower amount of entries.

...The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the following paper: Ehsan Emadzadeh, Azadeh Nikfarjam, and Graciela Gonzalez. 2011. Double Layered Learning for Biological Event Extraction from Text. In Proceedings of the BioNLP 2011 Workshop Companion Volume for Shared Task, Portland, Oregon, June. Association for Computational Linguistic

This is a series of *.java Classes for making programming tasks simpler, much like Apache Commons. Included in this src package is an Advanced Randomizer, TStringList Clone From Delphi, an Algorithem Class, and Method MultiTask Better than Runnables.

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

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.

Backwards mappable double linked list for Common Lisp.

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.

An extremely memory-efficient hash_map implementation. 2 bits/entry overhead! The SparseHash library contains several hash-map implementations, including implementations that optimize for space or speed.

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

...The features includes: - Famvir Distributed File System - Job Tracker and Task Tracker: the MapReduce Engine For detailed documentation, please download this full document (EPFamvir Documentation.chm) from the "Downloads" Section. * If the documentation file is not visible after finishing download. Solution 1. ** Double-click the .chm file. ** In the Open File-Security Warning dialog box, click to clear the Always ask before opening this file check box. ** Click Open. Solution 2. ** Right-click the CHM file, and then click Properties. ** Click Unblock. ** Double-click the .chm file to open the file.