- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 35 for elemLen (0.06 sec)
-
android/guava/src/com/google/common/collect/ConcurrentHashMultiset.java
// Query Operations /** * Returns the number of occurrences of {@code element} in this multiset. * * @param element the element to look for * @return the nonnegative number of occurrences of the element */ @Override public int count(@Nullable Object element) { AtomicInteger existingCounter = safeGet(countMap, element); return (existingCounter == null) ? 0 : existingCounter.get(); }Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Dec 08 22:42:14 UTC 2025 - 22.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/AbstractMapBasedMultiset.java
if (occurrences == 0) { return count(element); } checkArgument(occurrences > 0, "occurrences cannot be negative: %s", occurrences); int entryIndex = backingMap.indexOf(element); if (entryIndex == -1) { backingMap.put(element, occurrences); size += occurrences; return 0; } int oldCount = backingMap.getValue(entryIndex);
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Fri Dec 05 23:15:58 UTC 2025 - 7.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/LinkedHashMultiset.java
* according to when the first occurrence of the element was added. When the multiset contains * multiple instances of an element, those instances are consecutive in the iteration order. If all * occurrences of an element are removed, after which that element is added to the multiset, the * element will appear at the end of the iteration. * * <p>See the Guava User Guide article on <a href=
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Fri Dec 05 23:15:58 UTC 2025 - 3.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/ObjectArrays.java
T[] result = newArray(array, array.length + 1); result[0] = element; arraycopy(array, 0, result, 1, array.length); return result; } /** * Returns a new array that appends {@code element} to {@code array}. * * @param array the array of elements to prepend * @param element the element to append to the end
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Dec 09 15:48:28 UTC 2025 - 8.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectArrays.java
T[] result = newArray(array, array.length + 1); result[0] = element; arraycopy(array, 0, result, 1, array.length); return result; } /** * Returns a new array that appends {@code element} to {@code array}. * * @param array the array of elements to prepend * @param element the element to append to the end
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Dec 09 15:48:28 UTC 2025 - 8.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/util/GsaConfigParser.java
public static final String CONTAINS = "contains:"; /** XML element name for collections container. */ protected static final String COLLECTIONS = "collections"; /** XML element name for individual collection. */ protected static final String COLLECTION = "collection"; /** XML element name for global parameters container. */ protected static final String GLOBALPARAMS = "globalparams";Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Fri Nov 28 16:29:12 UTC 2025 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
@Override public int add(@ParametricNullness E element, int occurrences) { checkNonnegative(occurrences, "occurrences"); if (occurrences == 0) { return count(element); } checkArgument(range.contains(element)); AvlNode<E> root = rootReference.get(); if (root == null) { int unused = comparator().compare(element, element); AvlNode<E> newRoot = new AvlNode<>(element, occurrences);
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Dec 09 15:58:48 UTC 2025 - 33.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeMultiset.java
@Override public int add(@ParametricNullness E element, int occurrences) { checkNonnegative(occurrences, "occurrences"); if (occurrences == 0) { return count(element); } checkArgument(range.contains(element)); AvlNode<E> root = rootReference.get(); if (root == null) { int unused = comparator().compare(element, element); AvlNode<E> newRoot = new AvlNode<>(element, occurrences);
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Dec 09 15:58:48 UTC 2025 - 34.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Serialization.java
* support concurrent multisets whose content may change while the method is running. * * <p>The serialized output consists of the number of distinct elements, the first element, its * count, the second element, its count, and so on. */ static <E extends @Nullable Object> void writeMultiset( Multiset<E> multiset, ObjectOutputStream stream) throws IOException {
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Dec 09 15:58:48 UTC 2025 - 6.7K bytes - Viewed (0) -
api/maven-api-xml/src/main/java/org/apache/maven/api/xml/XmlNode.java
/** * This default mode for combining a DOM node during merge means that where element names match, the process will * try to merge the element attributes and values, rather than overriding the recessive element completely with the * dominant one. This means that wherever the dominant element doesn't provide the value or a particular attribute, * that value or attribute will be set from the recessive DOM node.Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Wed Dec 17 15:20:44 UTC 2025 - 18.3K bytes - Viewed (0)