String[] openingVowels
String[] midVowels
String[] openingConsonants
String[] midConsonants
String[] closingConsonants
String[] vowelSplitters
String[] closingSyllables
boolean clean
IntDoubleOrderedMap syllableFrequencies
double totalSyllableFrequency
double vowelStartFrequency
double vowelEndFrequency
double vowelSplitFrequency
double syllableEndFrequency
regexodus.Pattern[] sanityChecks
ArrayList<E> modifiers
String summary
regexodus.Replacer replacer
String replacement
double chance
FakeLanguageGen.Alteration[] alterations
FakeLanguageGen language
StatefulRNG rng
HashMap<K,V> table
HashMap<K,V> reverse
int cacheLevel
long shift
FakeLanguageGen language
squidpony.NaturalLanguageCipher.SemiRandom rs
RNG rng
String pluralSuffix
String verbingSuffix
String verbedSuffix
String verberSuffix
String verbationSuffix
String verbmentSuffix
String nounySuffix
String nounenSuffix
String nounistSuffix
String nounismSuffix
String nounicSuffix
String nouniveSuffix
String adjectivelySuffix
String adjectivestSuffix
String reverbPrefix
String ennounPrefix
String preverbPrefix
String postverbPrefix
String proverbPrefix
String antiverbPrefix
String disnounPrefix
HashMap<K,V> table
HashMap<K,V> reverse
int cacheLevel
long shift
regexodus.Pattern[] additionalPrefixChecks
regexodus.Pattern[] additionalSuffixChecks
OrderedMap<K,V> mappings
StatefulRNG rng
Adjacency adjacency
double[] physicalMap
double[] gradientMap
int[] costMap
int[][][] neighbors
Adjacency.portal(int[][][], int, int, boolean)
if you want to create portals between non-adjacent cells.int height
int width
IntVLA path
IntDoubleOrderedMap goals
IntDoubleOrderedMap fresh
IntDoubleOrderedMap closed
IntDoubleOrderedMap open
RNG rng
int frustration
int[] reuse
boolean initialized
int mappedCount
double cachedLongerPaths
long cachedImpassable
long cachedFearSources
double[] cachedFleeMap
int cachedSize
DijkstraMap.Measurement measurement
double[][] physicalMap
double[][] gradientMap
double[][] safetyMap
double[][] costMap
int height
int width
ArrayList<E> path
IntDoubleOrderedMap goals
IntDoubleOrderedMap fresh
IntDoubleOrderedMap closed
IntDoubleOrderedMap open
RNG rng
int frustration
Coord[][] targetMap
Direction[] reuse
boolean initialized
int mappedCount
int blockingRequirement
double cachedLongerPaths
Set<E> cachedImpassable
Coord[] cachedFearSources
double[][] cachedFleeMap
int cachedSize
Direction[] directions
int maxAdjacent
boolean twoStepRule
int blockingRule
DijkstraMap.Measurement measurement
int width
int height
int rotations
int depths
IntDoubleOrderedMap costRules
Adjacency.addCostRule(char, double)
or Adjacency.addCostRule(char, double, boolean)
if the map has rotations).
A cost of 1.0 is normal for most implementations; higher costs make a movement harder to perform and take more
time if the game uses that mechanic, while lower costs (which should always be greater than 0.0) make a move
easier to perform. Most games can do perfectly well with just 1.0 and 2.0, if they use this at all, plus possibly
a very high value for impossible moves (say, 9999.0 for something like a submarine trying to enter suburbia).
IntDoubleOrderedMap.defaultReturnValue(double)
; there may be a reason for user code to call this as well.int[] invertAdjacent
int shift
int type
int maxRadius
int maxLOSRadius
int width
int height
int mapLimit
int limit
double[][] resMap
Radius radiusKind
short[][][] cache
short[][][] tmpCache
short[][] losCache
boolean complete
boolean qualityComplete
boolean refreshComplete
FOV fov
FOV gradedFOV
short[][] ALL_WALLS
short[] wallMap
double[][] atan2Cache
double[][] directionAngles
short[][] distanceCache
Coord[][] waves
int NUM_THREADS
ExecutorService executor
double fovPermissiveness
OrderedMap<K,V> lights
Coord[] lightSources
int[] lightBrightnesses
double[][] levels
double decay
Thread performanceThread
Thread qualityThread
char[][] map
int[][] environment
Coord[] validDoors
Coord min
Coord max
ArrayList<E> leftDoors
ArrayList<E> rightDoors
ArrayList<E> topDoors
ArrayList<E> bottomDoors
int category
Coord bottomLeft
int width
int height
short[] shorts
private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException
IOException
ClassNotFoundException
private void writeObject(ObjectOutputStream s) throws IOException
IOException
Object[] key
int[] value
int mask
boolean containsNullKey
int first
Arrangement.size
is nonzero; otherwise, it contains -1.int last
Arrangement.size
is nonzero; otherwise, it contains -1.IntVLA order
int n
int maxFill
Arrangement.f
.int size
float f
squidpony.squidmath.Arrangement.MapEntrySet entries
Arrangement.KeySet keys
Collection<E> values
int defRetValue
CrossHash.IHasher hasher
squidpony.squidmath.Arrangement.MapEntry entry
Object[] elements
int[] combinationIndices
long remainingCombinations
long totalCombinations
int x
int y
int z
double x
double y
int step
long lastShuffledState
double[] baseDeck
double[] deck
double fairness
double produced
double baseline
RNG rng
double expected
double centrality
double rawLatest
long[] data
int height
int width
int ySections
long yEndMask
int[] key
double[] value
int mask
boolean containsNullKey
int first
IntDoubleOrderedMap.size
is nonzero; otherwise, it contains -1.int last
IntDoubleOrderedMap.size
is nonzero; otherwise, it contains -1.long[] link
((prev & 0xFFFFFFFFL) << 32) | (next & 0xFFFFFFFFL)
. The first entry contains predecessor -1, and the
last entry contains successor -1.int n
int maxFill
IntDoubleOrderedMap.f
.int size
float f
IntDoubleOrderedMap.MapEntrySet entries
IntDoubleOrderedMap.KeySet keys
IntDoubleOrderedMap.DoubleCollection values
double defRetValue
int[] items
int size
int count
long[] results
long[] mem
long a
long b
long c
long state
long[] state
int choice
byte[] seed
ReentrantLock lock
int[] mt
int mtIndex
RNG rng
int maxDistance
int minDistance
int width
int height
LinkedList<E> distribution
private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException
IOException
ClassNotFoundException
private void writeObject(ObjectOutputStream s) throws IOException
IOException
Object[] key
Object[] value
int mask
boolean containsNullKey
int first
OrderedMap.size
is nonzero; otherwise, it contains -1.int last
OrderedMap.size
is nonzero; otherwise, it contains -1.IntVLA order
int n
int maxFill
OrderedMap.f
.int size
float f
squidpony.squidmath.OrderedMap.MapEntrySet entries
OrderedMap.KeySet keys
Collection<E> values
Object defRetValue
CrossHash.IHasher hasher
squidpony.squidmath.OrderedMap.MapEntry entry
private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException
IOException
ClassNotFoundException
private void writeObject(ObjectOutputStream s) throws IOException
IOException
Object[] key
int mask
boolean containsNull
int first
OrderedSet.size
is nonzero; otherwise, it contains -1.int last
OrderedSet.size
is nonzero; otherwise, it contains -1.IntVLA order
int n
int maxFill
OrderedSet.f
.int size
float f
CrossHash.IHasher hasher
Object[] elements
int[] permutationIndices
long remainingPermutations
long totalPermutations
long state
OrderedMap<K,V> table
RNG rng
int total
OrderedMap<K,V> biases
RNG rng
int distribution
short[] raw
Coord[] coords
boolean dirty
LightRNG lrng
int size
short[][] keyTable
Object[] valueTable
int capacity
int stashSize
float loadFactor
int hashShift
int mask
int threshold
int stashCapacity
int pushIterations
RegionMap.Entries<V> entries1
RegionMap.Entries<V> entries2
RegionMap.Values<V> values1
RegionMap.Values<V> values2
RegionMap.Keys keys1
RegionMap.Keys keys2
RandomnessSource random
double nextNextGaussian
boolean haveNextNextGaussian
Random ran
RandomnessSource randomnessSource
int size
short[] keyTable
int capacity
int stashSize
boolean hasZeroValue
float loadFactor
int hashShift
int threshold
int stashCapacity
int pushIterations
int mask
ShortSet.ShortSetIterator iterator1
ShortSet.ShortSetIterator iterator2
short[] items
int size
boolean ordered
int dimension
int count
long[][] direction
long[] x
long low
long high
long state
long jumble
long state0
long state1
long state0
long state1
Copyright © 2012–2016. All rights reserved.