Search Results for "fifo"

The library provides generic FIFO ring buffer implementation.

The Simple components for Ada library provides implementations of smart pointers for automatically collected objects (using reference counting), object persistence, unbounded and bounded arrays of smart pointers, generic unbounded arrays of private objects and plain pointers, generic sets, maps, arbitrary precision arithmetic, B-trees, directed graphs, directed weighted graphs, stacks, and storage pools. It also includes table management, string editing, IEEE 754 support, and infix...

A Ring-Buffer instance could be used with element types - char - long - long long - void* . Focus is on a hardened SW structure with buffer-instance-pointer check (not very fast but more secure). Some features are globally choosable on compile-time (e.g. switch multithread support off completely to have faster access). Note: User Interface is for Test and Tutor Code only.

...Main list-linkage-change functions: append, insert, delete. - 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...

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

缓存是服务器程序中经常用到的技术，使用缓存可以大大降低服务器的压力。目前常见的缓存工具都很好地解决了生命周期、存储、命中率等关键算法，但是绝大多数的缓存框架对于数据更新都是阻塞式的，即当缓存过期时会等待应用程序重新获取值，用户在使用系统的过程中将产生顿挫感。 NCache建立了一套抽象的非阻塞式缓存模型与API， 使用NCache仅需在首次加载数据时停顿，此后的更新都将在后台线程完成。 使用NCache至少具有以下两个好处： 1.用户具有平滑的页面体验 2.访问压力将在应用堆积并适当溢出，缓解了对数据服务的集中请求压力

C library to quickly implement streaming communication between parallel threads. Optimized for use in embedded systems. Allows FIFO behavior as well as separate data access and synchronization. NOTE: development has moved to the vfTasks project.

The List Libs contain some simple list and map systems written in C++. They all use template thus they are type independent.