| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| Alias.java | 27 private final NodeId fromId;
28 private final NodeId toId;
30 public Alias(NodeId fromId, NodeId toId) {
35 public NodeId getFromId() {
39 public NodeId getToId() {
|
| Edge.java | 28 private final NodeId fromId;
29 private final NodeId toId;
31 protected Edge(NodeId fromId, NodeId toId) {
36 public NodeId getFromId() {
40 public NodeId getToId() {
63 public abstract Edge copy(NodeId fromId, NodeId toId);
|
| NodeId.java | 32 public final class NodeId {
50 private NodeId(Key<?> key, NodeType nodeType) {
55 public static NodeId newTypeId(Key<?> key) {
56 return new NodeId(key, NodeType.TYPE);
59 public static NodeId newInstanceId(Key<?> key) {
60 return new NodeId(key, NodeType.INSTANCE);
72 if (!(obj.getClass().equals(NodeId.class))) {
75 NodeId other = (NodeId) obj;
80 return "NodeId{nodeType=" + nodeType + " key=" + key + "}"
[all...] |
| DefaultEdgeCreator.java | 61 * @param nodeId ID of the node that should be the tail of the dependency
66 NodeId nodeId, T binding) {
69 NodeId to = NodeId.newTypeId(dependency.getKey());
70 builder.add(new DependencyEdge(nodeId, to, dependency.getInjectionPoint()));
80 return newDependencyEdges(NodeId.newTypeId(binding.getKey()), binding);
89 return ImmutableList.<Edge>of(new BindingEdge(NodeId.newTypeId(binding.getKey()),
90 NodeId.newTypeId(binding.getSourceKey()),
102 .add(new BindingEdge(NodeId.newTypeId(binding.getKey())
[all...] |
| BindingEdge.java | 42 public BindingEdge(NodeId fromId, NodeId toId, Type type) {
67 @Override public Edge copy(NodeId fromId, NodeId toId) {
|
| DependencyEdge.java | 36 public DependencyEdge(NodeId fromId, NodeId toId, InjectionPoint injectionPoint) {
62 @Override public Edge copy(NodeId fromId, NodeId toId) {
|
| Node.java | 34 private final NodeId id;
37 protected Node(NodeId id, Object source) {
42 public NodeId getId() {
69 public abstract Node copy(NodeId id);
|
| InterfaceNode.java | 27 public InterfaceNode(NodeId id, Object source) {
31 @Override public Node copy(NodeId id) {
|
| AbstractInjectorGrapher.java | 109 Map<NodeId, NodeId> aliases = resolveAliases(aliasCreator.createAliases(bindings));
136 private void createNodes(Iterable<Node> nodes, Map<NodeId, NodeId> aliases) throws IOException {
138 NodeId originalId = node.getId();
139 NodeId resolvedId = resolveAlias(aliases, originalId);
155 private void createEdges(Iterable<Edge> edges, Map<NodeId, NodeId> aliases) throws IOException {
169 private NodeId resolveAlias(Map<NodeId, NodeId> aliases, NodeId nodeId)
[all...] |
| ProviderAliasCreator.java | 37 aliases.add(new Alias(NodeId.newTypeId(binding.getKey()),
38 NodeId.newTypeId(((ProviderBinding<?>) binding).getProvidedKey())));
|
| ImplementationNode.java | 35 public ImplementationNode(NodeId id, Object source, Collection<Member> members) {
61 @Override public Node copy(NodeId id) {
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| NodeId.java | 21 public enum NodeId {
|
| AnchorNode.java | 28 public NodeId getNodeId() {
29 return NodeId.anchor;
|
| ScalarNode.java | 57 public NodeId getNodeId() {
58 return NodeId.scalar;
|
| SequenceNode.java | 46 public NodeId getNodeId() {
47 return NodeId.sequence;
|
| /external/llvm/lib/Target/Hexagon/ |
| RDFDeadCode.h | 40 bool erase(const SetVector<NodeId> &Nodes);
44 SetVector<NodeId> getDeadNodes() { return DeadNodes; }
45 SetVector<NodeId> getDeadInstrs() { return DeadInstrs; }
50 SetVector<NodeId> LiveNodes;
51 SetVector<NodeId> DeadNodes;
52 SetVector<NodeId> DeadInstrs;
60 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
61 void processDef(NodeAddr<DefNode*> DA, SetQueue<NodeId> &WorkQ);
62 void processUse(NodeAddr<UseNode*> UA, SetQueue<NodeId> &WorkQ);
|
| RDFCopy.h | 42 std::map<RegisterRef,std::map<NodeId,NodeId>> RDefMap;
44 std::map<NodeId, EqualityMap> CopyMap;
45 std::vector<NodeId> Copies;
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
| GraphvizEdge.java | 20 import com.google.inject.grapher.NodeId;
31 private final NodeId headNodeId;
36 private final NodeId tailNodeId;
43 public GraphvizEdge(NodeId tailNodeId, NodeId headNodeId) {
49 public NodeId getHeadNodeId() {
78 public NodeId getTailNodeId() {
|
| GraphvizNode.java | 22 import com.google.inject.grapher.NodeId;
34 private final NodeId nodeId;
51 public GraphvizNode(NodeId nodeId) {
52 this.nodeId = nodeId;
56 public NodeId getNodeId() {
57 return nodeId;
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 typedef unsigned NodeId;
34 static NodeId invalidNodeId() {
35 return std::numeric_limits<NodeId>::max();
82 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
104 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs)
126 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) {
140 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
157 void disconnectFrom(Graph &G, NodeId NId) {
166 NodeId getN1Id() const { return NIds[0];
[all...] |
| Solution.h | 30 typedef std::map<GraphBase::NodeId, unsigned> SelectionsMap;
74 /// @param nodeId Node id.
75 /// @param selection Selection for nodeId.
76 void setSelection(GraphBase::NodeId nodeId, unsigned selection) {
77 selections[nodeId] = selection;
81 /// @param nodeId Node id.
82 /// @return The selection for nodeId;
83 unsigned getSelection(GraphBase::NodeId nodeId) const
[all...] |
| ReductionRules.h | 29 void applyR1(GraphT &G, typename GraphT::NodeId NId) {
30 typedef typename GraphT::NodeId NodeId;
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) {
74 typedef typename GraphT::NodeId NodeId;
89 NodeId YNId = G.getEdgeOtherNodeId(YXEId, NId),
180 typedef GraphBase::NodeId NodeId;
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/ |
| YamlComposeTest.java | 24 import org.yaml.snakeyaml.nodes.NodeId;
54 assertEquals(NodeId.mapping, node.getNodeId());
56 assertEquals(NodeId.scalar, node.getNodeId());
65 assertEquals(NodeId.scalar, node.getNodeId());
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
| SequenceNodeTest.java | 27 assertEquals(NodeId.sequence, node.getNodeId());
|
| /external/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 155 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
159 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const {
175 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId;
339 typedef GraphBase::NodeId NodeId;
359 void handleAddNode(NodeId NId) {
364 void handleRemoveNode(NodeId NId) {}
365 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
377 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
384 void handleReconnectEdge(EdgeId EId, NodeId NId)
[all...] |
