- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 625 for repeats (0.14 sec)
-
src/compress/bzip2/bzip2.go
// This is either the RUNA or RUNB symbol. if repeat == 0 { repeatPower = 1 } repeat += repeatPower << v repeatPower <<= 1 // This limit of 2 million comes from the bzip2 source // code. It prevents repeat from overflowing. if repeat > 2*1024*1024 { return StructuralError("repeat count too large") } continue } if repeat > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:40 UTC 2024 - 13K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/c/c_api_unified_experimental_mlir.cc
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 28.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
assertTrue(BloomFilter.optimalNumOfBits(n, fpp) >= 0); } } // some random values Random random = new Random(0); for (int repeats = 0; repeats < 10000; repeats++) { assertTrue(BloomFilter.optimalNumOfBits(random.nextInt(1 << 16), random.nextDouble()) >= 0); } // and some crazy values (this used to be capped to Integer.MAX_VALUE, now it can go bigger
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 21.2K bytes - Viewed (0) -
src/hash/maphash/smhasher_test.go
b[i] = 0 } } } // Test strings with repeats, like "abcdabcdabcdabcd..." func TestSmhasherCyclic(t *testing.T) { if testing.Short() { t.Skip("Skipping in short mode") } t.Parallel() r := rand.New(rand.NewSource(1234)) const REPEAT = 8 const N = 1000000 h := newHashSet() for n := 4; n <= 12; n++ { b := make([]byte, REPEAT*n) for i := 0; i < N; i++ { b[0] = byte(i * 79 % 97)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:41:38 UTC 2024 - 11K bytes - Viewed (0) -
src/slices/slices.go
newslice = append(newslice, s...) } return newslice } // Repeat returns a new slice that repeats the provided slice the given number of times. // The result has length and capacity (len(x) * count). // The result is never nil. // Repeat panics if count is negative or if the result of (len(x) * count) // overflows. func Repeat[S ~[]E, E any](x S, count int) S { if count < 0 { panic("cannot be negative") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 29 14:01:59 UTC 2024 - 13.6K bytes - Viewed (0) -
src/internal/reflectlite/value.go
// - flagIndir: val holds a pointer to the data // - flagAddr: v.CanAddr is true (implies flagIndir) // Value cannot represent method values. // The next five bits give the Kind of the value. // This repeats typ.Kind() except for method values. // The remaining 23+ bits give a method number for method values. // If flag.kind() != Func, code can assume that flagMethod is unset.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 17:01:54 UTC 2024 - 13.6K bytes - Viewed (0) -
src/database/sql/convert.go
// D: 1. Column Converter 2. Default // // The only time a Column Converter is called is first // or after NamedValueConverter. If first it is handled before // the nextCheck label. Thus for repeats tries only when the // NamedValueConverter is selected should the Column Converter // be used in the retry. checker := defaultCheckNamedValue nextCC := false switch { case nvc != nil:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 16.2K bytes - Viewed (0) -
src/runtime/hash_test.go
} } b[i] = 0 } } } // Test strings with repeats, like "abcdabcdabcdabcd..." func TestSmhasherCyclic(t *testing.T) { if testing.Short() { t.Skip("Skipping in short mode") } if race.Enabled { t.Skip("Too long for race mode") } t.Parallel() r := rand.New(rand.NewSource(1234)) const REPEAT = 8 const N = 1000000 h := newHashSet() for n := 4; n <= 12; n++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 17:50:18 UTC 2024 - 18.4K bytes - Viewed (0) -
src/runtime/mfinal.go
} var finalizer1 = [...]byte{ // Each Finalizer is 5 words, ptr ptr INT ptr ptr (INT = uintptr here) // Each byte describes 8 words. // Need 8 Finalizers described by 5 bytes before pattern repeats: // ptr ptr INT ptr ptr // ptr ptr INT ptr ptr // ptr ptr INT ptr ptr // ptr ptr INT ptr ptr // ptr ptr INT ptr ptr // ptr ptr INT ptr ptr // ptr ptr INT ptr ptr // ptr ptr INT ptr ptr // aka //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 01:56:56 UTC 2024 - 19K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/common/quantization_lib/quantization_utils.cc
namespace quant { namespace { constexpr double kSmallestHalfRange = kNearZeroTolerance / 2; using QType = quant::QuantizedType; // Repeats the content of `data` multiple times to resize to `target_size`. // Note that this only broadcast across one dimension. template <typename T> bool BroadcastVector(int target_size, SmallVectorImpl<T>& data) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 08 02:10:16 UTC 2024 - 43.2K bytes - Viewed (0)