- Sort Score
- Result 10 results
- Languages All
Results 191 - 200 of 798 for NEXT (0.03 sec)
-
docs/en/docs/tutorial/dependencies/dependencies-in-path-operation-decorators.md
/// /// info In this example we use invented custom headers `X-Key` and `X-Token`. But in real cases, when implementing security, you would get more benefits from using the integrated [Security utilities (the next chapter)](../security/index.md){.internal-link target=_blank}. /// ## Dependencies errors and return values You can use the same dependency *functions* you use normally. ### Dependency requirements
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 4K bytes - Viewed (0) -
guava/src/com/google/common/eventbus/Dispatcher.java
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 7.3K bytes - Viewed (0) -
compat/maven-compat/src/test/java/org/apache/maven/artifact/resolver/ArtifactResolverTest.java
printErrors(result); Iterator<Artifact> i = result.getArtifacts().iterator(); assertEquals(n, i.next(), "n should be first"); assertEquals(m, i.next(), "m should be second"); // inverse order set = new LinkedHashSet<>(); set.add(m); set.add(n);
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 10.1K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
* acquire(1000)} will result in exactly the same throttling, if any), but it affects the throttling * of the <i>next</i> request. I.e., if an expensive task arrives at an idle RateLimiter, it will be * granted immediately, but it is the <i>next</i> request that will experience extra throttling, * thus paying for the cost of the expensive task. * * @author Dimitris Andreou * @since 13.0 */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:51:36 UTC 2024 - 21.9K bytes - Viewed (0) -
docs/en/docs/deployment/concepts.md
I'll show you some concrete examples in the next chapters. --- Then the next concepts to consider are all about the program running your actual API (e.g. Uvicorn). ## Program and Process
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Wed Sep 18 16:09:57 UTC 2024 - 17.8K bytes - Viewed (0) -
compat/maven-builder-support/src/main/java/org/apache/maven/building/ProblemCollector.java
*/ void add(Problem.Severity severity, String message, int line, int column, Exception cause); /** * The next messages will be bound to this source. When calling this method again, previous messages keep * their source, but the next messages will use the new source. * * @param source a source */ void setSource(String source); /** *
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 1.9K bytes - Viewed (0) -
docs/en/docs/advanced/middleware.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 27 16:45:50 UTC 2024 - 4K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/JoinerBenchmark.java
StringBuilder sb = new StringBuilder(); Iterator<String> iterator = components.iterator(); if (iterator.hasNext()) { sb.append(iterator.next().toString()); while (iterator.hasNext()) { sb.append(DELIMITER_STRING); sb.append(iterator.next()); } } dummy ^= sb.toString().length(); } return dummy; } /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 4.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/SimpleAbstractMultisetTest.java
@Override public boolean hasNext() { return backingEntries.hasNext(); } @Override public Multiset.Entry<E> next() { final Map.Entry<E, Integer> mapEntry = backingEntries.next(); return new Multisets.AbstractEntry<E>() { @Override public E getElement() { return mapEntry.getKey(); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Oct 15 17:36:06 UTC 2024 - 5.6K bytes - Viewed (0) -
internal/grid/benchmark_test.go
b.RunParallel(func(pb *testing.PB) { rng := rand.New(rand.NewSource(time.Now().UnixNano())) n := 0 var latency int64 managers := grid.Managers hosts := grid.Hosts for pb.Next() { // Pick a random manager. src, dst := rng.Intn(len(managers)), rng.Intn(len(managers)) if src == dst { dst = (dst + 1) % len(managers) } local := managers[src]
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Jun 07 15:51:52 UTC 2024 - 15.7K bytes - Viewed (0)