| /external/skia/src/core/ |
| D | SkEdgeBuilder.cpp | 26 SkEdgeBuilder::Combine SkBasicEdgeBuilder::combineVertical(const SkEdge* edge, SkEdge* last) { in combineVertical()
69 SkEdgeBuilder::Combine SkAnalyticEdgeBuilder::combineVertical(const SkAnalyticEdge* edge, in combineVertical()
122 static bool is_vertical(const Edge* edge) { in is_vertical()
133 SkEdge* edge = fAlloc.make<SkEdge>(); in addLine() local
147 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); in addLine() local
162 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); in addQuad() local
168 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
191 auto edge = (SkEdge*) arg_edge; in addPolyLine() local
[all …]
|
| D | SkScanPriv.h | 45 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 void backward_insert_edge_based_on_x(EdgeType* edge) { in backward_insert_edge_based_on_x()
|
| /external/guava/guava/src/com/google/common/graph/ |
| D | NetworkConnections.java | 57 N adjacentNode(E edge); in adjacentNode()
66 N removeInEdge(E edge, boolean isSelfLoop); in removeInEdge()
70 N removeOutEdge(E edge); in removeOutEdge()
75 void addInEdge(E edge, N node, boolean isSelfLoop); in addInEdge()
78 void addOutEdge(E edge, N node); in addOutEdge()
|
| D | AbstractUndirectedNetworkConnections.java | 70 public N adjacentNode(E edge) { in adjacentNode()
77 public N removeInEdge(E edge, boolean isSelfLoop) { in removeInEdge()
85 public N removeOutEdge(E edge) { in removeOutEdge()
92 public void addInEdge(E edge, N node, boolean isSelfLoop) { in addInEdge()
99 public void addOutEdge(E edge, N node) { in addOutEdge()
|
| D | MutableNetwork.java | 68 boolean addEdge(N nodeU, N nodeV, E edge); in addEdge()
97 boolean addEdge(EndpointPair<N> endpoints, E edge); in addEdge()
113 boolean removeEdge(E edge); in removeEdge()
|
| D | StandardMutableNetwork.java | 79 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
90 edge, in addEdge() local
123 public boolean addEdge(EndpointPair<N> endpoints, E edge) { in addEdge()
149 public boolean removeEdge(E edge) { in removeEdge()
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | NetworkConnections.java | 57 N adjacentNode(E edge); in adjacentNode()
66 N removeInEdge(E edge, boolean isSelfLoop); in removeInEdge()
70 N removeOutEdge(E edge); in removeOutEdge()
75 void addInEdge(E edge, N node, boolean isSelfLoop); in addInEdge()
78 void addOutEdge(E edge, N node); in addOutEdge()
|
| D | AbstractUndirectedNetworkConnections.java | 70 public N adjacentNode(E edge) { in adjacentNode()
77 public N removeInEdge(E edge, boolean isSelfLoop) { in removeInEdge()
85 public N removeOutEdge(E edge) { in removeOutEdge()
92 public void addInEdge(E edge, N node, boolean isSelfLoop) { in addInEdge()
99 public void addOutEdge(E edge, N node) { in addOutEdge()
|
| D | MutableNetwork.java | 68 boolean addEdge(N nodeU, N nodeV, E edge); in addEdge()
97 boolean addEdge(EndpointPair<N> endpoints, E edge); in addEdge()
113 boolean removeEdge(E edge); in removeEdge()
|
| D | StandardMutableNetwork.java | 79 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
90 edge, in addEdge() local
123 public boolean addEdge(EndpointPair<N> endpoints, E edge) { in addEdge()
149 public boolean removeEdge(E edge) { in removeEdge()
|
| /external/angle/third_party/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_navigator.h | 52 CordRep* edge; member
194 CordRepBtree* edge = node_[height]; in Seek() local
218 CordRepBtree* edge = node_[0]; in Next() local
223 CordRepBtree* edge = node_[0]; in Previous() local
229 CordRepBtree* edge; in NextUp() local
247 CordRepBtree* edge; in PreviousUp() local
|
| D | cord_data_edge.h | 32 inline bool IsDataEdge(const CordRep* edge) { in IsDataEdge()
45 inline absl::string_view EdgeData(const CordRep* edge) { in EdgeData()
|
| /external/webrtc/third_party/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_navigator.h | 52 CordRep* edge; member
194 CordRepBtree* edge = node_[height]; in Seek() local
218 CordRepBtree* edge = node_[0]; in Next() local
223 CordRepBtree* edge = node_[0]; in Previous() local
229 CordRepBtree* edge; in NextUp() local
247 CordRepBtree* edge; in PreviousUp() local
|
| D | cord_data_edge.h | 32 inline bool IsDataEdge(const CordRep* edge) { in IsDataEdge()
45 inline absl::string_view EdgeData(const CordRep* edge) { in EdgeData()
|
| /external/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_navigator.h | 52 CordRep* edge; member
194 CordRepBtree* edge = node_[height]; in Seek() local
218 CordRepBtree* edge = node_[0]; in Next() local
223 CordRepBtree* edge = node_[0]; in Previous() local
229 CordRepBtree* edge; in NextUp() local
247 CordRepBtree* edge; in PreviousUp() local
|
| D | cord_data_edge.h | 32 inline bool IsDataEdge(const CordRep* edge) { in IsDataEdge()
45 inline absl::string_view EdgeData(const CordRep* edge) { in EdgeData()
|
| /external/cronet/third_party/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_navigator.h | 52 CordRep* edge; member
194 CordRepBtree* edge = node_[height]; in Seek() local
218 CordRepBtree* edge = node_[0]; in Next() local
223 CordRepBtree* edge = node_[0]; in Previous() local
229 CordRepBtree* edge; in NextUp() local
247 CordRepBtree* edge; in PreviousUp() local
|
| D | cord_data_edge.h | 32 inline bool IsDataEdge(const CordRep* edge) { in IsDataEdge()
45 inline absl::string_view EdgeData(const CordRep* edge) { in EdgeData()
|
| /external/tensorflow/third_party/absl/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_navigator.h | 52 CordRep* edge; member
194 CordRepBtree* edge = node_[height]; in Seek() local
218 CordRepBtree* edge = node_[0]; in Next() local
223 CordRepBtree* edge = node_[0]; in Previous() local
229 CordRepBtree* edge; in NextUp() local
247 CordRepBtree* edge; in PreviousUp() local
|
| D | cord_data_edge.h | 32 inline bool IsDataEdge(const CordRep* edge) { in IsDataEdge()
45 inline absl::string_view EdgeData(const CordRep* edge) { in EdgeData()
|
| /external/tensorflow/tensorflow/core/tpu/graph_rewrite/ |
| D | tpu_embedding_rewrite_pass_utils.cc | 35 for (const Edge* edge : from->in_edges()) { in ReplaceNode() local
42 for (const Edge* edge : from->out_edges()) { in ReplaceNode() local
55 for (const Edge* edge : edges) { in ReplaceNode() local
66 for (const Edge* edge : edges) { in ReplaceNode() local
|
| /external/tensorflow/tensorflow/core/nccl/ |
| D | nccl_rewrite.cc | 46 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/tensorflow/tensorflow/core/common_runtime/ |
| D | replicate_per_replica_nodes.cc | 63 void ReplicateFromRegularDeviceToCompositeDevice(const Edge* edge, in ReplicateFromRegularDeviceToCompositeDevice()
80 const Edge* edge, const std::vector<string>& allowed_devices, in ReplicateFromCompositeDeviceToCompositeDevice()
112 const Edge* edge, const std::vector<string>& allowed_devices, in ReplicateFromCompositeDeviceToRegularDevice()
202 for (const Edge* edge : node->out_edges()) { in ReplicateNodesAndEdges() local
223 for (const Edge* edge : node->in_edges()) { in ReplicateNodesAndEdges() local
|
| /external/dagger2/java/dagger/internal/codegen/bindinggraphvalidation/ |
| D | SubcomponentFactoryMethodValidator.java | 79 ChildFactoryMethodEdge edge, BindingGraph graph) { in findMissingModules()
101 ChildFactoryMethodEdge edge, BindingGraph bindingGraph) { in subgraphFactoryMethodParameters()
132 ChildFactoryMethodEdge edge, in reportMissingModuleParameters()
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | encapsulate_xla_computations_pass.cc | 84 DataType EdgeType(const Edge* edge) { in EdgeType()
90 for (const Edge* edge : node.in_edges()) { in AddControlInputs() local
99 for (const Edge* edge : node.out_edges()) { in AddControlOutputs() local
271 const Edge* edge = in_edges[i]; in BuildXlaLaunchOps() local
279 const Edge* edge = in_edges[pos]; in BuildXlaLaunchOps() local
|