Uses of Interface
net.walend.collection.HasState

Packages that use HasState

net.walend.collection	This package contains a few additions and utilities for the java.util collections kit.
net.walend.collection.test
net.walend.digraph	This package contains a kit for working with directed graphs.
net.walend.digraph.path	This package contains a kit for working with paths on directed graphs.
net.walend.digraph.test
net.walend.grid	Grids are Collections built on multidimensional arrays.
net.walend.grid.test
net.walend.measured	This package contains a kit for working with measured paths on directed graphs.
net.walend.measured.test	This package contains a kit for testing measuring paths.

Uses of HasState in net.walend.collection

Subinterfaces of HasState in net.walend.collection

interface

Bag Bag is an interface for Collections that are just simple Collections.

Classes in net.walend.collection that implement HasState

class	ImmutableBag An implementation of the Bag interface that wraps another Bag and throws UnsupportedOperationExceptions in all the mutators.
class	MapBag An implementation of the Bag interface based on a Map.

Methods in net.walend.collection with parameters of type HasState

boolean	MapBag.sameStateAs(HasState victim) If two HasStates have the same internal state, return true.
boolean	HasState.sameStateAs(HasState victim) If two HasStates have the same internal state, return true.
boolean	ImmutableBag.sameStateAs(HasState victim) If two HasStates have the same internal state, return true.

Uses of HasState in net.walend.collection.test

Methods in net.walend.collection.test with parameters of type HasState

void	BagTest.testSameStateAs(HasState bag, HasState otherBag, boolean expected)
void	BagTest.testSameStateAs(HasState bag, HasState otherBag, boolean expected)
void	BagTest.testGetPrincipleInterface(HasState object, java.lang.Class expected)
void	SerializationTest.testSerializable(HasState victem)

Uses of HasState in net.walend.digraph

Subinterfaces of HasState in net.walend.digraph

interface	CEDigraph CEDigraph is an interface for representing directed graphs of nodes linked by zero or one edge.
interface	Digraph Digraph is a superinterface for representing directed graphs.
interface	GEDigraph GEDigraph is an interface for representing directed graphs of nodes linked by zero or one edge.
interface	IndexedCEDigraph CEDigraph methods that use indices.
interface	IndexedDigraph IndexedDigraph adds index methods to a Digraph.
interface	IndexedGEDigraph GEDigraph methods that use indices.
interface	IndexedMutableCEDigraph Indexed mutators
interface	IndexedMutableGEDigraph Indexed mutators
interface	MutableCEDigraph MutableCEDigraph adds mutators to the CEDigraph interface so that a developer can add and remove edges and nodes.
interface	MutableGEDigraph MutableGEDigraph adds mutators to the GEDigraph interface so that a developer can add and remove edges and nodes.
interface	MutableUEDigraph MutableUEDigraph adds mutators to the UEDigraph interface so that a developer can add and remove edges and nodes.
interface	UEDigraph UEDigraph is an interface for representing directed graphs of nodes linked by zero or one edge.

Classes in net.walend.digraph that implement HasState

class	AbstractHashCEDigraph This abstract class implements the CEDigraph interface using a Map and a Set.
class	AbstractHashGEDigraph This abstract class implements the GEDigraph interface using two HashSets.
class	AbstractHashUEDigraph This abstract class implements the UEDigraph interface using three HashMaps.
class	AbstractLMCEDigraph An extension of AbstractMatrixCEDigraph that keeps an additional int[][] that shows what nodes can be reached from what other nodes.
class	AbstractLMGEDigraph An extension of AbstractMatrixGEDigraph that keeps an additional int[][] that shows what nodes can be reached from what other nodes.
class	AbstractMatrixCEDigraph This abstract class implements the CEDigraph interface using a Map and a Set.
class	AbstractMatrixGEDigraph A GEDigraph backed by an ArrayList of nodes and a boolean[][] matrix that stores edges.
class	AbstractMatrixUEDigraph This abstract class implements the UEDigraph interface using a List and a Grid.
class	HashCEDigraph This class implements the CEDigraph interface using a Map and a Set.
class	HashGEDigraph This class implements the GEDigraph interface using two HashMaps.
class	HashUEDigraph This class implements the UEDigraph interface using three HashMaps.
class	LMCEDigraph This class implements the CEDigraph interface using a Matrix and an array to speed up some indexed operations.
class	LMGEDigraph This class implements the GEDigraph interface using an ArrayList and a boolean matrix and keeps an additional int[][] that shows what nodes can be reached from what other nodes.
class	MatrixCEDigraph This class implements the CEDigraph interface using a Matrix.
class	MatrixGEDigraph This class implements the GEDigraph interface using an ArrayList and a boolean matrix.
class	MatrixUEDigraph This class implements the UEDigraph interface using a List and a Grid.
class	MutableHashCEDigraph
class	MutableHashGEDigraph
class	MutableHashUEDigraph
class	MutableLMCEDigraph
class	MutableLMGEDigraph This class implements the GEDigraph interface using an ArrayList and a boolean matrix and keeps an additional int[][] that shows what nodes can be reached from what other nodes.
class	MutableMatrixCEDigraph
class	MutableMatrixGEDigraph A MutableGEDigraph backed by an ArrayList of nodes and a boolean[][] matrix of edges.
class	MutableMatrixUEDigraph

Methods in net.walend.digraph with parameters of type HasState

boolean	AbstractHashGEDigraph.sameStateAs(HasState victim)
boolean	AbstractMatrixCEDigraph.sameStateAs(HasState victim)
boolean	AbstractMatrixUEDigraph.sameStateAs(HasState victim)
boolean	AbstractHashCEDigraph.sameStateAs(HasState victim)
boolean	AbstractHashUEDigraph.sameStateAs(HasState victim)
boolean	AbstractMatrixGEDigraph.sameStateAs(HasState victim) If two HasStates have the same internal state, return true.

Uses of HasState in net.walend.digraph.path

Subinterfaces of HasState in net.walend.digraph.path

interface	CEPath CEPath is an interface for represtenting paths through CEDigraph.
interface	DigraphOfCEPaths DigraphOfCEPaths is a CEDigraph containing the nodes from a base digraph and edges that are paths through the base digraph between these nodes.
interface	DigraphOfGEPaths DigraphOfGEPaths is a CEDigraph containing the nodes from a base digraph and edges that are paths through the base digraph between these nodes.
interface	GEPath GEPath is an interface for represtenting paths through GEDigraph.
interface	MutableCEPath MutableCEPath is an interface for represtenting mutable paths through CEDigraph.
interface	MutableDigraphOfCEPaths This class contains mutator methods for a DigraphOfCEPaths.
interface	MutableDigraphOfGEPaths This class contains mutator methods for a DigraphOfCEPaths.
interface	MutableGEPath MutableGEPath is an interface for represtenting mutable paths through GEDigraph.
interface	MutableUEPath MutableUEPath is an interface for represtenting mutable paths through UEDigraph.
interface	Path Path is an interface for representing paths through Digraphs.
interface	UEPath UEPath is an interface for represtenting paths through UEDigraph.

Classes in net.walend.digraph.path that implement HasState

class	AbstractDelegateDigraphOfCEPaths This class implements the DigraphOfCEPaths by delegating to an underlying IndexedMutableCEDigraph.
protected static class	AbstractDelegateDigraphOfCEPaths.DigraphCEPath
class	AbstractDelegateDigraphOfGEPaths This class implements the DigraphOfGEPaths by delegating to an underlying IndexedMutableCEDigraph.
protected static class	AbstractDelegateDigraphOfGEPaths.DigraphGEPath
class	AbstractListCEPath This abstract class implements the CEPath interface using a List of nodes and a List of Edges.
class	AbstractListGEPath This abstract class implements the GEPath interface using a List of nodes.
class	AbstractListUEPath This abstract class implements the UEPath interface using a List of nodes and a List of Edges.
class	ListCEPath This class implements the CEPath interface using two lists.
class	ListGEPath This class implements the GEPath interface using two lists.
class	ListUEPath This class implements the UEPath interface using two lists.
class	MutableListCEPath This class implements the MutableCEPath interface using two lists.
class	MutableListGEPath This class implements the MutableGEPath interface using a list.
class	MutableListUEPath This class implements the MutableUEPath interface using two lists.

Methods in net.walend.digraph.path with parameters of type HasState

boolean	AbstractDelegateDigraphOfCEPaths.sameStateAs(HasState victim)
boolean	AbstractDelegateDigraphOfCEPaths.DigraphCEPath.sameStateAs(HasState victim)
boolean	AbstractDelegateDigraphOfGEPaths.sameStateAs(HasState victim)
boolean	AbstractDelegateDigraphOfGEPaths.DigraphGEPath.sameStateAs(HasState victim)
boolean	AbstractListCEPath.sameStateAs(HasState victim)
boolean	AbstractListGEPath.sameStateAs(HasState victim)
boolean	AbstractListUEPath.sameStateAs(HasState victim)

Uses of HasState in net.walend.digraph.test

Classes in net.walend.digraph.test that implement HasState

class

TestBean An object for testing Digraphs

Methods in net.walend.digraph.test with parameters of type HasState

boolean

TestBean.sameStateAs(HasState victim)

Uses of HasState in net.walend.grid

Subinterfaces of HasState in net.walend.grid

interface	Grid Grid is a Collection implanted in a multidimensional array.
interface	Grid2D Grid2D is a simple two-dimensional Grid, indexed by (i,j).
interface	MutableGrid MutableGrid adds methods to change Grids.
interface	MutableGrid2D Grid2D is a simple two-dimensional Grid, indexed by (i,j).

Classes in net.walend.grid that implement HasState

class	AbstractArrayGrid2D Grid2D is a simple two-dimensional Grid.
class	AbstractMapGrid2D Grid2D is a simple two-dimensional Grid built atop a Map.
class	ArrayGrid2D Grid2D is a simple two-dimensional Grid.
class	MapGrid2D Grid2D is a simple two-dimensional Grid.
class	MutableArrayGrid2D MutableGrid2D is a simple two-dimensional Grid that you can put and take.
class	MutableMapGrid2D MutableGrid2D is a simple two-dimensional Grid that you can put and take.

Methods in net.walend.grid with parameters of type HasState

boolean	AbstractArrayGrid2D.sameStateAs(HasState victim) If two HasStates have the same internal state, return true.
boolean	AbstractMapGrid2D.sameStateAs(HasState victim) If two HasStates have the same internal state, return true.

Uses of HasState in net.walend.grid.test

Methods in net.walend.grid.test with parameters of type HasState

void	AbstractArrayGrid2DTest.testSameStateAs(Grid2D grid1, HasState ob, boolean expected)
void	AbstractMapGrid2DTest.testSameStateAs(Grid2D grid1, HasState ob, boolean expected)

Uses of HasState in net.walend.measured

Subinterfaces of HasState in net.walend.measured

interface	MeasuredCEPath
interface	MeasuredGEPath
interface	ShortestCEDistances This interface describes methods to find the shortest distances on a CE digraph.
interface	ShortestCEPaths This interface is a DigraphOfCEPaths that contains the shortest paths in available in the base digraph as measured by a PathMeter.
interface	ShortestGEDistances This interface describes methods to find the shortest distances on a GE digraph.
interface	ShortestGEPaths This interface is a DigraphOfGEPaths that contains the shortest paths in available in the base digraph as measured by a PathMeter.

Classes in net.walend.measured that implement HasState

class	AbstractShortestCEDistances AbstractShortestCEDistances contains a 2D array of distances between nodes in a directed graph.
class	AbstractShortestCEPaths AbstractShortestCEPaths is a CEDigraph containing the nodes from the base digraph and edges that are the shortest paths between some pairs of nodes.
private class	AbstractShortestCEPaths.DigraphMeasuredCEPath
class	AbstractShortestGEDistances AbstractShortestGEDistances contains a 2D array of distances between nodes in a directed graph.
class	AbstractShortestGEPaths AbstractShortestGEPaths is a CEDigraph containing the nodes from the base digraph and edges that are the shortest paths between some pairs of nodes.
private class	AbstractShortestGEPaths.DigraphMeasuredGEPath
class	CEBellmanFordTest Performs the Bellman-Ford test for a given digraph and pathmeter.
private static class	CEBellmanFordTest.BFCEDigraph This is simply a wrapper of a CEDigraph that has a BFNode and BFEdges from that node to all nodes.
class	CEPathsFromShortestDistances CEPathsFromShortestDistances wraps a ShortestCEDistances object to provide a full ShortestCEPaths interface.
private class	CEPathsFromShortestDistances.DigraphMeasuredCEPath
class	DijkstraShortestCEDistances DijkstraShortestCEDistances is an abstract class that holds Dijkstra's algorithm.
class	DijkstraShortestCEPaths DijkstraShortestCEPaths is an abstract class that contains Dijkstra's algorithm for shortest paths, plus supporting code for solutions with nodes must go inside a hash table.
class	DijkstraShortestGEDistances DijkstraShortestGEDistances is an abstract class that holds Dijkstra's algorithm.
class	DijkstraShortestGEPaths DijkstraShortestGEPaths is an abstract class that contains Dijkstra's algorithm for shortest paths, plus supporting code for solutions with nodes must go inside a hash table.
class	FloydWarshallShortestCEDistances FloydWarshallShortestCEDistances uses the very simple Floyd-Warshall algorithm to find the shortest distances.
class	FloydWarshallShortestCEPaths FloydWarshallShortestCEPaths uses the very simple Floyd-Warshall algorithm to find the shortest paths.
class	FloydWarshallShortestGEDistances FloydWarshallShortestGEDistances uses the very simple Floyd-Warshall algorithm to find the shortest distances.
class	FloydWarshallShortestGEPaths FloydWarshallShortestGEPaths uses the very simple Floyd-Warshall algorithm to find the shortest paths.
class	GEBellmanFordTest Performs the Bellman-Ford test for a given digraph and pathmeter.
private static class	GEBellmanFordTest.BFGEDigraph This is simply a wrapper of a GEDigraph that has a BFNode and BFEdges from that node to all nodes.
class	JITShortestCEDistances JITShortestCEDistances is an implementation of ShortestCEDistances that uses Dijkstra's algorithm to find the shortest distances just in time.
class	JITShortestCEPaths JITShortestCEPaths is an implementation of ShortestCEPaths that uses Dijkstra's algorithm to find the shortest paths just in time.
class	JITShortestGEDistances JITShortestGEDistances is an implementation of ShortestGEDistances that uses Dijkstra's algorithm to find the shortest distances just in time.
class	JITShortestGEPaths JITShortestGEPaths is an implementation of ShortestGEPaths that uses Dijkstra's algorithm to find the shortest paths just in time.
class	JohnsonShortestCEDistances JohnsonShortestCEDistances uses Johnson's algorithm to find the shortest distances during construction.
class	JohnsonShortestCEPaths JohnsonShortestCEPaths uses Johnson's algorithm to find the shortest paths during construction.
class	JohnsonShortestGEDistances JohnsonShortestGEDistances uses Johnson's algorithm to find the shortest distances during construction.
class	JohnsonShortestGEPaths JohnsonShortestGEPaths uses Johnson's algorithm to find the shortest paths during construction.

Methods in net.walend.measured with parameters of type HasState

boolean	AbstractShortestCEPaths.sameStateAs(HasState victim)
boolean	AbstractShortestCEPaths.DigraphMeasuredCEPath.sameStateAs(HasState victim)
boolean	GEBellmanFordTest.BFGEDigraph.sameStateAs(HasState victim)
boolean	CEPathsFromShortestDistances.sameStateAs(HasState victim)
boolean	CEPathsFromShortestDistances.DigraphMeasuredCEPath.sameStateAs(HasState victim)
boolean	CEBellmanFordTest.BFCEDigraph.sameStateAs(HasState victim)
boolean	AbstractShortestCEDistances.sameStateAs(HasState victim)
boolean	AbstractShortestGEPaths.sameStateAs(HasState victim)
boolean	AbstractShortestGEPaths.DigraphMeasuredGEPath.sameStateAs(HasState victim)
boolean	AbstractShortestGEDistances.sameStateAs(HasState victim)

Uses of HasState in net.walend.measured.test

Methods in net.walend.measured.test with parameters of type HasState

void	ShortestCEPathTest.testSerializable(HasState ob)