/dports/games/hs-scroll/scroll-1.20180421/_cabal_deps/language-c-0.8.3/src/Language/C/Data/ |
H A D | RList.hs | 23 newtype Reversed a = Reversed a constructor 31 snoc :: Reversed [a] -> a -> Reversed [a] 32 snoc (Reversed xs) x = Reversed (x : xs) 35 rappend :: Reversed [a] -> [a] -> Reversed [a] 38 appendr :: [a] -> Reversed [a] -> Reversed [a] 41 rappendr :: Reversed [a] -> Reversed [a] -> Reversed [a] 42 rappendr (Reversed xs) (Reversed ys) = Reversed (ys ++ xs) 44 rmap :: (a -> b) -> Reversed [a] -> Reversed [b] 45 rmap f (Reversed xs) = Reversed (map f xs) 50 viewr :: Reversed [a] -> (Reversed [a] , a) [all …]
|
/dports/devel/elm-format/elm-format-0.8.3/src/ |
H A D | ReversedList.hs | 9 newtype Reversed a = Reversed [a] type 12 empty :: Reversed a 14 Reversed [] 17 push :: a -> Reversed a -> Reversed a 18 push a (Reversed list) = 19 Reversed (a : list) 22 isEmpty :: Reversed a -> Bool 23 isEmpty (Reversed []) = True 27 toList :: Reversed a -> [a] 28 toList (Reversed list) =
|
/dports/lang/gleam/gleam-0.18.2/cargo-crates/petgraph-0.6.0/src/visit/ |
H A D | reversed.rs | 14 pub struct Reversed<G>(pub G); struct 16 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 21 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 23 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 25 impl<G> IntoNeighbors for Reversed<G> implementation 35 impl<G> IntoNeighborsDirected for Reversed<G> implementation 45 impl<G> IntoEdges for Reversed<G> implementation 57 impl<G> IntoEdgesDirected for Reversed<G> implementation 69 impl<G: Visitable> Visitable for Reversed<G> { implementation 137 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/devel/grex/grex-1.3.0/cargo-crates/petgraph-0.6.0/src/visit/ |
H A D | reversed.rs | 14 pub struct Reversed<G>(pub G); struct 16 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 21 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 23 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 25 impl<G> IntoNeighbors for Reversed<G> implementation 35 impl<G> IntoNeighborsDirected for Reversed<G> implementation 45 impl<G> IntoEdges for Reversed<G> implementation 57 impl<G> IntoEdgesDirected for Reversed<G> implementation 69 impl<G: Visitable> Visitable for Reversed<G> { implementation 137 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.6.0/src/visit/ |
H A D | reversed.rs | 14 pub struct Reversed<G>(pub G); struct 16 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 21 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 23 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 25 impl<G> IntoNeighbors for Reversed<G> implementation 35 impl<G> IntoNeighborsDirected for Reversed<G> implementation 45 impl<G> IntoEdges for Reversed<G> implementation 57 impl<G> IntoEdgesDirected for Reversed<G> implementation 69 impl<G: Visitable> Visitable for Reversed<G> { implementation 137 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.6.0/src/visit/ |
H A D | reversed.rs | 14 pub struct Reversed<G>(pub G); struct 16 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 21 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 23 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 25 impl<G> IntoNeighbors for Reversed<G> implementation 35 impl<G> IntoNeighborsDirected for Reversed<G> implementation 45 impl<G> IntoEdges for Reversed<G> implementation 57 impl<G> IntoEdgesDirected for Reversed<G> implementation 69 impl<G: Visitable> Visitable for Reversed<G> { implementation 137 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/sysutils/dua-cli/dua-cli-2.14.11/cargo-crates/petgraph-0.6.0/src/visit/ |
H A D | reversed.rs | 14 pub struct Reversed<G>(pub G); struct 16 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 21 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 23 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 25 impl<G> IntoNeighbors for Reversed<G> implementation 35 impl<G> IntoNeighborsDirected for Reversed<G> implementation 45 impl<G> IntoEdges for Reversed<G> implementation 57 impl<G> IntoEdgesDirected for Reversed<G> implementation 69 impl<G: Visitable> Visitable for Reversed<G> { implementation 137 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/devel/rust-analyzer/rust-analyzer-2021-12-20/cargo-crates/petgraph-0.5.1/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); struct 15 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 20 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> implementation 34 impl<G> IntoNeighborsDirected for Reversed<G> implementation 44 impl<G> IntoEdges for Reversed<G> implementation 56 impl<G> IntoEdgesDirected for Reversed<G> implementation 68 impl<G: Visitable> Visitable for Reversed<G> { implementation 130 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/net-im/libsignal-client/libsignal-client-0.9.6/cargo-crates/petgraph-0.5.1/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); struct 15 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 20 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> implementation 34 impl<G> IntoNeighborsDirected for Reversed<G> implementation 44 impl<G> IntoEdges for Reversed<G> implementation 56 impl<G> IntoEdgesDirected for Reversed<G> implementation 68 impl<G: Visitable> Visitable for Reversed<G> { implementation 130 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/sysutils/vector/vector-0.10.0/cargo-crates/petgraph-0.5.1/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); struct 15 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 20 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> implementation 34 impl<G> IntoNeighborsDirected for Reversed<G> implementation 44 impl<G> IntoEdges for Reversed<G> implementation 56 impl<G> IntoEdgesDirected for Reversed<G> implementation 68 impl<G: Visitable> Visitable for Reversed<G> { implementation 130 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/petgraph-0.5.0/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); struct 15 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 20 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> implementation 34 impl<G> IntoNeighborsDirected for Reversed<G> implementation 44 impl<G> IntoEdges for Reversed<G> implementation 56 impl<G> IntoEdgesDirected for Reversed<G> implementation 68 impl<G: Visitable> Visitable for Reversed<G> { implementation 120 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/petgraph/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); struct 15 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 20 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> implementation 34 impl<G> IntoNeighborsDirected for Reversed<G> implementation 44 impl<G> IntoEdges for Reversed<G> implementation 56 impl<G> IntoEdgesDirected for Reversed<G> implementation 68 impl<G: Visitable> Visitable for Reversed<G> { implementation 130 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/net/krill/krill-0.9.4/cargo-crates/petgraph-0.5.1/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); struct 15 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 20 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> implementation 34 impl<G> IntoNeighborsDirected for Reversed<G> implementation 44 impl<G> IntoEdges for Reversed<G> implementation 56 impl<G> IntoEdgesDirected for Reversed<G> implementation 68 impl<G: Visitable> Visitable for Reversed<G> { implementation 130 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.5.1/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); struct 15 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 20 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> implementation 34 impl<G> IntoNeighborsDirected for Reversed<G> implementation 44 impl<G> IntoEdges for Reversed<G> implementation 56 impl<G> IntoEdgesDirected for Reversed<G> implementation 68 impl<G: Visitable> Visitable for Reversed<G> { implementation 130 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.5.1/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); struct 15 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 20 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> implementation 34 impl<G> IntoNeighborsDirected for Reversed<G> implementation 44 impl<G> IntoEdges for Reversed<G> implementation 56 impl<G> IntoEdgesDirected for Reversed<G> implementation 68 impl<G: Visitable> Visitable for Reversed<G> { implementation 130 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/lang/rust/rustc-1.58.1-src/vendor/petgraph/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); struct 15 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 20 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> implementation 34 impl<G> IntoNeighborsDirected for Reversed<G> implementation 44 impl<G> IntoEdges for Reversed<G> implementation 56 impl<G> IntoEdgesDirected for Reversed<G> implementation 68 impl<G: Visitable> Visitable for Reversed<G> { implementation 130 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/petgraph/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); struct 15 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 20 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> implementation 34 impl<G> IntoNeighborsDirected for Reversed<G> implementation 44 impl<G> IntoEdges for Reversed<G> implementation 56 impl<G> IntoEdgesDirected for Reversed<G> implementation 68 impl<G: Visitable> Visitable for Reversed<G> { implementation 130 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/audio/ncspot/ncspot-0.9.3/cargo-crates/petgraph-0.5.1/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); 15 impl<G: GraphBase> GraphBase for Reversed<G> { 20 impl<G: GraphRef> GraphRef for Reversed<G> {} 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> 34 impl<G> IntoNeighborsDirected for Reversed<G> 44 impl<G> IntoEdges for Reversed<G> 56 impl<G> IntoEdgesDirected for Reversed<G> 68 impl<G: Visitable> Visitable for Reversed<G> { 130 impl<G> IntoEdgeReferences for Reversed<G> [all …]
|
/dports/sysutils/fselect/fselect-0.7.7/cargo-crates/petgraph-0.5.1/src/visit/ |
H A D | reversed.rs | 13 pub struct Reversed<G>(pub G); struct 15 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 20 impl<G: GraphRef> GraphRef for Reversed<G> {} implementation 22 Data! {delegate_impl [[G], G, Reversed<G>, access0]} 24 impl<G> IntoNeighbors for Reversed<G> implementation 34 impl<G> IntoNeighborsDirected for Reversed<G> implementation 44 impl<G> IntoEdges for Reversed<G> implementation 56 impl<G> IntoEdgesDirected for Reversed<G> implementation 68 impl<G: Visitable> Visitable for Reversed<G> { implementation 130 impl<G> IntoEdgeReferences for Reversed<G> implementation [all …]
|
/dports/security/sequoia/sequoia-383133f6be990237044900a4df676488bf8dd71e/cargo-crates/petgraph-0.4.13/src/visit/ |
H A D | reversed.rs | 28 pub struct Reversed<G>(pub G); struct 30 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 35 impl<G: GraphRef> GraphRef for Reversed<G> { } implementation 37 Data!{delegate_impl [[G], G, Reversed<G>, access0]} 39 impl<G> IntoNeighbors for Reversed<G> implementation 49 impl<G> IntoNeighborsDirected for Reversed<G> implementation 60 impl<G: Visitable> Visitable for Reversed<G> implementation 97 impl<G> IntoEdgeReferences for Reversed<G> implementation 128 NodeIndexable!{delegate_impl [[G], G, Reversed<G>, access0]} 132 GraphProp!{delegate_impl [[G], G, Reversed<G>, access0]} [all …]
|
/dports/textproc/ripgrep-all/ripgrep-all-0.9.6/cargo-crates/petgraph-0.4.13/src/visit/ |
H A D | reversed.rs | 28 pub struct Reversed<G>(pub G); struct 30 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 35 impl<G: GraphRef> GraphRef for Reversed<G> { } implementation 37 Data!{delegate_impl [[G], G, Reversed<G>, access0]} 39 impl<G> IntoNeighbors for Reversed<G> implementation 49 impl<G> IntoNeighborsDirected for Reversed<G> implementation 60 impl<G: Visitable> Visitable for Reversed<G> implementation 97 impl<G> IntoEdgeReferences for Reversed<G> implementation 128 NodeIndexable!{delegate_impl [[G], G, Reversed<G>, access0]} 132 GraphProp!{delegate_impl [[G], G, Reversed<G>, access0]} [all …]
|
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/petgraph-0.4.13/src/visit/ |
H A D | reversed.rs | 28 pub struct Reversed<G>(pub G); struct 30 impl<G: GraphBase> GraphBase for Reversed<G> { implementation 35 impl<G: GraphRef> GraphRef for Reversed<G> { } implementation 37 Data!{delegate_impl [[G], G, Reversed<G>, access0]} 39 impl<G> IntoNeighbors for Reversed<G> implementation 49 impl<G> IntoNeighborsDirected for Reversed<G> implementation 60 impl<G: Visitable> Visitable for Reversed<G> implementation 97 impl<G> IntoEdgeReferences for Reversed<G> implementation 128 NodeIndexable!{delegate_impl [[G], G, Reversed<G>, access0]} 132 GraphProp!{delegate_impl [[G], G, Reversed<G>, access0]} [all …]
|
/dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
H A D | successive_shortest_path_nonnegative_weights.hpp | 32 template <class Graph, class Weight, class Distance, class Reversed> 51 Reversed rev_; 54 template <class Graph, class Weight, class Distance, class Reversed> 55 MapReducedWeight<Graph, Weight, Distance, Reversed> 71 Reversed rev, in successive_shortest_path_nonnegative_weights() 121 Reversed rev, in successive_shortest_path_nonnegative_weights_dispatch3() 138 Reversed rev, in successive_shortest_path_nonnegative_weights_dispatch3() 159 Reversed rev, in successive_shortest_path_nonnegative_weights_dispatch2() 176 Reversed rev, in successive_shortest_path_nonnegative_weights_dispatch2() 198 Reversed rev, in successive_shortest_path_nonnegative_weights_dispatch1() [all …]
|
/dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
H A D | successive_shortest_path_nonnegative_weights.hpp | 34 template < class Graph, class Weight, class Distance, class Reversed > 37 MapReducedWeight< Graph, Weight, Distance, Reversed > > 46 MapReducedWeight(const Graph& g, Weight w, Distance d, Reversed r) in MapReducedWeight() 61 Reversed rev_; 64 template < class Graph, class Weight, class Distance, class Reversed > 66 const Graph& g, Weight w, Distance d, Reversed r) in make_mapReducedWeight() 68 return MapReducedWeight< Graph, Weight, Distance, Reversed >( in make_mapReducedWeight() 80 ResidualCapacity residual_capacity, Weight weight, Reversed rev, in successive_shortest_path_nonnegative_weights() 124 class Weight, class Reversed, class Pred, class Distance, 138 class Weight, class Reversed, class Pred, class Distance, [all …]
|
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
H A D | successive_shortest_path_nonnegative_weights.hpp | 34 template < class Graph, class Weight, class Distance, class Reversed > 37 MapReducedWeight< Graph, Weight, Distance, Reversed > > 46 MapReducedWeight(const Graph& g, Weight w, Distance d, Reversed r) in MapReducedWeight() 61 Reversed rev_; 64 template < class Graph, class Weight, class Distance, class Reversed > 66 const Graph& g, Weight w, Distance d, Reversed r) in make_mapReducedWeight() 68 return MapReducedWeight< Graph, Weight, Distance, Reversed >( in make_mapReducedWeight() 80 ResidualCapacity residual_capacity, Weight weight, Reversed rev, in successive_shortest_path_nonnegative_weights() 124 class Weight, class Reversed, class Pred, class Distance, 138 class Weight, class Reversed, class Pred, class Distance, [all …]
|