- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 29 for set_bits (1 sec)
-
tensorflow/compiler/mlir/tensorflow/transforms/tf_saved_model_freeze_variables.cc
// Construct a new array of input shapes excluding the input shapes of the // erased arguments. SmallVector<Attribute> updated_input_shapes_attr; for (const unsigned i : args_to_erase_bit_vector.flip().set_bits()) { updated_input_shapes_attr.emplace_back(input_shapes_attr[i]); } // Replaces the attribute with the updated "#tf_type.shape" array. // Builder builder(func_op.getContext());
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 09:56:53 UTC 2024 - 19.4K bytes - Viewed (0) -
src/math/big/bits_test.go
min = b } } // create bit pattern x := NewInt(0) for _, b := range bits { badj := b - min // propagate carry if necessary for x.Bit(badj) != 0 { x.SetBit(x, badj, 0) badj++ } x.SetBit(x, badj, 1) } // create corresponding float z := new(Float).SetInt(x) // normalized if e := int64(z.exp) + int64(min); MinExp <= e && e <= MaxExp { z.exp = int32(e) } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 5.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_ops_a_m.cc
const int32_t num_in_original = operandSegmentSizes[0]; int32_t num_in_tensors = num_in_original; int32_t num_captured_tensors = operandSegmentSizes[1]; for (const unsigned operand_index : erase_indices.set_bits()) { operand_index < num_in_original ? num_in_tensors-- : num_captured_tensors--; } getOperation()->eraseOperands(erase_indices); getOperation()->setAttr( operand_segment_size_attr,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 146.7K bytes - Viewed (0) -
src/math/big/int_test.go
} } func BenchmarkBitset(b *testing.B) { z := new(Int) z.SetBit(z, 512, 1) b.ResetTimer() for i := b.N - 1; i >= 0; i-- { z.SetBit(z, i&512, 1) } } func BenchmarkBitsetNeg(b *testing.B) { z := NewInt(-1) z.SetBit(z, 512, 0) b.ResetTimer() for i := b.N - 1; i >= 0; i-- { z.SetBit(z, i&512, 0) } } func BenchmarkBitsetOrig(b *testing.B) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 58.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/CharMatcher.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 53.7K bytes - Viewed (0) -
guava/src/com/google/common/base/CharMatcher.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 53.8K bytes - Viewed (0) -
src/math/big/int.go
return t.bit(uint(i)) ^ 1 } return x.abs.bit(uint(i)) } // SetBit sets z to x, with x's i'th bit set to b (0 or 1). // That is, if b is 1 SetBit sets z = x | (1 << i); // if b is 0 SetBit sets z = x &^ (1 << i). If b is not 0 or 1, // SetBit will panic. func (z *Int) SetBit(x *Int, i int, b uint) *Int { if i < 0 { panic("negative bit index") } if x.neg {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 33.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/BigIntegerMathTest.java
assertTrue(ZERO.setBit(result).compareTo(x) <= 0); assertTrue(ZERO.setBit(result + 1).compareTo(x) > 0); } } } public void testLog2Ceiling() { for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) { for (RoundingMode mode : asList(CEILING, UP)) { int result = BigIntegerMath.log2(x, mode); assertTrue(ZERO.setBit(result).compareTo(x) >= 0);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 17:58:33 UTC 2024 - 27.8K bytes - Viewed (0) -
common/scripts/kind_provisioner.sh
python3 - <<EOF from ipaddress import ip_network, IPv6Network; from itertools import islice; net = ip_network('$CIDR') net_bits = 128 if type(net) == IPv6Network else 32; net_len = pow(2, net_bits - net.prefixlen) start, end = int(net_len / 4 * 3), net_len if net_len > 2000: start, end = 1000, 2000
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Apr 08 19:12:55 UTC 2024 - 17.3K bytes - Viewed (0) -
src/hash/maphash/smhasher_test.go
} func sparse(t *testing.T, h *hashSet, n int, k int) { b := make([]byte, n/8) setbits(h, b, 0, k) h.check(t) } // set up to k bits at index i and greater func setbits(h *hashSet, b []byte, i int, k int) { h.addB(b) if k == 0 { return } for j := i; j < len(b)*8; j++ { b[j/8] |= byte(1 << uint(j&7)) setbits(h, b, j+1, k-1) b[j/8] &= byte(^(1 << uint(j&7))) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:41:38 UTC 2024 - 11K bytes - Viewed (0)