- Sort Score
- Num 10 results
- Language All
Results 51 - 60 of 611 for Mask (0.03 seconds)
-
guava-tests/benchmark/com/google/common/collect/MapBenchmark.java
// Allows us to use & instead of %, acting on hearsay that division // operators (/%) are disproportionately expensive; should test this too! int mask = queries.length - 1; boolean dummy = false; for (int i = 0; i < reps; i++) { dummy ^= map.get(queries[i & mask]) != null; } return dummy; } @Benchmark int createAndPopulate(int reps) { int dummy = 0;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue May 13 17:27:14 GMT 2025 - 7.8K bytes - Click Count (0) -
cmd/peer-rest-common.go
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Mon Sep 09 16:58:30 GMT 2024 - 3K bytes - Click Count (0) -
src/test/java/jcifs/util/StringsTest.java
// When String result = Strings.maskSecretValue(input); // Then assertEquals(expected, result, "Should mask password in SMB URL"); } @ParameterizedTest @DisplayName("maskSecretValue should not mask non-SMB URLs or URLs without credentials") @ValueSource(strings = { "http://user:password@server/path", "smb://server/share", "smb://server/share/file.txt",Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 18.6K bytes - Click Count (0) -
src/test/java/jcifs/smb1/smb1/SmbConstantsTest.java
import jcifs.SmbConstants; /** * Basic unit tests for {@link SmbConstants}. The interface only * provides {@code static final} constants, so the test suite focuses on * value correctness, bit‑mask logic, and some derived properties. * * <p>Mockito is exercised in a dummy scenario to satisfy the * request for an interaction test. The mock represents a * {@code SmbTransport} collaborator and is used only forCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 4.2K bytes - Click Count (0) -
.ci/jobs.t/defaults.yml
- timestamps - gradle-build-scan - inject-passwords: global: false job-passwords: - name: VAULT_ADDR password: https://secrets.elastic.co:8200 mask-password-params: true properties: - github: url: https://github.com/elastic/elasticsearch/ - inject: properties-content: | JOB_BRANCH=%BRANCH%Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Wed Sep 29 15:38:05 GMT 2021 - 2.9K 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/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) -
cmd/peer-rest-server.go
} pattern := event.NewPattern(prefix, suffix) var eventNames []event.Name var mask pubsub.Mask for _, ev := range values[peerRESTListenEvents] { eventName, err := event.ParseName(ev) if err != nil { return grid.NewRemoteErr(err) } mask.MergeMaskable(eventName) eventNames = append(eventNames, eventName) }
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 53.6K bytes - Click Count (0) -
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)