Sit - Git implementation in Scala

Checkout this new project where I record myself implementing git

This project is a playground to experiment with domain modeling, algorithms, data structures and functional effects.

Git internals highlights

Source: https://git-scm.com/book/en/v2/Git-Internals-Plumbing-and-Porcelain

Objects

Git uses the concept of Object. There 3 types of object:

blobs. A blob basically represents the content of a file. It is stored in a file named after the hash of the content.
trees. Trees are used to represent the hierarchy between blobs. A tree contains blobs and other trees with their names. For instance :

100644 blob dc711f442241823069c499197accce1537f30928    .gitignore
100644 blob e5d351c3cd44aa1d8c1cb967c7e7fde1dee4b0ad    README.md
100644 blob 7a010b786eb29b895ba5799306052b996516d63b    build.sbt
040000 tree 8bac5f27882165d313f5732bb4f140003156c693    project
040000 tree 163727ec9bd17ef32ee088a52a31fe0b483fa18f    src

commits. Commits are used to capture :
- the tree snapshot of the code
- the parent(s) commits. Usually a commit has only one parent, but it can have 0 to n parents. The first commit does not have any parent. A merge commit has several parents (usually 2).
- the author
- the commiter
- a blank line
- the commit message

Those files are stored in .git/objects.

Useful git commands:

git cat-file show information about an object
- -p <hash> show the content of an object. hash can be master^{tree} to reference the tree object pointed to the last version of master.
- -t <hash> show the type of object
git hash-object (explicit)
git update-index Register file contents in the working tree to the index
git write-tree

References

Working with hashes is not handy, so the concept of Reference was introduced. Here are different types of reference:

HEAD is a special kind of reference. It stores the current branch being used. In some cases (when a specific commit is checked-out for instance), it can be referencing commit hash. This is called "detached head".
heads. Heads are used to reference the last commit (hash) of a branch.
tags
remotes

Useful git commands:

git update-ref refs/heads/master <hash>

Details of features

Model

CQRS - Commands

CommitCommand and CommitCommandHandler

Katas / Dojo

As this project covers a lot of different skills (domain modeling, algorithms, data structures, CQRS/ES, functional effects, etc.), it is a great opportunity to share some knowledge.

Here are the details of the 1h katas/dojos organized using this project :

#1 Implementing `ShowChangeService` (algorithm)

The idea of this kata is to implement the function ShowChangeService.show(init: String, change: Change): String . The goal of this function is to replicate the output of git diff (line added with + and line removed with a - at the beginning).

The challenge here is to make sure that you are not interleaving line added and line removed. The expected behevior is that every block of line added should be added after a block of line removed.

Here is the test

#2 Exploring Commit domain model (domain modeling)

The idea of this kata is to start to explore how commits can be modeled and start to think about commit event sourcing. How to represent a single commit? What are the main properties of a commit? Is there different types of commit?

Here is the code

#3 Commit Event Sourcing (folding, event sourcing and domain modeling)

The idea of this kata would be to continue the work done in the previous kata (domain modeling of a commit) in order to handle a collection of commit.

To simplify, we are going to work only with one file. The goal is to implement a function that take a list of changes and that returns the file as an output.

It would be the opportunity to cover a bit of domain modeling (how to represent a collection of commit) and event sourcing (implementation of applying commits)

Here is the code

Here is the test

#4 Group by consecutive values (algorithm)

As far as I know, when git is displaying changes, it groups consecutive line removed together. After the block of line removed, line added are displayed. This is part of kata #1 that we did not have time to do.

Line removed is represented as SortedSet[Int]. The goal is to write the function that is going to create List[SortedSet[Int]] where the list contains set composed only of consecutive numbers.

The challenge here is to write an easily understandable function the has a correct time complexity (O(n)).

Example :

val input = SortedSet(1,2,3,10,11,12,60)
val output = List(SortedSet(1,2,3), SortedSet(10,11,12), SortedSet(60))

Here is the code

Here is the test

5# Git Status Query 1/2 (tail recursion, collections, breadth-first search)

We implemented the function to scan the file system.

Here is the code

Data-structures

`IndexedList[T]`

This abstraction purpose is to deal with insertion and deletion of lines at some index. For the moment, the implementation is using a (Linked)List which is convenient because it is ordered and the insertion shifts all the indexes (line number in our case). However, in terms of performance, it is probably not the best.

Main operations :

get(idx: Int): Option[T]
delete(idx: Int): IndexedList[T]
insertAt(idx: Int, t: T): IndexedList[T]
update(idx: Int, f: T => T): IndexedList[T]

Sources

How different are different diff algorithms in Git? https://link.springer.com/article/10.1007/s10664-019-09772-z

Dnomyar/sit

ErrorLooks like something went wrong!

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Error
Looks like something went wrong!

Packages