- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 20 for E$1 (0.07 sec)
-
guava-tests/test/com/google/common/collect/ImmutableMultisetTest.java
a, b1, c, b2); collector = ImmutableMultiset.toImmutableMultiset(e -> e, e -> 1); CollectorTester.of(collector, equivalence) .expectCollects( ImmutableMultiset.<TypeWithDuplicates>builder().add(a).addCopies(b1, 2).add(c).build(), a, b1,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 25K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultiset.java
@IgnoreJRERequirement // Users will use this only if they're already using streams. public static <E> Collector<E, ?, ImmutableMultiset<E>> toImmutableMultiset() { return CollectCollectors.toImmutableMultiset(Function.identity(), e -> 1); } /** * Returns a {@code Collector} that accumulates elements into an {@code ImmutableMultiset} whose * elements are the result of applying {@code elementFunction} to the inputs, with counts equal to
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 22.5K bytes - Viewed (0) -
src/cmd/cgo/internal/test/test.go
} } func testNamedEnum(t *testing.T) { e := new(C.enum_E) *e = C.Enum1 if *e != 1 { t.Error("bad enum", C.Enum1) } *e = C.Enum2 if *e != 2 { t.Error("bad enum", C.Enum2) } } func testCastToEnum(t *testing.T) { e := C.enum_E(C.Enum1) if e != 1 { t.Error("bad enum", C.Enum1) } e = C.enum_E(C.Enum2) if e != 2 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:50:06 UTC 2024 - 48.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
* will be added more than once, with the count summed over all appearances of the element. * * <p>Note that {@code stream.collect(toMultiset(function, e -> 1, supplier))} is equivalent to * {@code stream.map(function).collect(Collectors.toCollection(supplier))}. * * <p>To collect to an {@link ImmutableMultiset}, use {@link * ImmutableMultiset#toImmutableMultiset}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 41.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java
public static <E> Collector<E, ?, ImmutableSortedMultiset<E>> toImmutableSortedMultiset( Comparator<? super E> comparator) { return toImmutableSortedMultiset(comparator, Function.identity(), e -> 1); } /** * Returns a {@code Collector} that accumulates elements into an {@code ImmutableSortedMultiset} * whose elements are the result of applying {@code elementFunction} to the inputs, with counts
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 35.5K bytes - Viewed (0) -
cluster/gce/gci/configure.sh
fi done done } function is-preloaded { local -r key=$1 local -r value=$2 grep -qs "${key},${value}" "${KUBE_HOME}/preload_info" } function split-commas { echo -e "${1//,/'\n'}" } function remount-flexvolume-directory { local -r flexvolume_plugin_dir=$1 mkdir -p "$flexvolume_plugin_dir" mount --bind "$flexvolume_plugin_dir" "$flexvolume_plugin_dir"
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 30 04:14:02 UTC 2024 - 36.5K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat.go
// doesn't pay off. Instead, we do a simple conditional square-and-multiply // chain, skipping the initial run of zeroes. xR := NewNat().set(x).montgomeryRepresentation(m) out.set(xR) for i := bits.UintSize - bitLen(e) + 1; i < bits.UintSize; i++ { out.montgomeryMul(out, out, m) if k := (e >> (bits.UintSize - i - 1)) & 1; k != 0 { out.montgomeryMul(out, xR, m) } } return out.montgomeryReduction(m)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 24K bytes - Viewed (0) -
src/cmd/go/go_test.go
} for _, e := range tg.env { if strings.HasPrefix(e, "GOROOT=") || strings.HasPrefix(e, "GOPATH=") || strings.HasPrefix(e, "GOBIN=") { val := e[strings.Index(e, "=")+1:] if strings.HasPrefix(val, "testdata") || strings.HasPrefix(val, "./testdata") { tg.t.Fatalf("internal testsuite error: call to parallel with testdata in environment (%s)", e) } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 81.1K bytes - Viewed (0) -
src/cmd/internal/obj/arm64/asm7.go
y += x return (y-1)&y == 0 } // bitconEncode returns the encoding of a bitcon used in logical instructions // x is known to be a bitcon // a bitcon is a sequence of n ones at low bits (i.e. 1<<n-1), right rotated // by R bits, and repeated with period of 64, 32, 16, 8, 4, or 2. // it is encoded in logical instructions with 3 bitfields // N (1 bit) : R (6 bits) : S (6 bits), where // N=1 -- period=64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 201.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_generated_ops.td
For complex numbers, the exponential value is calculated as follows: ``` e^(x+iy) = e^x * e^iy = e^x * (cos y + i sin y) ``` Let's consider complex number 1+1j as an example. e^1 * (cos 1 + i sin 1) = 2.7182818284590 * (0.54030230586+0.8414709848j) ```python x = tf.constant(1 + 1j) tf.math.exp(x) ==> 1.4686939399158851+2.2873552871788423j ``` }];
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 793K bytes - Viewed (0)