| /external/guava/guava/src/com/google/common/graph/ |
| D | AbstractDirectedNetworkConnections.java | 110 N previousNode = inEdgeMap.remove(edge);
111 return checkNotNull(previousNode);
116 N previousNode = outEdgeMap.remove(edge);
117 return checkNotNull(previousNode);
125 N previousNode = inEdgeMap.put(edge, node);
126 checkState(previousNode == null);
131 N previousNode = outEdgeMap.put(edge, node);
132 checkState(previousNode == null);
|
| D | AbstractUndirectedNetworkConnections.java | 81 N previousNode = incidentEdgeMap.remove(edge); in removeOutEdge() local
82 return checkNotNull(previousNode); in removeOutEdge()
94 N previousNode = incidentEdgeMap.put(edge, node); in addOutEdge() local
95 checkState(previousNode == null); in addOutEdge()
|
| D | Graphs.java | 102 Graph<N> graph, Map<Object, NodeVisitState> visitedNodes, N node, @Nullable N previousNode) { in subgraphHasCycle() argument
113 if (canTraverseWithoutReusingEdge(graph, nextNode, previousNode) in subgraphHasCycle()
129 Graph<?> graph, Object nextNode, @Nullable Object previousNode) { in canTraverseWithoutReusingEdge() argument
130 if (graph.isDirected() || !Objects.equal(previousNode, nextNode)) { in canTraverseWithoutReusingEdge()
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | AbstractDirectedNetworkConnections.java | 110 N previousNode = inEdgeMap.remove(edge);
111 return checkNotNull(previousNode);
116 N previousNode = outEdgeMap.remove(edge);
117 return checkNotNull(previousNode);
125 N previousNode = inEdgeMap.put(edge, node);
126 checkState(previousNode == null);
131 N previousNode = outEdgeMap.put(edge, node);
132 checkState(previousNode == null);
|
| D | AbstractUndirectedNetworkConnections.java | 81 N previousNode = incidentEdgeMap.remove(edge); in removeOutEdge() local
82 return checkNotNull(previousNode); in removeOutEdge()
94 N previousNode = incidentEdgeMap.put(edge, node); in addOutEdge() local
95 checkState(previousNode == null); in addOutEdge()
|
| D | Graphs.java | 104 @NullableDecl N previousNode) { in subgraphHasCycle() argument
115 if (canTraverseWithoutReusingEdge(graph, nextNode, previousNode) in subgraphHasCycle()
131 Graph<?> graph, Object nextNode, @NullableDecl Object previousNode) { in canTraverseWithoutReusingEdge() argument
132 if (graph.isDirected() || !Objects.equal(previousNode, nextNode)) { in canTraverseWithoutReusingEdge()
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | UnbufferedCommonTreeNodeStreamState.m | 62 - (CommonTree *) previousNode
64 return previousNode;
69 if (previousNode != aPreviousNode) {
71 [previousNode release];
72 previousNode = aPreviousNode;
|
| D | UnbufferedCommonTreeNodeStreamState.h | 32 CommonTree *previousNode; variable
45 - (CommonTree *) previousNode;
|
| D | UnbufferedCommonTreeNodeStream.m | 38 @synthesize previousNode;
91 previousNode = nil;
112 return previousNode;
185 previousNode = [lookahead objectAtIndex:head];
202 [state setPreviousNode:previousNode];
233 previousNode = [state previousNode];
|
| D | UnbufferedCommonTreeNodeStream.h | 40 CommonTree *previousNode; variable
61 @property (retain, getter=getPreviousNode, setter=setPreviousNode:) CommonTree *previousNode;
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| D | DTMNodeIterator.java | 176 public Node previousNode() in previousNode() method in DTMNodeIterator
181 int handle=dtm_iter.previousNode(); in previousNode()
|
| /external/antlr/runtime/C/include/ |
| D | antlr3commontreenodestream.h | 228 pANTLR3_BASE_TREE previousNode; member
323 pANTLR3_BASE_TREE previousNode; member
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| D | NodeSequence.java | 372 public int previousNode() in previousNode() method in NodeSequence
386 int n = m_iter.previousNode(); in previousNode()
507 while ((m_next >= index) && DTM.NULL != (n = previousNode())); in runTo()
|
| D | LocPathIterator.java | 585 public int previousNode() in previousNode() method in LocPathIterator
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| D | DTMIterator.java | 183 public int previousNode(); in previousNode() method
|
| /external/exoplayer/tree/testutils/src/main/java/com/google/android/exoplayer2/testutil/ |
| D | ActionSchedule.java | 117 private ActionNode previousNode; field in ActionSchedule.Builder
125 previousNode = rootNode; in Builder()
591 previousNode.setNext(actionNode); in appendActionNode()
592 previousNode = actionNode; in appendActionNode()
|
| /external/dagger2/java/dagger/internal/codegen/ |
| D | DependencyCycleValidator.java | 134 Node previousNode = path.get(path.size() - 2); in reportCycle() local
136 chooseDependencyEdgeConnecting(previousNode, cycleStartNode, bindingGraph); in reportCycle()
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| D | NodeSetDTM.java | 411 public int previousNode() in previousNode() method in NodeSetDTM
|
| D | NodeSet.java | 267 public Node previousNode() throws DOMException in previousNode() method in NodeSet
|