MCPcopy Index your code
hub / github.com/Workiva/go-datastructures / newSparseBitArray

Function newSparseBitArray

bitarray/sparse_bitarray.go:346–348  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

344}
345
346func newSparseBitArray() *sparseBitArray {
347 return &sparseBitArray{}
348}
349
350// NewSparseBitArray will create a bit array that consumes a great
351// deal less memory at the expense of longer sets and gets.

Callers 15

UnmarshalFunction · 0.85
TestGetCompressedBitFunction · 0.85
TestGetSetCompressedBitFunction · 0.85
TestGetSetCompressedBitsFunction · 0.85
TestCompressedCountFunction · 0.85
TestClearCompressedBitFunction · 0.85

Calls

no outgoing calls

Tested by 15

TestGetCompressedBitFunction · 0.68
TestGetSetCompressedBitFunction · 0.68
TestGetSetCompressedBitsFunction · 0.68
TestCompressedCountFunction · 0.68
TestClearCompressedBitFunction · 0.68
TestCompressedEqualsFunction · 0.68
TestCompressedIntersectsFunction · 0.68

Used in the wild real call sites across dependent graphs

searching dependent graphs…