Search Results for "keys"

...Read-only transactions can read values for a given bucket and a given key or iterate over a set of key-value pairs. Read-write transactions can read, update and delete keys from the DB. NutsDB allows only one read-write transaction at a time but allows as many read-only transactions as you want at a time. Each transaction has a consistent view of the data as it existed when the transaction started. When a transaction fails, it will roll back, and revert all changes that occurred to the database during that transaction.

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

...A list where each element points to the next element in the list. A set is a data structure that can store elements and has no repeated values. A Map is a data structure that maps keys to values.

in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] }

Libnsa stands literally for "Library: Non Semper erit Aestas". It is a small C++ library which implements RSA encryption. The current version only creates the 4096 bit public and private keys.

Moved to GitHub https://github.com/fedups A command-line utility to sort files. Funnel is a sort utility to sort files, large and small. It efficiently handles fixed length records and variable length records. Funnel easily handles ascii (readable) data and binary data. There are many more features in Funnel. It is easy to use and very fast. All documentation is on the Wiki.

plausj a collection of checksum algorithms used to validate business keys like bank account codes or credit card numbers. It's compiled as JVM bytecode files (although it's not necessarily implemented in Java) and can be used on JRE 1.5 and later.

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