Search Options

Results per page
Sort
Preferred Languages
Advance

Results 181 - 190 of 916 for tcount (0.05 sec)

  1. src/main/java/jcifs/smb1/smb1/SmbComWriteResponse.java

            count = readInt2(buffer, bufferIndex) & 0xFFFFL;
            return 8;
        }
    
        @Override
        int readBytesWireFormat(final byte[] buffer, final int bufferIndex) {
            return 0;
        }
    
        @Override
        public String toString() {
            return ("SmbComWriteResponse[" + super.toString() + ",count=" + count + "]");
        }
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 1.6K bytes
    - Viewed (0)
  2. docs/resiliency/resiliency-initial-script.sh

    for idx in {1..10}; do
    	# generate random nr of blocks
    	COUNT=$((RANDOM % 100 + 100))
    	# generate random content
    	dd if=/dev/urandom bs=50K count="${COUNT}" of="${SRC_DIR}"/file"$idx"
    done
    
    # create small object that will be inlined into xl.meta
    dd if=/dev/urandom bs=50K count=1 of="${INLINED_DIR}"/inlined
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sat Dec 21 04:24:45 UTC 2024
    - 1.5K bytes
    - Viewed (0)
  3. src/test/java/jcifs/MsrpcDfsRootEnumTest.java

        void testGetEntries_largeNumberOfRoots() throws Exception {
            // Create array with many entries
            int count = 100;
            netdfs.DfsEnumArray200 largeArray = new netdfs.DfsEnumArray200();
            largeArray.count = count;
            largeArray.s = new netdfs.DfsInfo200[count];
    
            for (int i = 0; i < count; i++) {
                netdfs.DfsInfo200 entry = new netdfs.DfsInfo200();
                entry.dfs_name = "share_" + i;
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 12.9K bytes
    - Viewed (0)
  4. src/main/java/jcifs/dcerpc/UUID.java

     *
     */
    public class UUID extends rpc.uuid_t {
    
        private static int hex_to_bin(final char[] arr, final int offset, final int length) {
            int value = 0;
            int ai, count;
    
            count = 0;
            for (ai = offset; ai < arr.length && count < length; ai++) {
                value <<= 4;
                switch (arr[ai]) {
                case '0':
                case '1':
                case '2':
                case '3':
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 4.7K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/math/PairedStatsAccumulatorTest.java

        assertThat(emptyAccumulator.count()).isEqualTo(0);
        assertThat(emptyAccumulatorByAddAllEmptyPairedStats.count()).isEqualTo(0);
        assertThat(oneValueAccumulator.count()).isEqualTo(1);
        assertThat(oneValueAccumulatorByAddAllEmptyPairedStats.count()).isEqualTo(1);
        assertThat(twoValuesAccumulator.count()).isEqualTo(2);
        assertThat(twoValuesAccumulatorByAddAllPartitionedPairedStats.count()).isEqualTo(2);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 23.4K bytes
    - Viewed (0)
  6. src/main/java/org/codelibs/fess/entity/FacetInfo.java

                        return BucketOrder.key(asc);
                    }
                    if ("count".equals(values[0])) {
                        return BucketOrder.count(asc);
                    }
                }
            }
            return BucketOrder.count(false);
        }
    
        /**
         * Adds a query facet to the existing query array.
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 5.3K bytes
    - Viewed (0)
  7. docs/distributed/decom.sh

    ./mc admin decom start myminio/ http://localhost:9000/tmp/xl/{1...10}/disk{0...1}
    
    count=0
    until $(./mc admin decom status myminio/ | grep -q Complete); do
    	echo "waiting for decom to finish..."
    	count=$((count + 1))
    	if [ ${count} -eq 120 ]; then
    		./mc cat /tmp/expanded_*.log
    	fi
    	sleep 1
    done
    
    kill $pid_1
    kill $pid_2
    
    sleep 5
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon May 27 19:17:46 UTC 2024
    - 6.4K bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/app/pager/AccessTokenPager.java

            versionNo = null;
    
        }
    
        /**
         * Get the all record count.
         * @return The all record count.
         */
        public int getAllRecordCount() {
            return allRecordCount;
        }
    
        /**
         * Set the all record count.
         * @param allRecordCount The all record count.
         */
        public void setAllRecordCount(final int allRecordCount) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 5.7K bytes
    - Viewed (0)
  9. src/main/java/org/codelibs/fess/app/pager/PathMapPager.java

        }
    
        /**
         * Gets the total record count.
         *
         * @return the total record count
         */
        public int getAllRecordCount() {
            return allRecordCount;
        }
    
        /**
         * Sets the total record count.
         *
         * @param allRecordCount the total record count
         */
        public void setAllRecordCount(final int allRecordCount) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 5.9K bytes
    - Viewed (0)
  10. cmd/erasure-metadata-utils.go

    			continue
    		}
    		errorCounts[err]++
    	}
    
    	maxCnt := 0
    	for err, count := range errorCounts {
    		switch {
    		case maxCnt < count:
    			maxCnt = count
    			maxErr = err
    
    		// Prefer `nil` over other error values with the same
    		// number of occurrences.
    		case maxCnt == count && err == nil:
    			maxErr = err
    		}
    	}
    	return maxCnt, maxErr
    }
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 11.7K bytes
    - Viewed (0)
Back to top