- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 40 for LinkedHashMap (1.77 sec)
-
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced * load on the garbage collector by only using a constant number of internal objects. * * <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashMap}. Generally speaking, this class reduces object allocation and memory
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Primitives.java
private static final Map<Class<?>, Class<?>> WRAPPER_TO_PRIMITIVE_TYPE; // Sad that we can't use a BiMap. :( static { Map<Class<?>, Class<?>> primToWrap = new LinkedHashMap<>(16); Map<Class<?>, Class<?>> wrapToPrim = new LinkedHashMap<>(16); add(primToWrap, wrapToPrim, boolean.class, Boolean.class); add(primToWrap, wrapToPrim, byte.class, Byte.class); add(primToWrap, wrapToPrim, char.class, Character.class);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Oct 05 19:04:25 UTC 2022 - 4.5K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Primitives.java
private static final Map<Class<?>, Class<?>> WRAPPER_TO_PRIMITIVE_TYPE; // Sad that we can't use a BiMap. :( static { Map<Class<?>, Class<?>> primToWrap = new LinkedHashMap<>(16); Map<Class<?>, Class<?>> wrapToPrim = new LinkedHashMap<>(16); add(primToWrap, wrapToPrim, boolean.class, Boolean.class); add(primToWrap, wrapToPrim, byte.class, Byte.class); add(primToWrap, wrapToPrim, char.class, Character.class);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Oct 05 19:04:25 UTC 2022 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SparseImmutableTable.java
Map<R, Map<C, V>> rows = Maps.newLinkedHashMap(); for (R row : rowSpace) { rows.put(row, new LinkedHashMap<C, V>()); } Map<C, Map<R, V>> columns = Maps.newLinkedHashMap(); for (C col : columnSpace) { columns.put(col, new LinkedHashMap<R, V>()); } int[] cellRowIndices = new int[cellList.size()]; int[] cellColumnInRowIndices = new int[cellList.size()];
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Nov 30 21:54:06 UTC 2023 - 5.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/MutableClassToInstanceMap.java
import java.io.InvalidObjectException; import java.io.ObjectInputStream; import java.io.Serializable; import java.util.HashMap; import java.util.Iterator; import java.util.LinkedHashMap; import java.util.Map; import java.util.Set; import java.util.Spliterator; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.NonNull;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 7.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/LinkedHashMultiset.java
import com.google.common.annotations.GwtIncompatible; import com.google.common.annotations.J2ktIncompatible; import java.io.IOException; import java.io.ObjectInputStream; import java.io.ObjectOutputStream; import java.util.LinkedHashMap; import org.checkerframework.checker.nullness.qual.Nullable; /** * A {@code Multiset} implementation with predictable iteration order. Its iterator orders elements
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 4K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced * load on the garbage collector by only using a constant number of internal objects. * * <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashMap}. Generally speaking, this class reduces object allocation and memory
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 10.2K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/MultimapTestSuiteBuilder.java
} map.put(entry.getKey(), entry.getValue()); } Iterable<Entry<K, V>> ordered = multimapGenerator.order(builder); LinkedHashMap<K, Collection<V>> orderedMap = new LinkedHashMap<>(); for (Entry<K, V> entry : ordered) { orderedMap.put(entry.getKey(), map.get(entry.getKey())); } return orderedMap.entrySet(); } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 26 19:46:10 UTC 2024 - 26.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/SparseImmutableTable.java
Map<R, Map<C, V>> rows = Maps.newLinkedHashMap(); for (R row : rowSpace) { rows.put(row, new LinkedHashMap<C, V>()); } Map<C, Map<R, V>> columns = Maps.newLinkedHashMap(); for (C col : columnSpace) { columns.put(col, new LinkedHashMap<R, V>()); } int[] cellRowIndices = new int[cellList.size()]; int[] cellColumnInRowIndices = new int[cellList.size()];
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Nov 30 21:54:06 UTC 2023 - 5.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/DirectedGraphConnections.java
/** * All node connections in this graph, in edge insertion order. * * <p>Note: This field and {@link #adjacentNodeValues} cannot be combined into a single * LinkedHashMap because one target node may be mapped to both a predecessor and a successor. A * LinkedHashMap combines two such edges into a single node-value pair, even though the edges may * not have been inserted consecutively. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 20 17:00:05 UTC 2024 - 18K bytes - Viewed (0)