hadley / hadley/data-diff

Actually understand HyUCC

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

Nobody has claimed this yet.

Dominant language
Rust
Stars
27
Forks
0
Avg merge
53m
Merged PRs (30d)
1

Description

Should spend at least half a day on this working it through.

Also should extend the algorithm for the old-new case. I think we start with the key from old, and then if it doesn't work on new, we either add or delete columns. Closely related to #24

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 file, test, or entry point is named. Start by reading the HyUCC algorithm discussion and the closely related issue #24, then trace how the old-new case is currently handled. Done means the algorithm is understood and its old-new behavior is extended consistently, with the relevant behavior verified by tests.

Written by the indexing model from the issue text.

Assessment

Tech stack
rust
Domain
data-engineering
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Quiet
Clarity
Needs clarification
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.