Red/Black Tree implementation. Port of the sourceforge libredblack library to C#. The package also consists of mutlitree (tree with non-unique key) and tree with quick direct access to items by the index.
Delphi class incapsulating functionality of Red-black binary search tree
Delphi class which implements an associative array. Keys can be strings or integers. Keys are stored in Red-Black tree. Array can contain TObjects or it descendants.
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.
This example adds MATLABdlT« to the list of languages in this C++ vs Java vs Python vs Ruby: a first impression (http://www.dmh2000.com/cjpr/ ) article at www.dmh2000.com, which compares implementations of a Red Black Tree binary search algorithm...
Binary search trees provide O(lg n) performance on average for important operations such as item insertion, deletion, and search operations. Balanced trees provide O(lg n) even in the worst case.
GNU libavl is the most complete,...
PMKMP Returns perceptually balanced colormaps with rainbow-like colors
PMKMP(N,SCHEME) returns an Nx3 colormap.
JUSTIFICATION: rainbow, or spectrum color schemes are considered a poor choice for...
Sglib is a library defining useful macros for manipulating common data structures. The library currently provides generic implementation for:
- sorting arrays
- manipulating linked lists
- manipulating sorted linked lists
A collection of functions is presented
which includes 2nd generation wavelet
decomposition and reconstruction tools
for images as well as functions for the
computation of moment invariants.
The wavelet schemes rely on the...
MARTINGALE returns and plots a cashflow using the Martingale system in roulette
[outcomes] = martingale(initbet, betuntil, maxbet, gamblercash,
casinocash, betfactorfactor, totalnumberofbets, wheeltype)