shithub: furgit

ref: 3ce59c3248dec0eb0f918c42f37f53bc2ac20425
dir: /diff/trees/diff_recursive.go/

package trees

import (
	objectid "codeberg.org/lindenii/furgit/object/id"
	"codeberg.org/lindenii/furgit/object/tree"
)

func diffRecursive(a, b *tree.Tree, prefix []byte, readTree func(objectid.ObjectID) (*tree.Tree, error), out *[]Entry) error {
	if a == nil && b == nil {
		return nil
	}

	if a == nil {
		for i := range b.Entries {
			entry := &b.Entries[i]
			full := joinPath(prefix, entry.Name)

			*out = append(*out, Entry{Path: full, Kind: EntryKindAdded, Old: nil, New: entry})
			if entry.Mode != tree.FileModeDir {
				continue
			}

			sub, err := readTree(entry.ID)
			if err != nil {
				return err
			}

			err = diffRecursive(nil, sub, full, readTree, out)
			if err != nil {
				return err
			}
		}

		return nil
	}

	if b == nil {
		for i := range a.Entries {
			entry := &a.Entries[i]
			full := joinPath(prefix, entry.Name)

			*out = append(*out, Entry{Path: full, Kind: EntryKindDeleted, Old: entry, New: nil})
			if entry.Mode != tree.FileModeDir {
				continue
			}

			sub, err := readTree(entry.ID)
			if err != nil {
				return err
			}

			err = diffRecursive(sub, nil, full, readTree, out)
			if err != nil {
				return err
			}
		}

		return nil
	}

	i := 0

	j := 0
	for i < len(a.Entries) && j < len(b.Entries) {
		left := &a.Entries[i]
		right := &b.Entries[j]

		cmp := tree.TreeEntryNameCompare(
			left.Name,
			left.Mode,
			right.Name,
			right.Mode == tree.FileModeDir,
		)
		switch {
		case cmp < 0:
			full := joinPath(prefix, left.Name)

			*out = append(*out, Entry{Path: full, Kind: EntryKindDeleted, Old: left, New: nil})
			if left.Mode == tree.FileModeDir {
				sub, err := readTree(left.ID)
				if err != nil {
					return err
				}

				err = diffRecursive(sub, nil, full, readTree, out)
				if err != nil {
					return err
				}
			}

			i++
		case cmp > 0:
			full := joinPath(prefix, right.Name)

			*out = append(*out, Entry{Path: full, Kind: EntryKindAdded, Old: nil, New: right})
			if right.Mode == tree.FileModeDir {
				sub, err := readTree(right.ID)
				if err != nil {
					return err
				}

				err = diffRecursive(nil, sub, full, readTree, out)
				if err != nil {
					return err
				}
			}

			j++
		default:
			full := joinPath(prefix, left.Name)

			modified := left.Mode != right.Mode || left.ID != right.ID
			if modified {
				*out = append(*out, Entry{Path: full, Kind: EntryKindModified, Old: left, New: right})
			}

			if left.Mode == tree.FileModeDir && right.Mode == tree.FileModeDir && left.ID != right.ID {
				leftSub, err := readTree(left.ID)
				if err != nil {
					return err
				}

				rightSub, err := readTree(right.ID)
				if err != nil {
					return err
				}

				err = diffRecursive(leftSub, rightSub, full, readTree, out)
				if err != nil {
					return err
				}
			}

			i++
			j++
		}
	}

	for ; i < len(a.Entries); i++ {
		left := &a.Entries[i]
		full := joinPath(prefix, left.Name)

		*out = append(*out, Entry{Path: full, Kind: EntryKindDeleted, Old: left, New: nil})
		if left.Mode == tree.FileModeDir {
			sub, err := readTree(left.ID)
			if err != nil {
				return err
			}

			err = diffRecursive(sub, nil, full, readTree, out)
			if err != nil {
				return err
			}
		}
	}

	for ; j < len(b.Entries); j++ {
		right := &b.Entries[j]
		full := joinPath(prefix, right.Name)

		*out = append(*out, Entry{Path: full, Kind: EntryKindAdded, Old: nil, New: right})
		if right.Mode == tree.FileModeDir {
			sub, err := readTree(right.ID)
			if err != nil {
				return err
			}

			err = diffRecursive(nil, sub, full, readTree, out)
			if err != nil {
				return err
			}
		}
	}

	return nil
}