- Sort Score
- Result 10 results
- Languages All
Results 461 - 470 of 510 for representan (1.04 sec)
-
src/main/java/jcifs/smb/DfsImpl.java
} if (log.isTraceEnabled()) { log.trace("Resolving root " + root); } /* * The link entries contain maps of referrals by path representing DFS links. * Note that paths are relative to the root like "\" and not "\example.com\root". */ CacheEntry<DfsReferralDataInternal> links = roots.get(root);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 29.7K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/ClosingFuture.java
* complete, some objects captured during the computation are closed. * * <p>A pipeline of {@code ClosingFuture}s is a tree of steps. Each step represents either an * asynchronously-computed intermediate value, or else an exception that indicates the failure or * cancellation of the operation so far. The only way to extract the value or exception from a step
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jul 23 15:26:56 UTC 2025 - 98.1K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AbstractFutureState.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 34.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
size++; modCount++; return null; } /** * Updates the pointers of the insertion order linked list so that {@code next} follows {@code * prev}. {@code ENDPOINT} represents either the first or last entry in the entire map (as * appropriate). */ private void setSucceeds(int prev, int next) { if (prev == ENDPOINT) { firstInInsertionOrder = next; } else {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 36.2K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/ds/callback/FileListIndexUpdateCallbackImpl.java
} return false; } } } return true; } /** * Represents a crawl request containing a URL and its depth in the crawling hierarchy. * Used for managing recursive crawling operations. */ private static class CrawlRequest { /** The URL to be crawled. */
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 28.9K bytes - Viewed (0) -
cmd/iam-store.go
case stsUser: return pathJoin(iamConfigPolicyDBSTSUsersPrefix, name+".json") default: return pathJoin(iamConfigPolicyDBUsersPrefix, name+".json") } } // UserIdentity represents a user's secret key and their status type UserIdentity struct { Version int `json:"version"` Credentials auth.Credentials `json:"credentials"` UpdatedAt time.Time `json:"updatedAt"` }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 86.7K bytes - Viewed (0) -
gradle/wrapper/gradle-wrapper.jar
example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution"...
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Aug 01 08:06:31 UTC 2025 - 44.4K bytes - Viewed (1) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/HttpUrl.kt
} } /** * Returns a new [HttpUrl] representing this. * * @throws IllegalArgumentException If this is not a well-formed HTTP or HTTPS URL. */ @JvmStatic @JvmName("get") fun String.toHttpUrl(): HttpUrl = Builder().parse(null, this).build() /** * Returns a new `HttpUrl` representing `url` if it is a well-formed HTTP or HTTPS URL, or null
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Mon May 05 16:01:00 UTC 2025 - 63.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
this.entries = null; this.keys = null; this.values = null; incrementModCount(); return newDelegate; } /** Stores the hash table mask as the number of bits needed to represent an index. */ private void setHashTableMask(int mask) { int hashTableBits = Integer.SIZE - Integer.numberOfLeadingZeros(mask); metadata =
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 39.6K bytes - Viewed (0) -
doc/asm.html
represents the bitwise and instruction, <code>AND</code> (without the leading <code>A</code>), and is written in assembly source as <code>AND</code>. The enumeration is mostly in alphabetical order. (The architecture-independent <code>AXXX</code>, defined in the <code>cmd/internal/obj</code> package, represents an invalid instruction).
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue Nov 28 19:15:27 UTC 2023 - 36.3K bytes - Viewed (0)