- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 3,199 for greatest (0.34 sec)
-
src/math/floor.go
// Copyright 2009 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package math // Floor returns the greatest integer value less than or equal to x. // // Special cases are: // // Floor(±0) = ±0 // Floor(±Inf) = ±Inf // Floor(NaN) = NaN func Floor(x float64) float64 { if haveArchFloor { return archFloor(x) } return floor(x) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/math/ToDoubleRounder.java
*/ @GwtIncompatible @ElementTypesAreNonnullByDefault abstract class ToDoubleRounder<X extends Number & Comparable<X>> { /** * Returns x rounded to either the greatest double less than or equal to the precise value of x, * or the least double greater than or equal to the precise value of x. */ abstract double roundToDoubleArbitrarily(X x); /** Returns the sign of x: either -1, 0, or 1. */ abstract int sign(X x);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 5.8K bytes - Viewed (0) -
guava/src/com/google/common/math/ToDoubleRounder.java
*/ @GwtIncompatible @ElementTypesAreNonnullByDefault abstract class ToDoubleRounder<X extends Number & Comparable<X>> { /** * Returns x rounded to either the greatest double less than or equal to the precise value of x, * or the least double greater than or equal to the precise value of x. */ abstract double roundToDoubleArbitrarily(X x); /** Returns the sign of x: either -1, 0, or 1. */ abstract int sign(X x);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 5.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedMultiset.java
* {@code null} if this multiset is empty. */ @CheckForNull Entry<E> pollFirstEntry(); /** * Returns and removes the entry associated with the greatest element in this multiset, or returns * {@code null} if this multiset is empty. */ @CheckForNull Entry<E> pollLastEntry(); /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 5.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/SortedMultiset.java
* {@code null} if this multiset is empty. */ @CheckForNull Entry<E> pollFirstEntry(); /** * Returns and removes the entry associated with the greatest element in this multiset, or returns * {@code null} if this multiset is empty. */ @CheckForNull Entry<E> pollLastEntry(); /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 5.5K bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/native-binaries/cunit/groovy/libs/cunit/2.1-2/include/CUnit/Util.h
* result in szDest. Currently conversion of '&', '<', and '>' is supported. * Note that conversion to entities increases the length of the converted * string. The greatest conversion size increase would be a string * consisting entirely of entity characters of converted length * CUNIT_MAX_ENTITY_LEN. Neither szSrc nor szDest may be NULL * (checked by assertion).<br /><br /> *
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 5.8K bytes - Viewed (0) -
docs/distributed/DESIGN.md
of erasure set size is automatic based on the number of drives available, let's say for example if there are 32 servers and 32 drives which is a total of 1024 drives. In this scenario 16 becomes the erasure set size. This is decided based on the greatest common divisor (GCD) of acceptable erasure set sizes ranging from *4 to 16*. - *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*. In the example...
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Aug 15 23:04:20 UTC 2023 - 8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedLists.java
import java.util.RandomAccess; import org.checkerframework.checker.nullness.qual.Nullable; /** * Static methods pertaining to sorted {@link List} instances. * * <p>In this documentation, the terms <i>greatest</i>, <i>greater</i>, <i>least</i>, and * <i>lesser</i> are considered to refer to the comparator on the elements, and the terms * <i>first</i> and <i>last</i> are considered to refer to the elements' ordering in a list. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.9K bytes - Viewed (0) -
src/go/types/mono.go
again := true for again { again = false for i, edge := range check.mono.edges { src := &check.mono.vertices[edge.src] dst := &check.mono.vertices[edge.dst] // N.B., we're looking for the greatest weight paths, unlike // typical Bellman-Ford. w := src.weight + edge.weight if w <= dst.weight { continue } dst.pre = i dst.len = src.len + 1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/SortedLists.java
import java.util.RandomAccess; import org.checkerframework.checker.nullness.qual.Nullable; /** * Static methods pertaining to sorted {@link List} instances. * * <p>In this documentation, the terms <i>greatest</i>, <i>greater</i>, <i>least</i>, and * <i>lesser</i> are considered to refer to the comparator on the elements, and the terms * <i>first</i> and <i>last</i> are considered to refer to the elements' ordering in a list. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.9K bytes - Viewed (0)