Index

A B C D E F G H I J K L M N O P R S T U V 
All Classes|All Packages

M

mapConverter - Variable in class squidpony.store.text.TextStorage
 
mask - Variable in class squidpony.squidmath.MultiArrangement
The mask for wrapping a position counter.
maxFill - Variable in class squidpony.squidmath.MultiArrangement
Threshold after which we rehash.
maxFill(int, float) - Static method in class squidpony.squidmath.MultiArrangement
Returns the maximum number of entries that can be filled before rehashing.
maxFill(long, float) - Static method in class squidpony.squidmath.MultiArrangement
Returns the maximum number of entries that can be filled before rehashing.
MultiArrangement<K> - Class in squidpony.squidmath
A bi-directional mapping of non-unique objects to positions in an ordering (which this generates), and vice versa.
MultiArrangement() - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new MultiArrangement with initial expected 16 entries and 0.5f as load factor.
MultiArrangement(int) - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new MultiArrangement with 0.5f as load factor.
MultiArrangement(int, float) - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new MultiArrangement.
MultiArrangement(int, float, CrossHash.IHasher) - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new Arrangement.
MultiArrangement(int, CrossHash.IHasher) - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new Arrangement with 0.5f as load factor.
MultiArrangement(Collection<K>) - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new Arrangement using the elements of an array.
MultiArrangement(Collection<K>, float) - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new Arrangement using the given collection of keys.
MultiArrangement(K[]) - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new Arrangement with 0.5f as load factor using the elements of an array.
MultiArrangement(K[], float) - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new MultiArrangement using the elements of an array.
MultiArrangement(K[], float, CrossHash.IHasher) - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new Arrangement using the elements of two parallel arrays.
MultiArrangement(K[], CrossHash.IHasher) - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new Arrangement with 0.5f as load factor using the elements of two parallel arrays.
MultiArrangement(CrossHash.IHasher) - Constructor for class squidpony.squidmath.MultiArrangement
Creates a new Arrangement with initial expected 16 entries and 0.5f as load factor.
MultiArrangement(MultiArrangement<? extends K>) - Constructor for class squidpony.squidmath.MultiArrangement
 
MultiArrangement.KeyIterator - Class in squidpony.squidmath
An iterator on keys.
MultiArrangement.KeyList - Class in squidpony.squidmath
 
MultiArrangement.ValueCollection - Class in squidpony.squidmath
 
MultiArrangement.ValueIterator - Class in squidpony.squidmath
An iterator on values.
MultiKey - Class in squidpony.squidmath
An ordered multi-directional "map" that keeps 1 or more keysets organized so you can look up one key given a key in another keyset, and do the same for the indices of keys.
MultiKey() - Constructor for class squidpony.squidmath.MultiKey
Constructs an empty MultiKey.
MultiKey(int, int) - Constructor for class squidpony.squidmath.MultiKey
Constructs a MultiKey with the expected number of indices to hold (the number of items in each keyset is always the same, and this will be more efficient if expected is greater than that number).
MultiKey(int, int, float) - Constructor for class squidpony.squidmath.MultiKey
Constructs a MultiKey with the expected number of indices to hold (the number of items in each keyset is always the same, and this will be more efficient if expected is greater than that number) and the load factor to use, between 0.1f and 0.8f usually (using load factors higher than 0.8f can cause problems).
MultiKey(Collection<Iterable>) - Constructor for class squidpony.squidmath.MultiKey
Constructs a MultiKey from a Collection of Iterables that will be processed in tandem, adding a unique item from each keyset in keysets if and only if it can also add a unique item from all other keysets, otherwise skipping that iteration in each Iterable.
MultiKey(Arrangement[]) - Constructor for class squidpony.squidmath.MultiKey
 
MultiKey(MultiKey) - Constructor for class squidpony.squidmath.MultiKey
 
A B C D E F G H I J K L M N O P R S T U V 
All Classes|All Packages