FIFO versus LIFO
Nobody has claimed this yet.
- Dominant language
- C#
- Stars
- 128
- Forks
- 37
- PR merge metrics
- No merged PRs in 30d
Description
Thanks for this useful package!
As I understand it, this queue works like a FIFO (first in first out) buffer. Did you consider an option to make it a LIFO (last in first out) buffer? This would be a useful option in our application since we wish to send the most recent data in the queue first. In the event of a long network outage, the queue could become quite large and waiting to clear the queue before seeing the latest data is not ideal.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No file or test is named in the issue. Start by locating the persistent queue API and its existing FIFO behavior, then determine how a LIFO option should be exposed. Done should mean that the newest queued data is returned first during a backlog, with behavior covered by tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- csharp
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 30/100