- Sort Score
- Result 10 results
- Languages All
Results 801 - 810 of 1,182 for was (0.06 sec)
-
okhttp/src/test/java/okhttp3/internal/http2/Http2Test.kt
frame.writeInt(expectedStreamId and 0x7fffffff) frame.writeByte(paddingLength) frame.write(expectedData) frame.write(padding) reader.nextFrame(requireSettings = false, assertData()) // Padding was skipped. assertThat(frame.exhausted()).isTrue() } @Test fun readPaddedDataFrameZeroPadding() { val dataLength = 1123 val expectedData = ByteArray(dataLength)
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 28.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
// move the last entry to the removed spot, just like we moved the element entries[dstIndex] = entries[srcIndex]; entries[srcIndex] = 0; // also need to update whoever's "next" pointer was pointing to the last entry place int tableIndex = smearedHash(object) & mask; int next = CompactHashing.tableGet(table, tableIndex); int srcNext = srcIndex + 1; if (next == srcNext) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 24.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
checkArgument(keyEntry == ABSENT, "Key already present: %s", key); } // insertion point for new entry is after predecessor // note predecessor must still be a valid entry: either we deleted an entry that was *not* // predecessor, or we didn't delete anything ensureCapacity(size + 1); keys[size] = key; values[size] = value; insertIntoTableKToV(size, keyHash);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Mar 06 16:06:58 UTC 2023 - 36.4K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* allowedPriorLocks} to find a path between {@code this} and the specified {@code lock}. * * @return If a path was found, a chained {@link ExampleStackTrace} illustrating the path to the * {@code lock}, or {@code null} if no path was found. */ @CheckForNull private ExampleStackTrace findPathTo(LockGraphNode node, Set<LockGraphNode> seen) { if (!seen.add(this)) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 35.9K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.13.md
- The default Go version was updated to 1.11.2. ([#70665](https://github.com/kubernetes/kubernetes/pull/70665)) - The minimum supported Go version was updated to 1.11.2 ([#69386](https://github.com/kubernetes/kubernetes/pull/69386))
Registered: Fri Nov 01 09:05:11 UTC 2024 - Last Modified: Thu May 05 13:44:43 UTC 2022 - 273.1K bytes - Viewed (0) -
src/main/webapp/css/bootstrap.min.css.map
center right 1.75rem/calc(0.75em + 0.375rem) calc(0.75em + 0.375rem);\n}\n\n.was-validated .custom-select:valid:focus, .custom-select.is-valid:focus {\n border-color: #28a745;\n box-shadow: 0 0 0 0.2rem rgba(40, 167, 69, 0.25);\n}\n\n.was-validated .form-check-input:valid ~ .form-check-label, .form-check-input.is-valid ~ .form-check-label {\n color: #28a745;\n}\n\n.was-validated .form-check-input:valid ~ .valid-feedback,\n.was-validated .form-check-input:valid ~ .valid-tooltip, .form-check-input.is-valid...
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Thu Feb 13 04:21:06 UTC 2020 - 626.8K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InetAddresses.java
* uses the uncompressed form (except on Android, where the zero compression is also done). The * other difference is that this method outputs any scope ID in the format that it was provided at * creation time, while Android may always output it as an interface name, even if it was supplied * as a numeric ID. * * <p>This method uses hexadecimal for all IPv6 addresses, including IPv4-mapped IPv6 addresses * such as "::c000:201". *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 47.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
long lastEntry = entries[srcIndex]; entries[dstIndex] = lastEntry; entries[srcIndex] = UNSET; // also need to update whoever's "next" pointer was pointing to the last entry place // reusing "tableIndex" and "next"; these variables were no longer needed int tableIndex = getHash(lastEntry) & hashTableMask(); int lastNext = table[tableIndex];
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jun 01 22:07:10 UTC 2021 - 15K bytes - Viewed (0) -
src/main/java/jcifs/netbios/NbtAddress.java
* address, isPermanent, isBeingDeleted, ...etc. This information can only * be retrieved with the Node Status request. * * The degree of state that an NbtAddress has is dependant on how it was * created and what is required of it. The second degree of state is the * most common. This is the state information that would be retrieved from * WINS for example. Natrually it is not practical for every NbtAddress
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 15.2K bytes - Viewed (0) -
docs/en/docs/tutorial/security/simple-oauth2.md
Both of these dependencies will just return an HTTP error if the user doesn't exist, or if is inactive. So, in our endpoint, we will only get a user if the user exists, was correctly authenticated, and is active: //// tab | Python 3.10+ ```Python hl_lines="58-66 69-74 94" {!> ../../docs_src/security/tutorial003_an_py310.py!} ``` //// //// tab | Python 3.9+
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 12.3K bytes - Viewed (0)