Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 81 - 90 of 1,205 for numIter (0.49 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. .teamcity/src/test/kotlin/PromotionProjectTests.kt

            assertEquals(3, steps.size)
    
            val expectedGradleParams =
                """
                -PcommitId=%dep.Gradle_Release_Check_Stage_ReadyforNightly_Trigger.build.vcs.number% 
                "-PgitUserName=bot-teamcity"
                "-PgitUserEmail=******@****.***"
                $pluginPortalUrlOverride
                -DenablePredictiveTestSelection=false
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Thu Jun 12 09:41:54 GMT 2025
    - 15.3K bytes
    - Click Count (1)
  2. android/guava/src/com/google/common/util/concurrent/RateLimiter.java

      }
    
      /**
       * Acquires the given number of permits from this {@code RateLimiter}, blocking until the request
       * can be granted. Tells the amount of time slept, if any.
       *
       * @param permits the number of permits to acquire
       * @return time spent sleeping to enforce rate, in seconds; 0.0 if not rate-limited
       * @throws IllegalArgumentException if the requested number of permits is negative or zero
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:05:27 GMT 2025
    - 21.8K bytes
    - Click Count (0)
  3. src/main/java/jcifs/internal/smb2/rdma/RdmaConnection.java

            receiveCredits.incrementAndGet();
        }
    
        /**
         * Get number of available send credits
         *
         * @return available send credits
         */
        public int getAvailableSendCredits() {
            return sendCredits.get();
        }
    
        /**
         * Get number of available receive credits
         *
         * @return available receive credits
         */
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 24 00:12:28 GMT 2025
    - 8.2K bytes
    - Click Count (0)
  4. src/main/java/org/codelibs/fess/helper/IndexingHelper.java

     */
    public class IndexingHelper {
        /** Logger for this class */
        private static final Logger logger = LogManager.getLogger(IndexingHelper.class);
    
        /** Maximum number of retry attempts for failed operations */
        protected int maxRetryCount = 5;
    
        /** Default number of rows to process in a single batch */
        protected int defaultRowSize = 100;
    
        /**
         * Default constructor for indexing helper.
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Nov 28 16:29:12 GMT 2025
    - 26.1K bytes
    - Click Count (0)
  5. src/main/java/jcifs/internal/smb1/trans/SmbComTransaction.java

        protected int dataDisplacement;
    
        /** Total number of parameter bytes to be sent */
        protected int totalParameterCount;
        /** Total number of data bytes to be sent */
        protected int totalDataCount;
        /** Maximum number of parameter bytes the server should return */
        protected int maxParameterCount;
        /** Maximum number of data bytes the server should return */
        protected int maxDataCount;
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 17.3K bytes
    - Click Count (0)
  6. internal/etag/etag.go

    //
    //	 e1 := MD5(part-1)
    //	 e2 := MD5(part-2)
    //	...
    //	 eN := MD5(part-N)
    //
    // Then, the ETag of the object is computed as MD5 of all individual
    // part checksums. S3 also encodes the number of parts into the ETag
    // by appending a -<number-of-parts> at the end:
    //
    //	ETag := MD5(e1 || e2 || e3 ... || eN) || -N
    //
    //	For example: ceb8853ddc5086cc4ab9e149f8f09c88-5
    //
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri May 16 14:27:42 GMT 2025
    - 13.2K bytes
    - Click Count (0)
  7. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/PushObserver.kt

       * skipped.
       *
       * @param streamId server-initiated stream ID: an even number.
       * @param source location of data corresponding with this stream ID.
       * @param byteCount number of bytes to read or skip from the source.
       * @param last when true, there are no data frames to follow.
       */
      @Throws(IOException::class)
      fun onData(
        streamId: Int,
        source: BufferedSource,
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Wed Mar 19 19:25:20 GMT 2025
    - 3.6K bytes
    - Click Count (0)
  8. impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/mvnup/goals/UpgradeResult.java

        }
    
        /**
         * Returns the number of POMs processed.
         */
        public int processedCount() {
            return processedPoms.size();
        }
    
        /**
         * Returns the number of POMs modified.
         */
        public int modifiedCount() {
            return modifiedPoms.size();
        }
    
        /**
         * Returns the number of POMs that had errors.
         */
        public int errorCount() {
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Sat Jun 07 06:22:47 GMT 2025
    - 3.9K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/hash/BloomFilterStrategies.java

          }
          return array;
        }
    
        /** Number of bits */
        long bitSize() {
          return (long) data.length() * Long.SIZE;
        }
    
        /**
         * Number of set bits (1s).
         *
         * <p>Note that because of concurrent set calls and uses of atomics, this bitCount is a (very)
         * close *estimate* of the actual number of bits set. It's not possible to do better than an
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 10.7K bytes
    - Click Count (0)
  10. docs/distributed/DESIGN.md

    with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total.
    
    - *If total number of nodes are of odd number then GCD algorithm provides affinity towards odd number erasure sets to provide for uniform distribution across nodes*. This is to ensure that same number of drives are pariticipating in any erasure set. For example if you have 2 nodes with 180 drives then GCD is 15 but this would lead to uneven distribution,...
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Wed Feb 26 09:25:50 GMT 2025
    - 8K bytes
    - Click Count (2)
Back to Top