JuliaCollections / JuliaCollections/DataStructures.jl

Desired data structures

Open
#16 6 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Dominant language
Julia
Stars
745
Forks
261
PR merge metrics
No merged PRs in 30d

Description

I kind of have an itch to dig into a new data structure implementation, so I'm wondering what could be most useful, some ideas are:

  • Red-Black Trees
  • Suffix Array
  • Skip List
  • B-Tree, B+ Tree
  • Radix Tree
  • Splay tree

I think we could have an entire Trees.jl package, if the right abstractions could be ironed out, but I'm not feeling quite that ambitious, so it'd be better if there's a specific type that would be deemed highest priority.

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

The issue does not name files, tests, or an entry point; it lists several possible tree and array structures and asks which has highest priority. First get a maintainer decision on one specific structure and the desired abstractions, then define completion criteria before implementation begins.

Written by the indexing model from the issue text.

Assessment

Tech stack
julia
Domain
data
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
15/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.