- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 87 for Clements (0.19 sec)
-
android/guava/src/com/google/common/collect/Iterators.java
* elements. */ @SafeVarargs public static <T extends @Nullable Object> Iterator<T> cycle(T... elements) { return cycle(Lists.newArrayList(elements)); } /** * Returns an Iterator that walks the specified array, nulling out elements behind it. This can * avoid memory leaks when an element is no longer necessary. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Apr 20 03:33:06 GMT 2024 - 50.6K bytes - Viewed (0) -
build-logic/documentation/src/main/groovy/gradlebuild/docs/ReleaseNotesTransformer.java
private void wrapH2InSectionTopic(Document document) { Element heading = document.body().select("h2").first(); List<Element> inSection = new ArrayList<>(); inSection.add(heading); Element next = heading.nextElementSibling(); while (true) { if (next == null || next.tagName().equals("h2")) { Element section = heading.before("<section class='topic'/>").previousElementSibling();
Java - Registered: Wed May 01 11:36:15 GMT 2024 - Last Modified: Thu Apr 25 04:49:56 GMT 2024 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
* have been removed. * * <p><b>Warning:</b> Typical uses of the resulting iterator may produce an infinite loop. You * should use an explicit {@code break} or be certain that you will eventually remove all the * elements. * * <p>To cycle over the elements {@code n} times, use the following: {@code * Iterables.concat(Collections.nCopies(n, Arrays.asList(elements)))} *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
* * @throws NullPointerException if any element of {@code elements} is {@code null} * @since 3.0 */ // TODO(kevinb): rerun benchmarks including new options public <E extends @NonNull T> ImmutableList<E> immutableSortedCopy(Iterable<E> elements) { return ImmutableList.sortedCopyOf(this, elements); } /** * Returns {@code true} if each element in {@code iterable} after the first is greater than or
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ListsTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 35.2K bytes - Viewed (0) -
src/builtin/builtin.go
// (m[key]) from the map. If m is nil or there is no such element, delete // is a no-op. func delete(m map[Type]Type1, key Type) // The len built-in function returns the length of v, according to its type: // // Array: the number of elements in v. // Pointer to array: the number of elements in *v (even if v is nil). // Slice, or map: the number of elements in v; if v is nil, len(v) is zero.
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 12.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
return new LexicographicalOrdering<S>(checkNotNull(comparator)); } /** * Returns {@code true} if each element in {@code iterable} after the first is greater than or * equal to the element that preceded it, according to the specified comparator. Note that this is * always true when the iterable has fewer than two elements. */ public static <T extends @Nullable Object> boolean isInOrder(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 11 08:42:51 GMT 2024 - 10K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ListsTest.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 35.2K bytes - Viewed (0) -
doc/go_spec.html
</li> <li>An element list that does not contain any keys must list an element for each struct field in the order in which the fields are declared. </li> <li>If any element has a key, every element must have a key. </li> <li>An element list that contains keys does not need to have an element for each struct field. Omitted fields
HTML - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Apr 26 00:39:16 GMT 2024 - 279.6K bytes - Viewed (0) -
doc/go1.17_spec.html
</li> <li>An element list that does not contain any keys must list an element for each struct field in the order in which the fields are declared. </li> <li>If any element has a key, every element must have a key. </li> <li>An element list that contains keys does not need to have an element for each struct field. Omitted fields
HTML - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 211.6K bytes - Viewed (0)