type mapEntry struct { uid uint64 // if plist is filled, then corresponds to plist's uid. key []byte plist []byte }
(key []byte, p *pb.Posting)
| 80 | // } |
| 81 | |
| 82 | func mapEntrySize(key []byte, p *pb.Posting) int { |
| 83 | return 8 + 4 + 4 + len(key) + proto.Size(p) // UID + keySz + postingSz + len(key) + size(p) |
| 84 | } |
| 85 | |
| 86 | func marshalMapEntry(dst []byte, uid uint64, key []byte, p *pb.Posting) { |
| 87 | if p != nil { |
no test coverage detected
searching dependent graphs…