| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/grafana/loki/pkg/storage/chunk/purger/ |
| H A D | tombstones.go | 60 tombstones map[string]*TombstonesSet member
130 if len(tl.tombstones) == 0 {
155 tombstoneSet, isOK := tl.tombstones[userID]
170 return tl.tombstones[userID], nil
191 filteredSet.tombstones = append(filteredSet.tombstones, tombstone)
221 for i := range tombstoneSet.tombstones {
222 …tombstoneSet.tombstones[i].Matchers = make([][]*labels.Matcher, len(tombstoneSet.tombstones[i].Sel…
244 tl.tombstones[userID] = &tombstoneSet
350 for i := range ts.tombstones {
352 model.Interval{Start: ts.tombstones[i].StartTime, End: ts.tombstones[i].EndTime})
[all …]
|
| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/cortexproject/cortex/pkg/chunk/purger/ |
| H A D | tombstones.go | 60 tombstones map[string]*TombstonesSet member
130 if len(tl.tombstones) == 0 {
155 tombstoneSet, isOK := tl.tombstones[userID]
170 return tl.tombstones[userID], nil
191 filteredSet.tombstones = append(filteredSet.tombstones, tombstone)
221 for i := range tombstoneSet.tombstones {
222 …tombstoneSet.tombstones[i].Matchers = make([][]*labels.Matcher, len(tombstoneSet.tombstones[i].Sel…
244 tl.tombstones[userID] = &tombstoneSet
350 for i := range ts.tombstones {
352 model.Interval{Start: ts.tombstones[i].StartTime, End: ts.tombstones[i].EndTime})
[all …]
|
| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/grafana/loki/vendor/github.com/cortexproject/cortex/pkg/chunk/purger/ |
| H A D | tombstones.go | 60 tombstones map[string]*TombstonesSet member
130 if len(tl.tombstones) == 0 {
155 tombstoneSet, isOK := tl.tombstones[userID]
170 return tl.tombstones[userID], nil
191 filteredSet.tombstones = append(filteredSet.tombstones, tombstone)
221 for i := range tombstoneSet.tombstones {
222 …tombstoneSet.tombstones[i].Matchers = make([][]*labels.Matcher, len(tombstoneSet.tombstones[i].Sel…
244 tl.tombstones[userID] = &tombstoneSet
350 for i := range ts.tombstones {
352 model.Interval{Start: ts.tombstones[i].StartTime, End: ts.tombstones[i].EndTime})
[all …]
|
| /dports/net-mgmt/thanos/thanos-0.11.0/vendor/github.com/prometheus/prometheus/tsdb/record/ |
| H A D | record_test.go | 58 tstones := []tombstones.Stone{
59 {Ref: 123, Intervals: tombstones.Intervals{
63 {Ref: 13, Intervals: tombstones.Intervals{
70 testutil.Equals(t, []tombstones.Stone{
71 {Ref: 123, Intervals: tombstones.Intervals{{Mint: -1000, Maxt: 1231231}}},
72 {Ref: 123, Intervals: tombstones.Intervals{{Mint: 5000, Maxt: 0}}},
73 {Ref: 13, Intervals: tombstones.Intervals{{Mint: -1000, Maxt: -11}}},
74 {Ref: 13, Intervals: tombstones.Intervals{{Mint: 5000, Maxt: 1000}}},
108 tstones := []tombstones.Stone{
109 {Ref: 123, Intervals: tombstones.Intervals{
|
| /dports/net-mgmt/promscale/promscale-0.6.2/vendor/github.com/thanos-io/thanos/pkg/compactv2/ |
| H A D | modifiers.go | 60 var intervals tombstones.Intervals
88 var deleted tombstones.Intervals
90 … deleted = deleted.Add(tombstones.Interval{Mint: chks[0].MinTime, Maxt: chks[len(chks)-1].MaxTime})
111 func intersection(i tombstones.Interval, dranges tombstones.Intervals) tombstones.Intervals {
112 var ret tombstones.Intervals
119 intersection := tombstones.Interval{Mint: r.Mint, Maxt: r.Maxt}
151 intervals tombstones.Intervals
155 logDelete func(intervals tombstones.Intervals)
156 deleted tombstones.Intervals
161 intervals tombstones.Intervals,
[all …]
|
| /dports/net-mgmt/promscale/promscale-0.6.2/vendor/github.com/prometheus/prometheus/tsdb/record/ |
| H A D | record_test.go | 59 tstones := []tombstones.Stone{
60 {Ref: 123, Intervals: tombstones.Intervals{
64 {Ref: 13, Intervals: tombstones.Intervals{
71 require.Equal(t, []tombstones.Stone{
72 {Ref: 123, Intervals: tombstones.Intervals{{Mint: -1000, Maxt: 1231231}}},
73 {Ref: 123, Intervals: tombstones.Intervals{{Mint: 5000, Maxt: 0}}},
74 {Ref: 13, Intervals: tombstones.Intervals{{Mint: -1000, Maxt: -11}}},
75 {Ref: 13, Intervals: tombstones.Intervals{{Mint: 5000, Maxt: 1000}}},
118 tstones := []tombstones.Stone{
119 {Ref: 123, Intervals: tombstones.Intervals{
[all …]
|
| /dports/net-mgmt/prometheus2/prometheus-2.30.3/tsdb/record/ |
| H A D | record_test.go | 59 tstones := []tombstones.Stone{
60 {Ref: 123, Intervals: tombstones.Intervals{
64 {Ref: 13, Intervals: tombstones.Intervals{
71 require.Equal(t, []tombstones.Stone{
72 {Ref: 123, Intervals: tombstones.Intervals{{Mint: -1000, Maxt: 1231231}}},
73 {Ref: 123, Intervals: tombstones.Intervals{{Mint: 5000, Maxt: 0}}},
74 {Ref: 13, Intervals: tombstones.Intervals{{Mint: -1000, Maxt: -11}}},
75 {Ref: 13, Intervals: tombstones.Intervals{{Mint: 5000, Maxt: 1000}}},
118 tstones := []tombstones.Stone{
119 {Ref: 123, Intervals: tombstones.Intervals{
[all …]
|
| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/prometheus/prometheus/tsdb/record/ |
| H A D | record_test.go | 59 tstones := []tombstones.Stone{
60 {Ref: 123, Intervals: tombstones.Intervals{
64 {Ref: 13, Intervals: tombstones.Intervals{
71 require.Equal(t, []tombstones.Stone{
72 {Ref: 123, Intervals: tombstones.Intervals{{Mint: -1000, Maxt: 1231231}}},
73 {Ref: 123, Intervals: tombstones.Intervals{{Mint: 5000, Maxt: 0}}},
74 {Ref: 13, Intervals: tombstones.Intervals{{Mint: -1000, Maxt: -11}}},
75 {Ref: 13, Intervals: tombstones.Intervals{{Mint: 5000, Maxt: 1000}}},
118 tstones := []tombstones.Stone{
119 {Ref: 123, Intervals: tombstones.Intervals{
[all …]
|
| /dports/textproc/sonic/sonic-1.3.0/cargo-crates/librocksdb-sys-6.7.4/rocksdb/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/storage/rocksdb/rocksdb/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/databases/rocksdb-lite/rocksdb-6.26.1/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/databases/rocksdb/rocksdb-6.26.1/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/storage/rocksdb/rocksdb/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/rocksdb/rocksdb/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/storage/rocksdb/rocksdb/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/storage/rocksdb/rocksdb/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/storage/rocksdb/rocksdb/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/storage/rocksdb/rocksdb/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/rocksdb/rocksdb/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/rocksdb/rocksdb/docs/_posts/ |
| H A D | 2018-11-21-delete-range.markdown | 45 disadvantage of outputting tombstones to all but the bottom level. That's
59 reaches the bottom of the LSM, where tombstones can finally be dropped.
100 tombstones seen during reads to ones in a similar key-range.
121 tombstones dropped or merged wherever possible.
134 *Lifetime of point keys and range tombstones in RocksDB*
174 …e tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T)), where T…
183 tombstones. This operation is O(T\*log(T)) where T is the number of tombstones
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
244 Writing the range tombstones ensures that most of them are not compacted away, and we have more tom…
[all …]
|
| /dports/net-mgmt/thanos/thanos-0.11.0/vendor/github.com/prometheus/prometheus/tsdb/ |
| H A D | block.go | 121 Tombstones() (tombstones.Reader, error)
264 tombstones tombstones.Reader member
317 tombstones: tr,
340 merr.Add(pb.tombstones.Close())
462 tombstones.Reader
498 stones := tombstones.NewMemTombstones()
524 err = pb.tombstones.Iter(func(id uint64, ivs tombstones.Intervals) error {
533 pb.tombstones = stones
536 n, err := tombstones.WriteFile(pb.logger, pb.dir, pb.tombstones)
554 if err := pb.tombstones.Iter(func(id uint64, ivs tombstones.Intervals) error {
[all …]
|
| /dports/net-mgmt/promscale/promscale-0.6.2/vendor/github.com/prometheus/prometheus/tsdb/ |
| H A D | block.go | 130 Tombstones() (tombstones.Reader, error)
265 tombstones tombstones.Reader member
315 tombstones: tr,
337 pb.tombstones.Close(),
483 tombstones.Reader
519 stones := tombstones.NewMemTombstones()
545 err = pb.tombstones.Iter(func(id uint64, ivs tombstones.Intervals) error {
554 pb.tombstones = stones
557 n, err := tombstones.WriteFile(pb.logger, pb.dir, pb.tombstones)
577 if err := pb.tombstones.Iter(func(id uint64, ivs tombstones.Intervals) error {
[all …]
|
| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/cortexproject/cortex/vendor/github.com/prometheus/prometheus/tsdb/ |
| H A D | block.go | 134 Tombstones() (tombstones.Reader, error)
269 tombstones tombstones.Reader member
319 tombstones: tr,
341 pb.tombstones.Close(),
497 tombstones.Reader
533 stones := tombstones.NewMemTombstones()
559 err = pb.tombstones.Iter(func(id uint64, ivs tombstones.Intervals) error {
568 pb.tombstones = stones
571 n, err := tombstones.WriteFile(pb.logger, pb.dir, pb.tombstones)
591 if err := pb.tombstones.Iter(func(id uint64, ivs tombstones.Intervals) error {
[all …]
|
| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/prometheus/prometheus/tsdb/ |
| H A D | block.go | 134 Tombstones() (tombstones.Reader, error)
269 tombstones tombstones.Reader member
319 tombstones: tr,
341 pb.tombstones.Close(),
497 tombstones.Reader
533 stones := tombstones.NewMemTombstones()
559 err = pb.tombstones.Iter(func(id uint64, ivs tombstones.Intervals) error {
568 pb.tombstones = stones
571 n, err := tombstones.WriteFile(pb.logger, pb.dir, pb.tombstones)
591 if err := pb.tombstones.Iter(func(id uint64, ivs tombstones.Intervals) error {
[all …]
|
| /dports/net-mgmt/prometheus2/prometheus-2.30.3/tsdb/ |
| H A D | block.go | 134 Tombstones() (tombstones.Reader, error)
269 tombstones tombstones.Reader member
319 tombstones: tr,
341 pb.tombstones.Close(),
497 tombstones.Reader
533 stones := tombstones.NewMemTombstones()
559 err = pb.tombstones.Iter(func(id uint64, ivs tombstones.Intervals) error {
568 pb.tombstones = stones
571 n, err := tombstones.WriteFile(pb.logger, pb.dir, pb.tombstones)
591 if err := pb.tombstones.Iter(func(id uint64, ivs tombstones.Intervals) error {
[all …]
|