Package | Description |
---|---|
squidpony |
Utilities that don't fit elsewhere in SquidLib; mostly text manipulation, compression, and helper code.
|
squidpony.squidgrid.mapping |
Tools specifically for generating maps and placing content in them, usually working with 2D char arrays.
|
squidpony.squidmath |
A very broad package containing random number generators, geometry tools, data structures, and noise functions.
|
Modifier and Type | Field and Description |
---|---|
Arrangement<java.lang.String> |
Mnemonic.allAdjectives |
Arrangement<java.lang.String> |
Mnemonic.allNouns |
Arrangement<T> |
MarkovObject.body
All unique T items that this encountered during the latest call to
MarkovObject.analyze(Iterable) . |
Arrangement<java.lang.String> |
Mnemonic.items |
Modifier and Type | Method and Description |
---|---|
static <T> Arrangement<T> |
Maker.makeArrange(T... elements)
Makes a Arrangement (Arrange) of T given an array or vararg of T elements.
|
Modifier and Type | Method and Description |
---|---|
static <K> StringConvert<Arrangement<K>> |
Converters.convertArrangement(java.lang.CharSequence type) |
static <K> StringConvert<Arrangement<K>> |
Converters.convertArrangement(java.lang.Class<K> type) |
static <K> StringConvert<Arrangement<K>> |
Converters.convertArrangement(StringConvert<K> convert) |
Modifier and Type | Field and Description |
---|---|
protected Arrangement<java.lang.String> |
SectionMap.names |
Modifier and Type | Field and Description |
---|---|
Arrangement<A> |
K2.keysA |
Arrangement<B> |
K2.keysB |
Arrangement<T> |
ProbabilityTable.table
The set of items that can be produced directly from
ProbabilityTable.random() (without additional lookups). |
Modifier and Type | Method and Description |
---|---|
Arrangement<K> |
Arrangement.clone()
Returns a deep copy of this map.
|
Arrangement<K> |
Arrangement.reorder(int... ordering)
Given an array or varargs of replacement indices for this Arrangement's iteration order, reorders this so the
first item in the returned version is the same as
getAt(ordering[0]) (with some care taken for negative
or too-large indices), the second item in the returned version is the same as getAt(ordering[1]) , etc. |
Arrangement<K> |
Arrangement.shuffle(IRNG rng)
Randomly alters the iteration order for this Arrangement using the given IRNG to shuffle.
|
Arrangement<K> |
Arrangement.take(int amount)
Produces a copy of this Arrangement, but only using up to the given amount of items to take.
|
Constructor and Description |
---|
Arrangement(Arrangement<? extends K> a) |
K2(Arrangement<A> aItems,
Arrangement<B> bItems) |
K2(Arrangement<A> aItems,
Arrangement<B> bItems) |
Copyright © Eben Howard 2012–2022. All rights reserved.