- Sort Score
- Result 10 results
- Languages All
Results 391 - 400 of 573 for Franke (0.04 sec)
-
guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
} return BigInteger.valueOf(result); } /* * We want each multiplication to have both sides with approximately the same number of digits. * Currently, we just divide the range in half. */ int mid = (n1 + n2) >>> 1; return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2)); } @Benchmark int slowFactorial(int reps) { int tmp = 0;Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 3.5K bytes - Viewed (0) -
src/test/java/jcifs/smb1/smb1/NtTransQuerySecurityDescTest.java
bb.putShort((short) fid); bb.put((byte) 0x00); // Reserved bb.put((byte) 0x00); // Reserved bb.putInt(securityInformation); return bb.array(); } /** * Provide a range of values that are valid for the constructor. */ static Stream<org.junit.jupiter.params.provider.Arguments> validInputs() { return Stream.of(org.junit.jupiter.params.provider.Arguments.of(0x0001, 0x00000000),
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 4.6K bytes - Viewed (0) -
docs/pt/docs/deployment/concepts.md
memória, por exemplo, um modelo de aprendizado de máquina em uma variável, ou o conteúdo de um arquivo grande em uma variável, tudo isso **consome um pouco da memória (RAM)** do servidor. E vários processos normalmente **não compartilham nenhuma memória**. Isso significa que cada processo em execução tem suas próprias coisas, variáveis e memória. E se você estiver consumindo uma grande quantidade de memória em seu código, **cada processo** consumirá uma quantidade equivalente de memória....
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun May 11 13:37:26 UTC 2025 - 19.7K bytes - Viewed (0) -
docs/en/docs/tutorial/handling-errors.md
* etc. In these cases, you would normally return an **HTTP status code** in the range of **400** (from 400 to 499). This is similar to the 200 HTTP status codes (from 200 to 299). Those "200" status codes mean that somehow there was a "success" in the request. The status codes in the 400 range mean that there was an error from the client. Remember all those **"404 Not Found"** errors (and jokes)?
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 9.4K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/opensearch/query/StoredLtrQueryBuilder.java
import org.opensearch.index.query.QueryBuilder; import org.opensearch.index.query.QueryShardContext; /** * A query builder for a stored LTR (Learning to Rank) query. * This builder constructs a query that uses a pre-trained LTR model * to re-rank search results based on a given set of features. */ public class StoredLtrQueryBuilder extends AbstractQueryBuilder<StoredLtrQueryBuilder> implements NamedWriteable {
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 7.6K bytes - Viewed (0) -
cmd/bucket-lifecycle.go
// PendingTasks returns the number of pending ILM expiry tasks. func (es *expiryState) PendingTasks() int { w := es.workers.Load() if w == nil || len(*w) == 0 { return 0 } var tasks int for _, wrkr := range *w { tasks += len(wrkr) } return tasks } // enqueueTierJournalEntry enqueues a tier journal entry referring to a remote // object corresponding to a 'replaced' object versions. This applies only to
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 33.7K bytes - Viewed (0) -
src/cmd/asm/internal/arch/arm64.go
// Handle some special cases. specialMapping := map[string]arm64.SpecialOperand{ // The internal representation of CS(CC) and HS(LO) are the same. "CS": arm64.SPOP_HS, "CC": arm64.SPOP_LO, } for s, opd := range specialMapping { arm64SpecialOperand[s] = opd } } if opd, ok := arm64SpecialOperand[name]; ok { return opd } return arm64.SPOP_END }
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Feb 14 15:13:11 UTC 2025 - 10.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/MathBenchmarking.java
} /** * Generates a number in [0, 2^numBits) with an exponential distribution. The floor of the log2 of * the result is chosen uniformly at random in [0, numBits), and then the result is chosen in that * range uniformly at random. Zero is treated as having log2 == 0. */ static BigInteger randomNonNegativeBigInteger(int numBits) { int digits = RANDOM_SOURCE.nextInt(numBits); if (digits == 0) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Aug 10 19:54:19 UTC 2025 - 4.2K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Doubles.java
max = Math.max(max, array[i]); } return max; } /** * Returns the value nearest to {@code value} which is within the closed range {@code [min..max]}. * * <p>If {@code value} is within the range {@code [min..max]}, {@code value} is returned * unchanged. If {@code value} is less than {@code min}, {@code min} is returned, and if {@code
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 27.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/SortedSetTestSuiteBuilder.java
// the null value might be out of bounds, so we can't always construct a subset with nulls features.add(CollectionFeature.ALLOWS_NULL_QUERIES); // but add null might still be supported if it happens to be within range of the subset suppressing.add(CollectionAddTester.getAddNullUnsupportedMethod()); suppressing.add(CollectionAddAllTester.getAddAllNullUnsupportedMethod()); } return newBuilderUsing(delegate, to, from)
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 4.9K bytes - Viewed (0)