- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 269 for hamster (0.09 sec)
-
src/cmd/vendor/rsc.io/markdown/emoji.go
"haiti": "\U0001f1ed\U0001f1f9", "hamburger": "\U0001f354", "hammer": "\U0001f528", "hammer_and_pick": "\u2692\ufe0f", "hammer_and_wrench": "\U0001f6e0\ufe0f", "hamster": "\U0001f439", "hand": "\u270b",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 107.7K bytes - Viewed (0) -
src/runtime/map_fast64.go
racewritepc(unsafe.Pointer(h), callerpc, abi.FuncPCABIInternal(mapassign_fast64)) } if h.flags&hashWriting != 0 { fatal("concurrent map writes") } hash := t.Hasher(noescape(unsafe.Pointer(&key)), uintptr(h.hash0)) // Set hashWriting after calling t.hasher for consistency with mapassign. h.flags ^= hashWriting if h.buckets == nil { h.buckets = newobject(t.Bucket) // newarray(t.bucket, 1) } again:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 14.1K bytes - Viewed (0) -
src/strings/compare.go
// The result will be 0 if a == b, -1 if a < b, and +1 if a > b. // // Use Compare when you need to perform a three-way comparison (with // slices.SortFunc, for example). It is usually clearer and always faster // to use the built-in string comparison operators ==, <, >, and so on. func Compare(a, b string) int { return bytealg.CompareString(a, b)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 23:39:07 UTC 2024 - 628 bytes - Viewed (0) -
src/sort/sort_impl_go121.go
// license that can be found in the LICENSE file. //go:build go1.21 // Starting with Go 1.21, we can leverage the new generic functions from the // slices package to implement some `sort` functions faster. However, until // the bootstrap compiler uses Go 1.21 or later, we keep a fallback version // in sort_impl_120.go that retains the old implementation. package sort import "slices"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jul 21 13:00:18 UTC 2023 - 876 bytes - Viewed (0) -
src/net/netip/uint128.go
// 128-bit number. func mask6(n int) uint128 { return uint128{^(^uint64(0) >> n), ^uint64(0) << (128 - n)} } // isZero reports whether u == 0. // // It's faster than u == (uint128{}) because the compiler (as of Go // 1.15/1.16b1) doesn't do this trick and instead inserts a branch in // its eq alg's generated code. func (u uint128) isZero() bool { return u.hi|u.lo == 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 07 21:28:44 UTC 2022 - 2.2K bytes - Viewed (0) -
src/internal/coverage/cfile/apis.go
} if cmode != coverage.CtrModeAtomic { return fmt.Errorf("ClearCounters invoked for program built with -covermode=%s (please use -covermode=atomic)", cmode.String()) } // Implementation note: this function would be faster and simpler // if we could just zero out the entire counter array, but for the // moment we go through and zero out just the slots in the array // corresponding to the counter values. We do this to avoid the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 09:57:47 UTC 2024 - 5.4K bytes - Viewed (0) -
src/log/slog/value_test.go
} func (r *replace) LogValue() Value { return r.v } type panickingLogValue struct{} func (panickingLogValue) LogValue() Value { panic("bad") } // A Value with "unsafe" strings is significantly faster: // safe: 1785 ns/op, 0 allocs // unsafe: 690 ns/op, 0 allocs // Run this with and without -tags unsafe_kvs to compare. func BenchmarkUnsafeStrings(b *testing.B) { b.ReportAllocs() dst := make([]Value, 100)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 16:12:08 UTC 2024 - 6.9K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/server/options/encryptionconfig/controller/controller.go
return nil, false, nil } return encryptionConfiguration, true, nil } // minKMSPluginCloseGracePeriod can be lowered in unit tests to make the health check poll faster var minKMSPluginCloseGracePeriod = 10 * time.Second func (d *DynamicEncryptionConfigContent) validateNewTransformersHealth( ctx context.Context, kmsPluginHealthzCheck healthz.HealthChecker,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 9.5K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/generate.go
}, { Element: "P384Element", Prime: "2^384 - 2^128 - 2^96 + 2^32 - 1", Prefix: "p384", FiatType: "[6]uint64", BytesLen: 48, }, // Note that unsaturated_solinas would be about 2x faster than // word_by_word_montgomery for P-521, but this curve is used rarely enough // that it's not worth carrying unsaturated_solinas support for it. { Element: "P521Element", Prime: "2^521 - 1",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 9.1K bytes - Viewed (0) -
src/runtime/mksizeclasses.go
// // if d is a power of two then // Let F ← log₂(d) and c = 1. // else // Let F ← N + L where L is the smallest integer // such that d ≤ (2^(N+L) mod d) + 2^L. // end if // // [1] "Faster Remainder by Direct Computation: Applications to // Compilers and Software Libraries" Daniel Lemire, Owen Kaser, // Nathan Kurz arXiv:1902.01961 // // To minimize the risk of introducing errors, we implement the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:31:27 UTC 2024 - 9.6K bytes - Viewed (0)