- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 600 for Younis (0.29 sec)
-
android/guava/src/com/google/common/collect/RegularImmutableSortedMultiset.java
/** * An immutable sorted multiset with one or more distinct elements. * * @author Louis Wasserman */ @SuppressWarnings("serial") // uses writeReplace, not default serialization @GwtIncompatible @ElementTypesAreNonnullByDefault final class RegularImmutableSortedMultiset<E> extends ImmutableSortedMultiset<E> { private static final long[] ZERO_CUMULATIVE_COUNTS = {0}; static final ImmutableSortedMultiset<?> NATURAL_EMPTY_MULTISET =
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMultiset.java
final Object[] elements; final int[] counts; // "extends Object" works around https://github.com/typetools/checker-framework/issues/3013 SerializedForm(Multiset<? extends Object> multiset) { int distinct = multiset.entrySet().size(); elements = new Object[distinct]; counts = new int[distinct]; int i = 0;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 4.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/Count.java
import com.google.common.annotations.GwtCompatible; import java.io.Serializable; import javax.annotation.CheckForNull; /** * A mutable value of type {@code int}, for multisets to use in tracking counts of values. * * @author Louis Wasserman */ @GwtCompatible @ElementTypesAreNonnullByDefault final class Count implements Serializable { private int value; Count(int value) { this.value = value; }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Aug 05 00:40:25 GMT 2021 - 1.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeMap.java
* this range map are guaranteed to read through to the returned {@code Map}. * * <p>The returned {@code Map} iterates over entries in ascending order of the bounds of the * {@code Range} entries. * * <p>It is guaranteed that no empty ranges will be in the returned {@code Map}. */ Map<Range<K>, V> asMapOfRanges(); /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Count.java
import com.google.common.annotations.GwtCompatible; import java.io.Serializable; import javax.annotation.CheckForNull; /** * A mutable value of type {@code int}, for multisets to use in tracking counts of values. * * @author Louis Wasserman */ @GwtCompatible @ElementTypesAreNonnullByDefault final class Count implements Serializable { private int value; Count(int value) { this.value = value; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Aug 05 00:40:25 GMT 2021 - 1.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMultiset.java
final Object[] elements; final int[] counts; // "extends Object" works around https://github.com/typetools/checker-framework/issues/3013 SerializedForm(Multiset<? extends Object> multiset) { int distinct = multiset.entrySet().size(); elements = new Object[distinct]; counts = new int[distinct]; int i = 0;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 20.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeSet.java
* complementLowerBoundWindow. Complement range lower bounds are either positive range upper * bounds, or Cut.belowAll(). * * positiveItr starts at the first positive range with lower bound greater than * firstComplementRangeLowerBound. (Positive range lower bounds correspond to complement range * upper bounds.) */ Collection<Range<C>> positiveRanges;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 32.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java
/* * We keep an array of elements and counts. Periodically -- when we need more room in the * array, or when we're building, or the like -- we sort, deduplicate, and combine the counts. * Negative counts indicate a setCount operation with ~counts[i]. */ private final Comparator<? super E> comparator; @VisibleForTesting E[] elements; private int[] counts; /*
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 35.7K bytes - Viewed (0) -
internal/mountinfo/mountinfo_linux_test.go
mountsPath := filepath.Join(dir, "mounts") if err = os.WriteFile(mountsPath, []byte(successCase), 0o666); err != nil { t.Fatal(err) } // Verifies if reading each line worked properly. { var mounts mountInfos mounts, err = readProcMounts(mountsPath) if err != nil { t.Fatal(err) } if len(mounts) != 3 { t.Fatalf("expected 3 mounts, got %d", len(mounts)) }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Jan 18 07:03:17 GMT 2024 - 7.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/EnumMultiset.java
if (occurrences == 0) { return count(element); } int index = e.ordinal(); int oldCount = counts[index]; if (oldCount == 0) { return 0; } else if (oldCount <= occurrences) { counts[index] = 0; distinctElements--; size -= oldCount; } else { counts[index] = oldCount - occurrences; size -= occurrences; } return oldCount; }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9.3K bytes - Viewed (0)