Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 30 for mid2 (0.07 sec)

  1. fess-crawler-opensearch/src/test/java/org/codelibs/fess/crawler/service/impl/OpenSearchDataServiceTest.java

            accessResult2.setSessionId("id2");
            accessResult2.setStatus(200);
            accessResult2.setUrl("http://www.id2.com/");
    
            dataService.store(accessResult2);
    
            final OpenSearchAccessResult accessResult3 = dataService.getAccessResult("id1", "http://www.id1.com/");
            final OpenSearchAccessResult accessResult4 = dataService.getAccessResult("id2", "http://www.id2.com/");
            assertNotNull(accessResult3);
    Registered: Sun Nov 10 03:50:12 UTC 2024
    - Last Modified: Thu Nov 07 04:44:10 UTC 2024
    - 6.8K bytes
    - Viewed (0)
  2. buildscripts/verify-healing-empty-erasure-set.sh

    	pid1=$!
    	disown ${pid1}
    
    	"${MINIO[@]}" --address ":$((start_port + 2))" $args >"${WORK_DIR}/dist-minio-server2.log" 2>&1 &
    	pid2=$!
    	disown $pid2
    
    	"${MINIO[@]}" --address ":$((start_port + 3))" $args >"${WORK_DIR}/dist-minio-server3.log" 2>&1 &
    	pid3=$!
    	disown $pid3
    
    	export MC_HOST_myminio="http://minio:minio123@127.0.0.1:$((start_port + 1))"
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jul 12 20:51:54 UTC 2024
    - 3.7K bytes
    - Viewed (0)
  3. okhttp/src/main/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt

          while (low < high) {
            var mid = (low + high) / 2
            // Search for a '\n' that marks the start of a value. Don't go back past the start of the
            // array.
            while (mid > -1 && this[mid] != '\n'.code.toByte()) {
              mid--
            }
            mid++
    
            // Now look for the ending '\n'.
            var end = 1
            while (this[mid + end] != '\n'.code.toByte()) {
              end++
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 11.7K bytes
    - Viewed (0)
  4. cmd/bucket-replication-utils_test.go

    		expErr: nil,
    		expDsc: ReplicateDecision{
    			targetsMap: map[string]replicateTargetDecision{
    				"arn:minio:replication::id:bucket":  newReplicateTargetDecision("arn:minio:replication::id:bucket", true, false),
    				"arn:minio:replication::id2:bucket": newReplicateTargetDecision("arn:minio:replication::id2:bucket", false, true),
    			},
    		},
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Aug 08 20:27:40 UTC 2023
    - 9.3K bytes
    - Viewed (0)
  5. guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

        /*
         * 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;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 19 16:21:24 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  6. docs/bucket/replication/delete-replication.sh

    ./mc cp README.md myminio1/foobucket/dir/file
    
    versionId="$(./mc ls --json --versions myminio1/foobucket/dir/ | jq -r .versionId)"
    
    kill ${pid2} && wait ${pid2} || true
    
    aws s3api --endpoint-url http://localhost:9001 delete-object --bucket foobucket --key dir/file --version-id "$versionId"
    
    out="$(./mc ls myminio1/foobucket/dir/)"
    if [ "$out" != "" ]; then
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Sep 06 09:42:21 UTC 2024
    - 3.9K bytes
    - Viewed (0)
  7. buildscripts/verify-healing.sh

    	pid1=$!
    	disown ${pid1}
    
    	"${MINIO[@]}" --address ":$((start_port + 2))" $args >"${WORK_DIR}/dist-minio-server2.log" 2>&1 &
    	pid2=$!
    	disown $pid2
    
    	"${MINIO[@]}" --address ":$((start_port + 3))" $args >"${WORK_DIR}/dist-minio-server3.log" 2>&1 &
    	pid3=$!
    	disown $pid3
    
    	export MC_HOST_myminio="http://minio:minio123@127.0.0.1:$((start_port + 1))"
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jul 12 20:51:54 UTC 2024
    - 4K bytes
    - Viewed (0)
  8. fess-crawler-opensearch/src/test/java/org/codelibs/fess/crawler/service/impl/OpenSearchUrlQueueServiceTest.java

            urlQueue2.setCreateTime(System.currentTimeMillis());
            urlQueue2.setDepth(1);
            urlQueue2.setMethod("GET");
            urlQueue2.setSessionId("id2");
            urlQueue2.setUrl("http://www.id2.com/");
    
            urlQueueService.insert(urlQueue2);
            assertTrue(fesenClient.prepareSearch("fess_crawler.queue").setQuery(QueryBuilders.termQuery("sessionId", "id1")).execute()
    Registered: Sun Nov 10 03:50:12 UTC 2024
    - Last Modified: Thu Nov 07 04:44:10 UTC 2024
    - 5.1K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/math/Quantiles.java

        boolean midLessThanFrom = (array[mid] < array[from]);
        boolean toLessThanFrom = (array[to] < array[from]);
        if (toLessThanMid == midLessThanFrom) {
          // Either array[to] < array[mid] < array[from] or array[from] <= array[mid] <= array[to].
          swap(array, mid, from);
        } else if (toLessThanMid != toLessThanFrom) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri May 12 17:02:53 UTC 2023
    - 29.9K bytes
    - Viewed (0)
  10. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

        /*
         * 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;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 19 16:21:24 UTC 2024
    - 3.4K bytes
    - Viewed (0)
Back to top