mirror of
https://github.com/featurebasedb/featurebase.git
synced 2026-10-30 06:12:25 +00:00
This patch replaces a lot of circumstances in which containers were being copied with circumstances in which they are shared, using copy-on-write semantics. To achieve this, we emulate somewhat the design of go's native `append` function. Operations on a container may optionally yield a new container. A container can be marked "frozen", after which no operation should ever write to it in any way; that applies both to the container itself and the backing store it refers to, if any. So for instance, instead of: c.arrayToBitmap() we now write: c = c.arrayToBitmap() Operations which need to modify a container in any way need to be able to return a new container, which is a modified copy of the previous container. This applies to operations like add/remove, but also to things like unmapping memory-mapped storage, or changing a container's type. Bitmaps do not support the same copy-on-write semantics, currently, but "copying" a bitmap and sharing the containers instead of duplicating them is *much* cheaper than copying the containers. Bitmaps do support a .Freeze method, which currently copies the previous bitmap, making a new one with the same container pointers, and freezes the individual containers. Use this if you need a writeable copy of a bitmap -- the resulting bitmap can safely have its set of containers modified, and bitmap operators that would want to modify the containers will use copy-on-write for that. The primary motivation of this is to reduce the cost of the row cache used by fragments. As a secondary issue, the row cache is no longer updated on writes -- that update was actually a race condition waiting to happen. Rather, writes to a row invalidate the cache entry for that row. The row cache is created by creating a new bitmap, and freezing the relevant containers from the fragment's storage. In the case where nothing is being written, the row cache grows to contain bitmaps containing all those containers, but never copies any containers. If nothing's being read, the row cache is never created, and the containers are in general not getting frozen. The only circumstance where copies have to happen is when things are read (and thus stored in the row cache) and later modified. In that case, each read freezes objects, and the first write to a container after it's been frozen will create a new copy. We drop the enterprise/b btree implementation, because we don't really need it anymore -- we now provide that implementation by default in the open source product anyway. Along with this, there's a lot of other changes which improve support for nil containers, as a cheaper representation for empty containers. Operations which we know will provide an empty container can always short-circuit and just yield a nil *Container. Similarly, operations which would provide a full container can return a single shared full container object (which is frozen). The higher-level (non type-specific) container ops are now using that logic to short-circuit operations for empty and full containers. (For instance, difference of anything minus an empty container is the original thing, union of anything and empty is the original thing, and so on.) The Containers interface adds "Update" and "UpdateEvery" methods, based in part on the "Put" interface provided by the underlying btree implementation; Update performs a possible update in-place of a container for a given key, bypassing the need to replicate the search for that key in the container. UpdateEvery loops through all the containers. Containers do not strictly guarantee that they won't return nil `*Container` objects. However, the container iterators won't return those -- empty containers aren't interesting. Some tests are updated to reflect this. Some of the container internals, like N(), or the isArray() and related functions, accept nil container pointers. Some, like Thaw(), do not. For the array(), bitmap(), and runs() methods, roaringparanoia enables an explicit panic on a nil container explaining the problem, but the intent is that those should never be called unless you already know you have the right kind of container, so by default they don't perform the extra checks. In most cases, this is already covered because a nil container is empty, and there's no operation we can perform that requires us to inspect the contents of an empty container. This is passing a fair amount of testing, but the testing may not be comprehensive enough. The overall impact of this is pretty trivial performance-wise. In our default roaring/ benchmarks, a few things get a few percent faster, or slower. The advantage is that, with read-heavy workloads, the row cache no longer eats up incredible amounts of memory. For a smallish test case, pilosa's memory usage (RES in top) after startup was ~2.5GB. Without this patch, simply reading every row a few times got memory usage to about 9GB, which seemed reasonably stable. With this patch, memory usage went to about 3GB. This will be less noticeable in mixed read/write loads, but it should be consistently significantly lower. In addition to dropping things from the rowCache on modifications, we also stopped performing a full count on a modified row when not using a cache of a kind that would use that count, and don't repopulate the rowCache regardless. We don't want every write to imply a corresponding read after it. There's a lot of room for possible future optimizations in terms of things like in-place operations, and some of the row/rowSegment code is a little suspicious to me, but I don't think it should be *worse* in any cases.
569 lines
17 KiB
Go
569 lines
17 KiB
Go
// Copyright 2017 Pilosa Corp.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package roaring
|
|
|
|
import (
|
|
"fmt"
|
|
"reflect"
|
|
"runtime"
|
|
"unsafe"
|
|
)
|
|
|
|
const (
|
|
stashedArraySize = 5
|
|
stashedRunSize = (stashedArraySize / 2)
|
|
)
|
|
|
|
// Container represents a Container for uint16 integers.
|
|
//
|
|
// These are used for storing the low bits of numbers in larger sets of uint64.
|
|
// The high bits are stored in a Container's key which is tracked by a separate
|
|
// data structure. Integers in a Container can be encoded in one of three ways -
|
|
// the encoding used is usually whichever is most compact, though any Container
|
|
// type should be able to encode any set of integers safely. For containers with
|
|
// less than 4,096 values, an array is often used. Containers with long runs of
|
|
// integers would use run length encoding, and more random data usually uses
|
|
// bitmap encoding.
|
|
type Container struct {
|
|
pointer *uint16 // the data pointer
|
|
len, cap int32 // length and cap
|
|
n int32 // number of integers in container
|
|
flags containerFlags // internal flags
|
|
typeID byte // array, bitmap, or run
|
|
data [stashedArraySize]uint16 // immediate data for small arrays or runs
|
|
}
|
|
|
|
type containerFlags uint8
|
|
|
|
const (
|
|
flagMapped = containerFlags(1 << iota)
|
|
flagFrozen
|
|
)
|
|
|
|
func (c *Container) String() string {
|
|
if c == nil {
|
|
return "<nil container>"
|
|
}
|
|
froze := ""
|
|
switch c.flags {
|
|
case flagFrozen:
|
|
froze = "frozen "
|
|
case flagMapped:
|
|
froze = "mapped "
|
|
case flagFrozen | flagMapped:
|
|
froze = "frozen/mapped"
|
|
}
|
|
switch c.typeID {
|
|
case containerArray:
|
|
return fmt.Sprintf("<%sarray container, N=%d>", froze, c.N())
|
|
case containerBitmap:
|
|
return fmt.Sprintf("<%sbitmap container, N=%d, len %dx uint64>",
|
|
froze, c.N(), len(c.bitmap()))
|
|
case containerRun:
|
|
return fmt.Sprintf("<%srun container, N=%d, len %dx interval>",
|
|
froze, c.N(), len(c.runs()))
|
|
default:
|
|
return fmt.Sprintf("<unknown %s%d container, N=%d>", froze, c.typeID, c.N())
|
|
}
|
|
}
|
|
|
|
// NewContainer returns a new instance of container. This trivial function
|
|
// may later become more interesting.
|
|
func NewContainer() *Container {
|
|
statsHit("NewContainer")
|
|
c := &Container{typeID: containerArray, len: 0, cap: stashedArraySize}
|
|
c.pointer = (*uint16)(unsafe.Pointer(&c.data[0]))
|
|
return c
|
|
}
|
|
|
|
// NewContainerBitmap makes a bitmap container using the provided bitmap, or
|
|
// an empty one if provided bitmap is nil. If the provided bitmap is too short,
|
|
// it will be padded. This function's API is wrong; it should have been
|
|
// written as NewContainerBitmapN, and this should not take the n argument,
|
|
// but I did it wrong initially and now that would be a breaking change.
|
|
func NewContainerBitmap(n int, bitmap []uint64) *Container {
|
|
if bitmap == nil {
|
|
return NewContainerBitmapN(nil, 0)
|
|
}
|
|
// pad to required length
|
|
if len(bitmap) < bitmapN {
|
|
bm2 := make([]uint64, bitmapN)
|
|
copy(bm2, bitmap)
|
|
bitmap = bm2
|
|
}
|
|
c := &Container{typeID: containerBitmap}
|
|
c.setBitmap(bitmap)
|
|
// set n based on bitmap contents.
|
|
if n < 0 {
|
|
c.bitmapRepair()
|
|
} else {
|
|
c.setN(int32(n))
|
|
}
|
|
return c
|
|
}
|
|
|
|
// NewContainerBitmapN makes a bitmap container using the provided bitmap, or
|
|
// an empty one if provided bitmap is nil. If the provided bitmap is too short,
|
|
// it will be padded. The container's count is specified directly.
|
|
func NewContainerBitmapN(bitmap []uint64, n int32) *Container {
|
|
if bitmap == nil {
|
|
bitmap = make([]uint64, bitmapN)
|
|
}
|
|
// pad to required length
|
|
if len(bitmap) < bitmapN {
|
|
bm2 := make([]uint64, bitmapN)
|
|
copy(bm2, bitmap)
|
|
bitmap = bm2
|
|
}
|
|
c := &Container{typeID: containerBitmap, n: n}
|
|
c.setBitmap(bitmap)
|
|
return c
|
|
}
|
|
|
|
// NewContainerArray returns an array container using the provided set of
|
|
// values. It's okay if the slice is nil; that's a length of zero.
|
|
func NewContainerArray(set []uint16) *Container {
|
|
c := &Container{typeID: containerArray, n: int32(len(set))}
|
|
c.setArray(set)
|
|
return c
|
|
}
|
|
|
|
// NewContainerArrayCopy returns an array container using the provided set of
|
|
// values. It's okay if the slice is nil; that's a length of zero. It copies
|
|
// the provided slice to new storage.
|
|
func NewContainerArrayCopy(set []uint16) *Container {
|
|
c := &Container{typeID: containerArray, n: int32(len(set))}
|
|
c.setArrayMaybeCopy(set, true)
|
|
return c
|
|
}
|
|
|
|
// NewContainerArrayN returns an array container using the specified
|
|
// set of values, but overriding n.
|
|
func NewContainerArrayN(set []uint16, n int32) *Container {
|
|
c := &Container{typeID: containerArray, n: n}
|
|
c.setArray(set)
|
|
return c
|
|
}
|
|
|
|
// NewContainerRun creates a new run container using a provided (possibly nil)
|
|
// slice of intervals.
|
|
func NewContainerRun(set []interval16) *Container {
|
|
c := &Container{typeID: containerRun}
|
|
c.setRuns(set)
|
|
for _, run := range set {
|
|
c.n += int32(run.last-run.start) + 1
|
|
}
|
|
return c
|
|
}
|
|
|
|
// NewContainerRunCopy creates a new run container using a provided (possibly nil)
|
|
// slice of intervals. It copies the provided slice to new storage.
|
|
func NewContainerRunCopy(set []interval16) *Container {
|
|
c := &Container{typeID: containerRun}
|
|
c.setRunsMaybeCopy(set, true)
|
|
for _, run := range set {
|
|
c.n += int32(run.last-run.start) + 1
|
|
}
|
|
return c
|
|
}
|
|
|
|
// NewContainerRunN creates a new run array using a provided (possibly nil)
|
|
// slice of intervals. It overrides n using the provided value.
|
|
func NewContainerRunN(set []interval16, n int32) *Container {
|
|
c := &Container{typeID: containerRun, n: n}
|
|
c.setRuns(set)
|
|
return c
|
|
}
|
|
|
|
// Mapped returns the internal mapped field, which indicates whether the
|
|
// slice's backing store is believed to be associated with unwriteable
|
|
// mmapped space.
|
|
func (c *Container) Mapped() bool {
|
|
if c == nil {
|
|
return false
|
|
}
|
|
return (c.flags & flagMapped) != 0
|
|
}
|
|
|
|
// frozen() returns the internal frozen state. It isn't exported because
|
|
// nothing outside this package should be thinking about this.
|
|
func (c *Container) frozen() bool {
|
|
if c == nil {
|
|
return true
|
|
}
|
|
return (c.flags & flagFrozen) != 0
|
|
}
|
|
|
|
// N returns the 1-count of the container.
|
|
func (c *Container) N() int32 {
|
|
if c == nil {
|
|
return 0
|
|
}
|
|
return c.n
|
|
}
|
|
|
|
func (c *Container) setN(n int32) {
|
|
if c == nil {
|
|
if roaringParanoia {
|
|
panic("trying to setN on a nil container")
|
|
}
|
|
return
|
|
}
|
|
c.n = n
|
|
}
|
|
|
|
func (c *Container) typ() byte {
|
|
if c == nil {
|
|
return containerNil
|
|
}
|
|
return c.typeID
|
|
}
|
|
|
|
// setTyp should only be called if you already know that c is a
|
|
// non-nil, non-frozen, container.
|
|
func (c *Container) setTyp(newType byte) {
|
|
if roaringParanoia {
|
|
if c == nil || c.frozen() {
|
|
panic("setTyp on nil or frozen container")
|
|
}
|
|
}
|
|
c.typeID = newType
|
|
}
|
|
|
|
func (c *Container) setMapped(mapped bool) {
|
|
if roaringParanoia {
|
|
if c == nil || c.frozen() {
|
|
panic("setMapped on nil or frozen container")
|
|
}
|
|
}
|
|
if mapped {
|
|
c.flags |= flagMapped
|
|
} else {
|
|
c.flags &^= flagMapped
|
|
}
|
|
}
|
|
|
|
// Freeze returns an unmodifiable container identical to c. This might
|
|
// be c, now marked unmodifiable, or might be a new container.
|
|
func (c *Container) Freeze() *Container {
|
|
if c == nil {
|
|
return nil
|
|
}
|
|
c.flags |= flagFrozen
|
|
return c
|
|
}
|
|
|
|
// Thaw returns a modifiable container identical to c. This may be c, or it
|
|
// may be a new container with distinct backing store.
|
|
func (c *Container) Thaw() *Container {
|
|
if roaringParanoia {
|
|
if c == nil {
|
|
panic("trying to thaw a nil container")
|
|
}
|
|
}
|
|
if c.flags&(flagFrozen|flagMapped) == 0 {
|
|
return c
|
|
}
|
|
return c.unmapOrClone()
|
|
}
|
|
|
|
func (c *Container) unmapOrClone() *Container {
|
|
if c.flags&flagFrozen != 0 {
|
|
// Caqn't modify this container, therefore, we have to make a
|
|
// copy.
|
|
return c.Clone()
|
|
}
|
|
c.flags &^= flagMapped
|
|
// mapped: we want to unmap the storage.
|
|
switch c.typeID {
|
|
case containerArray:
|
|
// mapped flag is wrong here
|
|
if c.pointer == (*uint16)(unsafe.Pointer(&c.data)) {
|
|
return c
|
|
}
|
|
// maybe it fits in storage
|
|
if c.len <= stashedArraySize {
|
|
copy(c.data[:stashedArraySize], c.array())
|
|
c.pointer, c.cap = (*uint16)(unsafe.Pointer(&c.data)), stashedArraySize
|
|
return c
|
|
}
|
|
array := c.array()
|
|
tmp := make([]uint16, c.len)
|
|
copy(tmp, array)
|
|
h := (*reflect.SliceHeader)(unsafe.Pointer(&tmp))
|
|
c.pointer, c.cap = (*uint16)(unsafe.Pointer(h.Data)), int32(h.Cap)
|
|
runtime.KeepAlive(&tmp)
|
|
case containerRun:
|
|
// mapped flag is wrong here
|
|
if c.pointer == (*uint16)(unsafe.Pointer(&c.data)) {
|
|
return c
|
|
}
|
|
oldRuns := c.runs()
|
|
// maybe it fits in storage
|
|
if c.len <= stashedRunSize {
|
|
c.pointer, c.cap = (*uint16)(unsafe.Pointer(&c.data)), stashedRunSize
|
|
copy(c.runs(), oldRuns)
|
|
return c
|
|
}
|
|
tmp := make([]interval16, c.len)
|
|
copy(tmp, oldRuns)
|
|
h := (*reflect.SliceHeader)(unsafe.Pointer(&tmp))
|
|
c.pointer, c.cap = (*uint16)(unsafe.Pointer(h.Data)), int32(h.Cap)
|
|
runtime.KeepAlive(&tmp)
|
|
case containerBitmap:
|
|
bitmap := c.bitmap()
|
|
tmp := make([]uint64, bitmapN)
|
|
copy(tmp, bitmap)
|
|
h := (*reflect.SliceHeader)(unsafe.Pointer(&tmp))
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(h.Data)), bitmapN, bitmapN
|
|
runtime.KeepAlive(&tmp)
|
|
default:
|
|
panic(fmt.Sprintf("can't thaw invalid container, type %d", c.typeID))
|
|
}
|
|
return c
|
|
}
|
|
|
|
// array yields the data viewed as a slice of uint16 values.
|
|
func (c *Container) array() []uint16 {
|
|
if roaringParanoia {
|
|
if c == nil {
|
|
panic("attempt to read a nil container's array")
|
|
}
|
|
if c.typeID != containerArray {
|
|
panic("attempt to read non-array's array")
|
|
}
|
|
}
|
|
return *(*[]uint16)(unsafe.Pointer(&reflect.SliceHeader{Data: uintptr(unsafe.Pointer(c.pointer)), Len: int(c.len), Cap: int(c.cap)}))
|
|
}
|
|
|
|
// setArrayMaybeCopy stores a set of uint16s as data. c must not be frozen.
|
|
// If doCopy is set, it will ensure that the data get copied (possibly to
|
|
// its internal stash.)
|
|
func (c *Container) setArrayMaybeCopy(array []uint16, doCopy bool) {
|
|
if roaringParanoia {
|
|
if c == nil || c.frozen() {
|
|
panic("setArray on nil or frozen container")
|
|
}
|
|
if c.typeID != containerArray {
|
|
panic("attempt to write non-array's array")
|
|
}
|
|
}
|
|
// no array: start with our default 5-value array
|
|
if array == nil {
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(&c.data[0])), 0, stashedArraySize
|
|
c.n = c.len
|
|
return
|
|
}
|
|
h := (*reflect.SliceHeader)(unsafe.Pointer(&array))
|
|
if h.Data == uintptr(unsafe.Pointer(c.pointer)) {
|
|
// nothing to do but update length
|
|
c.len = int32(h.Len)
|
|
c.n = c.len
|
|
return
|
|
}
|
|
// array we can fit in data store:
|
|
if len(array) <= stashedArraySize {
|
|
copy(c.data[:stashedArraySize], array)
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(&c.data[0])), int32(len(array)), stashedArraySize
|
|
c.n = c.len
|
|
c.flags &^= flagMapped // this is no longer using a hypothetical mmapped input array
|
|
return
|
|
}
|
|
// copy the array
|
|
if doCopy {
|
|
a2 := make([]uint16, len(array))
|
|
copy(a2, array)
|
|
h = (*reflect.SliceHeader)(unsafe.Pointer(&a2))
|
|
}
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(h.Data)), int32(h.Len), int32(h.Cap)
|
|
c.n = c.len
|
|
runtime.KeepAlive(&array)
|
|
}
|
|
|
|
// setArrayMaybeCopy stores a set of uint16s as data. c must not be frozen.
|
|
func (c *Container) setArray(array []uint16) {
|
|
c.setArrayMaybeCopy(array, false)
|
|
}
|
|
|
|
// bitmap yields the data viewed as a slice of uint64s holding bits.
|
|
func (c *Container) bitmap() []uint64 {
|
|
if roaringParanoia {
|
|
if c == nil {
|
|
panic("attempt to read nil container's bitmap")
|
|
}
|
|
if c.typeID != containerBitmap {
|
|
panic("attempt to read non-bitmap's bitmap")
|
|
}
|
|
}
|
|
return *(*[]uint64)(unsafe.Pointer(&reflect.SliceHeader{Data: uintptr(unsafe.Pointer(c.pointer)), Len: int(c.len), Cap: int(c.cap)}))
|
|
}
|
|
|
|
// setBitmap stores a set of uint64s as data.
|
|
func (c *Container) setBitmap(bitmap []uint64) {
|
|
if c == nil || c.frozen() {
|
|
panic("setBitmap on nil or frozen container")
|
|
}
|
|
if roaringParanoia {
|
|
if c.typeID != containerBitmap {
|
|
panic("attempt to write non-bitmap's bitmap")
|
|
}
|
|
}
|
|
h := (*reflect.SliceHeader)(unsafe.Pointer(&bitmap))
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(h.Data)), int32(h.Len), int32(h.Cap)
|
|
runtime.KeepAlive(&bitmap)
|
|
}
|
|
|
|
// runs yields the data viewed as a slice of intervals.
|
|
func (c *Container) runs() []interval16 {
|
|
if roaringParanoia {
|
|
if c == nil {
|
|
panic("attempt to read nil container's runs")
|
|
}
|
|
if c.typeID != containerRun {
|
|
panic("attempt to read non-run's runs")
|
|
}
|
|
}
|
|
return *(*[]interval16)(unsafe.Pointer(&reflect.SliceHeader{Data: uintptr(unsafe.Pointer(c.pointer)), Len: int(c.len), Cap: int(c.cap)}))
|
|
}
|
|
|
|
// setRuns stores a set of intervals as data. c must not be frozen.
|
|
func (c *Container) setRuns(runs []interval16) {
|
|
c.setRunsMaybeCopy(runs, false)
|
|
}
|
|
|
|
// setRunsMaybeCopy stores a set of intervals as data. c must not be frozen.
|
|
// If doCopy is set, the values will be copied to different storage.
|
|
func (c *Container) setRunsMaybeCopy(runs []interval16, doCopy bool) {
|
|
if roaringParanoia {
|
|
if c == nil || c.frozen() {
|
|
panic("setRuns on nil or frozen container")
|
|
}
|
|
if c.typeID != containerRun {
|
|
panic("attempt to write non-run's runs")
|
|
}
|
|
}
|
|
// no array: start with our default 2-value array
|
|
if runs == nil {
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(&c.data[0])), 0, stashedRunSize
|
|
return
|
|
}
|
|
h := (*reflect.SliceHeader)(unsafe.Pointer(&runs))
|
|
if h.Data == uintptr(unsafe.Pointer(c.pointer)) {
|
|
// nothing to do but update length
|
|
c.len = int32(h.Len)
|
|
return
|
|
}
|
|
|
|
// array we can fit in data store:
|
|
if len(runs) <= stashedRunSize {
|
|
newRuns := *(*[]interval16)(unsafe.Pointer(&reflect.SliceHeader{Data: uintptr(unsafe.Pointer(&c.data[0])), Len: stashedRunSize, Cap: stashedRunSize}))
|
|
copy(newRuns, runs)
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(&c.data[0])), int32(len(runs)), stashedRunSize
|
|
c.flags &^= flagMapped // this is no longer using a hypothetical mmapped input array
|
|
return
|
|
}
|
|
if doCopy {
|
|
r2 := make([]interval16, len(runs))
|
|
copy(r2, runs)
|
|
h = (*reflect.SliceHeader)(unsafe.Pointer(&r2))
|
|
}
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(h.Data)), int32(h.Len), int32(h.Cap)
|
|
runtime.KeepAlive(&runs)
|
|
}
|
|
|
|
// UpdateOrMake updates the container, yielding a new container if necessary.
|
|
func (c *Container) UpdateOrMake(typ byte, n int32, mapped bool) *Container {
|
|
if c == nil {
|
|
switch typ {
|
|
case containerRun:
|
|
c = NewContainerRunN(nil, n)
|
|
case containerBitmap:
|
|
c = NewContainerBitmapN(nil, n)
|
|
default:
|
|
c = NewContainerArrayN(nil, n)
|
|
}
|
|
c.flags |= flagMapped
|
|
return c
|
|
}
|
|
// ensure that we are allowed to modify this container
|
|
c = c.Thaw()
|
|
c.typeID = typ
|
|
c.n = n
|
|
// note: this probably shouldn't be happening, the decision should be getting
|
|
// made when we specify the storage.
|
|
c.setMapped(mapped)
|
|
// we don't know that any existing slice is usable, so let's ditch it
|
|
switch c.typeID {
|
|
case containerArray:
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(&c.data[0])), int32(0), stashedArraySize
|
|
case containerRun:
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(&c.data[0])), 0, stashedRunSize
|
|
default:
|
|
c.pointer, c.len, c.cap = nil, 0, 0
|
|
}
|
|
return c
|
|
}
|
|
|
|
// Update updates the container if possible. It is an error to
|
|
// call Update on a frozen container.
|
|
func (c *Container) Update(typ byte, n int32, mapped bool) {
|
|
if c == nil || c.frozen() {
|
|
panic("cannot Update a nil or frozen container")
|
|
}
|
|
c.typeID = typ
|
|
c.n = n
|
|
// note: this probably shouldn't be happening, the decision should be getting
|
|
// made when we specify the storage.
|
|
c.setMapped(mapped)
|
|
// we don't know that any existing slice is usable, so let's ditch it
|
|
switch c.typeID {
|
|
case containerArray:
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(&c.data[0])), int32(0), stashedArraySize
|
|
case containerRun:
|
|
c.pointer, c.len, c.cap = (*uint16)(unsafe.Pointer(&c.data[0])), 0, stashedRunSize
|
|
default:
|
|
c.pointer, c.len, c.cap = nil, 0, 0
|
|
}
|
|
}
|
|
|
|
// isArray returns true if the container is an array container.
|
|
func (c *Container) isArray() bool {
|
|
if roaringParanoia {
|
|
if c == nil {
|
|
panic("calling isArray on nil container")
|
|
}
|
|
}
|
|
return c.typeID == containerArray
|
|
}
|
|
|
|
// isBitmap returns true if the container is a bitmap container.
|
|
func (c *Container) isBitmap() bool {
|
|
if roaringParanoia {
|
|
if c == nil {
|
|
panic("calling isBitmap on nil container")
|
|
}
|
|
}
|
|
return c.typeID == containerBitmap
|
|
}
|
|
|
|
// isRun returns true if the container is a run-length-encoded container.
|
|
func (c *Container) isRun() bool {
|
|
if roaringParanoia {
|
|
if c == nil {
|
|
panic("calling isRun on nil container")
|
|
}
|
|
}
|
|
return c.typeID == containerRun
|
|
}
|