- Sort Score
- Num 10 results
- Language All
Results 91 - 100 of 246 for counting (0.04 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
docs/de/llm-prompt.md
* «the lifespan event»: «das Lifespan-Event» * «the lock»: «der Lock» * «the locking»: «das Locking» * «the mobile application»: «die Mobile-Anwendung» * «the model object»: «das Modellobjekt» * «the mounting»: «das Mounten» * «mounted»: «gemountet» * «the origin»: «das Origin» * «the override»: «Die Überschreibung» * «the parameter»: «der Parameter» * «the parameters» (plural): «die Parameter»
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Fri Dec 26 09:39:53 GMT 2025 - 11.9K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
import com.google.caliper.BeforeExperiment; import com.google.caliper.Benchmark; import com.google.caliper.Param; import java.math.BigInteger; import org.jspecify.annotations.NullUnmarked; /** * Benchmarks for the non-rounding methods of {@code BigIntegerMath}. * * @author Louis Wasserman */ @NullUnmarked public class BigIntegerMathBenchmark { private static final int[] factorials = new int[ARRAY_SIZE];Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 3.5K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/math/DoubleMathTest.java
boolean isInBounds = expected.compareTo(MAX_INT_AS_BIG_DECIMAL) <= 0 & expected.compareTo(MIN_INT_AS_BIG_DECIMAL) >= 0; try { assertEquals( "Rounding " + d + " with mode " + mode, expected.intValue(), DoubleMath.roundToInt(d, mode)); assertTrue(isInBounds); } catch (ArithmeticException e) {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Oct 30 14:15:36 GMT 2025 - 27.3K bytes - Click Count (0) -
src/test/java/jcifs/smb1/smb1/Trans2FindFirst2ResponseTest.java
assertEquals(4, response.lastNameOffset); } @Test void testReadDataWireFormat() { response.numEntries = 1; response.lastNameOffset = 94; // Pointing to the start of the filename response.useUnicode = false; // Use OEM for simplicity byte[] buffer = new byte[120]; int bufferIndex = 0; // Entry 1
Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 9.3K bytes - Click Count (0) -
docs/en/docs/how-to/custom-request-and-route.md
{* ../../docs_src/custom_request_and_route/tutorial001_an_py310.py hl[9:16] *} ### Create a custom `GzipRoute` class { #create-a-custom-gziproute-class } Next, we create a custom subclass of `fastapi.routing.APIRoute` that will make use of the `GzipRequest`. This time, it will overwrite the method `APIRoute.get_route_handler()`. This method returns a function. And that function is what will receive a request and return a response.Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Wed Dec 10 08:55:32 GMT 2025 - 4.6K bytes - Click Count (0) -
android/guava/src/com/google/common/math/DoubleUtils.java
return x.longValue(); } else if (exponent > MAX_EXPONENT) { return x.signum() * POSITIVE_INFINITY; } /* * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or * down. twiceSignifFloor will contain the top SIGNIFICAND_BITS + 2 bits, and signifFloor the
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Dec 21 03:10:51 GMT 2024 - 5.1K bytes - Click Count (0) -
fastapi/utils.py
from pydantic import BaseModel from pydantic.fields import FieldInfo from typing_extensions import Literal from ._compat import v2 if TYPE_CHECKING: # pragma: nocover from .routing import APIRoute # Cache for `create_cloned_field` _CLONED_TYPES_CACHE: MutableMapping[type[BaseModel], type[BaseModel]] = ( WeakKeyDictionary() )Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sat Dec 27 12:54:56 GMT 2025 - 5.1K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactHashMap.java
/** * Contains the logical entries, in the range of [0, size()). The high bits of each int are the * part of the smeared hash of the key not covered by the hashtable mask, whereas the low bits are * the "next" pointer (pointing to the next entry in the bucket chain), which will always be less * than or equal to the hashtable mask. * * <pre> * hash = aaaaaaaa * mask = 00000fff * next = 00000bbb
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 39.6K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
assertThrows(IllegalArgumentException.class, () -> RateLimiter.create(1.0, -1, NANOSECONDS)); } @AndroidIncompatible // difference in String.format rounding? public void testWarmUp() { RateLimiter limiter = RateLimiter.create(2.0, 4000, MILLISECONDS, 3.0, stopwatch); for (int i = 0; i < 8; i++) { limiter.acquire(); // #1 }Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 21.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
assertThrows(IllegalArgumentException.class, () -> RateLimiter.create(1.0, -1, NANOSECONDS)); } @AndroidIncompatible // difference in String.format rounding? public void testWarmUp() { RateLimiter limiter = RateLimiter.create(2.0, 4000, MILLISECONDS, 3.0, stopwatch); for (int i = 0; i < 8; i++) { limiter.acquire(); // #1 }Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 21.9K bytes - Click Count (0)