Showing 6 open source projects for "queue"

View related business solutions
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • Incredable is the first DLT-secured platform that allows you to save time, eliminate errors, and ensure your organization is compliant all in one place. Icon
    Incredable is the first DLT-secured platform that allows you to save time, eliminate errors, and ensure your organization is compliant all in one place.

    For healthcare Providers and Facilities

    Incredable streamlines and simplifies the complex process of medical credentialing for hospitals and medical facilities, helping you save valuable time, reduce costs, and minimize risks. With Incredable, you can effortlessly manage all your healthcare providers and their credentials within a single, unified platform. Our state-of-the-art technology ensures top-notch data security, giving you peace of mind.
    Learn More
  • 1

    Lnkdlst

    Single sided linked list (kind of lib with test-code, C, C++ and java)

    ... - 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...
    Downloads: 2 This Week
    Last Update:
    See Project
  • 2
    FastDom

    FastDom

    Eliminates layout thrashing by batching DOM measurement

    ...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. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    SennMagic
    SennMagic, a small bundle of open source Java classes with handy and fun methods by Bart Thierens.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Network Management Software and Tools for Businesses and Organizations | Auvik Networks Icon
    Network Management Software and Tools for Businesses and Organizations | Auvik Networks

    Mapping, inventory, config backup, and more.

    Reduce IT headaches and save time with a proven solution for automated network discovery, documentation, and performance monitoring. Choose Auvik because you'll see value in minutes, and stay with us to improve your IT for years to come.
    Learn More
  • 5
    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
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    This is a C++ implementation of a lock free priority queue that is well suited for multiprocessor systems.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next