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

The repository have a library to each common data structures algorithms like Doubly linked list, Generic trees, Queue, Stack... Each lib have a option to carry your custom data in elements, other cool resources.

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

A collection of small utilities for: data extraction (text or binary files), data buffering, message queue control, column addition, date/time manipulation, and data recovery testing.

Advanced C/C++ library(ACL) for UNIX-like OS and WIN32 OS, including sync/async/ssl iostream for net/file, thread pool, process pool, db pool, server framework, event, memory, string, array/hash/ring/list, xml and json parser, http/smtp/icmp protocol, SSL/TLS, C unit test, etc

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

libpseudo is a generic library which provides simple, thread-safe messaging between threads. It also provides a facility for implementing a run-time tunable, thread-like callback queue for single-threaded applications.

the c prototyping tools library provides thread-safe linked list, priority queue, hash table, hash list, AVL tree and trie implementations, as well as a thread pool and thread management framework, a tcp and http socket api, and a dbms abstraction layer.

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.

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.

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.

The latest version of libtap2 is now incorporated in the *libsxe* project, which is hosted on *github*. libtap2 is the Test Anything Protocol, version 2. C library for unit testing C (and C++) code. Backward compatible with the FreeBSD/CCAN version,

(To pronounce, just say the letter: AAY WHY QUEUE.) A collection of high-level models and utility code applicable to interactive applications. e.g. Fixed/variable timestep timing, state machine, etc.

General utility code for queuing and simple index tables for embedded software projects. It also includes async I/O sample code using pthreads.

GCS - General Computing Solutions. C library with Hash Tables, Binary AVL Tree, Memory Chunks, Single Linked Lists, Double Linked Lists, Memory Chunk Queue, Base64, Misc.

Libcfu is a library of tools that I have found useful, particularly when developing multithreaded software. It includes a hash table, a linked list, self-extending strings, a config file parser, a simple timer, a thread queue, and command-line parser.

A Generic Data Structures Library. A collection of data structures you're most likely to need. Written in ANSI C. Interface is basic, but powerful, and intuitive. Has AVL tree, binary heap, queue/linked list, and more. All platforms.

it is used to fetch several System V IPC message queue infos, which ordinary implementation of ipcs didn\'t provide, e.g. scanning the system for active queues or. also, it comes with a tool to creat/destroy message queues and send messages over them.