Home
last modified time | relevance | path

Searched refs:EdgeType (Results 1 – 25 of 37) sorted by relevance

12

/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DDirectedGraph.h27 template <class NodeType, class EdgeType> class DGEdge {
32 explicit DGEdge(const DGEdge<NodeType, EdgeType> &E) in DGEdge()
34 DGEdge<NodeType, EdgeType> &operator=(const DGEdge<NodeType, EdgeType> &E) {
41 bool operator==(const EdgeType &E) const { return getDerived().isEqualTo(E); }
42 bool operator!=(const EdgeType &E) const { return !operator==(E); }
48 static_cast<const DGEdge<NodeType, EdgeType> &>(*this).getTargetNode()); in getTargetNode()
56 bool isEqualTo(const EdgeType &E) const { return this == &E; } in isEqualTo()
59 EdgeType &getDerived() { return *static_cast<EdgeType *>(this); } in getDerived()
60 const EdgeType &getDerived() const { in getDerived()
61 return *static_cast<const EdgeType *>(this); in getDerived()
[all …]
/external/llvm-project/llvm/include/llvm/ADT/
DDirectedGraph.h27 template <class NodeType, class EdgeType> class DGEdge {
32 explicit DGEdge(const DGEdge<NodeType, EdgeType> &E) in DGEdge()
34 DGEdge<NodeType, EdgeType> &operator=(const DGEdge<NodeType, EdgeType> &E) {
41 bool operator==(const EdgeType &E) const { return getDerived().isEqualTo(E); }
42 bool operator!=(const EdgeType &E) const { return !operator==(E); }
48 static_cast<const DGEdge<NodeType, EdgeType> &>(*this).getTargetNode()); in getTargetNode()
56 bool isEqualTo(const EdgeType &E) const { return this == &E; } in isEqualTo()
59 EdgeType &getDerived() { return *static_cast<EdgeType *>(this); } in getDerived()
60 const EdgeType &getDerived() const { in getDerived()
61 return *static_cast<const EdgeType *>(this); in getDerived()
[all …]
/external/skqp/src/core/
DSkScanPriv.h44 template<class EdgeType>
45 static inline void remove_edge(EdgeType* edge) { in remove_edge()
50 template<class EdgeType>
51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { in insert_edge_after()
58 template<class EdgeType>
59 static void backward_insert_edge_based_on_x(EdgeType* edge) { in backward_insert_edge_based_on_x()
61 EdgeType* prev = edge->fPrev; in backward_insert_edge_based_on_x()
75 template<class EdgeType>
76 static EdgeType* backward_insert_start(EdgeType* prev, SkFixed x) { in backward_insert_start()
/external/skia/src/core/
DSkScanPriv.h44 template<class EdgeType>
45 static inline void remove_edge(EdgeType* edge) { in remove_edge()
50 template<class EdgeType>
51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { in insert_edge_after()
58 template<class EdgeType>
59 static void backward_insert_edge_based_on_x(EdgeType* edge) { in backward_insert_edge_based_on_x()
61 EdgeType* prev = edge->fPrev; in backward_insert_edge_based_on_x()
75 template<class EdgeType>
76 static EdgeType* backward_insert_start(EdgeType* prev, SkFixed x) { in backward_insert_start()
/external/guava/android/guava-tests/test/com/google/common/graph/
DGraphEquivalenceTest.java19 import static com.google.common.graph.TestUtil.EdgeType.DIRECTED;
20 import static com.google.common.graph.TestUtil.EdgeType.UNDIRECTED;
23 import com.google.common.graph.TestUtil.EdgeType;
39 private final EdgeType edgeType;
45 return Arrays.asList(new Object[][] {{EdgeType.UNDIRECTED}, {EdgeType.DIRECTED}}); in parameters()
48 public GraphEquivalenceTest(EdgeType edgeType) { in GraphEquivalenceTest()
53 private static MutableGraph<Integer> createGraph(EdgeType edgeType) { in createGraph()
64 private static EdgeType oppositeType(EdgeType edgeType) { in oppositeType()
67 return EdgeType.DIRECTED; in oppositeType()
69 return EdgeType.UNDIRECTED; in oppositeType()
DNetworkEquivalenceTest.java19 import static com.google.common.graph.TestUtil.EdgeType.DIRECTED;
20 import static com.google.common.graph.TestUtil.EdgeType.UNDIRECTED;
23 import com.google.common.graph.TestUtil.EdgeType;
44 private final EdgeType edgeType;
50 return Arrays.asList(new Object[][] {{EdgeType.UNDIRECTED}, {EdgeType.DIRECTED}}); in parameters()
53 public NetworkEquivalenceTest(EdgeType edgeType) { in NetworkEquivalenceTest()
58 private static MutableNetwork<Integer, String> createNetwork(EdgeType edgeType) { in createNetwork()
69 private static EdgeType oppositeType(EdgeType edgeType) { in oppositeType()
72 return EdgeType.DIRECTED; in oppositeType()
74 return EdgeType.UNDIRECTED; in oppositeType()
DDefaultNetworkImplementationsTest.java21 import static com.google.common.graph.TestUtil.EdgeType.DIRECTED;
22 import static com.google.common.graph.TestUtil.EdgeType.UNDIRECTED;
27 import com.google.common.graph.TestUtil.EdgeType;
66 private final EdgeType edgeType;
68 public DefaultNetworkImplementationsTest(EdgeType edgeType) { in DefaultNetworkImplementationsTest()
75 (edgeType == EdgeType.DIRECTED) ? NetworkBuilder.directed() : NetworkBuilder.undirected(); in setUp()
130 if (edgeType == EdgeType.DIRECTED) { in edgesConnecting_oneEdge()
151 if (edgeType == EdgeType.DIRECTED) { in edgesConnecting_parallelEdges()
/external/guava/guava-tests/test/com/google/common/graph/
DGraphEquivalenceTest.java19 import static com.google.common.graph.TestUtil.EdgeType.DIRECTED;
20 import static com.google.common.graph.TestUtil.EdgeType.UNDIRECTED;
23 import com.google.common.graph.TestUtil.EdgeType;
39 private final EdgeType edgeType;
45 return Arrays.asList(new Object[][] {{EdgeType.UNDIRECTED}, {EdgeType.DIRECTED}}); in parameters()
48 public GraphEquivalenceTest(EdgeType edgeType) { in GraphEquivalenceTest()
53 private static MutableGraph<Integer> createGraph(EdgeType edgeType) { in createGraph()
64 private static EdgeType oppositeType(EdgeType edgeType) { in oppositeType()
67 return EdgeType.DIRECTED; in oppositeType()
69 return EdgeType.UNDIRECTED; in oppositeType()
DNetworkEquivalenceTest.java19 import static com.google.common.graph.TestUtil.EdgeType.DIRECTED;
20 import static com.google.common.graph.TestUtil.EdgeType.UNDIRECTED;
23 import com.google.common.graph.TestUtil.EdgeType;
44 private final EdgeType edgeType;
50 return Arrays.asList(new Object[][] {{EdgeType.UNDIRECTED}, {EdgeType.DIRECTED}}); in parameters()
53 public NetworkEquivalenceTest(EdgeType edgeType) { in NetworkEquivalenceTest()
58 private static MutableNetwork<Integer, String> createNetwork(EdgeType edgeType) { in createNetwork()
69 private static EdgeType oppositeType(EdgeType edgeType) { in oppositeType()
72 return EdgeType.DIRECTED; in oppositeType()
74 return EdgeType.UNDIRECTED; in oppositeType()
DDefaultNetworkImplementationsTest.java21 import static com.google.common.graph.TestUtil.EdgeType.DIRECTED;
22 import static com.google.common.graph.TestUtil.EdgeType.UNDIRECTED;
27 import com.google.common.graph.TestUtil.EdgeType;
66 private final EdgeType edgeType;
68 public DefaultNetworkImplementationsTest(EdgeType edgeType) { in DefaultNetworkImplementationsTest()
75 (edgeType == EdgeType.DIRECTED) ? NetworkBuilder.directed() : NetworkBuilder.undirected(); in setUp()
130 if (edgeType == EdgeType.DIRECTED) { in edgesConnecting_oneEdge()
151 if (edgeType == EdgeType.DIRECTED) { in edgesConnecting_parallelEdges()
/external/skqp/tests/
DDetermineDomainModeTest.cpp55 enum EdgeType { enum in RectInfo
61 void set(const SkRect& rect, EdgeType left, EdgeType top, EdgeType right, EdgeType bot, in set()
72 EdgeType edgeType(Side side) const { return fTypes[side]; } in edgeType()
107 static const char* ToStr(EdgeType type) { in ToStr()
116 EdgeType fTypes[4];
151 static RectInfo::EdgeType compute_inset_edgetype(RectInfo::EdgeType previous, in compute_inset_edgetype()
200 RectInfo::EdgeType left = enclosing.edgeType(RectInfo::kLeft); in generic_inset()
210 RectInfo::EdgeType top = enclosing.edgeType(RectInfo::kTop); in generic_inset()
220 RectInfo::EdgeType right = enclosing.edgeType(RectInfo::kRight); in generic_inset()
230 RectInfo::EdgeType bot = enclosing.edgeType(RectInfo::kBot); in generic_inset()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DDependenceGraphBuilder.h34 using EdgeType = typename GraphType::EdgeType; variable
110 virtual EdgeType &createDefUseEdge(NodeType &Src, NodeType &Tgt) = 0;
113 virtual EdgeType &createMemoryEdge(NodeType &Src, NodeType &Tgt) = 0;
116 virtual EdgeType &createRootedEdge(NodeType &Src, NodeType &Tgt) = 0;
123 virtual void destroyEdge(EdgeType &E) { delete &E; } in destroyEdge()
/external/llvm-project/llvm/include/llvm/Analysis/
DDependenceGraphBuilder.h37 using EdgeType = typename GraphType::EdgeType; variable
123 virtual EdgeType &createDefUseEdge(NodeType &Src, NodeType &Tgt) = 0;
126 virtual EdgeType &createMemoryEdge(NodeType &Src, NodeType &Tgt) = 0;
129 virtual EdgeType &createRootedEdge(NodeType &Src, NodeType &Tgt) = 0;
136 virtual void destroyEdge(EdgeType &E) { delete &E; } in destroyEdge()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
DVPlanPredicator.cpp43 EdgeType ET = getEdgeTypeBetween(PredBB, CurrBB); in getOrCreateNotPredicate()
46 case EdgeType::TRUE_EDGE: in getOrCreateNotPredicate()
51 case EdgeType::FALSE_EDGE: in getOrCreateNotPredicate()
116 VPlanPredicator::EdgeType
123 return (Count == 0) ? EdgeType::TRUE_EDGE : EdgeType::FALSE_EDGE; in getEdgeTypeBetween()
DVPlanPredicator.h26 enum class EdgeType { enum
46 EdgeType getEdgeTypeBetween(VPBlockBase *FromBlock, VPBlockBase *ToBlock);
/external/llvm-project/llvm/lib/Transforms/Vectorize/
DVPlanPredicator.cpp43 EdgeType ET = getEdgeTypeBetween(PredBB, CurrBB); in getOrCreateNotPredicate()
46 case EdgeType::TRUE_EDGE: in getOrCreateNotPredicate()
51 case EdgeType::FALSE_EDGE: in getOrCreateNotPredicate()
116 VPlanPredicator::EdgeType
123 return (Count == 0) ? EdgeType::TRUE_EDGE : EdgeType::FALSE_EDGE; in getEdgeTypeBetween()
DVPlanPredicator.h26 enum class EdgeType { enum
46 EdgeType getEdgeTypeBetween(VPBlockBase *FromBlock, VPBlockBase *ToBlock);
/external/skia/src/gpu/
DGrAATriangulator.cpp25 using EdgeType = GrTriangulator::EdgeType; typedef
70 Edge bisector1(prev, prev->fPartner, 1, EdgeType::kConnector); in makeEvent()
71 Edge bisector2(next, next->fPartner, 1, EdgeType::kConnector); in makeEvent()
96 Edge bisector(v, v->fPartner, 1, EdgeType::kConnector); in makeEvent()
116 this->makeConnectingEdge(outer, inner, EdgeType::kConnector, c, 0); in connectPartners()
206 Edge* join = this->makeEdge(prev, next, EdgeType::kInner, c); in simplifyBoundary()
236 this->makeConnectingEdge(v, dest, EdgeType::kConnector, c, 0); in connectSSEdge()
297 if (e->fType == EdgeType::kOuter) { in is_overlap_edge()
299 } else if (e->fType == EdgeType::kInner) { in is_overlap_edge()
327 bool isOuterBoundary = e->fType == EdgeType::kOuter && in collapseOverlapRegions()
[all …]
DGrTriangulator.h41 enum class EdgeType { kInner, kOuter, kConnector }; enum
140 Edge* makeEdge(Vertex* prev, Vertex* next, EdgeType type, const Comparator&) const;
149 Edge* makeConnectingEdge(Vertex* prev, Vertex* next, EdgeType, const Comparator&,
376 Edge(Vertex* top, Vertex* bottom, int winding, EdgeType type) in Edge()
400 EdgeType fType;
/external/tensorflow/tensorflow/lite/kernels/internal/optimized/integer_ops/
Ddepthwise_conv_hybrid_3x3_filter.h121 template <DepthwiseConvOutputRounding output_rounding, EdgeType kEdgeType,
2071 DepthwiseConvOutputRounding::kUpward, EdgeType::kCenter, 1, 1> {
2187 DepthwiseConvOutputRounding::kUpward, EdgeType::kCorner, 1, 1> {
2357 DepthwiseConvOutputRounding::kUpward, EdgeType::kHorizontal, 1, 1> {
2561 DepthwiseConvOutputRounding::kUpward, EdgeType::kVertical, 1, 1> {
2940 DepthwiseConvHybridPartialPerChannel<output_rounding, EdgeType::kCenter, 1,
2959 output_rounding, EdgeType::kCorner, 1, 1>::Run(
2970 output_rounding, EdgeType::kHorizontal, 1, 1>::Run(
2978 output_rounding, EdgeType::kCorner, 1, 1>::Run(
2990 output_rounding, EdgeType::kVertical, 1, 1>::Run(
[all …]
Ddepthwise_conv_3x3_filter.h1928 EdgeType::kCenter, 1, 1> {
2040 EdgeType::kCorner, 1, 1> {
2204 EdgeType::kHorizontal, 1, 1> {
2401 EdgeType::kVertical, 1, 1> {
2772 DepthwiseConvPartialPerChannel<output_rounding, EdgeType::kCenter, 1,
2791 DepthwiseConvPartialPerChannel<output_rounding, EdgeType::kCorner, 1, 1>::Run(
2801 DepthwiseConvPartialPerChannel<output_rounding, EdgeType::kHorizontal, 1,
2810 DepthwiseConvPartialPerChannel<output_rounding, EdgeType::kCorner, 1, 1>::Run(
2821 DepthwiseConvPartialPerChannel<output_rounding, EdgeType::kVertical, 1,
2839 DepthwiseConvPartialPerChannel<output_rounding, EdgeType::kVertical, 1,
[all …]
/external/exoplayer/tree/library/core/src/main/java/com/google/android/exoplayer2/text/
DCaptionStyleCompat.java49 public @interface EdgeType {} annotation in CaptionStyleCompat
111 @EdgeType public final int edgeType;
151 @EdgeType int edgeType, in CaptionStyleCompat()
/external/llvm-project/llvm/lib/Analysis/
DDependenceGraphBuilder.cpp159 using EdgeKind = typename EdgeType::EdgeKind; in createPiBlocks()
192 SmallVector<EdgeType *, 10> EL; in createPiBlocks()
194 for (EdgeType *OldEdge : EL) { in createPiBlocks()
397 EdgeType &Edge = N->back(); in simplify()
416 for (EdgeType *E : *N) { in simplify()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DDependenceGraphBuilder.cpp158 using EdgeKind = typename EdgeType::EdgeKind; in createPiBlocks()
191 SmallVector<EdgeType *, 10> EL; in createPiBlocks()
193 for (EdgeType *OldEdge : EL) { in createPiBlocks()
/external/python/apitools/apitools/base/py/
Dencoding_helper.py36 class EdgeType(object): class
64 if self.type_ == EdgeType.SCALAR:
792 repeated_edge = ProtoEdge(EdgeType.REPEATED, field.name, i)
798 map_edge = ProtoEdge(EdgeType.MAP, field.name, key)
803 scalar_edge = ProtoEdge(EdgeType.SCALAR, field.name, None)

12