- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 38 for fit (0.14 sec)
-
android/guava/src/com/google/common/math/PairedStatsAccumulator.java
* * <p>This fit minimizes the root-mean-square error in {@code y} as a function of {@code x}. This * error is defined as the square root of the mean of the squares of the differences between the * actual {@code y} values of the data and the values predicted by the fit for the {@code x}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 10.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/SupplementalMonitorTest.java
import java.util.concurrent.atomic.AtomicReference; import junit.framework.TestCase; /** * Supplemental tests for {@link Monitor}. * * <p>This test class contains various test cases that don't fit into the test case generation in * {@link GeneratedMonitorTest}. * * @author Justin T. Sampson */ public class SupplementalMonitorTest extends TestCase { public void testLeaveWithoutEnterThrowsIMSE() {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 4.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashing.java
} } /** * Sets {@code table[index]} to {@code entry}, where {@code table} is actually a {@code byte[]}, * {@code short[]}, or {@code int[]}. The value of {@code entry} should fit in the size of the * assigned array element, when seen as an unsigned value. So if {@code table} is a {@code byte[]} * then we should have {@code 0 ≤ entry ≤ 255}, and if {@code table} is a {@code short[]} then we
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Aug 02 21:41:22 GMT 2021 - 7.1K bytes - Viewed (0) -
guava/src/com/google/common/base/Utf8.java
} } if (utf8Length < utf16Length) { // Necessary and sufficient condition for overflow because of maximum 3x expansion throw new IllegalArgumentException( "UTF-8 length does not fit in int: " + (utf8Length + (1L << 32))); } return utf8Length; } private static int encodedLengthGeneral(CharSequence sequence, int start) { int utf16Length = sequence.length(); int utf8Length = 0;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 10 14:11:51 GMT 2023 - 7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/Murmur3Hash32Test.java
// Ordinarily we'd use something like i += Character.charCount(string.codePointAt(i)) here. But // we can get away with i++ because the whole point of this method is to return false if we find // a code point that doesn't fit in a char. for (int i = 0; i < string.length(); i++) { if (string.codePointAt(i) > 0xffff) { return false; } } return true; } @SuppressWarnings("deprecation")
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 08 13:56:22 GMT 2021 - 8.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashing.java
} } /** * Sets {@code table[index]} to {@code entry}, where {@code table} is actually a {@code byte[]}, * {@code short[]}, or {@code int[]}. The value of {@code entry} should fit in the size of the * assigned array element, when seen as an unsigned value. So if {@code table} is a {@code byte[]} * then we should have {@code 0 ≤ entry ≤ 255}, and if {@code table} is a {@code short[]} then we
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Aug 02 21:41:22 GMT 2021 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/PairedStats.java
* * <p>This fit minimizes the root-mean-square error in {@code y} as a function of {@code x}. This * error is defined as the square root of the mean of the squares of the differences between the * actual {@code y} values of the data and the values predicted by the fit for the {@code x}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 12.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/Murmur3Hash32Test.java
// Ordinarily we'd use something like i += Character.charCount(string.codePointAt(i)) here. But // we can get away with i++ because the whole point of this method is to return false if we find // a code point that doesn't fit in a char. for (int i = 0; i < string.length(); i++) { if (string.codePointAt(i) > 0xffff) { return false; } } return true; } @SuppressWarnings("deprecation")
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 08 13:56:22 GMT 2021 - 8.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/PairedStatsAccumulatorTest.java
LinearTransformation fit = accumulator.leastSquaresFit(); LinearTransformation fitByAddAllPartitionedPairedStats = accumulatorByAddAllPartitionedPairedStats.leastSquaresFit(); if (values.hasAnyNonFinite()) { assertLinearTransformationNaN(fit); assertLinearTransformationNaN(fitByAddAllPartitionedPairedStats); } else {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 23.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/PairedStatsAccumulatorTest.java
LinearTransformation fit = accumulator.leastSquaresFit(); LinearTransformation fitByAddAllPartitionedPairedStats = accumulatorByAddAllPartitionedPairedStats.leastSquaresFit(); if (values.hasAnyNonFinite()) { assertLinearTransformationNaN(fit); assertLinearTransformationNaN(fitByAddAllPartitionedPairedStats); } else {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 23.4K bytes - Viewed (0)