Skip to content
This repository was archived by the owner on Sep 11, 2020. It is now read-only.

plumbing/idxfile: object iterators returns entries in offset order #927

Merged
merged 1 commit into from
Aug 21, 2018
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
69 changes: 69 additions & 0 deletions plumbing/format/idxfile/idxfile.go
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,7 @@ package idxfile
import (
"bytes"
"io"
"sort"

"gopkg.in/src-d/go-git.v4/plumbing"
"gopkg.in/src-d/go-git.v4/utils/binary"
Expand Down Expand Up @@ -34,6 +35,9 @@ type Index interface {
Count() (int64, error)
// Entries returns an iterator to retrieve all index entries.
Entries() (EntryIter, error)
// EntriesByOffset returns an iterator to retrieve all index entries ordered
// by offset.
EntriesByOffset() (EntryIter, error)
}

// MemoryIndex is the in memory representation of an idx file.
Expand Down Expand Up @@ -215,6 +219,36 @@ func (idx *MemoryIndex) Entries() (EntryIter, error) {
return &idxfileEntryIter{idx, 0, 0, 0}, nil
}

// EntriesByOffset implements the Index interface.
func (idx *MemoryIndex) EntriesByOffset() (EntryIter, error) {
count, err := idx.Count()
if err != nil {
return nil, err
}

iter := &idxfileEntryOffsetIter{
entries: make(entriesByOffset, count),
}

entries, err := idx.Entries()
if err != nil {
return nil, err
}

for pos := 0; int64(pos) < count; pos++ {
entry, err := entries.Next()
if err != nil {
return nil, err
}

iter.entries[pos] = entry
}

sort.Sort(iter.entries)

return iter, nil
}

// EntryIter is an iterator that will return the entries in a packfile index.
type EntryIter interface {
// Next returns the next entry in the packfile index.
Expand Down Expand Up @@ -276,3 +310,38 @@ type Entry struct {
CRC32 uint32
Offset uint64
}

type idxfileEntryOffsetIter struct {
entries entriesByOffset
pos int
}

func (i *idxfileEntryOffsetIter) Next() (*Entry, error) {
if i.pos >= len(i.entries) {
return nil, io.EOF
}

entry := i.entries[i.pos]
i.pos++

return entry, nil
}

func (i *idxfileEntryOffsetIter) Close() error {
i.pos = len(i.entries) + 1
return nil
}

type entriesByOffset []*Entry

func (o entriesByOffset) Len() int {
return len(o)
}

func (o entriesByOffset) Less(i int, j int) bool {
return o[i].Offset < o[j].Offset
}

func (o entriesByOffset) Swap(i int, j int) {
o[i], o[j] = o[j], o[i]
}
15 changes: 15 additions & 0 deletions plumbing/format/idxfile/idxfile_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -115,6 +115,21 @@ func (s *IndexSuite) TestFindHash(c *C) {
}
}

func (s *IndexSuite) TestEntriesByOffset(c *C) {
idx, err := fixtureIndex()
c.Assert(err, IsNil)

entries, err := idx.EntriesByOffset()
c.Assert(err, IsNil)

for _, pos := range fixtureOffsets {
e, err := entries.Next()
c.Assert(err, IsNil)

c.Assert(e.Offset, Equals, uint64(pos))
}
}

var fixtureHashes = []plumbing.Hash{
plumbing.NewHash("303953e5aa461c203a324821bc1717f9b4fff895"),
plumbing.NewHash("5296768e3d9f661387ccbff18c4dea6c997fd78c"),
Expand Down
2 changes: 1 addition & 1 deletion plumbing/format/packfile/packfile.go
Original file line number Diff line number Diff line change
Expand Up @@ -394,7 +394,7 @@ func (p *Packfile) GetByType(typ plumbing.ObjectType) (storer.EncodedObjectIter,
plumbing.TreeObject,
plumbing.CommitObject,
plumbing.TagObject:
entries, err := p.Entries()
entries, err := p.EntriesByOffset()
if err != nil {
return nil, err
}
Expand Down