- Sort Score
- Result 10 results
- Languages All
Results 261 - 270 of 419 for inInts (0.04 sec)
-
src/test/java/jcifs/smb/SmbTreeHandleInternalTest.java
assertEquals("DFS resolution failed", ex.getMessage()); verify(handle, times(1)).ensureDFSResolved(); } @ParameterizedTest @ValueSource(ints = { 0, 1, -1, Integer.MIN_VALUE, Integer.MAX_VALUE }) @DisplayName("hasCapability(cap): returns configured value and captures argument across edge caps")
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 9.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableTable.java
* input element is mapped to one cell in the returned table, with the rows, columns, and values * generated by applying the specified functions. If multiple inputs are mapped to the same row * and column pair, they will be combined with the specified merging function in encounter order. * * <p>The returned {@code Collector} will throw a {@code NullPointerException} at collection timeRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 21:07:18 UTC 2025 - 17.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedMultiset.java
/** * Returns a {@code Collector} that accumulates elements into an {@code ImmutableSortedMultiset} * whose elements are the result of applying {@code elementFunction} to the inputs, with counts * equal to the result of applying {@code countFunction} to the inputs. * * <p>If the mapped elements contain duplicates (according to {@code comparator}), the firstRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 21:07:18 UTC 2025 - 29.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeSet.java
import com.google.common.annotations.J2ktIncompatible; import com.google.common.collect.SortedLists.KeyAbsentBehavior; import com.google.common.collect.SortedLists.KeyPresentBehavior; import com.google.common.primitives.Ints; import com.google.errorprone.annotations.CanIgnoreReturnValue; import com.google.errorprone.annotations.DoNotCall; import com.google.errorprone.annotations.concurrent.LazyInit; import com.google.j2objc.annotations.RetainedWith;
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Sep 23 17:50:58 UTC 2025 - 27.5K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb1/com/SmbComLockingAndXTest.java
assertEquals(1, SMBUtil.readInt2(buffer, 10)); } /** * Test that a large file lock (bit 0x10 set) is encoded and decoded correctly. */ @ParameterizedTest @ValueSource(ints = { 0x10, 0x11 }) void largeFileFlagSet_and_decoded_according_to_type(int type) throws Exception { Configuration cfg = mock(Configuration.class); SmbComLockingAndX cmd = new SmbComLockingAndX(cfg);
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 7.1K bytes - Viewed (0) -
internal/logger/logger.go
// unique set. data is expected to be pre-sorted, and the resulting set in // the range [0:size] will remain in sorted order. Uniq, following a // sort.Sort call, can be used to prepare arbitrary inputs for use as sets. func uniq(data sort.Interface) (size int) { p, l := 0, data.Len() if l <= 1 { return l } for i := 1; i < l; i++ { if !data.Less(p, i) { continue } p++
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 12.4K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedInts.java
* <i>unsigned</i> (that is, any negative value {@code x} is treated as the positive value {@code * 2^32 + x}). The methods for which signedness is not an issue are in {@link Ints}, as well as * signed versions of methods for which signedness is an issue. * * <p>In addition, this class provides several static methods for converting an {@code int} to a
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sun Feb 09 16:22:33 UTC 2025 - 13.8K bytes - Viewed (0) -
guava/src/com/google/common/hash/Crc32cHashFunction.java
* CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...) * and then to XOR them together. The strideTable enables us to hash an int followed by 12 * zero bytes (3 ints), while the byteTable is for advancing one byte at a time. * This algorithm is due to the paper "Everything we know about CRC but [are] afraid to forget" * by Kadatch and Jenkins, 2010. */ Crc32cHasher() {
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Dec 28 01:26:26 UTC 2024 - 21.2K bytes - Viewed (0) -
src/test/java/jcifs/dcerpc/ndr/NdrShortTest.java
@Nested @DisplayName("Constructor Tests") class ConstructorTests { @ParameterizedTest @DisplayName("Should mask input values with 0xFF correctly") @ValueSource(ints = { 0, 1, 127, 128, 255, 256, -1, -128, -255, -256, 32767, -32768, 65535, 65536 }) void testConstructorMasking(int inputValue) { // Given: An input value // When: Creating NdrShort with that valueRegistered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 11.2K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/io/Smb2ReadResponseTest.java
// Then assertEquals(0, bytesWritten); } @DisplayName("Should write zero bytes at various offsets") @ParameterizedTest @ValueSource(ints = { 0, 1, 10, 50, 100, 255 }) void testWriteBytesWireFormatAtDifferentOffsets(int offset) { // Given byte[] buffer = new byte[256]; // WhenRegistered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 22.1K bytes - Viewed (0)