Uses of Interface
java.lang.Iterable

Packages that use Iterable
de.cau.cs.kieler.core.math Mathematics classes and functions. 
de.cau.cs.kieler.core.util General purpose utility classes in the style of java.util
de.cau.cs.kieler.kiml.service.formats KIML support for graph formats. 
de.cau.cs.kieler.klay.force.graph Basic structures for the force layouter. 
de.cau.cs.kieler.klay.layered.graph Basic structures for the layered layouter. 
de.cau.cs.kieler.klay.layered.p5edges Phase 5 - edge routing and horizontal node placement. 
de.cau.cs.kieler.sim.kiem.config.data This package contains the data storing classes for all managers. 
de.cau.cs.kieler.sj.util Package with short and fast data structures used by SJ. 
java.util Utilities 
lejos.nxt Access to NXT sensors, motors, etc. 
lejos.robotics Hardware abstraction interfaces for the robotics package. 
lejos.robotics.proposal Support for maps 
 

Uses of Iterable in de.cau.cs.kieler.core.math
 

Classes in de.cau.cs.kieler.core.math that implement Iterable
 class KVectorChain
          A chain of vectors.
 

Uses of Iterable in de.cau.cs.kieler.core.util
 

Classes in de.cau.cs.kieler.core.util that implement Iterable
static class FilteredIterator.Iterable<E>
          An iterable that creates a filtered iterator as iterator.
 class ProxyIterable<T>
          A class for creating iterable instances to a given iterator.
 

Uses of Iterable in de.cau.cs.kieler.kiml.service.formats
 

Methods in de.cau.cs.kieler.kiml.service.formats that return Iterable
 Iterable<String> TransformationData.getMessages()
          Returns the reported log messages.
 

Uses of Iterable in de.cau.cs.kieler.klay.force.graph
 

Methods in de.cau.cs.kieler.klay.force.graph that return Iterable
 Iterable<FParticle> FGraph.getParticles()
          Returns a list of all particles occurring in the graph: vertices, labels, and bend points.
 

Uses of Iterable in de.cau.cs.kieler.klay.layered.graph
 

Classes in de.cau.cs.kieler.klay.layered.graph that implement Iterable
 class Layer
          A layer in a layered graph.
 class LayeredGraph
          A layered graph has a set of layers that contain the nodes, as well as a list of nodes that are not yet assigned to a layer.
 

Methods in de.cau.cs.kieler.klay.layered.graph that return Iterable
 Iterable<LEdge> LNode.getConnectedEdges()
          Returns an iterable for all connected edges, both incoming and outgoing.
 Iterable<LEdge> LPort.getConnectedEdges()
          Returns an iterable over all connected edges, both incoming and outgoing.
 Iterable<LPort> LPort.getConnectedPorts()
          Returns an iterable over all connected ports, both predecessors and successors.
 Iterable<LEdge> LNode.getIncomingEdges()
          Returns an iterable for all inomcing edges.
 Iterable<LEdge> LNode.getOutgoingEdges()
          Returns an iterable for all outgoing edges.
 Iterable<LPort> LNode.getPorts(PortSide side)
          Returns an iterable for all ports of given side.
 Iterable<LPort> LNode.getPorts(PortType portType)
          Returns an iterable for all ports of given type.
 Iterable<LPort> LNode.getPorts(PortType portType, PortSide side)
          Returns an iterable for all ports of a given type and side.
 Iterable<LPort> LPort.getPredecessorPorts()
          Returns an iterable over all the port's predecessor ports.
 Iterable<LPort> LPort.getSuccessorPorts()
          Returns an iterable over all the port's successor ports.
 

Uses of Iterable in de.cau.cs.kieler.klay.layered.p5edges
 

Methods in de.cau.cs.kieler.klay.layered.p5edges with parameters of type Iterable
 int OrthogonalRoutingGenerator.routeEdges(LayeredGraph layeredGraph, Iterable<LNode> sourceLayerNodes, int sourceLayerIndex, Iterable<LNode> targetLayerNodes, double startPos)
          Route edges between the given layers.
 int OrthogonalRoutingGenerator.routeEdges(LayeredGraph layeredGraph, Iterable<LNode> sourceLayerNodes, int sourceLayerIndex, Iterable<LNode> targetLayerNodes, double startPos)
          Route edges between the given layers.
 

Uses of Iterable in de.cau.cs.kieler.sim.kiem.config.data
 

Classes in de.cau.cs.kieler.sim.kiem.config.data that implement Iterable
 class MostRecentCollection<T>
           This implements a collection that can update according to most recent use.
 

Uses of Iterable in de.cau.cs.kieler.sj.util
 

Classes in de.cau.cs.kieler.sj.util that implement Iterable
 class AbstractCollection<T>
          A AbstactCollection as a basic implementation for lists, queues and more.
 class PriorityQueue<T extends Comparable<T>>
          A simple PriorityQueue how we need them for SJ.
 

Uses of Iterable in java.util
 

Subinterfaces of Iterable in java.util
 interface Collection<E>
           
 interface List<E>
           
 

Classes in java.util that implement Iterable
 class AbstractSequentialList<E>
           
 class ArrayList<E>
          An expandable array.
 class LinkedList<E>
           
 

Uses of Iterable in lejos.nxt
 

Classes in lejos.nxt that implement Iterable
 class VM.VMClasses
          Provide access to a series of class records
 class VM.VMConstants
          This class allows access to all of the constant values.
static class VM.VMElements
           
static class VM.VMExceptions
          Class to provide access to a series of exception records
 class VM.VMFields
           
static class VM.VMItems<E>
          This class provides the ability to iterate through a series of in memory structures and returns a Java accessible clone of the structure.
 class VM.VMMethods
          Provide access to a series of method records
 class VM.VMStackFrames
           
static class VM.VMStaticFields
          This class can be used to gain access to all of the static fields.
 class VM.VMThreads
          Provide access to a series of internal thread records
 

Uses of Iterable in lejos.robotics
 

Classes in lejos.robotics that implement Iterable
 class RangeReadings
          Represents a set of range readings.
 

Uses of Iterable in lejos.robotics.proposal
 

Classes in lejos.robotics.proposal that implement Iterable
 class MapPathFinder
          PathFinder that takes a map and a dummy set of range readings.
 class SimplePathFinder
          Very simple path finder that assumes there is a direct route to the target