mirror of
https://github.com/restic/restic.git
synced 2024-08-21 20:03:23 +02:00
Since backend.ID is always a slice of constant length, use an array instead of a slice. Mostly, arrays behave as slices, except that an array cannot be nil, so use `*backend.ID` insteaf of `backend.ID` in places where the absence of an ID is possible (e.g. for the Subtree of a Node, which may not present when the node is a file node). This change allows to directly use backend.ID as the the key for a map, so that arbitrary data structures (e.g. a Set implemented as a map[backend.ID]struct{}) can easily be formed.
48 lines
899 B
Go
48 lines
899 B
Go
package repository
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"github.com/restic/restic/backend"
|
|
)
|
|
|
|
type Blob struct {
|
|
ID *backend.ID `json:"id,omitempty"`
|
|
Size uint64 `json:"size,omitempty"`
|
|
Storage *backend.ID `json:"sid,omitempty"` // encrypted ID
|
|
StorageSize uint64 `json:"ssize,omitempty"` // encrypted Size
|
|
}
|
|
|
|
type Blobs []Blob
|
|
|
|
func (b Blob) Valid() bool {
|
|
if b.ID == nil || b.Storage == nil || b.StorageSize == 0 {
|
|
return false
|
|
}
|
|
|
|
return true
|
|
}
|
|
|
|
func (b Blob) String() string {
|
|
return fmt.Sprintf("Blob<%s (%d) -> %s (%d)>",
|
|
b.ID.Str(), b.Size,
|
|
b.Storage.Str(), b.StorageSize)
|
|
}
|
|
|
|
// Compare compares two blobs by comparing the ID and the size. It returns -1,
|
|
// 0, or 1.
|
|
func (b Blob) Compare(other Blob) int {
|
|
if res := b.ID.Compare(*other.ID); res != 0 {
|
|
return res
|
|
}
|
|
|
|
if b.Size < other.Size {
|
|
return -1
|
|
}
|
|
if b.Size > other.Size {
|
|
return 1
|
|
}
|
|
|
|
return 0
|
|
}
|