Uses of Interface
org.ascape.model.space.Node

Packages that use Node
edu.brook   
edu.brook.sugarscape   
name.milesparker.epi   
name.milesparker.epi.plague   
name.milesparker.epi.region   
name.milesparker.markets   
org.ascape.model   
org.ascape.model.space   
org.eclipse.amp.amf.examples.escape   
org.eclipse.amp.examples.heatbugs   
org.metaabm.examples.stupid1   
org.metaabm.examples.stupid2   
org.metaabm.examples.stupid3   
org.metaabm.examples.stupid5   
org.metaabm.gen.test   
 

Uses of Node in edu.brook
 

Classes in edu.brook that implement Node
 class DemographicPrisonersDilemma
          Demographic Prisoner_s Dilemma Java Implementation.
 class DemographicPrisonersDilemma3D
          Demographic Prisoner_s Dilemma Java Implementation.
 class PlayCell
          Play Cell Java Implementation.
 class Player
          Player Java Implementation.
 

Uses of Node in edu.brook.sugarscape
 

Classes in edu.brook.sugarscape that implement Node
 class GAS_Base
          G A S_ Base Java Implementation.
 class SugarAgent
          Sugar Agent Java Implementation.
 class SugarCell
          Sugar Cell Java Implementation.
 

Uses of Node in name.milesparker.epi
 

Classes in name.milesparker.epi that implement Node
 class Epidemic
          Epidemic Java Implementation.
 class Epidemic3D
          Epidemic Java Implementation.
 class Epidemic3DTiles
          Demonstrates how to define custom 3D and color providers.
 class Individual
          Individual Java Implementation.
 class Place
          Place Java Implementation.
 

Uses of Node in name.milesparker.epi.plague
 

Classes in name.milesparker.epi.plague that implement Node
 class Flea
          Flea Java Implementation.
 class Rat
          Rat Java Implementation.
 

Uses of Node in name.milesparker.epi.region
 

Classes in name.milesparker.epi.region that implement Node
 class City
          City Java Implementation.
 class City3D
          City Java Implementation.
 class EpidemicPeriods
           
 class Region
          Region Java Implementation.
 class Region3D
          Region Java Implementation.
 class RegionalLocation
          Regional Location Java Implementation.
 

Uses of Node in name.milesparker.markets
 

Classes in name.milesparker.markets that implement Node
 class Firm
          Firm Java Implementation.
 class Instrument
          Instrument Java Implementation.
 class Markets
          Markets Java Implementation.
 class Markets3D
          Markets Java Implementation.
 class Trader
          Trader Java Implementation.
 

Uses of Node in org.ascape.model
 

Classes in org.ascape.model that implement Node
 class Cell
          The base class for all members of lattices.
 class CellOccupant
          An occupant of a cell within a lattice.
 class HostCell
          An cell capable fo serving as a 'home' for agents.
 class Scape
          The base class for all collections of agents within ascape.
 

Methods in org.ascape.model that return Node
 Node CellOccupant.findRandomAvailableNeighbor()
           
 Node Cell.findRandomAvailableNeighbor()
           
 Node CellOccupant.findRandomNeighbor()
           
 Node Cell.findRandomNeighbor()
          Returns a cell randomly selected from among this cell's neighbors.
 Node HostCell.getOccupant()
          Return the occupant of this cell, null if no occupant.
 Node Cell.getOccupant()
          Returns any occupants of this cell.
 

Methods in org.ascape.model with parameters of type Node
 void HostCell.setOccupant(Node occupant)
          Host the supplied occupant.
 void Cell.setOccupant(Node occupant)
          Sets this cell's occupant.
 

Uses of Node in org.ascape.model.space
 

Subinterfaces of Node in org.ascape.model.space
 interface NodeOccupant
          The Interface NodeOccupant.
 

Classes in org.ascape.model.space that implement Node
 class DefaultNode
          The Class DefaultNode.
 

Fields in org.ascape.model.space declared as Node
protected  Node[][] Array2DBase.cells
          The actual 2D array of agents.
 

Methods in org.ascape.model.space that return Node
 Node ListBase.findCellAway(Node origin, Node target)
          Returns the cell within immediate neighborhood furthest away from the requested cell.
 Node Graph.findCellAway(Node origin, Node target)
          Returns the next cell within immediate neighborhood furthest away from the requested cell.
abstract  Node Discrete.findCellAway(Node origin, Node target)
          Returns the cell within immediate neighborhood furthest away from the requestd cell.
 Node Array2DVonNeumann.findCellAway(Node originCell, Node targetCell)
          Returns the cell within immediate neighborhood furthest away from the requestd cell.
 Node Array2DBase.findCellAway(Node originCell, Node targetCell)
          Returns the cell within immediate neighborhood furthest away from the requestd cell.
protected  Node Discrete.findCellAwayBFS(Node origin, Node target)
          Find cell away BFS.
 Node[] Array2DBase.findCells(Conditional condition)
          Finds cells within the space that meet some condition.
 Node[] Array2DBase.findCells(Conditional condition, int _x, int _y, int width, int height)
          Finds cells within the specified space that meet some condition.
 Node ListBase.findCellToward(Node origin, Node target)
          Returns the next cell within immediate neighborhood toward the requested cell.
 Node Graph.findCellToward(Node origin, Node target)
          Returns the next cell within immediate neighborhood toward the requested cell.
abstract  Node Discrete.findCellToward(Node origin, Node target)
          Returns the next cell within immediate neighborhood toward the requested cell.
 Node Array2DVonNeumann.findCellToward(Node originCell, Node targetCell)
          Returns the next cell within immediate neighborhood toward the requested cell.
 Node Array2DBase.findCellToward(Node originCell, Node targetCell)
          Returns the next cell within immediate neighborhood toward the requested cell.
protected  Node Discrete.findCellTowardBFS(Node origin, Node target)
          Find cell toward BFS.
 Node ListBase.findFirstMatchInRank(Coordinate origin, Conditional condition, int rank)
          Returns a random element in the supplied rank that matches the supplied condition, null if no matches.
 Node Discrete.findRandomAvailable()
           
 Node Discrete.findRandomAvailable(Conditional condition)
           
 Node Node.findRandomAvailableNeighbor()
          Find random neighbor.
 Node DefaultNode.findRandomAvailableNeighbor()
           
 Node Node.findRandomNeighbor()
          Find random neighbor.
 Node DefaultNode.findRandomNeighbor()
           
 Node Array2DBase.findRandomUnoccupied(int x, int y, int width, int height)
          Returns a random unoccupied discrete location in the space given with the lattice.
 Node Discrete.findRandomUnoccupiedCell()
          Deprecated.  
 Node Discrete.findRandomUnoccupiedCell(Node excludeCell)
          Returns a random unoccupied discrete location in the space.
 Node ListBase.get(CoordinateDiscrete coordinate)
          Returns the agents at the specified index.
 Node Array2DBase.get(int xPosition, int yPosition)
          Returns the cell existing at the specified integer coordinates.
 Node[] Discrete.getCells()
          Returns all agents in the space as an array of cells (use this method to avoid coercion of members to Node.)
 Node[] Array1D.getCells()
          Returns all agents in the space as an array of cells (use this method to avoid coercion of memebers to Node.)
 Node[] Discrete.getCellsNearDefault(Node origin, boolean includeSelf, int distance)
          Deprecated.  
 Node[] Array2DBase.getCellsNearVonNeumannLineOfSight(Node origin, boolean includeSelf, int distance)
          Deprecated.  
 Node[] Array2DBase.getCellsNearVonNeumannMovement(Node origin, boolean includeSelf, int distance)
          Deprecated.  
 Node Node.getOccupant()
          Gets the occupant.
 Node DefaultNode.getOccupant()
           
 Node ListBase.set(int index, Location o, boolean isParent)
          Sets the agent at the specified coordinate to the supplied agent.
 

Methods in org.ascape.model.space with parameters of type Node
 void Graph.addNeighbor(Node source, Node target)
          Adds a neighbor (the target) to the source's list of neighbors.
 boolean Graph.addNeighbor(Node source, Node target, boolean directed)
          Adds a neighbor (the target) to the source's list of neighbors.
 boolean Graph.addNeighborSafe(Node source, Node target, boolean directed)
          Adds a neighbor (the target) to the source's list of neighbors.
 java.util.List Graph.calculateNeighbors(Node cell)
           
 java.util.List Discrete.calculateNeighbors(Node cell)
          Calculate neighbors.
 java.util.List Array2DSmallWorld.calculateNeighbors(Node cell)
           
 java.util.List Array2DEuclidian.calculateNeighbors(Node cell)
           
 void Graph.clearNeighbors(Node source)
          Clears the source agent's list of neighbors.
 Node ListBase.findCellAway(Node origin, Node target)
          Returns the cell within immediate neighborhood furthest away from the requested cell.
 Node Graph.findCellAway(Node origin, Node target)
          Returns the next cell within immediate neighborhood furthest away from the requested cell.
abstract  Node Discrete.findCellAway(Node origin, Node target)
          Returns the cell within immediate neighborhood furthest away from the requestd cell.
 Node Array2DVonNeumann.findCellAway(Node originCell, Node targetCell)
          Returns the cell within immediate neighborhood furthest away from the requestd cell.
 Node Array2DBase.findCellAway(Node originCell, Node targetCell)
          Returns the cell within immediate neighborhood furthest away from the requestd cell.
protected  Node Discrete.findCellAwayBFS(Node origin, Node target)
          Find cell away BFS.
 Node ListBase.findCellToward(Node origin, Node target)
          Returns the next cell within immediate neighborhood toward the requested cell.
 Node Graph.findCellToward(Node origin, Node target)
          Returns the next cell within immediate neighborhood toward the requested cell.
abstract  Node Discrete.findCellToward(Node origin, Node target)
          Returns the next cell within immediate neighborhood toward the requested cell.
 Node Array2DVonNeumann.findCellToward(Node originCell, Node targetCell)
          Returns the next cell within immediate neighborhood toward the requested cell.
 Node Array2DBase.findCellToward(Node originCell, Node targetCell)
          Returns the next cell within immediate neighborhood toward the requested cell.
protected  Node Discrete.findCellTowardBFS(Node origin, Node target)
          Find cell toward BFS.
 java.util.List Graph.findNeighbors(Node location)
           
 java.util.List Discrete.findNeighbors(Node location)
           
 Location Array2DBase.findRandom(Node cell, int x, int y, int width, int height)
          Returns a random unoccupied discrete location in the space given with the lattice.
 Location Discrete.findRandomAvailable(Node origin, Conditional condition, boolean includeSelf, double distance)
           
 Location Discrete.findRandomAvailableNeighbor(Node location)
           
 Location Discrete.findRandomNeighbor(Node location)
           
 Location Discrete.findRandomNeighbor(Node location, Conditional condition)
           
 Location Array2DBase.findRandomRelative(Node cell, int x, int y, int width, int height)
          Returns a random unoccupied discrete location in the space given with the lattice.
 Node Discrete.findRandomUnoccupiedCell(Node excludeCell)
          Returns a random unoccupied discrete location in the space.
 Node[] Discrete.getCellsNearDefault(Node origin, boolean includeSelf, int distance)
          Deprecated.  
 Node[] Array2DBase.getCellsNearVonNeumannLineOfSight(Node origin, boolean includeSelf, int distance)
          Deprecated.  
 Node[] Array2DBase.getCellsNearVonNeumannMovement(Node origin, boolean includeSelf, int distance)
          Deprecated.  
 int Discrete.getDistance(Node origin, Node target)
          Deprecated. use calculateDistance instead.
 java.util.List Graph.getNeighborsFor(Node agent)
          Gets the agent's list of neighbors.
 boolean Graph.isNeighbor(Node source, Node target)
          Returns whether target is a neighbor of source.
 java.util.Iterator Graph.neighborIterator(Node source)
          Return an iterator of the agent source's neighbors.
 boolean Graph.removeNeighbor(Node source, Node target)
          Remove agent b from a's list of neighbors.
 void Array.replace(Node currentCell, Node newCell)
          Changes the agent at the foirmer cells location to the supplied cell.
 void Graph.replaceNeighbor(Node agent, Node newNeighbor, boolean directed)
          Replaces the agent's list of neighbors with new neighbor.
 void Graph.setNeighborsFor(Node agent, java.util.List neighbors)
          Sets the agent's list of neighbors.
 void Node.setOccupant(Node occupant)
          Sets the occupant.
 void DefaultNode.setOccupant(Node occupant)
           
 void Array.swap(Node one, Node two)
          Swaps two cells in the graph.
 void BFSWithinIterator2DSmallWorld.visit(Node candidate)
           
 void BFSWithinIterator.visit(Node candidate)
          Visit.
 

Uses of Node in org.eclipse.amp.amf.examples.escape
 

Classes in org.eclipse.amp.amf.examples.escape that implement Node
 class Block
          Block Java Implementation.
 class WikiExample
          WikiExample Java Implementation.
 class WikiExample3D
          WikiExample Java Implementation.
 

Uses of Node in org.eclipse.amp.examples.heatbugs
 

Classes in org.eclipse.amp.examples.heatbugs that implement Node
 class HeatBug
          Heat Bug Java Implementation.
 class Heatbugs
          Heatbugs Java Implementation.
 class Heatbugs3D
          Heatbugs Java Implementation.
 class Heatbugs3DCustom
           
 class HeatCell
          Heat Cell Java Implementation.
 

Uses of Node in org.metaabm.examples.stupid1
 

Classes in org.metaabm.examples.stupid1 that implement Node
 class Bug
          Bug Java Implementation.
 class Habitat
          Habitat Java Implementation.
 class StupidModel1
          StupidModel1 Java Implementation.
 class StupidModel13D
          StupidModel1 Java Implementation.
 

Uses of Node in org.metaabm.examples.stupid2
 

Classes in org.metaabm.examples.stupid2 that implement Node
 class StupidModel2
          Stupid Model 2 Java Implementation.
 class StupidModel23D
          Stupid Model 2 Java Implementation.
 

Uses of Node in org.metaabm.examples.stupid3
 

Classes in org.metaabm.examples.stupid3 that implement Node
 class StupidModel3
          Stupid Model 3 Java Implementation.
 class StupidModel33D
          Stupid Model 3 Java Implementation.
 

Uses of Node in org.metaabm.examples.stupid5
 

Classes in org.metaabm.examples.stupid5 that implement Node
 class StupidModel5
          Stupid Model 5 Java Implementation.
 class StupidModel53D
          Stupid Model 5 Java Implementation.
 

Uses of Node in org.metaabm.gen.test
 

Classes in org.metaabm.gen.test that implement Node
 class BasicCell
           
 class BasicModel
           
 class BasicMovementAgent
           
 class BasicMovementModel
           
 class BasicMovementStateAgent
           
 class ComplexLocation
           
 class ComplexMovementAgent
           
 class MethodsAgent
           
 class OperationsAgent
           
 class SpatialModel
           
 class StateAgent