- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 76 for prime (0.01 sec)
-
android/guava-tests/test/com/google/common/math/MathTesting.java
// Add boundary values manually to avoid over/under flow (this covers 2^N for 0 and 31). intValues.add(Integer.MAX_VALUE - 1, Integer.MAX_VALUE); // Add values up to 40. This covers cases like "square of a prime" and such. for (int i = 1; i <= 40; i++) { intValues.add(i); } // Now add values near 2^N for lots of values of N. for (int exponent : asList(2, 3, 4, 9, 15, 16, 17, 24, 25, 30)) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Aug 10 19:54:19 UTC 2025 - 11.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/DiscreteDomain.java
* #minValue} and {@link #maxValue} should also be overridden for bounded types. * * <p>A discrete domain always represents the <i>entire</i> set of values of its type; it cannot * represent partial domains such as "prime integers" or "strings of length 5." * * <p>See the Guava User Guide section on <a href= * "https://github.com/google/guava/wiki/RangesExplained#discrete-domains">{@code * DiscreteDomain}</a>. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Feb 13 17:34:21 UTC 2025 - 10.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/DiscreteDomain.java
* #minValue} and {@link #maxValue} should also be overridden for bounded types. * * <p>A discrete domain always represents the <i>entire</i> set of values of its type; it cannot * represent partial domains such as "prime integers" or "strings of length 5." * * <p>See the Guava User Guide section on <a href= * "https://github.com/google/guava/wiki/RangesExplained#discrete-domains">{@code * DiscreteDomain}</a>. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Feb 13 17:34:21 UTC 2025 - 10.4K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
| (1 << 29)); /** * 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
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 29 16:20:07 UTC 2025 - 46.8K 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); } /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Jul 17 15:26:41 UTC 2025 - 29.8K 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
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 31.4K bytes - Viewed (0) -
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); } /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:06:57 UTC 2025 - 31.1K bytes - Viewed (0) -
tests/hooks_test.go
// will set all product's price to last product's price + 10 for idx, value := range []int64{410, 410, 410} { if products[idx].Price != value { t.Errorf("invalid price for product #%v, expects: %v, got %v", idx, value, products[idx].Price) } } products2 := []Product3{ {Name: "Product-1", Price: 100}, {Name: "Product-2", Price: 200}, {Name: "Product-3", Price: 300}, } DB.Create(&products2)
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Mon Jun 17 03:59:06 UTC 2024 - 16.7K bytes - Viewed (0) -
docs/es/docs/advanced/generate-clients.md
También obtendrás autocompletado para el payload a enviar: <img src="/img/tutorial/generate-clients/image03.png"> /// tip | Consejo Nota el autocompletado para `name` y `price`, que fue definido en la aplicación de FastAPI, en el modelo `Item`. /// Tendrás errores en línea para los datos que envíes: <img src="/img/tutorial/generate-clients/image04.png">
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Tue Jun 17 11:53:56 UTC 2025 - 10.9K bytes - Viewed (0) -
docs/fr/docs/index.md
```Python hl_lines="4 9-12 25-27" from typing import Union from fastapi import FastAPI from pydantic import BaseModel app = FastAPI() class Item(BaseModel): name: str price: float is_offer: Union[bool, None] = None @app.get("/") def read_root(): return {"Hello": "World"} @app.get("/items/{item_id}") def read_item(item_id: int, q: Union[str, None] = None):
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 10:49:48 UTC 2025 - 22K bytes - Viewed (0)