Uses of Class
squidpony.squidmath.IntVLA

Packages that use IntVLA 
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.

  • Uses of IntVLA in squidpony

    Fields in squidpony with type parameters of type IntVLA 
    Modifier and Type Field Description
    static StringConvert<IntVLA> Converters.convertIntVLA  
    ArrayList<IntVLA> MarkovObject.processed
    Complicated data that mixes probabilities and the indices of items in MarkovObject.body, generated during the latest call to MarkovObject.analyze(Iterable).
    ArrayList<IntVLA> MarkovObject.raw  

  • Uses of IntVLA in squidpony.squidai

    Fields in squidpony.squidai declared as IntVLA 
    Modifier and Type Field Description
    protected IntVLA CustomDijkstraMap.fresh  
    protected IntVLA DijkstraMap.fresh
    Goals that pathfinding will seek out.
    protected IntVLA CustomDijkstraMap.goals  
    protected IntVLA DijkstraMap.goals
    Goals that pathfinding will seek out.
    IntVLA CustomDijkstraMap.path
    The latest path that was obtained by calling findPath().
    Methods in squidpony.squidai that return IntVLA 
    Modifier and Type Method Description
    IntVLA CustomDijkstraMap.findFleePath​(int length, double preferLongerPaths, IntVLA impassable, IntVLA onlyPassable, int start, int... fearSources)
    Scans the dungeon using CustomDijkstraMap.scan with the listed fearSources and start point, and returns a list of Coord positions (using Manhattan distance) needed to get further from the closest fearSources, meant for running away.
    IntVLA CustomDijkstraMap.findFleePath​(int length, int scanLimit, double preferLongerPaths, IntVLA impassable, IntVLA onlyPassable, int start, int... fearSources)
    Scans the dungeon using CustomDijkstraMap.scan with the listed fearSources and start point, and returns a list of Coord positions (using Manhattan distance) needed to get further from the closest fearSources, meant for running away.
    IntVLA CustomDijkstraMap.findFleePathLarge​(int size, int length, int scanLimit, int preferLongerPaths, IntVLA impassable, IntVLA onlyPassable, int start, int... fearSources)
    Scans the dungeon using CustomDijkstraMap.scanLarge with the listed fearSources and start point, and returns a list of Coord positions (using Manhattan distance) needed to get further from the closest fearSources, meant for running away.
    IntVLA CustomDijkstraMap.findFleePathLarge​(int size, int length, int preferLongerPaths, IntVLA impassable, IntVLA onlyPassable, int start, int... fearSources)
    Scans the dungeon using CustomDijkstraMap.scanLarge with the listed fearSources and start point, and returns a list of Coord positions (using Manhattan distance) needed to get further from the closest fearSources, meant for running away.
    IntVLA CustomDijkstraMap.findPath​(int length, int scanLimit, IntVLA impassable, IntVLA onlyPassable, int start, int... targets)
    Scans the dungeon using CustomDijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
    IntVLA CustomDijkstraMap.findPath​(int length, IntVLA impassable, IntVLA onlyPassable, int start, int... targets)
    Scans the dungeon using CustomDijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
    IntVLA CustomDijkstraMap.findPathLarge​(int size, int length, int scanLimit, IntVLA impassable, IntVLA onlyPassable, int start, int... targets)
    Scans the dungeon using CustomDijkstraMap.scanLarge with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
    IntVLA CustomDijkstraMap.findPathLarge​(int size, int length, IntVLA impassable, IntVLA onlyPassable, int start, int... targets)
    Scans the dungeon using CustomDijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
    IntVLA GreasedZOI.nearestInfluences​(Coord point)
    This can be given a Coord to check in the results of the latest calculate() call.
    IntVLA GreasedZOI.nearestInfluences​(GreasedRegion[] zones, Coord point)
    Given the zones resulting from this class' GreasedZOI.calculate() method and a Coord to check, finds the indices of all influencing groups in zones that have the Coord in their area, and returns all such indices as an IntVLA.
    Methods in squidpony.squidai with parameters of type IntVLA 
    Modifier and Type Method Description
    IntVLA CustomDijkstraMap.findFleePath​(int length, double preferLongerPaths, IntVLA impassable, IntVLA onlyPassable, int start, int... fearSources)
    Scans the dungeon using CustomDijkstraMap.scan with the listed fearSources and start point, and returns a list of Coord positions (using Manhattan distance) needed to get further from the closest fearSources, meant for running away.
    IntVLA CustomDijkstraMap.findFleePath​(int length, int scanLimit, double preferLongerPaths, IntVLA impassable, IntVLA onlyPassable, int start, int... fearSources)
    Scans the dungeon using CustomDijkstraMap.scan with the listed fearSources and start point, and returns a list of Coord positions (using Manhattan distance) needed to get further from the closest fearSources, meant for running away.
    IntVLA CustomDijkstraMap.findFleePathLarge​(int size, int length, int scanLimit, int preferLongerPaths, IntVLA impassable, IntVLA onlyPassable, int start, int... fearSources)
    Scans the dungeon using CustomDijkstraMap.scanLarge with the listed fearSources and start point, and returns a list of Coord positions (using Manhattan distance) needed to get further from the closest fearSources, meant for running away.
    IntVLA CustomDijkstraMap.findFleePathLarge​(int size, int length, int preferLongerPaths, IntVLA impassable, IntVLA onlyPassable, int start, int... fearSources)
    Scans the dungeon using CustomDijkstraMap.scanLarge with the listed fearSources and start point, and returns a list of Coord positions (using Manhattan distance) needed to get further from the closest fearSources, meant for running away.
    IntVLA CustomDijkstraMap.findPath​(int length, int scanLimit, IntVLA impassable, IntVLA onlyPassable, int start, int... targets)
    Scans the dungeon using CustomDijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
    IntVLA CustomDijkstraMap.findPath​(int length, IntVLA impassable, IntVLA onlyPassable, int start, int... targets)
    Scans the dungeon using CustomDijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
    IntVLA CustomDijkstraMap.findPathLarge​(int size, int length, int scanLimit, IntVLA impassable, IntVLA onlyPassable, int start, int... targets)
    Scans the dungeon using CustomDijkstraMap.scanLarge with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
    IntVLA CustomDijkstraMap.findPathLarge​(int size, int length, IntVLA impassable, IntVLA onlyPassable, int start, int... targets)
    Scans the dungeon using CustomDijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
    double[] CustomDijkstraMap.partialScan​(int limit, IntVLA impassable)
    Recalculate the CustomDijkstra map up to a limit and return it.
    double[] CustomDijkstraMap.partialScanLarge​(int size, int limit, IntVLA impassable)
    Recalculate the CustomDijkstra map, up to a limit, for a creature that is potentially larger than 1x1 cell and return it.
    double[] CustomDijkstraMap.partialScanToStart​(int limit, int start, IntVLA impassable)
    Recalculate the CustomDijkstra map up to a limit, stopping early if it has a path from a goal to start, and return that map.
    double[] CustomDijkstraMap.partialScanToStartLarge​(int size, int limit, int start, IntVLA impassable)
    Recalculate the CustomDijkstra map, up to a limit, for a creature that is potentially larger than 1x1 cell, stopping early if a path is found between a goal and start, and return that map.
    double[] CustomDijkstraMap.scan​(IntVLA impassable)
    Recalculate the CustomDijkstra map and return it.
    double[] CustomDijkstraMap.scanLarge​(int size, IntVLA impassable)
    Recalculate the CustomDijkstra map for a creature that is potentially larger than 1x1 cell and return it.
    double[] CustomDijkstraMap.scanToStart​(int start, IntVLA impassable)
    Recalculate the CustomDijkstra map, stopping early if it has a path from a goal to start, and return that map.
    double[] CustomDijkstraMap.scanToStartLarge​(int size, int start, IntVLA impassable)
    Recalculate the CustomDijkstra map for a creature that is potentially larger than 1x1 cell and return it.

  • Uses of IntVLA in squidpony.squidgrid

    Methods in squidpony.squidgrid with parameters of type IntVLA 
    Modifier and Type Method Description
    void Adjacency.BasicAdjacency.putAllVariants​(IntVLA list, double[] map, int key, double value, int size)  
    void Adjacency.putAllVariants​(IntVLA list, double[] map, int key, double value)  
    abstract void Adjacency.putAllVariants​(IntVLA list, double[] map, int key, double value, int size)  
    void Adjacency.RotationAdjacency.putAllVariants​(IntVLA list, double[] map, int key, double value, int size)  

  • Uses of IntVLA in squidpony.squidgrid.mapping

    Fields in squidpony.squidgrid.mapping declared as IntVLA 
    Modifier and Type Field Description
    protected IntVLA MixedGenerator.points  
    protected IntVLA WorldMapGenerator.startCacheX  
    protected IntVLA WorldMapGenerator.startCacheY  
    Fields in squidpony.squidgrid.mapping with type parameters of type IntVLA 
    Modifier and Type Field Description
    protected ArrayList<IntVLA> SectionMap.connections  
    Methods in squidpony.squidgrid.mapping that return IntVLA 
    Modifier and Type Method Description
    IntVLA SectionMap.nameToConnections​(String name)
    Gets the list of connected sections (by their identifying numbers) given a name of a section.
    IntVLA SectionMap.numberToConnections​(int number)
    Gets the list of connected sections (by their identifying numbers) given an identifying number of a section.
    IntVLA SectionMap.positionToConnections​(int x, int y)
    Gets the list of connected sections (by their identifying numbers) given a position inside that section.
    IntVLA SectionMap.positionToConnections​(Coord position)
    Gets the list of connected sections (by their identifying numbers) given a position inside that section.

  • Uses of IntVLA in squidpony.squidmath

    Fields in squidpony.squidmath declared as IntVLA 
    Modifier and Type Field Description
    protected IntVLA Arrangement.order
    The ordering of entries, with the nth entry in order being the index into Arrangement.key and Arrangement.value to find that entry's key and value.
    protected IntVLA IntDoubleOrderedMap.order
    An IntVLA (variable-length int sequence) that stores the positions in the key array of specific keys, with the positions in insertion order.
    protected IntVLA IntIntOrderedMap.order
    An IntVLA (variable-length int sequence) that stores the positions in the key array of specific keys, with the positions in insertion order.
    protected IntVLA OrderedMap.order
    An IntVLA (variable-length int sequence) that stores the positions in the key array of specific keys, with the positions in insertion order.
    protected IntVLA OrderedSet.order
    An IntVLA (variable-length int sequence) that stores the positions in the key array of specific keys, with the positions in insertion order.
    IntVLA ProbabilityTable.weights  
    Methods in squidpony.squidmath that return IntVLA 
    Modifier and Type Method Description
    IntVLA IntSet.appendInto​(IntVLA array)
    Appends to an existing (non-null) IntVLA with all the int items in this IntSet.
    IntVLA IndexedDelaunayTriangulator.computeTriangles​(double[] polygon, boolean sorted)  
    IntVLA IndexedDelaunayTriangulator.computeTriangles​(double[] points, int offset, int count, boolean sorted)
    Triangulates the given point cloud to a list of triangle indices that make up the Delaunay triangulation.
    IntVLA IntVLA.copy()  
    static IntVLA IntVLA.deserializeFromString​(String data)  
    IntVLA Arrangement.getMany​(Iterable<? extends K> keys)  
    IntVLA IntIntOrderedMap.getMany​(int... keys)  
    IntVLA Dice.independentRolls​(int n, int sides)
    Get a list of the independent results of n rolls of dice with the given number of sides.
    IntVLA IntVLA.reorder​(int... ordering)
    Given an array or varargs of replacement indices for the values of this IntVLA, reorders this so the first item in the returned version is the same as get(ordering[0]) (with some care taken for negative or too-large indices), the second item in the returned version is the same as get(ordering[1]), etc.
    IntVLA IntVLA.shuffle​(IRNG random)
    Shuffles this IntVLA in place using the given IRNG.
    IntVLA IntSet.IntSetIterator.toArray()
    Returns a new array containing the remaining keys.
    IntVLA IntSet.IntSetIterator.toArray​(IntVLA array)  
    IntVLA Arrangement.valuesAsIntVLA()  
    IntVLA IntIntOrderedMap.valuesAsList()  
    static IntVLA IntVLA.with​(int... array)  
    Methods in squidpony.squidmath with parameters of type IntVLA 
    Modifier and Type Method Description
    void IntSet.addAll​(IntVLA array)  
    void IntSet.addAll​(IntVLA array, int offset, int length)  
    void IntVLA.addAll​(IntVLA array)  
    void IntVLA.addAll​(IntVLA array, int offset, int length)  
    IntVLA IntSet.appendInto​(IntVLA array)
    Appends to an existing (non-null) IntVLA with all the int items in this IntSet.
    OrderedSet<K> Arrangement.keysAt​(IntVLA positions)  
    boolean IntVLA.removeAll​(IntVLA array)
    Removes from this array all of elements contained in the specified array.
    static <T> void TimSort.sort​(T[] a, IntVLA order, int lo, int hi, Comparator<? super T> c)
    Modifies order by comparing items from index lo inclusive to index hi exclusive in the array a with the Comparator c; not likely to be used externally except by code that extends or re-implements SquidLib data structures.
    static <T> void TimSort.sort​(T[] a, IntVLA order, Comparator<? super T> c)
    Modifies order by comparing items in the array a with the Comparator c; not likely to be used externally except by code that extends or re-implements SquidLib data structures.
    IntVLA IntSet.IntSetIterator.toArray​(IntVLA array)  
    void IndexedDelaunayTriangulator.trim​(IntVLA triangles, double[] points, double[] hull, int offset, int count)
    Removes all triangles with a centroid outside the specified hull, which may be concave.
    static IntSet IntSet.with​(IntVLA array)  
    Constructors in squidpony.squidmath with parameters of type IntVLA 
    Constructor Description
    IntIntOrderedMap​(IntVLA keyColl, IntVLA valueColl)
    Creates a new OrderedMap using the elements of two parallel arrays.
    IntIntOrderedMap​(IntVLA keyColl, IntVLA valueColl, float f)
    Creates a new OrderedMap using the elements of two parallel arrays.
    IntVLA​(IntVLA array)
    Creates a new array containing the elements in the specific array.