haskell-nix/hnix

Check lazyness of datastructures

Open

#1,057 opened on Feb 10, 2022

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Nix (116 forks)github user discovery
good first issue

Repository metrics

Stars
 (835 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

It is probably beneficial to default to Strict data types, before constructing the case to convert them to Lazy.

A number of places in the code use Lazy data types, which seems like by accident (do not remember any mentions why lazy containers are used).

A bunch of places probably use Lazy data structures, where Strict would be a better fit.

Contributor guide

Research direction
Examine each use of lazy data structures in hnix source, test performance and correctness with strict equivalents, and propose changes where beneficial.
Tech stack
haskell
Domain
backend
Issue type
Refactor
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
Haskell
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
40