mirror of
https://github.com/johnkerl/miller.git
synced 2026-07-25 08:53:55 +00:00
d536318ed6
Miller assumes 64-bit integers, but in Go, the int type varies in size depending on the architecture: 32-bit architectures have int equivalent to int32. As a result, the supported range of integer values is greatly reduced on 32-bit architectures compared to what is suggested by the documentation. This patch explicitly uses int64 wherever 64-bit integers are assumed. Test cases affected by the behaviour of the random generator are updated to reflect the new values (the existing seed doesn't produce the same behaviour since the way random values are generated has changed). Signed-off-by: Stephen Kitt <steve@sk2.org>
95 lines
3.2 KiB
Go
95 lines
3.2 KiB
Go
// ================================================================
|
|
// Data structure for mlr top: just a decorated array.
|
|
// ================================================================
|
|
|
|
package utils
|
|
|
|
import (
|
|
"github.com/johnkerl/miller/internal/pkg/mlrval"
|
|
"github.com/johnkerl/miller/internal/pkg/types"
|
|
)
|
|
|
|
// ----------------------------------------------------------------
|
|
type TopKeeper struct {
|
|
TopValues []*mlrval.Mlrval
|
|
TopRecordsAndContexts []*types.RecordAndContext
|
|
size int64
|
|
capacity int64
|
|
bsearchFunc mlrval.BsearchMlrvalArrayFunc
|
|
}
|
|
|
|
// ----------------------------------------------------------------
|
|
func NewTopKeeper(capacity int64, doMax bool) *TopKeeper {
|
|
keeper := &TopKeeper{
|
|
TopValues: make([]*mlrval.Mlrval, capacity),
|
|
TopRecordsAndContexts: make([]*types.RecordAndContext, capacity),
|
|
size: 0,
|
|
capacity: capacity,
|
|
}
|
|
if doMax {
|
|
keeper.bsearchFunc = mlrval.BsearchMlrvalArrayForDescendingInsert
|
|
} else {
|
|
keeper.bsearchFunc = mlrval.BsearchMlrvalArrayForAscendingInsert
|
|
}
|
|
return keeper
|
|
}
|
|
|
|
func (keeper *TopKeeper) GetSize() int64 {
|
|
return keeper.size
|
|
}
|
|
|
|
// ----------------------------------------------------------------
|
|
// Cases:
|
|
// 1. array size < capacity
|
|
// * find destidx
|
|
// * if destidx == size
|
|
// put it there
|
|
// else
|
|
// shift down & insert
|
|
// increment size
|
|
//
|
|
// 2. array size == capacity
|
|
// * find destidx
|
|
// * if destidx == size
|
|
// discard
|
|
// else
|
|
// shift down & insert
|
|
//
|
|
// capacity = 10, size = 6, destidx = 3 capacity = 10, size = 10, destidx = 3
|
|
// [0 #] [0 #] [0 #] [0 #]
|
|
// [1 #] [1 #] [1 #] [1 #]
|
|
// [2 #] [2 #] [2 #] [2 #]
|
|
// [3 #]* [3 X] [3 #]* [3 X]
|
|
// [4 #] [4 #] [4 #] [4 #]
|
|
// [5 #] [5 #] [5 #] [5 #]
|
|
// [6 ] [6 #] [6 #] [6 #]
|
|
// [7 ] [7 ] [7 #] [7 #]
|
|
// [8 ] [8 ] [8 #] [8 #]
|
|
// [9 ] [9 ] [9 #] [9 #]
|
|
//
|
|
// Our caller, the 'top' verb, feeds us records. We keep them or not; in the
|
|
// latter case, the Go runtime GCs them.
|
|
|
|
func (keeper *TopKeeper) Add(value *mlrval.Mlrval, recordAndContext *types.RecordAndContext) {
|
|
destidx := keeper.bsearchFunc(&keeper.TopValues, keeper.size, value)
|
|
|
|
if keeper.size < keeper.capacity {
|
|
for i := keeper.size - 1; i >= destidx; i-- {
|
|
keeper.TopValues[i+1] = keeper.TopValues[i]
|
|
keeper.TopRecordsAndContexts[i+1] = keeper.TopRecordsAndContexts[i]
|
|
}
|
|
keeper.TopValues[destidx] = value.Copy()
|
|
keeper.TopRecordsAndContexts[destidx] = recordAndContext.Copy() // might be nil
|
|
keeper.size++
|
|
} else {
|
|
if destidx >= keeper.capacity {
|
|
return
|
|
}
|
|
for i := keeper.size - 2; i >= destidx; i-- {
|
|
keeper.TopValues[i+1] = keeper.TopValues[i]
|
|
keeper.TopRecordsAndContexts[i+1] = keeper.TopRecordsAndContexts[i]
|
|
}
|
|
keeper.TopValues[destidx] = value.Copy()
|
|
keeper.TopRecordsAndContexts[destidx] = recordAndContext.Copy()
|
|
}
|
|
}
|