- Sort Score
- Num 10 results
- Language All
Results 21 - 30 of 423 for assumed (0.04 seconds)
-
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced * load on the garbage collector by only using a constant number of internal objects. * * <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashMap}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this classCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 8.4K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/ImmutableCollection.java
* <i>deeply</i> immutable. * </ul> * * <h4>Performance notes</h4> * * <ul> * <li>Implementations can be generally assumed to prioritize memory efficiency, then speed of * access, and lastly speed of creation. * <li>The {@code copyOf} methods will sometimes recognize that the actual copy operation is
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Jan 29 22:14:05 GMT 2026 - 21.4K bytes - Click Count (0) -
internal/s3select/sql/aggregation.go
// current row and stores the result. // // On success, it returns (nil, nil). func (e *FuncExpr) evalAggregationNode(r Record, tableAlias string) error { // It is assumed that this function is called only when // `e` is an aggregation function. var val *Value var err error funcName := e.getFunctionName() if aggFnCount == funcName { if e.Count.StarArg { // Handle COUNT(*)
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sat Dec 23 07:19:11 GMT 2023 - 7.9K bytes - Click Count (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/RepositorySystem.java
ArtifactRepositoryPolicy snapshots, ArtifactRepositoryPolicy releases); /** * Calculates the effective repositories for the given input repositories which are assumed to be already mirrored * (if applicable). This process will essentially remove duplicate repositories by merging them into one equivalentCreated: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri Oct 25 12:31:46 GMT 2024 - 7.7K bytes - Click Count (0) -
docs/ftp/README.md
- All features currently used by your buckets will work as is without any changes - SSE (Server Side Encryption) - Replication (Server Side Replication) ## Prerequisites - It is assumed you have users created and configured with relevant access policies, to start with use basic "readwrite" canned policy to test all the operations before you finalize on what level of restrictions are needed for a user.
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue May 07 06:41:25 GMT 2024 - 7.8K bytes - Click Count (0) -
docs/multi-user/README.md
- `aws:EpochTime` - This is the date in epoch or Unix time, for use with date/time conditions. - `aws:PrincipalType` - This value indicates whether the principal is an account (Root credential), user (MinIO user), or assumed role (STS) - `aws:SecureTransport` - This is a Boolean value that represents whether the request was sent over TLS.
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 8.2K bytes - Click Count (0) -
docs/sts/web-identity.md
| Params | Value | | :-- | :-- | | *Type* | *String* |
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 18.9K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/-UtilCommon.kt
} } return result.toTypedArray() } /** * Returns true if there is an element in this array that is also in [other]. This method terminates * if any intersection is found. The sizes of both arguments are assumed to be so small, and the * likelihood of an intersection so great, that it is not worth the CPU cost of sorting or the * memory cost of hashing. */ internal fun Array<String>.hasIntersection( other: Array<String>?,
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Mon May 05 16:01:00 GMT 2025 - 10.1K bytes - Click Count (0) -
cmd/net.go
localIP6 = mustGetLocalIP6() // List of all local loopback addresses. localLoopbacks = mustGetLocalLoopbacks() ) // mustSplitHostPort is a wrapper to net.SplitHostPort() where error is assumed to be a fatal. func mustSplitHostPort(hostPort string) (host, port string) { xh, err := xnet.ParseHost(hostPort) if err != nil { logger.FatalIf(err, "Unable to split host port %s", hostPort) }
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 9.6K bytes - Click Count (1) -
src/main/java/jcifs/smb1/dcerpc/DcerpcHandle.java
/* Bindings are in the form: * proto:\\server[key1=val1,key2=val2] * or * proto:server[key1=val1,key2=val2] * or * proto:[key1=val1,key2=val2] * * If a key is absent it is assumed to be 'endpoint'. Thus the * following are equivalent: * proto:\\ts0.win.net[endpoint=\pipe\srvsvc] * proto:ts0.win.net[\pipe\srvsvc] * * If the server is absent it is set to "127.0.0.1" */Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 11.7K bytes - Click Count (0)