Search Results for "queue"

... - Examples: use of flexible variable ArgList (OnePointerArg, optional valid if not NULL, Argument-Type by ID-Number is easy to get), key-value pairs, build FIFO{queue}/LIFO{stack}, auto-list with max. Element-Size and chronological order. Use malloc{slower-but-easy} or fix (static) memory. - OAList01: Object-Kind of a predefined pre-reserved List with X Elements (with constant user-data size), with secur modify functions and option to use locks (POSIX: mutex). Supporting a BusyList and a IdleList for easy build of e.g. a FIFO without need of much time for mem-allocation...

Portable, stand-alone C libraries and data structures. Each folder is stand-alone with a single header/source pair in it. There is no build for libraries, just copy files you want. e.g If you want the logger, copy sc_log.h and sc_log.c to your project. High performance & minimal memory usage. Portability between many operating systems and architectures. Tests with 100% branch coverage and multiple sanitizers. Drag & drop source code distribution. There is 100% branch coverage on Linux....

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

.... ======================================================================================= The goal of qLibc project is providing general purpose complete C/C++ library which includes all kinds of containers and general library routines. For example, it contains Doubly Linked List, List Table, Hash Table, Vector, Queue, Stack and more.

Singly Linked-list - Doubly Linked-list - Stack - Queue - Deque - Generic Tree - AVL Tree - RB Tree

This library can be used, to take advantage of SMP systems, protect your program from crashes, upgrade/downgrade functionality on the fly without stopping your main program, test unsafe code/new versions.

The embedded Buffer Pool Manager (eBPM) supports the creation of pools of fixed buffer sizes. The user may allocate a buffer from the pool and queue to any other pool. A freed buffer is returned to its original pool.

This project is an userland library implementation of the Task Queue facility in the OpenSolaris kernel that simplifies thread management. Task Queues are somewhat similar to dispatch queues in Grand Central Dispatch but are more flexible.