-
Notifications
You must be signed in to change notification settings - Fork 529
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Return partial results for tags and tag values lookups (#1517)
* Return partial results for tags and tag values lookups * changelog
- Loading branch information
Showing
10 changed files
with
157 additions
and
109 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,61 @@ | ||
package util | ||
|
||
import "sort" | ||
|
||
type DistinctStringCollector struct { | ||
values map[string]struct{} | ||
maxLen int | ||
currLen int | ||
totalLen int | ||
} | ||
|
||
// NewDistinctStringCollector with the given maximum data size. This is calculated | ||
// as the total length of the recorded strings. For ease of use, maximum=0 | ||
// is interpreted as unlimited. | ||
func NewDistinctStringCollector(maxDataSize int) *DistinctStringCollector { | ||
return &DistinctStringCollector{ | ||
values: make(map[string]struct{}), | ||
maxLen: maxDataSize, | ||
} | ||
} | ||
|
||
func (d *DistinctStringCollector) Collect(s string) { | ||
if _, ok := d.values[s]; ok { | ||
// Already present | ||
return | ||
} | ||
|
||
// New entry | ||
d.totalLen += len(s) | ||
|
||
// Can it fit? | ||
if d.maxLen > 0 && d.currLen+len(s) > d.maxLen { | ||
// No | ||
return | ||
} | ||
|
||
d.values[s] = struct{}{} | ||
d.currLen += len(s) | ||
} | ||
|
||
// Strings returns the final list of distinct values collected and sorted. | ||
func (d *DistinctStringCollector) Strings() []string { | ||
ss := make([]string, 0, len(d.values)) | ||
|
||
for k := range d.values { | ||
ss = append(ss, k) | ||
} | ||
|
||
sort.Strings(ss) | ||
return ss | ||
} | ||
|
||
// Exceeded indicates if some values were lost because the maximum size limit was met. | ||
func (d *DistinctStringCollector) Exceeded() bool { | ||
return d.totalLen > d.currLen | ||
} | ||
|
||
// TotalDataSize is the total size of all distinct strings encountered. | ||
func (d *DistinctStringCollector) TotalDataSize() int { | ||
return d.totalLen | ||
} |
Oops, something went wrong.