- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 69 for primul (3.52 sec)
-
istioctl/pkg/ztunnelconfig/ztunnelconfig.go
} return debug, err } func setupConfigdumpZtunnelConfigWriter(debug []byte, out io.Writer) (*ztunnelDump.ConfigWriter, error) { cw := &ztunnelDump.ConfigWriter{Stdout: out, FullDump: debug} err := cw.Prime(debug) if err != nil { return nil, err } return cw, nil } func setupFileZtunnelConfigdumpWriter(filename string, out io.Writer) (*ztunnelDump.ConfigWriter, error) { data, err := readFile(filename)
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Wed May 01 13:11:40 GMT 2024 - 22.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
// The alternative (x + y) >>> 1 fails for negative values. return (x & y) + ((x ^ y) >> 1); } /** * Returns {@code true} if {@code n} is a <a * href="http://mathworld.wolfram.com/PrimeNumber.html">prime number</a>: an integer <i>greater * than one</i> that cannot be factored into a product of <i>smaller</i> positive integers. * Returns {@code false} if {@code n} is zero, one, or a composite number (one which <i>can</i> be
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Range.java
* {@code r.contains(c1) && r.contains(c3)} implies {@code r.contains(c2)}). This means that a * {@code Range<Integer>} can never be used to represent, say, "all <i>prime</i> numbers from * 1 to 100." * <li>When evaluated as a {@link Predicate}, a range yields the same result as invoking {@link * #contains}.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 27.8K bytes - Viewed (0) -
doc/go1.17_spec.html
for i := range src { // Loop over values received from 'src'. if i%prime != 0 { dst <- i // Send 'i' to channel 'dst'. } } } // The prime sieve: Daisy-chain filter processes together. func sieve() { ch := make(chan int) // Create a new channel. go generate(ch) // Start generate() as a subprocess. for { prime := <-ch fmt.Print(prime, "\n")
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 211.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// ends up at a[d], which in turn ends up at a[2d], and so on until we get back to a[0]. // (All indices taken mod n.) If d and n are mutually prime, all elements will have been // moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc, // then a[2] etc, and so on until we have rotated all elements. There are gcd(d, n) cycles
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
* * <pre>{@code * public static final ImmutableSortedSet<Number> LUCKY_NUMBERS = * new ImmutableSortedSet.Builder<Number>(ODDS_FIRST_COMPARATOR) * .addAll(SINGLE_DIGIT_PRIMES) * .add(42) * .build(); * }</pre> * * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 38.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
* * <pre>{@code * public static final ImmutableSortedSet<Number> LUCKY_NUMBERS = * new ImmutableSortedSet.Builder<Number>(ODDS_FIRST_COMPARATOR) * .addAll(SINGLE_DIGIT_PRIMES) * .add(42) * .build(); * }</pre> * * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 36.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
hashFunctions[0] = Murmur3_128HashFunction.GOOD_FAST_HASH_128; int seed = GOOD_FAST_HASH_SEED; for (int i = 1; i < hashFunctionsNeeded; i++) { seed += 1500450271; // a prime; shouldn't matter hashFunctions[i] = murmur3_128(seed); } return new ConcatenatedHashFunction(hashFunctions); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
doc/go_spec.html
for i := range src { // Loop over values received from 'src'. if i%prime != 0 { dst <- i // Send 'i' to channel 'dst'. } } } // The prime sieve: Daisy-chain filter processes together. func sieve() { ch := make(chan int) // Create a new channel. go generate(ch) // Start generate() as a subprocess. for { prime := <-ch fmt.Print(prime, "\n")
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu May 02 22:43:51 GMT 2024 - 279.6K bytes - Viewed (0) -
src/bufio/bufio_test.go
return } } } func createTestInput(n int) []byte { input := make([]byte, n) for i := range input { // 101 and 251 are arbitrary prime numbers. // The idea is to create an input sequence // which doesn't repeat too frequently. input[i] = byte(i % 251) if i%101 == 0 { input[i] ^= byte(i / 101) } } return input }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Feb 10 18:56:01 GMT 2023 - 51.5K bytes - Viewed (0)