- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 63 for Algorithm (0.31 sec)
-
android/guava/src/com/google/common/hash/HashFunction.java
* * <h3>Relationship to {@link Object#hashCode}</h3> * * <p>Java's baked-in concept of hash codes is constrained to 32 bits, and provides no separation * between hash algorithms and the data they act on, so alternate hash algorithms can't be easily * substituted. Also, implementations of {@code hashCode} tend to be poor-quality, in part because
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Bytes.java
* {@code toIndex > fromIndex} * @since 32.0.0 */ public static void rotate(byte[] array, int distance, int fromIndex, int toIndex) { // See Ints.rotate for more details about possible algorithms here. checkNotNull(array); checkPositionIndexes(fromIndex, toIndex, array.length); if (array.length <= 1) { return; } int length = toIndex - fromIndex;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 14.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
* {@code toIndex > fromIndex} * @since 32.0.0 */ public static void rotate(float[] array, int distance, int fromIndex, int toIndex) { // See Ints.rotate for more details about possible algorithms here. checkNotNull(array); checkPositionIndexes(fromIndex, toIndex, array.length); if (array.length <= 1) { return; } int length = toIndex - fromIndex;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 25.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/StatsBenchmark.java
import com.google.caliper.Param; import com.google.caliper.api.SkipThisScenarioException; import com.google.common.primitives.Doubles; import java.util.Random; /** * Benchmarks for various algorithms for computing the mean and/or variance. * * @author Louis Wasserman */ public class StatsBenchmark { enum MeanAlgorithm { SIMPLE { @Override double mean(double[] values) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Chars.java
* {@code toIndex > fromIndex} * @since 32.0.0 */ public static void rotate(char[] array, int distance, int fromIndex, int toIndex) { // See Ints.rotate for more details about possible algorithms here. checkNotNull(array); checkPositionIndexes(fromIndex, toIndex, array.length); if (array.length <= 1) { return; } int length = toIndex - fromIndex;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Doubles.java
* {@code toIndex > fromIndex} * @since 32.0.0 */ public static void rotate(double[] array, int distance, int fromIndex, int toIndex) { // See Ints.rotate for more details about possible algorithms here. checkNotNull(array); checkPositionIndexes(fromIndex, toIndex, array.length); if (array.length <= 1) { return; } int length = toIndex - fromIndex;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 27.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
* be updated after modifications to {@code graph}. * * @since 33.1.0 (present with return type {@code Graph} since 20.0) */ // TODO(b/31438252): Consider potential optimizations for this algorithm. public static <N> ImmutableGraph<N> transitiveClosure(Graph<N> graph) { ImmutableGraph.Builder<N> transitiveClosure = GraphBuilder.from(graph).allowsSelfLoops(true).<N>immutable();
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
// this case only, we can compute the sum as a long without risking overflow or loss of // precision. So we do that, as it's slightly quicker than the Knuth algorithm. long sum = 0; for (int index = 0; index < values.length; ++index) { sum += values[index]; } return (double) sum / values.length; } /**
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) -
guava-tests/benchmark/com/google/common/math/StatsBenchmark.java
import com.google.caliper.Param; import com.google.caliper.api.SkipThisScenarioException; import com.google.common.primitives.Doubles; import java.util.Random; /** * Benchmarks for various algorithms for computing the mean and/or variance. * * @author Louis Wasserman */ public class StatsBenchmark { enum MeanAlgorithm { SIMPLE { @Override double mean(double[] values) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/net/HttpHeaders.java
public static final String UNSAFE_URL = "unsafe-url"; } /** * The HTTP <a href="https://www.w3.org/TR/service-workers/#update-algorithm">{@code * Service-Worker}</a> header field name. * * @since 20.0 */ public static final String SERVICE_WORKER = "Service-Worker"; /** The HTTP {@code TE} header field name. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:08:08 GMT 2024 - 34.3K bytes - Viewed (0)