diff options
author | Florian Klink <flokli@flokli.de> | 2023-12-09T13·22+0200 |
---|---|---|
committer | clbot <clbot@tvl.fyi> | 2023-12-11T10·24+0000 |
commit | 459d9e106f68ea2761ee2dcaaa28e67756d6bdc3 (patch) | |
tree | 46aa68022f1b41aa2e66977073c5cf41d585894a /tvix/castore-go/castore.pb.go | |
parent | db3ef5255fd6f6c4c4ac0e9077803a9eb70e63d9 (diff) |
chore(tvix/castore/protof): buf format r/7149
Change-Id: Idf11de78b0d6eca69fda34a89f2c57a00ed89ad5 Reviewed-on: https://cl.tvl.fyi/c/depot/+/10237 Autosubmit: flokli <flokli@flokli.de> Tested-by: BuildkiteCI Reviewed-by: Adam Joseph <adam@westernsemico.com>
Diffstat (limited to 'tvix/castore-go/castore.pb.go')
-rw-r--r-- | tvix/castore-go/castore.pb.go | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/tvix/castore-go/castore.pb.go b/tvix/castore-go/castore.pb.go index f792a5d3905b..ab39f1fda118 100644 --- a/tvix/castore-go/castore.pb.go +++ b/tvix/castore-go/castore.pb.go @@ -24,8 +24,8 @@ const ( ) // A Directory can contain Directory, File or Symlink nodes. -// Each of these nodes have a name attribute, which is the basename in that directory -// and node type specific attributes. +// Each of these nodes have a name attribute, which is the basename in that +// directory and node type specific attributes. // The name attribute: // - MUST not contain slashes or null bytes // - MUST not be '.' or '..' @@ -108,14 +108,14 @@ type DirectoryNode struct { Digest []byte `protobuf:"bytes,2,opt,name=digest,proto3" json:"digest,omitempty"` // Number of child elements in the Directory referred to by `digest`. // Calculated by summing up the numbers of `directories`, `files` and - // `symlinks`, and for each directory, its size field. Used for inode - // number calculation. + // `symlinks`, and for each directory, its size field. Used for inode number + // calculation. // This field is precisely as verifiable as any other Merkle tree edge. - // Resolve `digest`, and you can compute it incrementally. Resolve the - // entire tree, and you can fully compute it from scratch. + // Resolve `digest`, and you can compute it incrementally. Resolve the entire + // tree, and you can fully compute it from scratch. // A credulous implementation won't reject an excessive size, but this is - // harmless: you'll have some ordinals without nodes. Undersizing is - // obvious and easy to reject: you won't have an ordinal for some nodes. + // harmless: you'll have some ordinals without nodes. Undersizing is obvious + // and easy to reject: you won't have an ordinal for some nodes. Size uint64 `protobuf:"varint,3,opt,name=size,proto3" json:"size,omitempty"` } |