RepoMirrors/prometheus
1
0
Fork 0
mirror of https://github.com/prometheus/prometheus synced 2025-01-28 02:12:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

Rename bytePostings To bigEndianPostings

Browse Source 
* To be more specific about the contents of the byte slice.
This commit is contained in:
Goutham Veeramachaneni 2017-03-27 14:04:42 +05:30
parent efb0dfe1be
commit 7b94a4e17d
No known key found for this signature in database
GPG Key ID: F1C217E8E9023CAD
2 changed files with 10 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
index.go
View File

@ -702,7 +702,7 @@ func (r *indexReader) Postings(name, value string) (Postings, error) {
if len(b)%4 != 0 { if len(b)%4 != 0 {
return nil, errors.Wrap(errInvalidSize, "plain postings entry") return nil, errors.Wrap(errInvalidSize, "plain postings entry")
} }
return newBytePostings(b), nil return newBigEndianPostings(b), nil
} }
type stringTuples struct { type stringTuples struct {

16
postings.go
View File

@ -241,26 +241,28 @@ func (it *listPostings) Err() error {
return nil return nil
} }
type bytePostings struct { // bigEndianPostings implements the Postings interface over a byte stream of
// big endian numbers.
type bigEndianPostings struct {
list []byte list []byte
idx int idx int
} }
func newBytePostings(list []byte) *bytePostings { func newBigEndianPostings(list []byte) *bigEndianPostings {
return &bytePostings{list: list, idx: -1} return &bigEndianPostings{list: list, idx: -1}
} }
func (it *bytePostings) At() uint32 { func (it *bigEndianPostings) At() uint32 {
idx := 4 * it.idx idx := 4 * it.idx
return binary.BigEndian.Uint32(it.list[idx : idx+4]) return binary.BigEndian.Uint32(it.list[idx : idx+4])
} }
func (it *bytePostings) Next() bool { func (it *bigEndianPostings) Next() bool {
it.idx++ it.idx++
return it.idx*4 < len(it.list) return it.idx*4 < len(it.list)
} }
func (it *bytePostings) Seek(x uint32) bool { func (it *bigEndianPostings) Seek(x uint32) bool {
num := len(it.list) / 4 num := len(it.list) / 4
// Do binary search between current position and end. // Do binary search between current position and end.
it.idx += sort.Search(num-it.idx, func(i int) bool { it.idx += sort.Search(num-it.idx, func(i int) bool {
@ -271,7 +273,7 @@ func (it *bytePostings) Seek(x uint32) bool {
return it.idx*4 < len(it.list) return it.idx*4 < len(it.list)
} }
func (it *bytePostings) Err() error { func (it *bigEndianPostings) Err() error {
return nil return nil
} }