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

...By batching DOM access we avoid unnecessary document reflows and dramatically speed up layout performance. Each measure/mutate job is added to a corresponding measure/mutate queue. The queues are emptied (reads, then writes) at the turn of the next frame using window.requestAnimationFrame. FastDom aims to behave like a singleton across all modules in your app. When any module requires 'fastdom' they get the same instance back, meaning FastDom can harmonize DOM access app-wide. Potentially a third-party library could depend on FastDom, and better integrate within an app that itself uses it. ...

Based on boost. Thread:mutex-condition queue and map,ACE style thread and Glib style thread pool, loop task. Memory:memory pool. COM:COM object invocation. Language:compiler lexical and grammar analysis. Network:epoll reactor.

SennMagic, a small bundle of open source Java classes with handy and fun methods by Bart Thierens.

QueueReaders are persistent, stateful server-like objects, without sockets. Clients queue requests for later processing. Based on Offsiders, uses flexible object-oriented message passing. Useful for coordinating the activity of system components

This is a C++ implementation of a lock free priority queue that is well suited for multiprocessor systems.