- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 364 for bots (0.13 sec)
-
android/guava/src/com/google/common/collect/TreeBasedTable.java
* ordering or by supplied comparators. When constructing a {@code TreeBasedTable}, you may provide * comparators for the row keys and the column keys, or you may use natural ordering for both. * * <p>The {@link #rowKeySet} method returns a {@link SortedSet} and the {@link #rowMap} method * returns a {@link SortedMap}, instead of the {@link Set} and {@link Map} specified by the {@link * Table} interface. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 11.4K bytes - Viewed (0) -
docs/en/docs/tutorial/response-model.md
This way, you can get the best of both worlds: type annotations with **tooling support** and **data filtering**. ## See it in the docs When you see the automatic docs, you can check that the input model and output model will both have their own JSON Schema: <img src="/img/tutorial/response-model/image01.png"> And both models will be used for the interactive API documentation:
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 17.9K bytes - Viewed (0) -
docs/security/README.md
Further any secret key (apart from the KMS-generated ones) is 256 bits long. The KMS-generated keys may be 256 bits but this depends on the KMS capabilities and configuration.
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sat Feb 12 00:51:25 GMT 2022 - 13.8K bytes - Viewed (0) -
operator/README.md
- The legacy [Helm installation API](https://github.com/istio/istio/blob/master/operator/pkg/apis/istio/v1alpha1/values_types.proto) for backwards compatibility. Some parameters will temporarily exist both the component configuration and legacy Helm APIs - for example, K8s resources. However, the Istio community recommends using the first API as it is more consistent, is validated,
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Sun Sep 17 08:27:52 GMT 2023 - 17.5K bytes - Viewed (0) -
docs/bucket/replication/README.md
To add a replication rule allowing both delete marker replication, versioned delete replication or both specify the --replicate flag with comma separated values as in the example below.
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Jan 24 23:46:33 GMT 2023 - 18.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/UnsignedLongTest.java
// The values here look like 111...11101...010 in binary, where the initial 111...1110 takes // up exactly as many bits as can be represented in the significand (24 for float, 53 for // double). That final 0 should be rounded up to 1 because the remaining bits make that number // slightly nearer. long floatConversionTest = 0xfffffe8000000002L; long doubleConversionTest = 0xfffffffffffff402L;
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 10.5K bytes - Viewed (0) -
docs/bucket/replication/DESIGN.md
- i.e with `mc stat --version-id dm-version-id` It must be noted that if active-active replication is set up with delete marker replication, there is potential for duplicate delete markers to be created if both source and target concurrently set a Delete Marker or if one/both of the clusters went down at tandem before the replication event was synced.This is an unavoidable side-effect in active-active replication caused by allowing delete markers set on a object version with `REPLICA` status...
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Sep 29 04:28:45 GMT 2022 - 14.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/MathTesting.java
// Add values up to 40. This covers cases like "square of a prime" and such. for (int i = 1; i <= 40; i++) { intValues.add(i); } // Now add values near 2^N for lots of values of N. for (int exponent : asList(2, 3, 4, 9, 15, 16, 17, 24, 25, 30)) { int x = 1 << exponent; intValues.add(x, x + 1, x - 1); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
// will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) { transitiveClosure.putEdge(node, reachableNode);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
package com.google.common.math; import static com.google.common.base.Preconditions.checkArgument; import static com.google.common.math.DoubleUtils.IMPLICIT_BIT; import static com.google.common.math.DoubleUtils.SIGNIFICAND_BITS; import static com.google.common.math.DoubleUtils.getSignificand; import static com.google.common.math.DoubleUtils.isFinite; import static com.google.common.math.DoubleUtils.isNormal;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0)