- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 188 for flips (0.08 sec)
-
src/hash/maphash/smhasher_test.go
// More precisely, we did N = k.bits() * hashSize experiments where // each is the sum of REP coin flips. We want to find bounds on the // sum of coin flips such that a truly random experiment would have // all sums inside those bounds with 99% probability. N := n * hashSize var c float64 // find c such that Prob(mean-c*stddev < x < mean+c*stddev)^N > .9999
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:41:38 UTC 2024 - 11K bytes - Viewed (0) -
android/guava/src/com/google/common/io/ReaderInputStream.java
} /** * Flips the buffer output buffer so we can start reading bytes from it. If we are starting to * drain because there was overflow, and there aren't actually any characters to drain, then the * overflow must be due to a small output buffer. */ private void startDraining(boolean overflow) { Java8Compatibility.flip(byteBuffer); if (overflow && byteBuffer.remaining() == 0) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 28 20:13:02 UTC 2023 - 9.3K bytes - Viewed (0) -
guava/src/com/google/common/io/ReaderInputStream.java
} /** * Flips the buffer output buffer so we can start reading bytes from it. If we are starting to * drain because there was overflow, and there aren't actually any characters to drain, then the * overflow must be due to a small output buffer. */ private void startDraining(boolean overflow) { Java8Compatibility.flip(byteBuffer); if (overflow && byteBuffer.remaining() == 0) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 28 20:13:02 UTC 2023 - 9.3K bytes - Viewed (0) -
src/runtime/hash_test.go
// More precisely, we did N = k.bits() * hashSize experiments where // each is the sum of REP coin flips. We want to find bounds on the // sum of coin flips such that a truly random experiment would have // all sums inside those bounds with 99% probability. N := n * hashSize var c float64 // find c such that Prob(mean-c*stddev < x < mean+c*stddev)^N > .9999
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/internal/fuzz/mutators_byteslice.go
} src := m.rand(len(b)) dst := m.rand(len(b)) for dst == src { dst = m.rand(len(b)) } n := m.chooseLen(len(b) - src - 1) copy(b[dst:], b[src:src+n]) return b } // byteSliceBitFlip flips a random bit in a random byte in b. func byteSliceBitFlip(m *mutator, b []byte) []byte { if len(b) == 0 { return nil } pos := m.rand(len(b)) b[pos] ^= 1 << uint(m.rand(8)) return b }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 19 18:23:43 UTC 2021 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Tables.java
} @Override public String toString() { return "(" + getRowKey() + "," + getColumnKey() + ")=" + getValue(); } } /** * Creates a transposed view of a given table that flips its row and column keys. In other words, * calling {@code get(columnKey, rowKey)} on the generated table always returns the same value as * calling {@code get(rowKey, columnKey)} on the original table. Updating the original table
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 26.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Tables.java
} @Override public String toString() { return "(" + getRowKey() + "," + getColumnKey() + ")=" + getValue(); } } /** * Creates a transposed view of a given table that flips its row and column keys. In other words, * calling {@code get(columnKey, rowKey)} on the generated table always returns the same value as * calling {@code get(rowKey, columnKey)} on the original table. Updating the original table
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 04 22:45:41 UTC 2024 - 26.3K bytes - Viewed (0) -
src/main/webapp/js/admin/popper.min.js.map
not */\n enabled: true,\n /** @prop {ModifierFn} */\n fn: flip,\n /**\n * @prop {String|Array} behavior='flip'\n * The behavior used to change the popper's placement. It can be one of\n * `flip`, `clockwise`, `counterclockwise` or an array with a list of valid\n * placements (with optional variations)\n */\n behavior: 'flip',\n /**\n * @prop {number} padding=5\n * The popper will flip if it hits the edges of the `boundariesElement`\n */\n padding:...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Feb 07 10:28:50 UTC 2020 - 121K bytes - Viewed (0) -
tensorflow/cc/gradients/math_grad.cc
auto input_shape = Shape(scope, op.input(0)); // output_shape_kept_dims = [2, 1] auto output_shape_kept_dims = ReducedShapeHelper(scope, input_shape, op.input(1)); // This step "flips" any 1s with values from the input_shape, and // replaces remaining entries with 1. This creates a shape that // shows how much each dimension in the incoming gradient should be // replicated. // tile_scaling = [1, 3]
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Aug 25 18:20:20 UTC 2023 - 50.7K bytes - Viewed (0) -
internal/fips/fips.go
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jun 21 14:54:48 UTC 2022 - 860 bytes - Viewed (0)