- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 721 for sortby (0.19 sec)
-
guava/src/com/google/common/collect/ImmutableSortedMultiset.java
* Returns an immutable sorted multiset containing the given elements sorted by their natural * ordering. * * @throws NullPointerException if any element is null */ public static <E extends Comparable<? super E>> ImmutableSortedMultiset<E> of( E e1, E e2, E e3, E e4) { return copyOf(Ordering.natural(), Arrays.asList(e1, e2, e3, e4)); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 08 03:01:02 UTC 2024 - 29.5K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/internal/internal.go
import ( "sort" "golang.org/x/text/language" ) // SortTags sorts tags in place. func SortTags(tags []language.Tag) { sort.Sort(sorter(tags)) } type sorter []language.Tag func (s sorter) Len() int { return len(s) } func (s sorter) Swap(i, j int) { s[i], s[j] = s[j], s[i] } func (s sorter) Less(i, j int) bool { return s[i].String() < s[j].String()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 1K bytes - Viewed (0) -
testing/internal-performance-testing/src/main/groovy/org/gradle/performance/measure/DataSeries.java
max = max.compareTo(amount) >= 0 ? max : amount; } List<Amount<Q>> sorted = Lists.newArrayList(this); Collections.sort(sorted); Amount<Q> medianLeft = sorted.get((sorted.size() - 1) / 2); Amount<Q> medianRight = sorted.get((sorted.size() - 1) / 2 + 1 - sorted.size() % 2); median = medianLeft.plus(medianRight).div(2); average = total.div(size());
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 3.9K bytes - Viewed (0) -
src/sort/search.go
// SearchInts searches for x in a sorted slice of ints and returns the index // as specified by [Search]. The return value is the index to insert x if x is // not present (it could be len(a)). // The slice must be sorted in ascending order. func SearchInts(a []int, x int) int { return Search(len(a), func(i int) bool { return a[i] >= x }) } // SearchFloat64s searches for x in a sorted slice of float64s and returns the index
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 28 16:40:32 UTC 2023 - 5.7K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/NodeSets.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed May 11 14:29:26 UTC 2022 - 1.1K bytes - Viewed (0) -
platforms/core-execution/snapshots/src/test/groovy/org/gradle/internal/snapshot/CaseSensitiveVfsRelativePathTest.groovy
class CaseSensitiveVfsRelativePathTest extends AbstractCaseVfsRelativePathTest { def "finds right entry in sorted list with only case differences"() { def children = ["bAd", "BaD", "Bad"] children.sort(getPathComparator(CASE_SENSITIVE)) expect: for (int i = 0; i < children.size(); i++) { def searchedChild = children[i]
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:34:50 UTC 2023 - 3.4K bytes - Viewed (0) -
src/sort/example_search_test.go
// license that can be found in the LICENSE file. package sort_test import ( "fmt" "sort" ) // This example demonstrates searching a list sorted in ascending order. func ExampleSearch() { a := []int{1, 3, 6, 10, 15, 21, 28, 36, 45, 55} x := 6 i := sort.Search(len(a), func(i int) bool { return a[i] >= x }) if i < len(a) && a[i] == x { fmt.Printf("found %d at index %d in %v\n", x, i, a)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 18 08:25:24 UTC 2021 - 2.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
Comparator<? super E> comparator, Collection<? extends E> elements) { return copyOf(comparator, (Iterable<? extends E>) elements); } /** * Returns an immutable sorted set containing the elements of a sorted set, sorted by the same * {@code Comparator}. That behavior differs from {@link #copyOf(Iterable)}, which always uses the * natural ordering of the elements. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 08 03:01:02 UTC 2024 - 38.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java
* Returns an immutable sorted multiset containing the given elements sorted by their natural * ordering. * * @throws NullPointerException if any element is null */ public static <E extends Comparable<? super E>> ImmutableSortedMultiset<E> of( E e1, E e2, E e3, E e4) { return copyOf(Ordering.natural(), Arrays.asList(e1, e2, e3, e4)); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 35.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedSetMultimap.java
* not necessarily a {@link SortedMap}: A {@code SortedSetMultimap} must expose the <i>values</i> * for a given key in sorted order, but it need not expose the <i>keys</i> in sorted order. * Individual {@code SortedSetMultimap} implementations, like those built with {@link * MultimapBuilder#treeKeys()}, may make additional guarantees. */ @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 24 17:47:51 UTC 2022 - 5.3K bytes - Viewed (0)