lspitzner / lspitzner/pqueue

Add strict mapping functions

Open
#60 1 comment 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

enhancement
Dominant language
Haskell
Stars
17
Forks
12
PR merge metrics
No merged PRs in 30d

Description

Since the queues are mostly strict, mapping in general is pretty slow, but lazy maps are egregiously so: they fill the structure with one thunk per element. Let's add strict versions that at least *accomplish* something for the work they do.

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

No files or tests are named. Start by locating the existing lazy mapping functions and the priority queue representation, then determine where strict variants belong. Done means strict mapping functions are available and their behavior and performance are covered by appropriate tests.

Written by the indexing model from the issue text.

Assessment

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

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.