#job-queue #queue #graph #minimalist #data #single

miniqueue

A minimalistic single-thread job queue based on fold/reduce

3 releases

0.1.2 Jan 30, 2022
0.1.1 Jan 6, 2020
0.1.0 Dec 2, 2019

#1864 in Data structures

Download history 18/week @ 2024-02-26 51/week @ 2024-04-01

51 downloads per month

MIT license

7KB
82 lines

miniqueue

A minimalist generic multi-threaded queue that aggregates results and populates the queue with more tasks.

The semantics are the opposite of fold/reduce: instead of starting with a bunch of data, it starts with a single data point and recursively traverses it to unfold a bigger structure.

It is useful when working with dependency graphs. It can be used by compilers, package managers and linkers/bundlers.

Usage

Here's a simple example:

let all_results = miniqueue::run(first_job, |job| {
    let (result, more_jobs) = run_job(job)
    (result, more_jobs)
});

Pass the first job that should be run as the first parameter.

The second parameter is a closure that receives the job and executes it, and should return a tuple containing:

  • The job result
  • A vector with more jobs to be executed in the next iterations

All the jobs returned in the vector will be enqueued to be executed later. Notice that jobs that were already executed in the past will not be scheduled again.

The end result of run itself is a HashMap aggregating jobs and job results.

Both the job and job result are generic types, so they can be anything you want.

Here's a test case with a self-contained example:

use miniqueue;

let result = run(1, |num| {
    match num {
        1 => Ok(("one", vec![ 2 ])),
        2 => Ok(("two", vec![])),
        _ => Ok(("", vec![]))
    }
});

assert_eq!(result.unwrap().get(&1), Some(&"one"));

LICENSE

Copyright (c) 2019 Silvio Henrique Ferreira

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

No runtime deps