Home
last modified time | relevance | path

Searched refs:GraphTraits (Results 1 – 25 of 1329) sorted by relevance

12345678910>>...54

/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/llvm10/llvm-10.0.1.src/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/llvm80/llvm-8.0.1.src/include/llvm/ADT/
H A DGraphTraits.h36 struct GraphTraits { struct
104 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
108 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
110 return make_range(GraphTraits<GraphType>::nodes_begin(G),
111 GraphTraits<GraphType>::nodes_end(G));
121 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
122 children(const typename GraphTraits<GraphType>::NodeRef &G) {
123 return make_range(GraphTraits<GraphType>::child_begin(G),
124 GraphTraits<GraphType>::child_end(G));
137 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/llvm70/llvm-7.0.1.src/include/llvm/ADT/
H A DGraphTraits.h29 struct GraphTraits {
97 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
101 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
103 return make_range(GraphTraits<GraphType>::nodes_begin(G),
104 GraphTraits<GraphType>::nodes_end(G));
114 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
115 children(const typename GraphTraits<GraphType>::NodeRef &G) {
116 return make_range(GraphTraits<GraphType>::child_begin(G),
117 GraphTraits<GraphType>::child_end(G));
130 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Ddigraph.h41 template <typename GraphTraits>
45 typedef typename GraphTraits::edge_t edge_t;
57 template <typename GraphTraits>
61 typedef typename GraphTraits::node_t node_t;
79 template <typename GraphTraits>
125 template <typename GraphTraits>
144 template <typename GraphTraits>
195 template <typename GraphTraits>
213 template <typename GraphTraits>
226 template <typename GraphTraits>
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Ddigraph.h41 template <typename GraphTraits>
45 typedef typename GraphTraits::edge_t edge_t;
57 template <typename GraphTraits>
61 typedef typename GraphTraits::node_t node_t;
79 template <typename GraphTraits>
125 template <typename GraphTraits>
144 template <typename GraphTraits>
195 template <typename GraphTraits>
213 template <typename GraphTraits>
226 template <typename GraphTraits>
[all …]
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Ddigraph.h41 template <typename GraphTraits>
45 typedef typename GraphTraits::edge_t edge_t;
57 template <typename GraphTraits>
61 typedef typename GraphTraits::node_t node_t;
79 template <typename GraphTraits>
125 template <typename GraphTraits>
144 template <typename GraphTraits>
195 template <typename GraphTraits>
213 template <typename GraphTraits>
226 template <typename GraphTraits>
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Ddigraph.h41 template <typename GraphTraits>
45 typedef typename GraphTraits::edge_t edge_t;
57 template <typename GraphTraits>
61 typedef typename GraphTraits::node_t node_t;
79 template <typename GraphTraits>
125 template <typename GraphTraits>
144 template <typename GraphTraits>
195 template <typename GraphTraits>
213 template <typename GraphTraits>
226 template <typename GraphTraits>
[all …]
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Ddigraph.h41 template <typename GraphTraits>
45 typedef typename GraphTraits::edge_t edge_t;
57 template <typename GraphTraits>
61 typedef typename GraphTraits::node_t node_t;
79 template <typename GraphTraits>
125 template <typename GraphTraits>
144 template <typename GraphTraits>
195 template <typename GraphTraits>
213 template <typename GraphTraits>
226 template <typename GraphTraits>
[all …]
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Ddigraph.h41 template <typename GraphTraits>
45 typedef typename GraphTraits::edge_t edge_t;
57 template <typename GraphTraits>
61 typedef typename GraphTraits::node_t node_t;
79 template <typename GraphTraits>
125 template <typename GraphTraits>
144 template <typename GraphTraits>
195 template <typename GraphTraits>
213 template <typename GraphTraits>
226 template <typename GraphTraits>
[all …]
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Ddigraph.h41 template <typename GraphTraits>
45 typedef typename GraphTraits::edge_t edge_t;
57 template <typename GraphTraits>
61 typedef typename GraphTraits::node_t node_t;
79 template <typename GraphTraits>
125 template <typename GraphTraits>
144 template <typename GraphTraits>
195 template <typename GraphTraits>
213 template <typename GraphTraits>
226 template <typename GraphTraits>
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/Analysis/
H A DRegionIterator.h42 using BlockTraits = GraphTraits<BlockT *>;
169 using BlockTraits = GraphTraits<BlockT *>;
284 template <> struct GraphTraits<RegionT *> : public GraphTraits<NodeT *> { \
319 template <> struct GraphTraits<RegionInfo*>
320 : public GraphTraits<FlatIt<RegionNode*>> {
323 GraphTraits<FlatIt<NodeRef>>>;
338 template <> struct GraphTraits<RegionInfoPass*>
339 : public GraphTraits<RegionInfo *> {
342 GraphTraits<FlatIt<NodeRef>>>;
349 return GraphTraits<RegionInfo*>::nodes_begin(&RI->getRegionInfo());
[all …]

12345678910>>...54