Search Results for "binary"

This library provides an implementation of tables indexed by strings. The binary search is used for names of known length. It is also possible to search a table for names of unknown length, i.e. to parse a string using some table. Table elements can be of any private type. Key- insensitive tables are supported.

Aleph-w is a library of data structures and algorithms implemented in and for C++. It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that allows to free deleted entries. Dynamic linear hash tables are implemented too. ...

...The library can also be used to just create a multipart MIME message body. Also comes with a command line application (quickmail) for sending mails (mutiple attachments supported) from command line or scripts. Cross-platform. Binary packages available for Windows (32-bit and 64-bit).

The libbuspirate is a C library to talk with the bus pirate hardware (http://dangerousprototypes.com/docs/Bus_Pirate) in raw, binary scripting mode. The libbuspirate allows to quickly write a short C program to test interfacing with your favorite hardware. The library has mainly be used to interface through SPI with RF transceivers such as CC2500, MRF24J40, Ethernet controller such as ENC28J60, EEPROMs such as 24C02, 24FC1025, LCD display (PCD8544 / Nokia5110), LED display (HT1632), ... ...

Struct-Pie (Structures Pie) is a set of C shared libraries to implement data structures and algorithms so that they can be used/integrated easily into C projects. LIFO & FIFO Stack, Binary Search Tree, Priority Queue and a Hash Table are implemented and included in this package. Future releases will have many other data structures. The hash table in this package uses separate chaining to avoid collision. In the "hash_table" directory, the hash table implementation uses linked lists. While in "HashBSTree" directory, a hash table with a binary tree in each index is implemented for faster lookup in large data. ...

A hash table library that can store binary data. It is thread safe and you can use as many hash tables in your program as you wish because each has its own context. You can drop items from the hash table and can expire items that have become too old. String keys are default, but with your own comparison routine you can use binary or specialty keys. If you have special needs you can substitute your on hash calculation function for the built in one.

...This package contains libengsas linked against KDE, so you should install this package instead of libengsas0, if you want to enable the internal KDE usage of libengsas Binary and source packages for many Linux distributions can be found at http://download.opensuse.org/repositories/home:/engsas The source code documentation can be found at http://trac.engsas.de/libengsas/doxygen.

The goal of this project - to create a TinySCHEME binaries for some kind of platforms. Now there are binaries for DOS / DJGPP and MinGW / MSYS / Win32, working on x86 architecture.