- Sort Score
- Num 10 results
- Language All
Results 131 - 140 of 1,299 for Make (0.04 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
src/bytes/bytes_test.go
if allocs > 0 { t.Errorf("Equal allocated %v times", allocs) } } func TestEqualExhaustive(t *testing.T) { var size = 128 if testing.Short() { size = 32 } a := make([]byte, size) b := make([]byte, size) b_init := make([]byte, size) // randomish but deterministic data for i := 0; i < size; i++ { a[i] = byte(17 * i) b_init[i] = byte(23*i + 100) } for len := 0; len <= size; len++ {
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Wed Mar 11 03:07:05 GMT 2026 - 62.9K bytes - Click Count (0) -
cmd/storage-datatypes_gen_test.go
v := BaseOptions{} b.ReportAllocs() b.ResetTimer() for i := 0; i < b.N; i++ { v.MarshalMsg(nil) } } func BenchmarkAppendMsgBaseOptions(b *testing.B) { v := BaseOptions{} bts := make([]byte, 0, v.Msgsize()) bts, _ = v.MarshalMsg(bts[0:0]) b.SetBytes(int64(len(bts))) b.ReportAllocs() b.ResetTimer() for i := 0; i < b.N; i++ { bts, _ = v.MarshalMsg(bts[0:0]) } }Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 73.9K bytes - Click Count (0) -
docs/en/docs/deployment/index.md
# Deployment { #deployment } Deploying a **FastAPI** application is relatively easy. ## What Does Deployment Mean { #what-does-deployment-mean } To **deploy** an application means to perform the necessary steps to make it **available to the users**.Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 1.5K bytes - Click Count (0) -
internal/ringbuffer/README.md
"github.com/smallnest/ringbuffer" ) func main() { rb := ringbuffer.New(1024) // write rb.Write([]byte("abcd")) fmt.Println(rb.Length()) fmt.Println(rb.Free()) // read buf := make([]byte, 4) rb.Read(buf) fmt.Println(string(buf)) } ``` It is possible to use an existing buffer with by replacing `New` with `NewBuffer`. # Blocking vs Non-blocking
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Wed May 15 00:11:04 GMT 2024 - 2.1K bytes - Click Count (0) -
internal/logger/target/http/http.go
name := newTgt.Name() currentBuff, ok := logChBuffers[name] if !ok { logChBuffers[name] = make(chan any, requiredCap) currentCap = requiredCap } else { currentCap = cap(currentBuff) requiredCap += len(currentBuff) } if requiredCap > currentCap { logChBuffers[name] = make(chan any, requiredCap) if len(currentBuff) > 0 { drain: for { select {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 15.6K bytes - Click Count (0) -
LICENSES/OWNERS
# See the OWNERS docs at https://go.k8s.io/owners options: # make root approval non-recursive no_parent_owners: true approvers:
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Mon Oct 10 12:26:53 GMT 2022 - 151 bytes - Click Count (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureFallbackAtomicHelperTest.java
* * <p>To force selection of our fallback strategies, we load {@link AbstractFuture} (and all of * {@code com.google.common.util.concurrent}) in degenerate class loaders which make certain * platform classes unavailable. Then we construct a test suite so we can run the normal * AbstractFutureTest test methods in these degenerate classloaders. */ @NullUnmarked @GwtIncompatibleCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Mar 07 02:20:33 GMT 2026 - 8.3K bytes - Click Count (0) -
cmd/bitrot.go
logger.Fatal(errSelfTestFailure, fmt.Sprintf("bitrot: failed to decode %v checksum %s for selftest: %v", algorithm, checksums[algorithm], err)) } var ( hash = algorithm.New() msg = make([]byte, 0, hash.Size()*hash.BlockSize()) sum = make([]byte, 0, hash.Size()) ) for i := 0; i < hash.Size()*hash.BlockSize(); i += hash.Size() { hash.Write(msg) sum = hash.Sum(sum[:0]) msg = append(msg, sum...) hash.Reset()
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 7.7K bytes - Click Count (0) -
internal/grid/grid.go
defaultSingleRequestTimeout = time.Minute ) var internalByteBuffer = bpool.Pool[*[]byte]{ New: func() *[]byte { m := make([]byte, 0, defaultBufferSize) return &m }, } var internal32KByteBuffer = bpool.Pool[*[]byte]{ New: func() *[]byte { m := make([]byte, 0, biggerBufMin) return &m }, } // GetByteBuffer can be replaced with a function that returns a small // byte buffer.
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Mar 30 00:56:02 GMT 2025 - 7K bytes - Click Count (0) -
.github/workflows/codeql-analysis.yml
# and modify them (or add more) to build your code if your project # uses a compiled language #- run: | # make bootstrap # make release - name: Perform CodeQL Analysis
Created: Thu Apr 02 15:34:12 GMT 2026 - Last Modified: Thu Nov 20 13:34:13 GMT 2025 - 2.1K bytes - Click Count (0)