- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 95 for timing (0.11 seconds)
-
docs/en/docs/advanced/security/http-basic-auth.md
# Return some error ... ``` But by using the `secrets.compare_digest()` it will be secure against a type of attacks called "timing attacks". ### Timing Attacks { #timing-attacks } But what's a "timing attack"? Let's imagine some attackers are trying to guess the username and password. And they send a request with a username `johndoe` and a password `love123`.Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 5K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/TimeLimiter.java
* annotation type, rather than an interface */ <T> T newProxy(T target, Class<T> interfaceType, long timeoutDuration, TimeUnit timeoutUnit); /** * Invokes a specified Callable, timing out after the specified time limit. If the target method * call finishes before the limit is reached, the return value or a wrapped exception is
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Jan 18 02:54:30 GMT 2025 - 8.2K bytes - Click Count (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/MonotonicClock.java
package org.apache.maven.api; import java.time.Clock; import java.time.Duration; import java.time.Instant; import java.time.ZoneId; import java.time.ZoneOffset; /** * A Clock implementation that combines monotonic timing with wall-clock time. * <p> * This class provides precise time measurements using {@link System#nanoTime()} * while maintaining wall-clock time information in UTC. The wall-clock timeCreated: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Wed Jan 15 06:28:29 GMT 2025 - 5.6K bytes - Click Count (0) -
api/maven-api-core/src/test/java/org/apache/maven/api/MonotonicClockTest.java
assertTrue( later.minus(initial).toMillis() >= 45, "Elapsed time difference should be at least 45ms (accounting for some timing variance)"); } @Test @DisplayName("MonotonicClock start time should remain constant") void testStartTime() throws InterruptedException { Instant start1 = MonotonicClock.start();
Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Wed Jan 15 06:28:29 GMT 2025 - 5.8K bytes - Click Count (0) -
ci/official/code_check_full.sh
# limitations under the License. # ============================================================================== source "${BASH_SOURCE%/*}/utilities/setup.sh"Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Tue Feb 06 17:29:44 GMT 2024 - 840 bytes - Click Count (0) -
.ci/jobs.t/elastic+elasticsearch+multijob+platform-support-windows.yml
- "windows-2016" - "windows-2019" # We shred out Windows testing into 4 parallel builds like on intake for expediency. # Our tests run much slower on Windows so this avoids issues with builds timing out. - axis: type: user-defined name: GRADLE_TASK values: - 'checkPart1' - 'checkPart2' - 'bwcTestSnapshots' - 'checkRestCompat'Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Wed Jun 09 01:50:21 GMT 2021 - 1.7K bytes - Click Count (0) -
docs/ko/docs/advanced/security/http-basic-auth.md
```Python if not (credentials.username == "stanleyjobson") or not (credentials.password == "swordfish"): # 어떤 오류를 반환 ... ``` 하지만 `secrets.compare_digest()`를 사용하면 "timing attacks"라고 불리는 한 유형의 공격에 대해 안전해집니다. ### 타이밍 공격 { #timing-attacks } 그렇다면 "timing attack"이란 무엇일까요? 공격자들이 사용자명과 비밀번호를 추측하려고 한다고 가정해봅시다. 그리고 사용자명 `johndoe`, 비밀번호 `love123`으로 요청을 보냅니다. 그러면 애플리케이션의 Python 코드는 대략 다음과 같을 것입니다: ```Python
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 14:06:26 GMT 2026 - 5.9K bytes - Click Count (0) -
docs/es/llm-prompt.md
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Tue Dec 16 16:33:45 GMT 2025 - 5.4K bytes - Click Count (0) -
ci/official/code_check_changed_files.sh
# limitations under the License. # ============================================================================== source "${BASH_SOURCE%/*}/utilities/setup.sh"Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Thu Oct 05 18:41:59 GMT 2023 - 850 bytes - Click Count (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
slowFactorials[i] = RANDOM_SOURCE.nextInt(factorialBound); binomials[i] = RANDOM_SOURCE.nextInt(factorials[i] + 1); } } /** Previous version of BigIntegerMath.factorial, kept for timing purposes. */ private static BigInteger oldSlowFactorial(int n) { if (n <= 20) { return BigInteger.valueOf(LongMath.factorial(n)); } else { int k = 20;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 3.5K bytes - Click Count (0)