java.lang.String[] openingVowels
java.lang.String[] midVowels
java.lang.String[] openingConsonants
java.lang.String[] midConsonants
java.lang.String[] closingConsonants
java.lang.String[] vowelSplitters
java.lang.String[] closingSyllables
boolean clean
double[] syllableFrequencies
double totalSyllableFrequency
double syllableBias
double vowelStartFrequency
double vowelEndFrequency
double vowelSplitFrequency
double syllableEndFrequency
regexodus.Pattern[] sanityChecks
java.util.ArrayList<E> modifiers
java.lang.String summary
java.lang.String name
regexodus.Replacer replacer
java.lang.String replacement
double chance
FakeLanguageGen.Alteration[] alterations
IStatefulRNG rng
int minWords
int maxWords
int maxChars
java.lang.String[] midPunctuation
java.lang.String[] endPunctuation
double midPunctuationFrequency
FakeLanguageGen language
int[] feed
char[] chars
MarkovChar.analyze(CharSequence)
. Will be null if MarkovChar.analyze(CharSequence)
was never called.IntIntOrderedMap pairs
MarkovChar.chars
indices placed into the most-significant bits for the first word and the
least-significant bits for the second word. The size of this IntIntOrderedMap is likely to be larger than the
char array MarkovChar.chars
, but should be equal to processed.length
. Will be null if
MarkovChar.analyze(CharSequence)
was never called.int[][] processed
MarkovChar.chars
and the indices of char
pairs in MarkovChar.pairs
, generated during the latest call to MarkovChar.analyze(CharSequence)
. This is a jagged 2D
array. Will be null if MarkovChar.analyze(CharSequence)
was never called.Arrangement<K> body
MarkovObject.analyze(Iterable)
.
Will be null if analyze() was never called.java.util.ArrayList<E> processed
MarkovObject.body
, generated during the latest
call to MarkovObject.analyze(Iterable)
. Will be null if analyze() was never called.java.util.ArrayList<E> raw
java.lang.String[] words
MarkovText.analyze(CharSequence)
. Will be null if MarkovText.analyze(CharSequence)
was never called.IntIntOrderedMap pairs
MarkovText.words
indices placed into the most-significant bits for the first word and the
least-significant bits for the second word. The size of this IntIntOrderedMap is likely to be larger than the
String array MarkovText.words
, but should be equal to processed.length
. Will be null if
MarkovText.analyze(CharSequence)
was never called.int[][] processed
MarkovText.words
and the indices of word
pairs in MarkovText.pairs
, generated during the latest call to MarkovText.analyze(CharSequence)
. This is a jagged 2D
array. Will be null if MarkovText.analyze(CharSequence)
was never called.java.lang.String[] words
MarkovTextLimited.analyze(CharSequence)
. Will be null if analyze() was never called.int[][] processed
MarkovTextLimited.words
, generated during the latest
call to MarkovTextLimited.analyze(CharSequence)
. This is a jagged 2D array. Will be null if analyze() was never called.FakeLanguageGen language
FakeLanguageGen.mixAll(Object...)
method of two or more of them, or
a random FakeLanguageGen produced by FakeLanguageGen.randomLanguage(long)
. Manually constructing
FakeLanguageGen objects isn't easy, and if you decide to do that it's recommended you look at SquidLib's source
to see how the existing calls to constructors work.squidpony.NaturalLanguageCipher.SemiRandom rs
RNG rng
java.lang.String pluralSuffix
java.lang.String verbingSuffix
java.lang.String verbedSuffix
java.lang.String verberSuffix
java.lang.String verbationSuffix
java.lang.String verbmentSuffix
java.lang.String nounySuffix
java.lang.String nounenSuffix
java.lang.String nounistSuffix
java.lang.String nounismSuffix
java.lang.String nounicSuffix
java.lang.String nouniveSuffix
java.lang.String adjectivelySuffix
java.lang.String adjectivestSuffix
java.lang.String reverbPrefix
java.lang.String ennounPrefix
java.lang.String preverbPrefix
java.lang.String postverbPrefix
java.lang.String proverbPrefix
java.lang.String antiverbPrefix
java.lang.String disnounPrefix
java.util.HashMap<K,V> table
java.util.HashMap<K,V> reverse
int cacheLevel
long shift
regexodus.Pattern[] additionalPrefixChecks
regexodus.Pattern[] additionalSuffixChecks
regexodus.Matcher markupMatcher
java.lang.String primary
java.util.ArrayList<E> associated
OrderedMap<K,V> mappings
java.util.ArrayList<E> alterations
SilkRNG rng
GapShuffler<T> plantTermShuffler
GapShuffler<T> fruitTermShuffler
GapShuffler<T> nutTermShuffler
GapShuffler<T> flowerTermShuffler
GapShuffler<T> potionTermShuffler
GapShuffler<T> vegetableTermShuffler
FakeLanguageGen defaultLanguage
Adjacency adjacency
Adjacency.BasicAdjacency
should cause this class to mimic DijkstraMap
, but using
Adjacency.RotationAdjacency
will be very different.double[] physicalMap
double[] gradientMap
int[] costMap
Adjacency.costRules
to get the actual cost as a double; this collection should almost
always start with a reasonable default value for when the int key is not present. It's common to simply assign
a char like '#' or '.' to an element in 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
IntVLA goals
IntVLA fresh
IRNG rng
int frustration
int[] reuse
boolean initialized
int mappedCount
double[] heuristics
double cachedLongerPaths
long cachedImpassable
long cachedFearSources
double[] cachedFleeMap
int cachedSize
Measurement measurement
double[][] physicalMap
double[][] gradientMap
double[][] costMap
boolean standardCosts
int height
int width
java.util.ArrayList<E> path
java.util.HashSet<E> impassable2
java.util.HashSet<E> friends
java.util.HashSet<E> tempSet
boolean cutShort
IntVLA goals
IntVLA fresh
IRNG rng
GWTRNG
if you may target web browsers with GWT, or a RNG
or StatefulRNG
otherwise.int frustration
Coord[][] targetMap
Direction[] dirs
boolean initialized
int mappedCount
int blockingRequirement
double cachedLongerPaths
java.util.HashSet<E> cachedImpassable
Coord[] cachedFearSources
double[][] cachedFleeMap
int cachedSize
DijkstraMap dijkstra
Coord[][] influences
GreasedRegion[] groups
boolean completed
Radius radius
int minDistance
metric
field.int maxDistance
metric
field.AimLimit limit
Radius metric
java.lang.String name
java.lang.String id
AOE aoe
char[][] dungeon
char[][] map
DijkstraMap dijkstra
Coord[][] influences
short[][] packedGroups
boolean completed
Radius radius
int width
int height
int width
int height
DirectedGraphAlgorithms<V> algorithms
Graph<V> graph
int idHash
java.lang.Object object
java.util.HashMap<K,V> neighbors
java.util.ArrayList<E> outEdges
boolean visited
boolean seen
double distance
double estimate
Node<V> prev
int i
int lastRunID
UndirectedGraphAlgorithms<V> algorithms
Direction[] directions
int maxAdjacent
boolean twoStepRule
int blockingRule
Measurement measurement
int width
int height
int rotations
int depths
boolean standardCost
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).
Adjacency.hasStandardCost()
, but
cannot be set directly).
IntDoubleOrderedMap.defaultReturnValue(double)
; there may be a reason for user code to call this as well.int[] invertAdjacent
int shift
int type
double[][] light
GreasedRegion nearLight
Measurement measurement
boolean[][] physicalMap
short[][] spillMap
GreasedRegion anySpillMap
GreasedRegion anyFreshMap
java.util.ArrayList<E> spreadPattern
int height
int width
int filled
java.util.ArrayList<E> fresh
IRNG rng
boolean initialized
Measurement measurement
boolean[][] physicalMap
boolean[][] spillMap
java.util.ArrayList<E> spreadPattern
int height
int width
int filled
OrderedSet<K> fresh
IStatefulRNG rng
GWTRNG
or StatefulRNG
.boolean initialized
int width
int height
StatefulRNG rng
java.lang.String name
char[][] politicalMap
char[][] zoomedMap
WorldMapGenerator wmg
WorldMapGenerator.BiomeMapper biomeMapper
OrderedMap<K,V> atlas
java.lang.String name
java.lang.String shortName
FakeLanguageGen language
java.util.HashSet<E> preferredBiomes
java.util.HashSet<E> blockedBiomes
int[] preferredHeight
int[] preferredHeat
int[] preferredMoisture
char[][] map
int[][] environment
GreasedRegion validDoors
Coord min
Coord max
java.util.ArrayList<E> leftDoors
java.util.ArrayList<E> rightDoors
java.util.ArrayList<E> topDoors
java.util.ArrayList<E> bottomDoors
int category
Coord bottomLeft
int width
int height
int[][] map
Arrangement<K> names
java.util.ArrayList<E> regions
java.util.ArrayList<E> connections
int width
int height
int biome
IStatefulRNG rng
java.util.ArrayList<E> contentTypes
java.util.ArrayList<E> floorTypes
int[][] content
int[][] floors
int[][] pieceMap
WildMap[] pieces
int[] minFloors
int[] maxFloors
int[] minContents
int[] maxContents
int width
int height
int seedA
int seedB
int cacheA
int cacheB
GWTRNG rng
double[][] heightData
double[][] heatData
double[][] moistureData
GreasedRegion landData
int[][] heightCodeData
double landModifier
double heatModifier
double minHeight
double maxHeight
double minHeightActual
double maxHeightActual
double minHeat
double maxHeat
double minWet
double maxWet
double centerLongitude
int zoom
int startX
int startY
int usedWidth
int usedHeight
IntVLA startCacheX
IntVLA startCacheY
int zoomStartX
int zoomStartY
double minHeat0
double maxHeat0
double minHeat1
double maxHeat1
double minWet0
double maxWet0
Noise.Noise3D terrain
Noise.Noise3D heat
Noise.Noise3D moisture
Noise.Noise3D otherRidged
Noise.Noise3D terrainLayered
double[][] xPositions
double[][] yPositions
double[][] zPositions
int[] edges
double minHeat0
double maxHeat0
double minHeat1
double maxHeat1
double minWet0
double maxWet0
Noise.Noise3D terrain
Noise.Noise3D heat
Noise.Noise3D moisture
Noise.Noise3D otherRidged
Noise.Noise3D terrainLayered
double[][] xPositions
double[][] yPositions
double[][] zPositions
int[] edges
double minHeat0
double maxHeat0
double minHeat1
double maxHeat1
double minWet0
double maxWet0
Noise.Noise3D terrain
Noise.Noise3D heat
Noise.Noise3D moisture
Noise.Noise3D otherRidged
Noise.Noise3D terrainLayered
double[][] xPositions
double[][] yPositions
double[][] zPositions
int[] edges
double minHeat0
double maxHeat0
double minHeat1
double maxHeat1
double minWet0
double maxWet0
Noise.Noise3D terrain
Noise.Noise3D heat
Noise.Noise3D moisture
Noise.Noise3D otherRidged
Noise.Noise3D terrainLayered
double[][] xPositions
double[][] yPositions
double[][] zPositions
int[] edges
double alpha
double kappa
double epsilon
double[] Z
double minHeat0
double maxHeat0
double minHeat1
double maxHeat1
double minWet0
double maxWet0
Noise.Maelstrom2D terrain
Noise.Maelstrom2D otherRidged
Noise.InverseLayered2D heat
Noise.InverseLayered2D moisture
Noise.InverseLayered2D terrainLayered
double[][] xPositions
double[][] yPositions
double[][] zPositions
GreasedRegion earth
GreasedRegion shallow
GreasedRegion coast
GreasedRegion earthOriginal
GreasedRegion earth
GreasedRegion shallow
GreasedRegion coast
GreasedRegion earthOriginal
double minHeat0
double maxHeat0
double minHeat1
double maxHeat1
double minWet0
double maxWet0
double[][] xPositions
double[][] yPositions
double[][] zPositions
int[] edges
WorldMapGenerator.SphereMap storedMap
double minHeat0
double maxHeat0
double minHeat1
double maxHeat1
double minWet0
double maxWet0
Noise.Noise3D terrain
Noise.Noise3D heat
Noise.Noise3D moisture
Noise.Noise3D otherRidged
Noise.Noise3D terrainLayered
double[][] xPositions
double[][] yPositions
double[][] zPositions
int[] edges
double minHeat0
double maxHeat0
double minHeat1
double maxHeat1
double minWet0
double maxWet0
Noise.Noise3D terrainRidged
Noise.Noise3D heat
Noise.Noise3D moisture
Noise.Noise3D otherRidged
Noise.Noise3D terrainBasic
double[][] xPositions
double[][] yPositions
double[][] zPositions
int[] edges
double minHeat0
double maxHeat0
double minHeat1
double maxHeat1
double minWet0
double maxWet0
Noise.Noise3D terrain
Noise.Noise3D heat
Noise.Noise3D moisture
Noise.Noise3D otherRidged
Noise.Noise3D terrainLayered
double[][] xPositions
double[][] yPositions
double[][] zPositions
double minHeat0
double maxHeat0
double minHeat1
double maxHeat1
double minWet0
double maxWet0
Noise.Noise4D terrain
Noise.Noise4D terrainRidged
Noise.Noise4D heat
Noise.Noise4D moisture
Noise.Noise4D otherRidged
short[] shorts
java.util.List<E> coords
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException
java.io.IOException
java.lang.Object[] key
int[] value
int mask
boolean containsNullKey
IntVLA order
Arrangement.key
and Arrangement.value
to find
that entry's key and value. The ints in order are always less than or equal to n, and greater than or equal to 0.int n
int maxFill
Arrangement.f
.int size
float f
squidpony.squidmath.Arrangement.MapEntrySet entries
Arrangement.KeySet keys
java.util.Collection<E> values
int defRetValue
CrossHash.IHasher hasher
squidpony.squidmath.Arrangement.MapEntry entry
int width
int height
Coord start
Coord target
AStarSearch.SearchType type
CostlyGraph graph
java.util.ArrayList<E> path
int state
long state
java.lang.Object[] elements
int[] combinationIndices
long remainingCombinations
long totalCombinations
int x
int y
int z
double x
double y
double[] connections
int len
long seed
double effect
float luck
int step
long lastShuffledState
double[] deck
CoordDouble[] points
java.util.ArrayList<E> triangleSoup
CoordDouble a
CoordDouble b
CoordDouble a
CoordDouble b
CoordDouble c
double fairness
double produced
double baseline
IRNG rng
long state
IDistribution.SimpleDistribution distribution
MoonwalkRNG rng
long state
double expected
double offset
double range
double centrality
long centralityCalculated
double rawLatest
java.util.ArrayList<E> path
double[][] lightMap
int width
int height
double threshold
int seed
FastNoise.getSeed()
float frequency
FastNoise.getFrequency()
int interpolation
FastNoise.getInterpolation()
int noiseType
FastNoise.getNoiseType()
int octaves
FastNoise.getFractalOctaves()
float lacunarity
FastNoise.getFractalLacunarity()
float gain
FastNoise.getFractalGain()
int fractalType
FastNoise.getFractalType()
float fractalBounding
int cellularDistanceFunction
FastNoise.getCellularDistanceFunction()
int cellularReturnType
FastNoise.getCellularReturnType()
boolean fractalSpiral
FastNoise.isFractalSpiral()
FastNoise cellularNoiseLookup
float gradientPerturbAmp
FastNoise.getGradientPerturbAmp()
float sharpness
FastNoise.getSharpness()
float mutation
FastNoise.getMutation()
IPointHash pointHash
FastNoise.getPointHash()
long state
long state
long stateA
long stateB
long stateC
long stateD
IRNG rng
java.util.ArrayList<E> elements
int index
long stateA
long stateB
long stateA
long stateB
long[] data
int height
int width
int ySections
long yEndMask
boolean tallied
int ct
int[] counts
int stateA
int stateB
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException
java.io.IOException
int[] key
double[] value
int mask
boolean containsNullKey
IntVLA order
IntDoubleOrderedMap.reorder(int...)
and other methods.int n
int maxFill
IntDoubleOrderedMap.f
.int size
float f
IntDoubleOrderedMap.MapEntrySet entries
IntDoubleOrderedMap.KeySet keys
IntDoubleOrderedMap.ValueCollection values
double defRetValue
IntDoubleOrderedMap.MapEntry entry
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException
java.io.IOException
int[] key
int[] value
int mask
boolean containsNullKey
IntVLA order
IntIntOrderedMap.reorder(int...)
and other methods.int n
int maxFill
IntIntOrderedMap.f
.int size
float f
IntIntOrderedMap.MapEntrySet entries
IntIntOrderedMap.KeySet keys
IntIntOrderedMap.ValueCollection values
int defRetValue
IntIntOrderedMap.MapEntry entry
int size
int[] keyTable
boolean hasZeroValue
float loadFactor
int threshold
int shift
IntSet.place(int)
to bit shift the upper bits of a long
into a usable range (>= 0 and <=
IntSet.mask
). The shift can be negative, which is convenient to match the number of bits in mask: if mask is a 7-bit
number, a shift of -7 shifts the upper 7 bits into the lowest 7 positions. This class sets the shift > 32 and < 64,
which if used with an int will still move the upper bits of an int to the lower bits due to Java's implicit modulus on
shifts.
IntSet.mask
can also be used to mask the low bits of a number, which may be faster for some hashcodes, if
IntSet.place(int)
is overridden.
int mask
IntSet.place(int)
is overriden, this can be used instead of IntSet.shift
to isolate usable bits of a
hash.IntSet.IntSetIterator iterator1
IntSet.IntSetIterator iterator2
int[] items
int size
int count
long[] results
long[] mem
long a
long b
long c
Arrangement<K> keysA
Arrangement<K> keysB
int stateA
int stateB
long state
long state
long state
long[] state
int choice
int bound
int index
int pow4
int halfBits
int leftMask
int rightMask
long key0
long key1
long key2
long key3
long seed
int bits
int resolution
long resSize
long[] mt
int mti
long extra
boolean bitState
long state
long state
long stream
long state
int stateA
int stateB
long stateA
long stateB
IRNG rng
int maxDistance
int minDistance
int width
int height
java.util.ArrayList<E> distribution
int state
long stateA
long stateB
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException
java.io.IOException
java.lang.Object[] key
java.lang.Object[] value
int mask
boolean containsNullKey
IntVLA order
OrderedMap.reorder(int...)
and other methods.int n
int maxFill
OrderedMap.f
.int size
float f
OrderedMap.MapEntrySet entries
OrderedMap.KeySet keys
java.util.Collection<E> values
java.lang.Object defRetValue
CrossHash.IHasher hasher
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException
java.io.IOException
java.lang.Object[] key
int mask
boolean containsNull
IntVLA order
OrderedSet.reorder(int...)
and other methods.int n
int maxFill
OrderedSet.f
.int size
float f
CrossHash.IHasher hasher
int stateA
int stateB
int stateC
java.lang.Object[] elements
int[] permutationIndices
long remainingPermutations
long totalPermutations
long state
int state
Arrangement<K> table
ProbabilityTable.random()
(without additional lookups).java.util.ArrayList<E> extraTable
ProbabilityTable.random()
(looking up values from inside
the nested tables).IntVLA weights
GWTRNG rng
int total
int normalTotal
long state
OrderedMap<K,V> biases
IRNG rng
int distribution
short[] raw
Coord[] coords
boolean dirty
RandomnessSource random
java.util.Random ran
RandomnessSource randomnessSource
long stateA
RomuTrioRNG.nextLong()
will return that value as-is. Later calls will be more random.long stateB
long stateC
short[] items
int size
boolean ordered
long seed
int stateA
int stateB
int dimension
int count
long[][] direction
long[] x
long state
long[] results
int a
int b
int c
int d
int stateA
int stateB
long stateA
long stateB
long stateC
StrangerRNG.nextLong()
and only change for the next call.long stateD
long stateA
long stateB
long state
long stateA
long stateB
long stateC
long stateA
long stateB
long stateC
long stateD
long stateA
long stateB
long centrality
long favor
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException
java.io.IOException
java.lang.Object[] key
java.lang.Object[] value
int mask
boolean containsNullKey
int n
int maxFill
UnorderedMap.f
.int size
float f
squidpony.squidmath.UnorderedMap.MapEntrySet entries
squidpony.squidmath.UnorderedMap.KeySet keys
java.util.Collection<E> values
java.lang.Object defRetValue
CrossHash.IHasher hasher
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException
java.io.IOException
java.lang.Object[] key
int mask
boolean containsNull
int n
int maxFill
UnorderedSet.f
.int size
float f
CrossHash.IHasher hasher
long state
int base
OrderedSet<K> pointSet
squidpony.squidmath.Voronoi.TriangleSoup triangleSoup
java.util.ArrayList<E> polygonSoup
CoordDouble a
CoordDouble b
CoordDouble centroid
CoordDouble[] vertices
CoordDouble a
CoordDouble b
CoordDouble c
CoordDouble centroid
int[] mixed
int size
long stateA
long stateB
long stateC
long stateD
long state0
long state1
int stateA
int stateB
int stateC
int stateD
long stateA
long stateB
long stateC
long stateD
Copyright © Eben Howard 2012–2022. All rights reserved.