all repos — legit @ 3060c752f8bbc4852939ee7f15732e9752d0c6ec

web frontend for git

sort tags and deduplicate

This sorts the tags reverse-chronologically.

If any tags have the same name (shouldn't happen but it does in some of my
repos), we use whichever one is "newer".

Signed-off-by: Derek Stevens <nilix@nilfm.cc>
Derek Stevens nilix@nilfm.cc
Tue, 31 Jan 2023 21:29:38 -0700
commit

3060c752f8bbc4852939ee7f15732e9752d0c6ec

parent

e782f36f196006f4fad6747811a5c883151e5102

1 files changed, 28 insertions(+), 0 deletions(-)

jump to
M git/git.gogit/git.go

@@ -2,6 +2,7 @@ package git

import ( "fmt" + "sort" "github.com/go-git/go-git/v5" "github.com/go-git/go-git/v5/plumbing"

@@ -11,6 +12,21 @@

type GitRepo struct { r *git.Repository h plumbing.Hash +} + +type TagList []*object.Tag + +func (self TagList) Len() int { + return len(self) +} + +func (self TagList) Swap(i, j int) { + self[i], self[j] = self[j], self[i] +} + +// sorting tags in reverse chronological order +func (self TagList) Less(i, j int) bool { + return self[i].Tagger.When.After(self[j].Tagger.When) } func Open(path string, ref string) (*GitRepo, error) {

@@ -94,9 +110,21 @@

tags := []*object.Tag{} _ = ti.ForEach(func(t *object.Tag) error { + for i, existing := range tags { + if existing.Name == t.Name { + if t.Tagger.When.After(existing.Tagger.When) { + tags[i] = t + } + return nil + } + } tags = append(tags, t) return nil }) + + var tagList TagList + tagList = tags + sort.Sort(tagList) return tags, nil }