- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for WidthCap (0.06 sec)
-
internal/bpool/bpool.go
} // Width returns the width of the byte arrays in this pool. func (bp *BytePoolCap) Width() (n int) { if bp == nil { return 0 } return bp.w } // WidthCap returns the cap width of the byte arrays in this pool. func (bp *BytePoolCap) WidthCap() (n int) { if bp == nil { return 0 } return bp.wcap } // CurrentSize returns current size of buffer pool func (bp *BytePoolCap) CurrentSize() int {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Aug 29 01:40:52 UTC 2024 - 3K bytes - Viewed (0) -
internal/bpool/bpool_test.go
// Check the width if bp.Width() != width { t.Fatalf("bytepool width invalid: got %v want %v", bp.Width(), width) } // Check with width cap if bp.WidthCap() != capWidth { t.Fatalf("bytepool capWidth invalid: got %v want %v", bp.WidthCap(), capWidth) } // Check that retrieved buffer are of the expected width b := bp.Get() if len(b) != width {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Aug 29 01:40:52 UTC 2024 - 2.8K bytes - Viewed (0) -
cmd/erasure-decode.go
shardSize := int(e.ShardSize()) var b []byte // We should always have enough capacity, but older objects may be bigger // we do not need stashbuffer for them. if globalBytePoolCap.Load().WidthCap() >= len(readers)*shardSize { // Fill buffers b = globalBytePoolCap.Load().Get() // Seed the buffers. for i := range bufs { bufs[i] = b[i*shardSize : (i+1)*shardSize] } }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Aug 29 01:40:52 UTC 2024 - 9.5K bytes - Viewed (0)