- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 498 for v_size (0.19 sec)
-
src/test/java/org/codelibs/fess/rank/fusion/RankFusionProcessorTest.java
} static class TestSubSearcher extends RankFusionSearcher { private int mainSize; private int inSize; private int outSize; TestSubSearcher(int mainSize, int inSize, int outSize) { this.mainSize = mainSize; this.inSize = inSize; this.outSize = outSize; } @Override
Java - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 25.6K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/Trans2FindFirst2Response.java
",allocationSize=" + allocationSize + ",extFileAttributes=" + extFileAttributes + ",fileNameLength=" + fileNameLength + ",eaSize=" + eaSize + ",shortNameLength=" + shortNameLength + ",shortName=" + shortName + ",filename=" + filename + "]" ); } } int sid; boolean isEndOfSearch;
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Fri Mar 22 21:10:40 GMT 2019 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
newDelegate.addAll(delegate); this.table = newDelegate; return; } int size = this.size; if (size < requireEntries().length) { resizeEntries(size); } int minimumTableSize = CompactHashing.tableSize(size); int mask = hashTableMask(); if (minimumTableSize < mask) { // smaller table size will always be less than current mask
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
// entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2 /** * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */ @CheckForNull private transient int[] predecessor; /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
src/main/java/jcifs/smb/SmbFile.java
try { w.start(); // use commonly acceptable buffer size int bsize = Math.min(sh.getReceiveBufferSize() - 70, dh.getSendBufferSize() - 70); byte[][] b = new byte[2][bsize]; copyRecursive(dest, b, bsize, w, sh, dh); } finally { w.write(null, -1, null);
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Mon Mar 13 12:00:57 GMT 2023 - 81.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
return null; } return entry.getValue(); } @SuppressWarnings("unchecked") final Segment<K, V, E, S>[] newSegmentArray(int ssize) { return (Segment<K, V, E, S>[]) new Segment<?, ?, ?, ?>[ssize]; } // Inner Classes /** * Segments are specialized versions of hash tables. This subclass inherits from ReentrantLock
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/util/MemoryUtil.java
return byteCountToDisplaySize(BigInteger.valueOf(size)); } private static String byteCountToDisplaySize(final BigInteger size) { Objects.requireNonNull(size, "size"); final String displaySize; if (size.divide(ONE_EB_BI).compareTo(BigInteger.ZERO) > 0) {
Java - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableBiMap.java
RegularImmutableBiMap(@Nullable Object[] alternatingKeysAndValues, int size) { this.alternatingKeysAndValues = alternatingKeysAndValues; this.size = size; this.keyOffset = 0; int tableSize = (size >= 2) ? ImmutableSet.chooseTableSize(size) : 0; this.keyHashTable = RegularImmutableMap.createHashTableOrThrow(alternatingKeysAndValues, size, tableSize, 0); Object valueHashTable =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 4.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/CartesianList.java
int[] axesSizeProduct = new int[axes.size() + 1]; axesSizeProduct[axes.size()] = 1; try { for (int i = axes.size() - 1; i >= 0; i--) { axesSizeProduct[i] = IntMath.checkedMultiply(axesSizeProduct[i + 1], axes.get(i).size()); } } catch (ArithmeticException e) { throw new IllegalArgumentException( "Cartesian product too large; must have size at most Integer.MAX_VALUE"); }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 4.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/AbstractIndexedListIterator.java
* size} * @throws IllegalArgumentException if {@code size} is negative */ protected AbstractIndexedListIterator(int size, int position) { checkPositionIndex(position, size); this.size = size; this.position = position; } @Override public final boolean hasNext() { return position < size; } @Override @ParametricNullness
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 3.2K bytes - Viewed (0)