Download the PHP package netlogix/jobqueue-polling without Composer
On this page you can find all versions of the php package netlogix/jobqueue-polling. It is possible to download/install these versions without Composer. Possible dependencies are resolved automatically.
Download netlogix/jobqueue-polling
More information about netlogix/jobqueue-polling
Files in netlogix/jobqueue-polling
Package jobqueue-polling
Short Description Shared poll scheduler for ReactPHP based job workers
License MIT
FAQ
Example:
In general, it is recommended to use always a project to download your libraries. In an application normally there is more than one library needed.
- Some hosting areas are not accessible by a terminal or SSH. Then it is not possible to use Composer.
- To use Composer is sometimes complicated. Especially for beginners.
- Composer needs much resources. Sometimes they are not available on a simple webspace.
- If you are using private repositories you don't need to share your credentials. You can set up everything on our site and then you provide a simple download link to your team member.
- Simplify your Composer build process. Use our own command line tool to download the vendor folder as binary. This makes your build process faster and you don't need to expose your credentials for private repositories.
Informations about the package jobqueue-polling
Netlogix.JobQueue.Polling
This package provides a small, dependency-free poll scheduler for ReactPHP based job workers.
There are two main goals:
- Poll for new work on a baseline interval without burning CPU when idle.
- Pick up freed capacity immediately after a job finishes, without waiting for the next interval — while never starting more work in parallel than allowed.
It is the shared polling core used by both Netlogix.JobQueue.FastRabbit (one job at
a time per worker) and Netlogix.JobQueue.Scheduled (N jobs in parallel).
Installation
The problem it solves
A naive worker either polls aggressively (high CPU even when there is nothing to do) or only on a slow interval (low throughput, because a freed slot waits up to one interval before the next job is picked up).
PollScheduler combines a periodic baseline poll with an on-demand "immediate" poll
that callers trigger when a job completes. Immediate polls are coalesced to a single
pending future tick, and every poll is gated by a capacity check, so a burst of
completions racing the periodic timer can never start more work than capacity allows.
The correctness invariant: the capacity check and the slot occupation done inside
$tryToPickUpWork run synchronously within a single, uninterrupted loop frame
(ReactPHP is single threaded, no await in between). Therefore any number of stacked
or racing polls collapse to "fill up to capacity, then bail".
Usage
PollScheduler is DI-free — instantiate it with new or the static create()
factory, also from a standalone worker binary that has no Flow object management.
$tryToPickUpWork is responsible for respecting capacity itself. The two canonical
shapes:
- Single concurrency (FastRabbit):
hasCapacity: fn () => count($pool) === 0, andtryToPickUpWorkreserves exactly one job when free. - N concurrency (Scheduled):
hasCapacity: fn () => count($pool) < $parallel, andtryToPickUpWorkdrains in awhile (count($pool) < $parallel)loop.
The scheduler's own capacity pre-check is an early-out; the callback's internal limit is the authoritative bound.
API
PollScheduler::create(LoopInterface $loop, Closure $tryToPickUpWork, Closure $hasCapacity, float $interval): static/ equivalent constructor.start(): self— register the periodic baseline poll.requestImmediatePoll(): void— request an out-of-band poll as soon as possible; coalesced to at most one pending future tick.stop(): void— cancel the baseline poll and stop picking up further work (drain phase); does not stop the event loop.
