| Package | Description |
|---|---|
| it.unimi.dsi.fastutil.objects |
Provides type-specific classes for object elements or keys.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractReference2DoubleMap<K>
An abstract class providing basic methods for maps implementing a type-specific interface.
|
class |
AbstractReference2DoubleSortedMap<K>
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
class |
Reference2DoubleArrayMap<K>
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
static class |
Reference2DoubleFunctions.EmptyFunction<K>
An immutable class representing an empty type-specific function.
|
static class |
Reference2DoubleFunctions.Singleton<K>
An immutable class representing a type-specific singleton function.
|
static class |
Reference2DoubleFunctions.UnmodifiableFunction<K>
An unmodifiable wrapper class for functions.
|
class |
Reference2DoubleLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
static class |
Reference2DoubleMaps.EmptyMap<K>
An immutable class representing an empty type-specific map.
|
static class |
Reference2DoubleMaps.Singleton<K>
An immutable class representing a type-specific singleton map.
|
static class |
Reference2DoubleMaps.UnmodifiableMap<K>
An unmodifiable wrapper class for maps.
|
class |
Reference2DoubleOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Reference2DoubleOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
static class |
Reference2DoubleSortedMaps.EmptySortedMap<K>
An immutable class representing an empty type-specific sorted map.
|
static class |
Reference2DoubleSortedMaps.Singleton<K>
An immutable class representing a type-specific singleton sorted map.
|
static class |
Reference2DoubleSortedMaps.UnmodifiableSortedMap<K>
An unmodifiable wrapper class for sorted maps.
|
Copyright © 2020. All rights reserved.