Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 41 - 50 of 101 for rdeps (0.02 seconds)

  1. tests/test_ws_dependencies.py

    async def index(websocket: WebSocket, deps: DepList):
        await websocket.accept()
        await websocket.send_text(json.dumps(deps))
        await websocket.close()
    
    
    @router.websocket("/router", dependencies=[create_dependency("routerindex")])
    async def routerindex(websocket: WebSocket, deps: DepList):
        await websocket.accept()
        await websocket.send_text(json.dumps(deps))
        await websocket.close()
    
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 21:25:59 GMT 2025
    - 2.1K bytes
    - Click Count (0)
  2. android/guava-tests/benchmark/com/google/common/base/ToStringHelperBenchmark.java

        if (omitNulls) {
          helper = helper.omitNullValues();
        }
        return helper;
      }
    
      @Benchmark
      int toString(int reps) {
        int dummy = 0;
        for (int i = 0; i < reps; i++) {
          MoreObjects.ToStringHelper helper = newHelper();
          for (int j = 0; j < dataSize; ++j) {
            dataset.addEntries(helper);
          }
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 4.4K bytes
    - Click Count (0)
  3. android/guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java

      }
    
      @Benchmark
      public int countIn(int reps) {
        int result = 0;
        CharMatcher matcher = this.matcher;
        String teststring = this.teststring;
        for (int i = 0; i < reps; i++) {
          result += matcher.countIn(teststring);
        }
        return result;
      }
    
      @Benchmark
      public int collapseFrom(int reps) {
        int result = 0;
        CharMatcher matcher = this.matcher;
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue May 13 18:46:00 GMT 2025
    - 3.9K bytes
    - Click Count (0)
  4. android/guava-tests/benchmark/com/google/common/math/IntMathRoundingBenchmark.java

      RoundingMode mode;
    
      @Benchmark
      int log2(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += IntMath.log2(positive[j], mode);
        }
        return tmp;
      }
    
      @Benchmark
      int log10(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += IntMath.log10(positive[j], mode);
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.6K bytes
    - Click Count (0)
  5. guava-tests/benchmark/com/google/common/io/BaseEncodingBenchmark.java

        }
      }
    
      @Benchmark
      public int encode(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          tmp += System.identityHashCode(encoding.encoding.encode(encodingInputs[i & INPUTS_MASK]));
        }
        return tmp;
      }
    
      @Benchmark
      public int decode(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 3.2K bytes
    - Click Count (0)
  6. guava-tests/benchmark/com/google/common/base/LazyStackTraceBenchmark.java

          throw new SkipThisScenarioException();
        }
      }
    
      @Benchmark
      public boolean timeFindCaller(int reps) {
        return timeFindCaller(reps, recursionCount);
      }
    
      private boolean timeFindCaller(int reps, int recurse) {
        return recurse > 0 ? timeFindCaller(reps, recurse - 1) : mode.timeIt(reps, breakAt);
      }
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.6K bytes
    - Click Count (0)
  7. android/guava-tests/benchmark/com/google/common/base/LazyStackTraceBenchmark.java

          throw new SkipThisScenarioException();
        }
      }
    
      @Benchmark
      public boolean timeFindCaller(int reps) {
        return timeFindCaller(reps, recursionCount);
      }
    
      private boolean timeFindCaller(int reps, int recurse) {
        return recurse > 0 ? timeFindCaller(reps, recurse - 1) : mode.timeIt(reps, breakAt);
      }
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.6K bytes
    - Click Count (0)
  8. guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java

        requests.set(0);
        misses.set(0);
      }
    
      @Benchmark
      int time(int reps) {
        int dummy = 0;
        for (int i = 0; i < reps; i++) {
          dummy += cache.getUnchecked(nextRandomKey());
        }
        requests.addAndGet(reps);
        return dummy;
      }
    
      private int nextRandomKey() {
        int a = random.nextInt(max);
    
        /*
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 3.4K bytes
    - Click Count (0)
  9. guava-tests/benchmark/com/google/common/eventbus/EventBusBenchmark.java

      @BeforeExperiment
      void setUp() {
        eventBus = new EventBus("for benchmarking purposes");
        eventBus.register(this);
      }
    
      @Benchmark
      void postStrings(int reps) {
        for (int i = 0; i < reps; i++) {
          eventBus.post("hello there");
        }
      }
    
      @Subscribe
      public void handleStrings(String string) {
        // Nothing to do here.
      }
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 1.2K bytes
    - Click Count (0)
  10. android/guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java

          queue.add(random.nextInt());
        }
      }
    
      @Benchmark
      void pollAndAdd(int reps) {
        for (int i = 0; i < reps; i++) {
          // TODO(kevinb): precompute random #s?
          queue.add(queue.poll() ^ random.nextInt());
        }
      }
    
      @Benchmark
      void populate(int reps) {
        for (int i = 0; i < reps; i++) {
          queue.clear();
          for (int j = 0; j < size; j++) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 4.4K bytes
    - Click Count (0)
Back to Top