- Sort Score
- Result 10 results
- Languages All
Results 241 - 250 of 295 for inferred (0.19 sec)
-
architecture/ambient/ztunnel.md
It very intentionally does not offer L7 (HTTP) functionality, for instance, which would likely violate some of the goals above, without contributing to them. Instead, the rich functionality that service mesh is traditionally associated with is deferred to the waypoints. The ztunnel is primarily a mechanism to get traffic to the waypoints, securely. ## Proxy implementation
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Wed Jul 17 23:10:17 UTC 2024 - 16.8K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/CipherSuite.kt
val lengthA = a.length val lengthB = b.length if (lengthA != lengthB) return if (lengthA < lengthB) -1 else 1 return 0 } } /** * Holds interned instances. This needs to be above the init() calls below so that it's * initialized by the time those parts of `<clinit>()` run. Guarded by CipherSuite.class. */
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 39.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/LinkedHashMultimap.java
K key = (K) stream.readObject(); @SuppressWarnings("unchecked") V value = (V) stream.readObject(); /* * requireNonNull is safe for a properly serialized multimap: We've already inserted a * collection for each key that we expect. */ requireNonNull(map.get(key)).add(value); } setMap(map); } @GwtIncompatible // java serialization not supported
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 24.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
} } } /** * Returns the bucket (in either the K-to-V or V-to-K tables) where elements with the specified * hash could be found, if present, or could be inserted. */ private int bucket(int hash) { return hash & (hashTableKToV.length - 1); } /** Given a key, returns the index of the entry in the tables, or ABSENT if not found. */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Mar 06 16:06:58 UTC 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
/** * A collection that supports order-independent equality, like {@link Set}, but may have duplicate * elements. A multiset is also sometimes called a <i>bag</i>. * * <p>Elements of a multiset that are equal to one another are referred to as <i>occurrences</i> of * the same single element. The total number of occurrences of an element in a multiset is called * the <i>count</i> of that element (the terms "frequency" and "multiplicity" are equivalent, but
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Jun 17 14:40:53 UTC 2023 - 19.7K bytes - Viewed (0) -
licenses/sigs.k8s.io/yaml/LICENSE
on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work.
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Tue Oct 31 19:53:28 UTC 2023 - 15.8K bytes - Viewed (0) -
src/bytes/bytes.go
func LastIndexFunc(s []byte, f func(r rune) bool) int { return lastIndexFunc(s, f, true) } // indexFunc is the same as IndexFunc except that if // truth==false, the sense of the predicate function is // inverted. func indexFunc(s []byte, f func(r rune) bool, truth bool) int { start := 0 for start < len(s) { wid := 1 r := rune(s[start]) if r >= utf8.RuneSelf { r, wid = utf8.DecodeRune(s[start:]) }
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Tue Sep 03 20:55:15 UTC 2024 - 35.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Multiset.java
/** * A collection that supports order-independent equality, like {@link Set}, but may have duplicate * elements. A multiset is also sometimes called a <i>bag</i>. * * <p>Elements of a multiset that are equal to one another are referred to as <i>occurrences</i> of * the same single element. The total number of occurrences of an element in a multiset is called * the <i>count</i> of that element (the terms "frequency" and "multiplicity" are equivalent, but
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Jun 17 14:40:53 UTC 2023 - 21K bytes - Viewed (0) -
common-protos/k8s.io/api/autoscaling/v2/generated.proto
// container is the name of the container in the pods of the scaling target optional string container = 3; } // CrossVersionObjectReference contains enough information to let you identify the referred resource. message CrossVersionObjectReference { // kind is the kind of the referent; More info: https://git.k8s.io/community/contributors/devel/sig-architecture/api-conventions.md#types-kinds optional string kind = 1;
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 21.3K bytes - Viewed (0) -
common-protos/k8s.io/api/autoscaling/v2beta1/generated.proto
// container is the name of the container in the pods of the scaling target optional string container = 4; } // CrossVersionObjectReference contains enough information to let you identify the referred resource. message CrossVersionObjectReference { // Kind of the referent; More info: https://git.k8s.io/community/contributors/devel/sig-architecture/api-conventions.md#types-kinds optional string kind = 1;
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 21.2K bytes - Viewed (0)