channable / channable/opsqueue

Strategies don't allow preferring certain submissions over others except for their age

Open
#95 1 comment 1 reaction 0 assignees View on GitHub
enhancement
Dominant language
Rust
Stars
96
Forks
2
Avg merge
1h 2m
Merged PRs (30d)
2

Description

https://github.com/channable/opsqueue/blob/78f1cc11fe0905d332a3f2fb47ef29f88afa034f/libs/opsqueue_python/src/common.rs#L102-L115

`Highest(meta_key)`/`Lowest(meta_key)`: Would make sense as this allows eating from one side of the key space

* We already have `Oldest`/`Newest`: effectively `Highest`/`Lowest` with `submission_time` as `meta_key`
* Priority based scheduling could be implemented using these strategies
* Underlying strategies could be used to move the needle further
* For high priority submissions you would prefer newest if latency is important
* For low priority submission you could prefer oldest, i.e. preferring finishing submitted work

Contributor guide

No contributing guide indexed for this repository

Research direction

Read libs/opsqueue_python/src/common.rs around lines 102-115, starting with the existing Oldest and Newest strategies. Trace how strategy metadata keys select submissions and define Highest(meta_key) and Lowest(meta_key) consistently with those strategies. Done means callers can select submissions by an arbitrary metadata key while retaining the existing age-based behavior.

Written by the indexing model from the issue text.

Assessment

Tech stack
rust
Domain
backend
Issue type
Feature
Difficulty
3/5
Estimated time
1-2 days
Activity status
Quiet
Clarity
Mostly clear
Newbie friendliness
55/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.