Home
last modified time | relevance | path

Searched defs:edge (Results 1 – 25 of 241) sorted by relevance

12345678910

/external/guava/android/guava/src/com/google/common/graph/
DNetworkConnections.java55 N adjacentNode(E edge); in adjacentNode()
63 N removeInEdge(E edge, boolean isSelfLoop); in removeInEdge()
67 N removeOutEdge(E edge); in removeOutEdge()
72 void addInEdge(E edge, N node, boolean isSelfLoop); in addInEdge()
75 void addOutEdge(E edge, N node); in addOutEdge()
DAbstractUndirectedNetworkConnections.java67 public N adjacentNode(E edge) { in adjacentNode()
72 public N removeInEdge(E edge, boolean isSelfLoop) { in removeInEdge()
80 public N removeOutEdge(E edge) { in removeOutEdge()
86 public void addInEdge(E edge, N node, boolean isSelfLoop) { in addInEdge()
93 public void addOutEdge(E edge, N node) { in addOutEdge()
DMutableNetwork.java67 boolean addEdge(N nodeU, N nodeV, E edge); in addEdge()
96 boolean addEdge(EndpointPair<N> endpoints, E edge); in addEdge()
112 boolean removeEdge(E edge); in removeEdge()
DStandardMutableNetwork.java77 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
88 edge, in addEdge() local
121 public boolean addEdge(EndpointPair<N> endpoints, E edge) { in addEdge()
147 public boolean removeEdge(E edge) { in removeEdge()
/external/guava/guava/src/com/google/common/graph/
DNetworkConnections.java55 N adjacentNode(E edge); in adjacentNode()
63 N removeInEdge(E edge, boolean isSelfLoop); in removeInEdge()
67 N removeOutEdge(E edge); in removeOutEdge()
72 void addInEdge(E edge, N node, boolean isSelfLoop); in addInEdge()
75 void addOutEdge(E edge, N node); in addOutEdge()
DAbstractUndirectedNetworkConnections.java67 public N adjacentNode(E edge) { in adjacentNode()
72 public N removeInEdge(E edge, boolean isSelfLoop) { in removeInEdge()
80 public N removeOutEdge(E edge) { in removeOutEdge()
86 public void addInEdge(E edge, N node, boolean isSelfLoop) { in addInEdge()
93 public void addOutEdge(E edge, N node) { in addOutEdge()
DMutableNetwork.java67 boolean addEdge(N nodeU, N nodeV, E edge); in addEdge()
96 boolean addEdge(EndpointPair<N> endpoints, E edge); in addEdge()
112 boolean removeEdge(E edge); in removeEdge()
DStandardMutableNetwork.java77 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
88 edge, in addEdge() local
121 public boolean addEdge(EndpointPair<N> endpoints, E edge) { in addEdge()
147 public boolean removeEdge(E edge) { in removeEdge()
/external/skia/src/core/
DSkEdgeBuilder.cpp19 SkEdgeBuilder::Combine SkBasicEdgeBuilder::combineVertical(const SkEdge* edge, SkEdge* last) { in combineVertical()
60 SkEdgeBuilder::Combine SkAnalyticEdgeBuilder::combineVertical(const SkAnalyticEdge* edge, in combineVertical()
111 static bool is_vertical(const Edge* edge) { in is_vertical()
120 SkEdge* edge = fAlloc.make<SkEdge>(); in addLine() local
134 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); in addLine() local
149 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); in addQuad() local
155 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); in addQuad() local
162 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); in addCubic() local
168 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); in addCubic() local
178 auto edge = (SkEdge*) arg_edge; in addPolyLine() local
[all …]
DSkScanPriv.h45 static inline void remove_edge(EdgeType* edge) { in remove_edge()
51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { in insert_edge_after()
59 static void backward_insert_edge_based_on_x(EdgeType* edge) { in backward_insert_edge_based_on_x()
/external/skqp/src/core/
DSkEdgeBuilder.cpp19 SkEdgeBuilder::Combine SkBasicEdgeBuilder::combineVertical(const SkEdge* edge, SkEdge* last) { in combineVertical()
60 SkEdgeBuilder::Combine SkAnalyticEdgeBuilder::combineVertical(const SkAnalyticEdge* edge, in combineVertical()
111 static bool is_vertical(const Edge* edge) { in is_vertical()
120 SkEdge* edge = fAlloc.make<SkEdge>(); in addLine() local
134 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); in addLine() local
156 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); in addQuad() local
162 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); in addQuad() local
175 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); in addCubic() local
181 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); in addCubic() local
197 auto edge = (SkEdge*) arg_edge; in addPolyLine() local
[all …]
DSkScanPriv.h45 static inline void remove_edge(EdgeType* edge) { in remove_edge()
51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { in insert_edge_after()
59 static void backward_insert_edge_based_on_x(EdgeType* edge) { in backward_insert_edge_based_on_x()
/external/tensorflow/tensorflow/core/common_runtime/
Dreplicate_per_replica_nodes.cc57 void ReplicateFromRegularDeviceToCompositeDevice(const Edge* edge, in ReplicateFromRegularDeviceToCompositeDevice()
69 Status ReplicateFromCompositeDeviceToCompositeDevice(const Edge* edge, in ReplicateFromCompositeDeviceToCompositeDevice()
94 Status ReplicateFromCompositeDeviceToRegularDevice(const Edge* edge, in ReplicateFromCompositeDeviceToRegularDevice()
192 for (const Edge* edge : node->in_edges()) { in ReplicateEdges() local
205 for (const Edge* edge : node->out_edges()) { in ReplicateEdges() local
Dmemory_types.cc115 static string GetTensorName(const Edge* edge) { in GetTensorName()
122 const string& device_name, bool host, const Edge* edge) { in Send()
138 const string& device_name, bool host, const Edge* edge) { in Recv()
157 const Edge* edge; in EnsureMemoryTypes() member
/external/tensorflow/tensorflow/core/nccl/
Dnccl_rewrite.cc46 for (const auto& edge : node->in_edges()) { in ReplaceReduce() local
52 for (const auto& edge : node->out_edges()) { in ReplaceReduce() local
60 for (const auto& edge : node->in_edges()) { in ReplaceReduce() local
126 for (const auto& edge : node->out_edges()) { in ReplaceBroadcast() local
172 for (const auto& edge : node->in_edges()) { in ReplaceBroadcast() local
/external/dagger2/java/dagger/internal/codegen/bindinggraphvalidation/
DSubcomponentFactoryMethodValidator.java89 ChildFactoryMethodEdge edge, BindingGraph graph) { in findMissingModules()
111 ChildFactoryMethodEdge edge, BindingGraph bindingGraph) { in subgraphFactoryMethodParameters()
141 ChildFactoryMethodEdge edge, in reportMissingModuleParameters()
/external/tensorflow/tensorflow/compiler/jit/
Dencapsulate_xla_computations_pass.cc79 DataType EdgeType(const Edge* edge) { in EdgeType()
85 for (const Edge* edge : node.in_edges()) { in AddControlInputs() local
94 for (const Edge* edge : node.out_edges()) { in AddControlOutputs() local
277 const Edge* edge = in_edges[i]; in BuildXlaLaunchOps() local
285 const Edge* edge = in_edges[pos]; in BuildXlaLaunchOps() local
/external/llvm-project/polly/lib/External/isl/
Disl_scheduler.c210 static int is_type(struct isl_sched_edge *edge, enum isl_edge_type type) in is_type()
217 static void set_type(struct isl_sched_edge *edge, enum isl_edge_type type) in set_type()
224 static void clear_type(struct isl_sched_edge *edge, enum isl_edge_type type) in clear_type()
231 static int is_validity(struct isl_sched_edge *edge) in is_validity()
238 static void set_validity(struct isl_sched_edge *edge) in set_validity()
245 static int is_proximity(struct isl_sched_edge *edge) in is_proximity()
252 static int is_local(struct isl_sched_edge *edge) in is_local()
259 static void set_local(struct isl_sched_edge *edge) in set_local()
266 static void clear_local(struct isl_sched_edge *edge) in clear_local()
273 static int is_coincidence(struct isl_sched_edge *edge) in is_coincidence()
[all …]
/external/antlr/tool/src/main/java/org/antlr/tool/
DDOTGenerator.java133 Transition edge = s.transition(i); in walkCreatingDFADOT() local
208 Transition edge = s.transition(i); in walkRuleNFACreatingDOT() local
284 protected String getEdgeLabel(Transition edge) { in getEdgeLabel()
/external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/
DGraphvizGrapher.java167 protected void renderEdge(GraphvizEdge edge) { in renderEdge()
185 protected Map<String, String> getEdgeAttributes(GraphvizEdge edge) { in getEdgeAttributes()
298 protected void newDependencyEdge(DependencyEdge edge) { in newDependencyEdge()
313 protected void newBindingEdge(BindingEdge edge) { in newBindingEdge()
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dvectorization_utils.cc56 for (auto edge : old_src.first->out_edges()) { in ReplaceEdgeSources() local
61 for (auto edge : edges_to_replace) { in ReplaceEdgeSources() local
232 for (auto edge : op_node->in_edges()) { in AddConversionMapping() local
255 auto edge = input_edges[i]; in AddConversionMapping() local
544 for (const auto& edge : tensor.first->in_edges()) { in AddUnstackedTensorMappingsHelper() local
574 for (const auto& edge : tensor.first->in_edges()) { in AddUnstackedTensorMappingsHelper() local
/external/skia/src/gpu/
DGrTriangulator.cpp197 void GrTriangulator::EdgeList::insert(Edge* edge, Edge* prev, Edge* next) { in insert()
201 void GrTriangulator::EdgeList::remove(Edge* edge) { in remove()
207 void GrTriangulator::MonotonePoly::addEdge(Edge* edge) { in addEdge()
536 void EdgeList::insert(Edge* edge, Edge* prev) { in insert()
597 static void remove_edge_above(Edge* edge) { in remove_edge_above()
605 static void remove_edge_below(Edge* edge) { in remove_edge_below()
644 static void rewind_if_necessary(Edge* edge, EdgeList* activeEdges, Vertex** current, in rewind_if_necessary()
682 void GrTriangulator::setTop(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, in setTop()
696 void GrTriangulator::setBottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, in setBottom()
710 void GrTriangulator::mergeEdgesAbove(Edge* edge, Edge* other, EdgeList* activeEdges, in mergeEdgesAbove()
[all …]
/external/antlr/tool/src/main/java/org/antlr/analysis/
DDFAOptimizer.java192 Transition edge = d.transition(i); in optimizeExitBranches() local
221 Transition edge = d.transition(i); in optimizeEOTBranches() local
/external/tensorflow/tensorflow/compiler/tf2xla/
Dfunctionalize_while.cc277 for (const Edge* edge : frame->loop_cond->out_edges()) { in FunctionalizeLoop() local
345 for (const Edge* edge : arg.merge->out_edges()) { in FunctionalizeLoop() local
366 for (const Edge* edge : arg.switch_node->out_edges()) { in FunctionalizeLoop() local
377 const Edge* edge = possible_exit.front(); in FunctionalizeLoop() local
481 for (const Edge* edge : edges) { in FunctionalizeLoop() local
/external/llvm-project/mlir/lib/Analysis/
DCallGraph.cpp56 return llvm::any_of(edges, [](const Edge &edge) { return edge.isChild(); }); in hasChildren()
156 for (const CallGraphNode::Edge &edge : llvm::make_early_inc_range(*node)) in eraseNode() local
162 it.second->edges.remove_if([node](const CallGraphNode::Edge &edge) { in eraseNode()

12345678910