- Sort Score
- Num 10 results
- Language All
Results 71 - 80 of 138 for umask (0.02 seconds)
-
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
int[] newTable = newTable(newCapacity); long[] entries = this.entries; int mask = newTable.length - 1; for (int i = 0; i < size; i++) { long oldEntry = entries[i]; int hash = getHash(oldEntry); int tableIndex = hash & mask; int next = newTable[tableIndex]; newTable[tableIndex] = i; entries[i] = ((long) hash << 32) | (NEXT_MASK & next);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Aug 09 01:14:59 GMT 2025 - 14.5K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Mar 19 18:53:45 GMT 2026 - 10.7K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/util/SystemUtil.java
* will have their values replaced with "********". * * @param key The key name to check * @param value The value to potentially mask * @return The masked value if the key matches a sensitive pattern, otherwise the original value */ public static String maskSensitiveValue(final String key, final String value) {
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Jan 02 03:32:50 GMT 2026 - 3.1K bytes - Click Count (0) -
src/test/java/jcifs/smb1/dcerpc/msrpc/MsrpcSamrConnect2Test.java
// Act & Assert assertDoesNotThrow(() -> new MsrpcSamrConnect2(null, 0, ph)); } @Test @DisplayName("should accept negative access mask values") void testNegativeAccessMaskAccepted() { // Arrange SamrPolicyHandle ph = createMockPolicyHandle(); // Act & AssertCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 5.6K bytes - Click Count (0) -
android/guava/src/com/google/common/io/BaseEncoding.java
return BASE16; } static final class Alphabet { private final String name; // this is meant to be immutable -- don't modify it! private final char[] chars; final int mask; final int bitsPerChar; final int charsPerChunk; final int bytesPerChunk; private final byte[] decodabet; private final boolean[] validPadding; private final boolean ignoreCase;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 17 16:45:58 GMT 2026 - 41.6K bytes - Click Count (0) -
src/test/java/jcifs/dcerpc/msrpc/MsrpcSamrConnect2Test.java
// When MsrpcSamrConnect2 msrpcSamrConnect2 = new MsrpcSamrConnect2(testServer, accessMask, mockPolicyHandle); // Then assertNotNull(msrpcSamrConnect2, "Should work with access mask: 0x" + Integer.toHexString(accessMask)); } } @Test @DisplayName("Should use public methods from DcerpcMessage") void shouldUsePublicMethodsFromDcerpcMessage() { // WhenCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 5.4K bytes - Click Count (0) -
src/main/java/jcifs/audit/SecurityAuditLogger.java
EventType type = success ? EventType.AUTHENTICATION_SUCCESS : EventType.AUTHENTICATION_FAILURE; Severity severity = success ? Severity.INFO : Severity.WARNING; // Pre-mask sensitive data to avoid repeated processing String maskedUsername = maskSensitiveData ? maskUsername(username) : username; String maskedAddress = maskSensitiveData ? maskIpAddress(remoteAddress) : remoteAddress;Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 30 05:58:03 GMT 2025 - 26.6K bytes - Click Count (0) -
src/main/webapp/js/purify.min.js
"keysplines","keytimes","lang","lengthadjust","letter-spacing","kernelmatrix","kernelunitlength","lighting-color","local","marker-end","marker-mid","marker-start","markerheight","markerunits","markerwidth","maskcontentunits","maskunits","max","mask","mask-type","media","method","mode","min","name","numoctaves","offset","operator","opacity","order","orient","orientation","origin","overflow","paint-order","path","pathlength","patterncontentunits","patterntransform","patternunits","points","preserv...
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Mar 15 06:21:57 GMT 2026 - 22.7K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
if ((radix & (radix - 1)) == 0) { // Radix is a power of two so we can avoid division. int shift = Integer.numberOfTrailingZeros(radix); int mask = radix - 1; do { buf[--i] = Character.forDigit(((int) x) & mask, radix); x >>>= shift; } while (x != 0); } else { // Separate off the last digit using unsigned division. That will leave
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Jan 05 22:13:21 GMT 2026 - 17.8K bytes - Click Count (0) -
CLAUDE.md
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Thu Mar 19 09:48:10 GMT 2026 - 7.8K bytes - Click Count (0)