- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 580 for mass (0.04 sec)
-
src/internal/trace/gc.go
if q > maxQ { maxQ = q } } // The distribution's mass is in units of time (it's not // normalized because this would make it more annoying to // account for future contributions of unrefined bands). The // total final mass will be the duration of the trace itself // minus the window size. Using this, we can compute the mass // corresponding to quantile maxQ. var duration int64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 26K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBiMap.java
this.lastInKeyInsertionOrder = null; this.size = 0; this.mask = tableSize - 1; this.modCount = 0; } /** * Finds and removes {@code entry} from the bucket linked lists in both the key-to-value direction * and the value-to-key direction. */ private void delete(BiEntry<K, V> entry) { int keyBucket = entry.keyHash & mask; BiEntry<K, V> prevBucketEntry = null;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 24.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/RegularImmutableBiMap.java
V value = entry.getValue(); checkEntryNotNull(key, value); int keyHash = key.hashCode(); int valueHash = value.hashCode(); int keyBucket = Hashing.smear(keyHash) & mask; int valueBucket = Hashing.smear(valueHash) & mask; ImmutableMapEntry<K, V> nextInKeyBucket = keyTable[keyBucket]; ImmutableMapEntry<K, V> nextInValueBucket = valueTable[valueBucket]; try {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 11.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
int hash = smearedHash(key); int mask = hashTableMask(); int tableIndex = hash & mask; int next = CompactHashing.tableGet(requireTable(), tableIndex); if (next == UNSET) { // uninitialized bucket if (newSize > mask) { // Resize and add new entry mask = resizeTable(mask, CompactHashing.newCapacity(mask), hash, newEntryIndex); } else {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 39.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/tpu-dynamic-layout-pass.mlir
// RUN: tf-opt %s -split-input-file -tf-tpu-dynamic-layout-pass | FileCheck %s // Tests that the pass can transform non-replicated execution. // CHECK: func @non_replicated(%[[ARG0:.*]]: tensor<*x!tf_type.resource> {tf.device = "/device:CPU:0"}) -> tensor<i32> func.func @non_replicated(%arg0: tensor<*x!tf_type.resource> {tf.device = "/device:CPU:0"}) -> tensor<i32> { // CHECK: %[[COMPILE:.*]]:2 = "tf_device.launch" // CHECK-NEXT: "tf._TPUCompileMlir"()
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Oct 31 08:59:10 UTC 2023 - 29.6K bytes - Viewed (0) -
src/cmd/internal/obj/riscv/cpu.go
ARDINSTRETH: true, } // Instruction encoding masks. const ( // BTypeImmMask is a mask including only the immediate portion of // B-type instructions. BTypeImmMask = 0xfe000f80 // CBTypeImmMask is a mask including only the immediate portion of // CB-type instructions. CBTypeImmMask = 0x1c7c // CJTypeImmMask is a mask including only the immediate portion of // CJ-type instructions.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 20 14:19:33 UTC 2024 - 13.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/op.go
s += "INS:\n" for _, i := range r.inputs { mask := fmt.Sprintf("%64b", i.regs) mask = strings.Replace(mask, "0", ".", -1) s += fmt.Sprintf("%2d |%s|\n", i.idx, mask) } s += "OUTS:\n" for _, i := range r.outputs { mask := fmt.Sprintf("%64b", i.regs) mask = strings.Replace(mask, "0", ".", -1) s += fmt.Sprintf("%2d |%s|\n", i.idx, mask) } s += "CLOBBERS:\n" mask := fmt.Sprintf("%64b", r.clobbers)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 15:29:10 UTC 2024 - 18.7K bytes - Viewed (0) -
src/crypto/internal/mlkem768/mlkem768.go
u[i] = ringDecodeAndDecompress10(b) } b := (*[encodingSize4]byte)(c[encodingSize10*k:]) v := ringDecodeAndDecompress4(b) var mask nttElement // s⊺ ◦ NTT(u) for i := range dx.s { mask = polyAdd(mask, nttMul(dx.s[i], ntt(u[i]))) } w := polySub(v, inverseNTT(mask)) return ringCompressAndEncode1(nil, w) } // fieldElement is an integer modulo q, an element of ℤ_q. It is always reduced.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 28.4K bytes - Viewed (0) -
src/runtime/asm_386.s
DATA masks<>+0xac(SB)/4, $0x00000000 DATA masks<>+0xb0(SB)/4, $0xffffffff DATA masks<>+0xb4(SB)/4, $0xffffffff DATA masks<>+0xb8(SB)/4, $0x00ffffff DATA masks<>+0xbc(SB)/4, $0x00000000 DATA masks<>+0xc0(SB)/4, $0xffffffff DATA masks<>+0xc4(SB)/4, $0xffffffff DATA masks<>+0xc8(SB)/4, $0xffffffff DATA masks<>+0xcc(SB)/4, $0x00000000 DATA masks<>+0xd0(SB)/4, $0xffffffff
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 15 15:45:13 UTC 2024 - 43.1K bytes - Viewed (0) -
src/os/signal/signal_cgo_test.go
// read. // // These steps are complicated by the rules around foreground process // groups. A process group cannot be foreground if it is "orphaned", // unless it masks SIGTTOU. i.e., to be foreground the process group // must have a parent process group in the same session or mask SIGTTOU // (which we do). An orphaned process group cannot receive // terminal-generated SIGTSTP at all. // // Achieving this requires three processes total:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 20 10:09:15 UTC 2024 - 10.7K bytes - Viewed (0)