Package | Description |
---|---|
squidpony |
Utilities that don't fit elsewhere in SquidLib; mostly text manipulation, compression, and helper code.
|
squidpony.squidai |
Tools for finding paths, optimizing targets for area-of-effect (AOE) abilities, and evaluating influence on a grid.
|
squidpony.squidgrid |
Tools for working with data on a grid, including LOS and FOV; overlaps with geometry code in squidpony.squidmath .
|
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 |
---|---|
OrderedSet<java.lang.String> |
MonsterGen.Chimera.powerAdjectives |
OrderedSet<java.lang.String> |
MonsterGen.Chimera.powerPhrases |
OrderedSet<java.lang.String> |
MonsterGen.Chimera.unsaidAdjectives |
OrderedSet<java.lang.String> |
MonsterGen.Chimera.wholeAdjectives |
Modifier and Type | Method and Description |
---|---|
OrderedSet<java.lang.String> |
ObText.keyOrderedSet()
Gets all unique Strings from the top level of this ObText, not including any associated values, and puts them in
an
OrderedSet of String. |
static <T> OrderedSet<T> |
Maker.makeOS(T... elements)
Makes an OrderedSet (OS) of T given an array or vararg of T elements.
|
static <T> OrderedSet<T> |
Maker.makeOS(T element)
Makes an OrderedSet of T given a single T element; avoids creating an array for varargs as
Maker.makeOS(Object[]) would do, but only allows one item. |
Modifier and Type | Method and Description |
---|---|
static <K> StringConvert<OrderedSet<K>> |
Converters.convertOrderedSet(java.lang.CharSequence type) |
static <K> StringConvert<OrderedSet<K>> |
Converters.convertOrderedSet(java.lang.Class<K> type) |
static <K> StringConvert<OrderedSet<K>> |
Converters.convertOrderedSet(StringConvert<K> convert) |
Modifier and Type | Method and Description |
---|---|
OrderedSet<Coord> |
WaypointPathfinder.getWaypoints() |
Modifier and Type | Method and Description |
---|---|
OrderedSet<Coord> |
Radius.expand(int distance,
int width,
int height,
java.lang.Iterable<Coord> points)
Given an Iterable of Coord (such as a List or Set), a distance to expand outward by (using this Radius), and the
bounding height and width of the map, gets a "thickened" group of Coord as a Set where each Coord in points has
been expanded out by an amount no greater than distance.
|
OrderedSet<I> |
SpatialMap.identities()
Get a Set of all identities used for values in this data structure, returning a OrderedSet (defensively
copying the key set used internally) for its stable iteration order.
|
OrderedSet<Coord> |
Radius.perimeter(Coord center,
int radiusLength,
boolean surpassEdges,
int width,
int height) |
OrderedSet<Coord> |
SpatialMap.positions()
Get a Set of all positions used for values in this data structure, returning a OrderedSet (defensively copying
the key set used internally) for its stable iteration order.
|
Modifier and Type | Method and Description |
---|---|
static OrderedSet<Coord> |
MixedGenerator.basicPoints(int width,
int height,
IRNG rng)
Mainly for internal use; this is used by
MixedGenerator(int, int, IRNG) to get its room positions. |
OrderedSet<OrderedSet<Coord>> |
Placement.getAlongStraightWalls()
Gets an OrderedSet of OrderedSet of Coord, where each inner OrderedSet of Coord refers to a placement
region along a straight wall with length 3 or more, not including corners.
|
OrderedSet<OrderedSet<Coord>> |
Placement.getCenters()
Gets an OrderedSet of OrderedSet of Coord, where each inner OrderedSet of Coord refers to a room's cells
that are furthest from the walls, and each Coord is one of those central positions.
|
OrderedSet<OrderedSet<Coord>> |
Placement.getCorners()
Gets an OrderedSet of OrderedSet of Coord, where each inner OrderedSet of Coord refers to a room's
corners, and each Coord is one of those corners.
|
OrderedSet<Coord> |
Placement.getHidingPlaces(Radius radiusStrategy,
int range)
Gets an OrderedSet of Coord, where each Coord is hidden (using the given radiusStrategy and range for FOV
calculations) from any doorways or similar narrow choke-points where a character might be easily ambushed.
|
protected OrderedSet<Coord> |
DungeonGenerator.removeAdjacent(OrderedSet<Coord> coll,
Coord pt) |
protected OrderedSet<Coord> |
SectionDungeonGenerator.removeAdjacent(OrderedSet<Coord> coll,
Coord pt) |
protected OrderedSet<Coord> |
DungeonGenerator.removeAdjacent(OrderedSet<Coord> coll,
Coord pt1,
Coord pt2) |
protected OrderedSet<Coord> |
SectionDungeonGenerator.removeAdjacent(OrderedSet<Coord> coll,
Coord pt1,
Coord pt2) |
protected OrderedSet<Coord> |
SectionDungeonGenerator.removeNearby(OrderedSet<Coord> coll,
char[][] disallowed) |
protected OrderedSet<Coord> |
DungeonGenerator.viableDoorways(boolean doubleDoors,
char[][] map) |
protected OrderedSet<Coord> |
SectionDungeonGenerator.viableDoorways(boolean doubleDoors,
char[][] map,
char[][] allCaves,
char[][] allCorridors) |
Modifier and Type | Method and Description |
---|---|
OrderedSet<OrderedSet<Coord>> |
Placement.getAlongStraightWalls()
Gets an OrderedSet of OrderedSet of Coord, where each inner OrderedSet of Coord refers to a placement
region along a straight wall with length 3 or more, not including corners.
|
OrderedSet<OrderedSet<Coord>> |
Placement.getCenters()
Gets an OrderedSet of OrderedSet of Coord, where each inner OrderedSet of Coord refers to a room's cells
that are furthest from the walls, and each Coord is one of those central positions.
|
OrderedSet<OrderedSet<Coord>> |
Placement.getCorners()
Gets an OrderedSet of OrderedSet of Coord, where each inner OrderedSet of Coord refers to a room's
corners, and each Coord is one of those corners.
|
Modifier and Type | Method and Description |
---|---|
protected OrderedSet<Coord> |
DungeonGenerator.removeAdjacent(OrderedSet<Coord> coll,
Coord pt) |
protected OrderedSet<Coord> |
SectionDungeonGenerator.removeAdjacent(OrderedSet<Coord> coll,
Coord pt) |
protected OrderedSet<Coord> |
DungeonGenerator.removeAdjacent(OrderedSet<Coord> coll,
Coord pt1,
Coord pt2) |
protected OrderedSet<Coord> |
SectionDungeonGenerator.removeAdjacent(OrderedSet<Coord> coll,
Coord pt1,
Coord pt2) |
protected OrderedSet<Coord> |
SectionDungeonGenerator.removeNearby(OrderedSet<Coord> coll,
char[][] disallowed) |
protected static OrderedMap<Coord,java.util.List<Coord>> |
SymmetryDungeonGenerator.setToMap(OrderedSet<Coord> sequence) |
Constructor and Description |
---|
SymmetryDungeonGenerator(int width,
int height,
IRNG rng,
OrderedSet<Coord> sequence)
This prepares a map generator that will generate a map with the given width and height, using the given RNG.
|
Modifier and Type | Class and Description |
---|---|
class |
EnumOrderedSet<K extends java.lang.Enum<?>>
A simple Set of Enum items (which are already unique if used in a normal Set) that keeps insertion order.
|
Modifier and Type | Method and Description |
---|---|
static OrderedSet<short[]> |
CoordPacker.findManyPacked(int x,
int y,
java.util.Collection<short[]> packed)
Quickly determines if an x,y position is true or false in one of the given packed arrays, without unpacking them,
and returns a List of all packed arrays that contain the position.
|
static OrderedSet<short[]> |
CoordPacker.findManyPacked(int x,
int y,
short[]... packed)
Quickly determines if an x,y position is true or false in one of the given packed arrays, without unpacking them,
and returns a List of all packed arrays that contain the position.
|
OrderedSet<A> |
K2.getOrderedSetA()
Returns a separate (shallow) copy of the set of A keys as an
OrderedSet . |
OrderedSet<A> |
K2V1.getOrderedSetA()
Returns a separate (shallow) copy of the set of A keys as an
OrderedSet . |
OrderedSet<B> |
K2.getOrderedSetB()
Returns a separate (shallow) copy of the set of B keys as an
OrderedSet . |
OrderedSet<B> |
K2V1.getOrderedSetB()
Returns a separate (shallow) copy of the set of B keys as an
OrderedSet . |
OrderedSet<CoordDouble> |
Voronoi.getPointSet()
Returns the point set in form of a vector of 2D vectors.
|
OrderedSet<T> |
ProbabilityTable.items()
Provides a set of the items in this table, without reference to their
weight.
|
OrderedSet<K> |
Arrangement.keysAsOrderedSet() |
OrderedSet<java.lang.Integer> |
IntDoubleOrderedMap.keysAsOrderedSet() |
OrderedSet<java.lang.Integer> |
IntIntOrderedMap.keysAsOrderedSet() |
OrderedSet<K> |
OrderedMap.keysAsOrderedSet() |
OrderedSet<K> |
Arrangement.keysAt(int... positions) |
OrderedSet<K> |
Arrangement.keysAt(IntVLA positions) |
OrderedSet<short[]> |
RegionMap.regionsContaining(int x,
int y)
Gets a List of all regions containing a given x,y point.
|
OrderedSet<K> |
OrderedSet.reorder(int... ordering)
Given an array or varargs of replacement indices for this OrderedSet'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. |
static OrderedSet<Coord> |
PoissonDisk.sampleCircle(Coord center,
float radius,
float minimumDistance,
int maxX,
int maxY)
Get a list of Coords, each randomly positioned around the given center out to the given radius (measured with
Euclidean distance, so a true circle), but with the given minimum distance from any other Coord in the list.
|
static OrderedSet<Coord> |
PoissonDisk.sampleCircle(Coord center,
float radius,
float minimumDistance,
int maxX,
int maxY,
int pointsPerIteration,
IRNG rng)
Get a list of Coords, each randomly positioned around the given center out to the given radius (measured with
Euclidean distance, so a true circle), but with the given minimum distance from any other Coord in the list.
|
static OrderedSet<Coord> |
PoissonDisk.sampleMap(char[][] map,
float minimumDistance,
IRNG rng,
java.lang.Character... blocking) |
static OrderedSet<Coord> |
PoissonDisk.sampleMap(Coord minPosition,
Coord maxPosition,
char[][] map,
float minimumDistance,
IRNG rng,
java.lang.Character... blocking) |
static OrderedSet<Coord> |
PoissonDisk.sampleRectangle(Coord minPosition,
Coord maxPosition,
float minimumDistance,
int maxX,
int maxY)
Get a list of Coords, each randomly positioned within the rectangle between the given minPosition and
maxPosition, but with the given minimum distance from any other Coord in the list.
|
static OrderedSet<Coord> |
PoissonDisk.sampleRectangle(Coord minPosition,
Coord maxPosition,
float minimumDistance,
int maxX,
int maxY,
int pointsPerIteration,
IRNG rng)
Get a list of Coords, each randomly positioned within the rectangle between the given minPosition and
maxPosition, but with the given minimum distance from any other Coord in the list.
|
OrderedSet<K> |
OrderedSet.shuffle(IRNG rng)
Randomly alters the iteration order for this OrderedSet using the given IRNG to shuffle.
|
static OrderedSet<GreasedRegion> |
GreasedRegion.whichContain(int x,
int y,
java.util.Collection<GreasedRegion> packed) |
static OrderedSet<GreasedRegion> |
GreasedRegion.whichContain(int x,
int y,
GreasedRegion... packed) |
Constructor and Description |
---|
Voronoi(OrderedSet<CoordDouble> pointSet)
Constructs a new triangulator instance using the specified point set.
|
Copyright © Eben Howard 2012–2022. All rights reserved.