- Sort Score
- Result 10 results
- Languages All
Results 211 - 220 of 303 for positions (0.18 sec)
-
src/main/java/jcifs/smb1/util/MD4.java
* <p> * Transforms context based on 512 bits from input block starting * from the offset'th byte. * * @param block input sub-array. * @param offset starting position of sub-array. */ private void transform(final byte[] block, int offset) { // encodes 64 bytes from input block into an array of 16 32-bit // entities. Use A as a temp var.Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 9.6K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/io/Smb2FlushRequestTest.java
int written = request.writeBytesWireFormat(buffer, offset); assertEquals(24, written); assertEquals(24, SMBUtil.readInt2(buffer, offset)); // Verify file ID at correct position byte[] copiedFileId = new byte[16]; System.arraycopy(buffer, offset + 8, copiedFileId, 0, 16); assertArrayEquals(testFileId, copiedFileId); } @TestRegistered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 11.5K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/ioctl/Smb2IoctlResponseTest.java
byte[] buf = new byte[bodyLen]; SMBUtil.writeInt2(9, buf, 0); // structureSize buf[2] = (byte) errorContextCount; // ErrorContextCount // one reserved byte at position 3 SMBUtil.writeInt4(bc, buf, 4); // ByteCount if (bc > 0 && errorData != null) { System.arraycopy(errorData, 0, buf, 8, bc); } return buf; } @Test
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 10.9K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/create/Smb2CreateResponseTest.java
byte[] data = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8 }; System.arraycopy(data, 0, ctx, 0x20, data.length); // Update base to point to the context area int offsetFieldPos = base.length - 8; // position of CreateContextsOffset SMBUtil.writeInt4(contextStartOffsetFromHeader, base, offsetFieldPos); SMBUtil.writeInt4(ctx.length, base, offsetFieldPos + 4);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 11.5K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/Headers.kt
@Deprecated( message = "moved to val", replaceWith = ReplaceWith(expression = "size"), level = DeprecationLevel.ERROR, ) fun size(): Int = size /** Returns the field at `position`. */ fun name(index: Int): String = commonName(index) /** Returns the value at `index`. */ fun value(index: Int): String = commonValue(index)Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Tue May 27 14:51:25 UTC 2025 - 11.5K bytes - Viewed (0) -
guava/src/com/google/common/math/Stats.java
* {@link ByteOrder#LITTLE_ENDIAN}, to which a BYTES-long byte representation of this instance * is written. In the process increases the position of {@link ByteBuffer} by BYTES. */ void writeTo(ByteBuffer buffer) { checkNotNull(buffer); checkArgument( buffer.remaining() >= BYTES,Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 24.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/TopKSelector.java
* k) worst case. */ private void trim() { int left = 0; int right = 2 * k - 1; int minThresholdPosition = 0; // The leftmost position at which the greatest of the k lower elements // -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Aug 31 13:15:26 UTC 2025 - 11.4K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb2/create/Smb2CreateResponse.java
* @return the allocationSize */ public final long getAllocationSize() { return this.allocationSize; } /** * Get the end of file position * @return the endOfFile */ public final long getEndOfFile() { return this.endOfFile; } /** * {@inheritDoc} *Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sun Aug 24 00:49:49 UTC 2025 - 15.4K bytes - Viewed (0) -
cmd/erasure-metadata-utils.go
} if !meta.IsValid() { inconsistent++ continue } if meta.XLV1 != fi.XLV1 { inconsistent++ continue } // check if erasure distribution order matches the index // position if this is not correct we discard the disk // and move to collect others if distribution[i] != meta.Erasure.Index { inconsistent++ // keep track of inconsistent entries continue }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 11.7K bytes - Viewed (0) -
LICENSE
therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables.
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Mon Jan 18 20:25:38 UTC 2016 - 25.8K bytes - Viewed (0)