/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
D | DirectedGraph.h | 27 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 …]
|
/third_party/skia/src/core/ |
D | SkScanPriv.h | 44 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()
|
/third_party/flutter/skia/src/core/ |
D | SkScanPriv.h | 44 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()
|
/third_party/flutter/skia/tests/ |
D | DetermineDomainModeTest.cpp | 57 enum EdgeType { enum in RectInfo 63 void set(const SkRect& rect, EdgeType left, EdgeType top, EdgeType right, EdgeType bot, in set() 74 EdgeType edgeType(Side side) const { return fTypes[side]; } in edgeType() 109 static const char* ToStr(EdgeType type) { in ToStr() 118 EdgeType fTypes[4]; 155 static RectInfo::EdgeType compute_inset_edgetype(RectInfo::EdgeType previous, in compute_inset_edgetype() 204 RectInfo::EdgeType left = enclosing.edgeType(RectInfo::kLeft); in generic_inset() 214 RectInfo::EdgeType top = enclosing.edgeType(RectInfo::kTop); in generic_inset() 224 RectInfo::EdgeType right = enclosing.edgeType(RectInfo::kRight); in generic_inset() 234 RectInfo::EdgeType bot = enclosing.edgeType(RectInfo::kBot); in generic_inset()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
D | DependenceGraphBuilder.h | 34 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()
|
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
D | cord_rep_btree.h | 70 enum class EdgeType { kFront, kBack }; enum 73 static constexpr EdgeType kFront = EdgeType::kFront; 74 static constexpr EdgeType kBack = EdgeType::kBack; 239 size_t index(EdgeType edge) const { in index() 254 inline CordRep* Edge(EdgeType edge_type) const; 305 template <EdgeType edge_type> 314 template <EdgeType edge_type> 395 template <EdgeType edge_type> 435 template <EdgeType edge_type> 441 template <EdgeType edge_type> [all …]
|
D | cord_rep_btree.cc | 40 using EdgeType = CordRepBtree::EdgeType; typedef 142 template <EdgeType edge_type> 147 template <EdgeType edge_type> 196 template <EdgeType edge_type> 430 template <EdgeType edge_type> 439 template <EdgeType edge_type> 462 template <EdgeType edge_type> 544 template <EdgeType edge_type> 595 template <EdgeType edge_type>
|
D | cord_rep_btree_navigator.h | 137 template <CordRepBtree::EdgeType edge_type> 172 template <CordRepBtree::EdgeType edge_type>
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/ |
D | VPlanPredicator.cpp | 43 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()
|
D | VPlanPredicator.h | 26 enum class EdgeType { enum 46 EdgeType getEdgeTypeBetween(VPBlockBase *FromBlock, VPBlockBase *ToBlock);
|
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/gnn/ |
D | edge.h | 30 using EdgeType = int8_t; variable 41 …Edge(EdgeIdType id, EdgeType type, WeightType weight, std::shared_ptr<Node> src_node, std::shared_… in Edge() 50 EdgeType type() const { return type_; } in type() 83 EdgeType type_;
|
D | graph_data.h | 38 std::vector<EdgeType> edge_type; 40 std::map<EdgeType, EdgeIdType> edge_num; 57 virtual Status GetAllEdges(EdgeType edge_type, std::shared_ptr<Tensor> *out) = 0;
|
D | graph_loader.h | 47 using EdgeTypeMap = std::unordered_map<EdgeType, std::vector<EdgeIdType>>; 49 using EdgeFeatureMap = std::unordered_map<EdgeType, std::unordered_set<FeatureType>>;
|
D | graph_data_impl.h | 61 Status GetAllEdges(EdgeType edge_type, std::shared_ptr<Tensor> *out) override; 284 std::unordered_map<EdgeType, std::vector<EdgeIdType>> edge_type_map_; 288 std::unordered_map<EdgeType, std::unordered_set<FeatureType>> edge_feature_map_;
|
D | local_edge.h | 40 LocalEdge(EdgeIdType id, EdgeType type, WeightType weight, std::shared_ptr<Node> src_node,
|
D | local_edge.cc | 24 LocalEdge::LocalEdge(EdgeIdType id, EdgeType type, WeightType weight, std::shared_ptr<Node> src_nod… in LocalEdge()
|
D | graph_loader.cc | 189 EdgeType edge_type = static_cast<EdgeType>(col_jsn["type"]); in LoadEdge()
|
D | graph_data_client.h | 67 Status GetAllEdges(EdgeType edge_type, std::shared_ptr<Tensor> *out) override;
|
D | graph_data_client.cc | 99 Status GraphDataClient::GetAllEdges(EdgeType edge_type, std::shared_ptr<Tensor> *out) { in GetAllEdges() 326 meta_info.edge_type.emplace_back(static_cast<EdgeType>(edge.type())); in GraphInfo() 327 … meta_info.edge_num[static_cast<EdgeType>(edge.type())] = static_cast<EdgeIdType>(edge.num()); in GraphInfo()
|
/third_party/skia/src/gpu/geometry/ |
D | GrAATriangulator.cpp | 25 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 …]
|
D | GrTriangulator.h | 44 enum class EdgeType { kInner, kOuter, kConnector }; enum 143 Edge* makeEdge(Vertex* prev, Vertex* next, EdgeType type, const Comparator&) const; 152 Edge* makeConnectingEdge(Vertex* prev, Vertex* next, EdgeType, const Comparator&, 379 Edge(Vertex* top, Vertex* bottom, int winding, EdgeType type) in Edge() 403 EdgeType fType;
|
D | GrTriangulator.cpp | 28 using EdgeType = GrTriangulator::EdgeType; typedef 270 if (fType == EdgeType::kInner || other.fType == EdgeType::kInner) { in intersect() 274 } else if (fType == EdgeType::kOuter && other.fType == EdgeType::kOuter) { in intersect() 281 SkASSERT(fType == EdgeType::kConnector || other.fType == EdgeType::kConnector); in intersect() 418 e = alloc->make<Edge>(fTail->fLastEdge->fBottom, e->fBottom, 1, EdgeType::kInner); in addEdge() 619 Edge* GrTriangulator::makeEdge(Vertex* prev, Vertex* next, EdgeType type, in makeEdge() 955 Edge* GrTriangulator::makeConnectingEdge(Vertex* prev, Vertex* next, EdgeType type, in makeConnectingEdge() 1050 uint8_t alpha = edge1->fType == EdgeType::kOuter ? 255 : 0; in computeBisector() 1167 this->makeConnectingEdge(prev, v, EdgeType::kInner, c); in buildEdges() 1433 EdgeType::kInner); in tessellate()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
D | DependenceGraphBuilder.cpp | 158 using EdgeKind = typename EdgeType::EdgeKind; in createPiBlocks() 191 SmallVector<EdgeType *, 10> EL; in createPiBlocks() 193 for (EdgeType *OldEdge : EL) { in createPiBlocks()
|
/third_party/gstreamer/gstplugins_bad/ext/closedcaption/ |
D | gstcea708decoder.h | 300 } EdgeType; typedef 348 EdgeType edge_type;
|
/third_party/mindspore/mindspore/ccsrc/debug/debugger/ |
D | debug_graph.proto | 200 enum EdgeType { enum 206 optional EdgeType type = 2;
|