Use a queue to communicate matches from browse to matches #202
Labels
No Milestone
No project
No Assignees
1 Participants
Notifications
Due Date
No due date set.
Dependencies
No dependencies set.
Reference: wojtek/musichoard#202
Loading…
Reference in New Issue
Block a user
No description provided.
Delete Branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Currently browse does a full fetch and only once it's done it passes the items to matches. This means that matches needs to be able to handle an entire vector (which may be empty) at all times slightly complicating the code. It would be better if it could operate on a queue instead and operate on one item at a time.
Something similar to an event queue would be good. The event queue itself cannot be used because any item on the queue triggers an event regardless of whether the system is ready for it.
Use https://doc.rust-lang.org/std/sync/mpsc/index.html