unisonweb/unison

Compute minimum unique hash prefix length for branches

Open

#843 opened on Oct 4, 2019

View on GitHub
 (7 comments) (0 reactions) (0 assignees)Haskell (304 forks)batch import
codebase-manager / ucmgood first issuehelp wanted

Repository metrics

Stars
 (6,624 stars)
PR merge metrics
 (Avg merge 12d 19h) (6 merged PRs in 30d)

Description

Related to #842, but can be done out of order.

Add a member like:

branchHashLength :: Int

which should return the smallest number of base32hex characters necessary to uniquely identify any known branch hash by prefix, in some way that doesn't do O(n) work on every call.

Contributor guide

Research direction
Examine the Branch data type and its hash structure. Look at how hashes are stored and how to compute a minimal prefix length that is unique across all branches. Consider using a hash set or a trie to avoid O(n) calls.
Tech stack
None
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
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
GitHaskell
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
75