-
KFM.DirNavigator.traverse()
-
com.dubture.twig.core.parser.ast.node.TwigModuleDeclaration.traverse()
-
com.fasterxml.jackson.databind.JsonNode.traverse()
Method for constructing a {@link JsonParser} instance foriterating over contents of the tree that this node is root of. Functionally equivalent to first serializing tree using {@link com.fasterxml.jackson.core.ObjectCodec} and then re-parsing butmore efficient.
-
com.fasterxml.jackson.databind.node.BinaryNode.traverse()
-
com.fasterxml.jackson.databind.node.ObjectNode.traverse()
-
com.fasterxml.jackson.databind.node.POJONode.traverse()
-
com.fasterxml.jackson.databind.node.TextNode.traverse()
-
com.linkedin.data.schema.DataSchemaTraverse.traverse()
-
com.opengamma.core.position.impl.DepthFirstPortfolioNodeTraverser.traverse()
Traverse the nodes notifying using the callback.
@param portfolioNode the node to start from, null does nothing
-
com.opengamma.core.position.impl.PortfolioNodeTraverser.traverse()
Traverse the nodes notifying using the callback.
@param portfolioNode the node to start from, null does nothing
-
com.persistit.Exchange.traverse()
Performs generalized tree traversal. The direction value indicates whether to traverse forward or backward in collation sequence, whether to descend to child nodes, and whether the key being sought must be strictly greater than or less then the supplied key.
The direction
value must be one of:
- Key.GT:
- Find the next key that is strictly greater than the supplied key. If there is none, return false.
- Key.GTEQ:
- If the supplied key exists in the database, return that key; otherwise find the next greater key and return it.
- Key.EQ:
- Return
true
iff the specified key exists in the database. Does not update the Key. - Key.LT:
- Find the next key that is strictly less than the supplied key. If there is none, return false.
- Key.LTEQ:
- If the supplied key exists in the database, return that key; otherwise find the next smaller key and return it.
@param direction One of Key.GT, Key.GTEQ, Key.EQ, Key.LT or Key.LTEQ.
@param deep Determines whether the result should represent the next (or previous) physical key in the
Tree
or should be restricted to just the logical siblings of the current key. (See
Logical Key Children and Siblings).
@return
true
if there is a key to traverse to, else
false
.
@throws PersistitException
-
com.redspr.redquerybuilder.core.client.expression.Expression.traverse()
-
com.sun.org.apache.xml.internal.utils.TreeWalker.traverse()
Perform a pre-order traversal non-recursive style. Note that TreeWalker assumes that the subtree is intended to represent a complete (though not necessarily well-formed) document and, during a traversal, startDocument and endDocument will always be issued to the SAX listener.
@param pos Node in the tree where to start traversal
@throws TransformerException
-
com.vaadin.sass.internal.tree.MixinDefNode.traverse()
-
edu.brown.designer.partitioners.BranchAndBoundPartitioner.TraverseThread.traverse()
-
er.extensions.qualifiers.ERXQualifierTraversal.traverse()
Visit every descendent qualifier in the given qualifier tree in a preorder traversal.
@param q the root qualifier to traverse
-
jease.cmf.domain.Node.traverse()
Applies given procedure to node and recursively to all children.
-
org.apache.agila.model.Connection.traverse()
Moves a token to the 'child' or 'bottom' node, setting the state appropriately
@param token
@return
-
org.apache.cayenne.exp.Expression.traverse()
Traverses itself and child expressions, notifying visitor via callback methods as it goes. This is an Expression-specific implementation of the "Visitor" design pattern.
@since 1.1
-
org.apache.cayenne.query.PrefetchTreeNode.traverse()
Traverses the tree depth-first, invoking callback methods of the processor when passing through the nodes.
-
org.apache.felix.ipojo.manipulator.metadata.annotation.model.AnnotationType.traverse()
-
org.apache.jorphan.collections.HashTree.traverse()
Allows any implementation of the HashTreeTraverser interface to easily traverse (depth-first) all the nodes of the HashTree. The Traverser implementation will be given notification of each node visited.
@see HashTreeTraverser
-
org.apache.jorphan.collections.ListedHashTree.traverse()
-
org.apache.poi.ss.util.cellwalk.CellWalk.traverse()
Traverse cell range from top left to bottom right cell.
@param handler handler to call on each appropriate cell
-
org.apache.uima.ruta.ide.parser.ast.RutaModuleDeclaration.traverse()
-
org.apache.xalan.transformer.TreeWalker2Result.traverse()
Perform a pre-order traversal non-recursive style.
@param pos Start node for traversal
@throws TransformerException
-
org.apache.xalan.xpath.xml.TreeWalker.traverse()
Perform a pre-order traversal non-recursive style.
-
org.apache.xml.dtm.ref.DTMTreeWalker.traverse()
Perform a non-recursive pre-order/post-order traversal, operating as a Visitor. startNode (preorder) and endNode (postorder) are invoked for each node as we traverse over them, with the result that the node is written out to m_contentHandler.
@param pos Node in the tree at which to start (and end) traversal --in other words, the root of the subtree to traverse over.
@throws TransformerException
-
org.apache.xml.serializer.TreeWalker.traverse()
Perform a pre-order traversal non-recursive style. Note that TreeWalker assumes that the subtree is intended to represent a complete (though not necessarily well-formed) document and, during a traversal, startDocument and endDocument will always be issued to the SAX listener.
@param pos Node in the tree where to start traversal
@throws TransformerException
-
org.apache.xml.utils.TreeWalker.traverse()
Perform a pre-order traversal non-recursive style. Note that TreeWalker assumes that the subtree is intended to represent a complete (though not necessarily well-formed) document and, during a traversal, startDocument and endDocument will always be issued to the SAX listener.
@param pos Node in the tree where to start traversal
@throws TransformerException
-
org.aspectj.org.eclipse.jdt.internal.compiler.ast.ASTNode.traverse()
-
org.aspectj.org.eclipse.jdt.internal.compiler.ast.ArrayInitializer.traverse()
-
org.aspectj.org.eclipse.jdt.internal.compiler.ast.CompilationUnitDeclaration.traverse()
-
org.aspectj.org.eclipse.jdt.internal.compiler.ast.ExplicitConstructorCall.traverse()
-
org.aspectj.org.eclipse.jdt.internal.compiler.ast.FieldDeclaration.traverse()
-
org.aspectj.org.eclipse.jdt.internal.compiler.ast.Initializer.traverse()
-
org.aspectj.org.eclipse.jdt.internal.compiler.ast.MethodDeclaration.traverse()
-
org.aspectj.org.eclipse.jdt.internal.compiler.ast.Statement.traverse()
-
org.aspectj.org.eclipse.jdt.internal.compiler.ast.TypeReference.traverse()
-
org.aspectj.weaver.patterns.Pointcut.traverse()
-
org.broadinstitute.gatk.engine.traversals.TraversalEngine.traverse()
this method must be implemented by all traversal engines
@param walker the walker to run with
@param dataProvider the data provider that generates data given the shard
@param sum the accumulator
@return an object of the reduce type
-
org.eclipse.dltk.ast.ASTNode.traverse()
-
org.eclipse.dltk.ast.declarations.MethodDeclaration.traverse()
-
org.eclipse.dltk.ast.declarations.ModuleDeclaration.traverse()
-
org.eclipse.dltk.ast.expressions.Expression.traverse()
-
org.eclipse.dltk.ast.statements.Statement.traverse()
-
org.eclipse.jdt.internal.compiler.ast.ASTNode.traverse()
-
org.eclipse.jdt.internal.compiler.ast.AbstractMethodDeclaration.traverse()
-
org.eclipse.jdt.internal.compiler.ast.ArrayInitializer.traverse()
-
org.eclipse.jdt.internal.compiler.ast.CompilationUnitDeclaration.traverse()
-
org.eclipse.jdt.internal.compiler.ast.ExplicitConstructorCall.traverse()
-
org.eclipse.jdt.internal.compiler.ast.Expression.traverse()
Traverse an expression in the context of a blockScope
@param visitor
@param scope
-
org.eclipse.jdt.internal.compiler.ast.FieldDeclaration.traverse()
-
org.eclipse.jdt.internal.compiler.ast.Initializer.traverse()
-
org.eclipse.jdt.internal.compiler.ast.MethodDeclaration.traverse()
-
org.eclipse.jdt.internal.compiler.ast.NameReference.traverse()
-
org.eclipse.jdt.internal.compiler.ast.Statement.traverse()
-
org.eclipse.jdt.internal.compiler.ast.TypeDeclaration.traverse()
Iteration for a package member type
-
org.eclipse.jdt.internal.compiler.ast.TypeReference.traverse()
-
org.eclipse.php.internal.core.compiler.ast.nodes.PHPMethodDeclaration.traverse()
-
org.eclipse.php.internal.core.compiler.ast.nodes.PHPModuleDeclaration.traverse()
-
org.eclipse.swt.widgets.Control.traverse()
Performs a platform traversal action corresponding to a
KeyDown
event.
Valid traversal values are SWT.TRAVERSE_NONE
, SWT.TRAVERSE_MNEMONIC
, SWT.TRAVERSE_ESCAPE
, SWT.TRAVERSE_RETURN
, SWT.TRAVERSE_TAB_NEXT
, SWT.TRAVERSE_TAB_PREVIOUS
, SWT.TRAVERSE_ARROW_NEXT
, SWT.TRAVERSE_ARROW_PREVIOUS
, SWT.TRAVERSE_PAGE_NEXT
and SWT.TRAVERSE_PAGE_PREVIOUS
. If traversal
is SWT.TRAVERSE_NONE
then the Traverse event is created with standard values based on the KeyDown event. If traversal
is one of the other traversal constants then the Traverse event is created with this detail, and its doit
is taken from the KeyDown event.
@param traversal the type of traversal, or
SWT.TRAVERSE_NONE
to computethis from
event
@param event the KeyDown event
@return
true
if the traversal succeeded
@exception IllegalArgumentException
- ERROR_NULL_ARGUMENT if the event is null
@exception SWTException
- ERROR_WIDGET_DISPOSED - if the receiver has been disposed
- ERROR_THREAD_INVALID_ACCESS - if not called from the thread that created the receiver
@since 3.6
-
org.eclipse.swt.widgets.Shell.traverse()
-
org.eclipse.wst.wsi.internal.core.wsdl.traversal.WSDLTraversal.traverse()
The method traverses given WSDL extensibility element according to the settings in the traversal context.
@param objExtensibilityElement a WSDL extensibility element artifact.
@param parent parent of the WSDL extensibility element artifact.
@param ctx the traversal contex.
-
org.encog.ml.tree.traverse.DepthFirstTraversal.traverse()
{@inheritDoc}
-
org.geotools.graph.traverse.GraphTraversal.traverse()
Starts or resumes a traversal over the components of a graph.
-
org.geotools.graph.traverse.basic.BasicGraphTraversal.traverse()
Upon each iteration of the traversal, a component is returned from the iterator and passed to the visitor. The traversal interprets the return codes from the walker and performs the following actions.
Code | Action Performed | CONTINUE | The traversal instructs the iterator to continue and starts the next stage of iteration. |
SUSPEND | The traversal instructs the iterator to continue but does not start the next stage of iteration, returning from traverse(). |
KILL_BRANCH | The traversal instructs the iterator to kill the current branch and starts the next stage of iteration. |
STOP | The traversal does not instruct the iterator to continue and does not start the next of iteration, returning from traverse() |
@see GraphTraversal#traverse()
-
org.internna.iwebmvc.core.validation.annotation.BeanConstraint.traverse()
-
org.internna.iwebmvc.core.validation.annotation.CollectionConstraint.traverse()
-
org.jrdf.graph.global.molecule.MoleculeTraverser.traverse()
-
org.jrdf.graph.global.molecule.mem.MoleculeTraverserImpl.traverse()
-
org.jsoup.select.NodeTraversor.traverse()
-
org.neo4j.graphdb.Node.traverse()
Instantiates a traverser that will start at this node and traverse according to the given order and evaluators along the specified relationship type and direction. If the traverser should traverse more than one RelationshipType
/Direction
pair, use one of the overloaded variants of this method. The created traverser will iterate over each node that can be reached from this node by the spanning tree formed by the given relationship types (with direction) exactly once. For more information about traversal, see the {@link Traverser}documentation.
@param traversalOrder the traversal order
@param stopEvaluator an evaluator instructing the new traverser aboutwhen to stop traversing, either a predefined evaluator such as {@link StopEvaluator#END_OF_GRAPH} or a custom-writtenevaluator
@param returnableEvaluator an evaluator instructing the new traverserabout whether a specific node should be returned from the traversal, either a predefined evaluator such as {@link ReturnableEvaluator#ALL} or a customer-writtenevaluator
@param relationshipType the relationship type that the traverser willtraverse along
@param direction the direction in which the relationships of typerelationshipType
will be traversed
@return a new traverser, configured as above
-
org.neo4j.graphdb.traversal.TraversalDescription.traverse()
Traverse from {@code startNode} based on all the rules and behaviorin this description. A {@link Traverser} is returned which isused to step through the graph and getting results back. The traversal is not guaranteed to start before the Traverser is used.
@param startNode the {@link Node} to start the traversal from.
@return a {@link Traverser} used to step through the graph and to getresults from.
-
org.neo4j.rest.graphdb.traversal.RestTraversal.traverse()
-
org.opentripplanner.routing.edgetype.LegSwitchingEdge.traverse()
-
org.opentripplanner.routing.graph.Edge.traverse()
Traverse this edge.
@param s0 The State coming into the edge.
@return The State upon exiting the edge.
-
org.picocontainer.PicoVisitor.traverse()
Entry point for the PicoVisitor traversal. The given node is the first object, that is asked for acceptance. Only objects of type {@link PicoContainer}, {@link ComponentAdapter}, or {@link Parameter} are valid.
@param node the start node of the traversal.
@return a visitor-specific value.
@throws IllegalArgumentException in case of an argument of invalid type.
@since 1.1
-
org.picocontainer.defaults.VerifyingVisitor.traverse()
Traverse through all components of the {@link PicoContainer} hierarchy and verify thecomponents.
@throws PicoVerificationException if some components could not be verified.
@see org.picocontainer.PicoVisitor#traverse(java.lang.Object)
-
org.python.pydev.parser.jython.ast.VisitorBase.traverse()
-
org.rascalmpl.interpreter.TraversalEvaluator.traverse()
-
org.uengine.processpublisher.graph.SwimLaneCoordinate.traverse()