- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 337 for tlen (0.03 sec)
-
src/main/java/jcifs/pac/PacMac.java
int ilen = data.length, olen = out.length; int msbit = ((ilen << 3) - 1 + ((ilen << 3) + 13) * (i / ilen) + (ilen - i % ilen << 3)) % (ilen << 3); int mshigh = msbit >>> 3, mslow = msbit & 7; int b = c + (out[i % olen] & 0xff) + (((data[(ilen - 1 - mshigh) % ilen] & 0xff) << 8 | data[(ilen - mshigh) % ilen] & 0xff) >>> mslow + 1 & 0xff);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 9K bytes - Viewed (0) -
guava/src/com/google/common/escape/CharEscaper.java
} // Copy the replacement string into the dest buffer as needed. if (rlen > 0) { System.arraycopy(r, 0, dest, destIndex, rlen); destIndex += rlen; } lastEscape = index + 1; } // Copy leftover characters if there are any. int charsLeft = slen - lastEscape; if (charsLeft > 0) { int sizeNeeded = destIndex + charsLeft;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Feb 13 15:45:16 UTC 2025 - 6.7K bytes - Viewed (0) -
src/main/java/jcifs/smb1/util/RC4.java
* @param ki the starting offset in the key array * @param klen the length of the key to use */ public void init(final byte[] key, final int ki, final int klen) { s = new byte[256]; for (i = 0; i < 256; i++) { s[i] = (byte) i; } for (i = j = 0; i < 256; i++) { j = j + key[ki + i % klen] + s[i] & 0xff; final byte t = s[i]; s[i] = s[j];
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 2.8K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/CharEscaper.java
} // Copy the replacement string into the dest buffer as needed. if (rlen > 0) { System.arraycopy(r, 0, dest, destIndex, rlen); destIndex += rlen; } lastEscape = index + 1; } // Copy leftover characters if there are any. int charsLeft = slen - lastEscape; if (charsLeft > 0) { int sizeNeeded = destIndex + charsLeft;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Feb 13 15:45:16 UTC 2025 - 6.7K bytes - Viewed (0) -
tests/count_test.go
} if count != int64(len(users)) { t.Errorf("Count() method should get correct value, expect: %v, got %v", count, len(users)) } if err := DB.Model(&User{}).Where("name = ?", user1.Name).Or("name = ?", user3.Name).Count(&count).Find(&users).Error; err != nil { t.Errorf(fmt.Sprintf("Count should work, but got err %v", err)) } if count != int64(len(users)) {
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Mon Oct 30 09:15:49 UTC 2023 - 6.9K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb1/trans/TransTransactNamedPipeResponse.java
return 0; } @Override protected int readParametersWireFormat(final byte[] buffer, final int bufferIndex, final int len) { return 0; } @Override protected int readDataWireFormat(final byte[] buffer, final int bufferIndex, final int len) throws SMBProtocolDecodingException { if (len > this.outputBuffer.length) {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 2.9K bytes - Viewed (0) -
android/guava/src/com/google/common/net/PercentEscaper.java
private final boolean plusForSpace; /** * An array of flags where for any {@code char c} if {@code safeOctets[c]} is true then {@code c} * should remain unmodified in the output. If {@code c >= safeOctets.length} then it should be * escaped. */ private final boolean[] safeOctets; /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 28 01:26:26 UTC 2024 - 8.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/AbstractStreamingHasherTest.java
private static class Control extends AbstractNonStreamingHashFunction { @Override public HashCode hashBytes(byte[] input, int off, int len) { return HashCode.fromBytes(Arrays.copyOfRange(input, off, off + len)); } @Override public int bits() { throw new UnsupportedOperationException(); } }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 8.5K bytes - Viewed (0) -
src/main/java/jcifs/internal/dtyp/ACE.java
* the access mask of the ACE, the access check is successful. Otherwise, * more ACEs are evaluated until all desired access bits (combined) * are "allowed". If all of the desired access bits are not "allowed" * the then same process is repeated for inherited ACEs. * <p> * For example, if user <code>WNET\alice</code> tries to open a file * with desired access bits <code>0x00000003</code> (<code>FILE_READ_DATA |
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 5.6K bytes - Viewed (0) -
docs/site-replication/run-multi-site-oidc.sh
if [ $? -ne 0 ]; then echo "expecting the command to succeed, exiting.." exit_1 fi ./mc admin policy info minio3 projecta >/dev/null 2>&1 if [ $? -ne 0 ]; then echo "expecting the command to succeed, exiting.." exit_1 fi ./mc admin policy remove minio3 projecta sleep 10 ./mc admin policy info minio1 projecta if [ $? -eq 0 ]; then echo "expecting the command to fail, exiting.."
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Sep 24 08:03:58 UTC 2024 - 8.5K bytes - Viewed (0)