Home
last modified time | relevance | path

Searched refs:preSet (Results 1 – 13 of 13) sorted by relevance

/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/
H A DAPI.hs90 , preSet :: forall a. c a => a -> g a -> Set a
172 , preSet = AM.preSet function
247 , preSet = T.preSet function
363 , preSet = \x -> T.preSet x . getMono function
435 , preSet = R.preSet function
505 , preSet = T.preSet function
570 , preSet = T.preSet function
628 , preSet = LAM.preSet function
H A DGeneric.hs657 preSet x y == (AM.preSet x . toAdjacencyMap) y
1089 preSet x empty == Set.empty
1092 preSet x (vertex x) == Set.empty
1095 preSet 1 (edge 1 2) == Set.empty
1098 preSet y (edge x y) == Set.fromList [x]
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/
H A DToGraph.hs186 preSet :: Ord (ToVertex t) => ToVertex t -> t -> Set (ToVertex t)
187 preSet x = AM.postSet x . toAdjacencyMapTranspose function
356 preSet = AM.preSet function
432 preSet = LAM.preSet function
454 preSet = NAM.preSet function
H A DRelation.hs29 adjacencyList, vertexSet, edgeSet, preSet, postSet,
474 preSet :: Ord a => a -> Relation a -> Set.Set a
475 preSet x = Set.mapMonotonic fst . Set.filter ((== x) . snd) . relation function
755 r = Set.unions [ preSet v x `setProduct` postSet v y | v <- Set.toAscList d ]
H A DAdjacencyMap.hs33 adjacencyList, vertexSet, edgeSet, preSet, postSet,
491 preSet :: Ord a => a -> AdjacencyMap a -> Set a
492 preSet x = Set.fromAscList . map fst . filter p . Map.toAscList . adjacencyMap function
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/Acyclic/
H A DAdjacencyMap.hs34 adjacencyList, vertexSet, edgeSet, preSet, postSet,
328 preSet :: Ord a => a -> AdjacencyMap a -> Set a
329 preSet = coerce AM.preSet function
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/NonEmpty/
H A DAdjacencyMap.hs38 vertexSet, edgeSet, preSet, postSet,
429 preSet :: Ord a => a -> AdjacencyMap a -> Set.Set a
430 preSet = coerce AM.preSet function
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/Acyclic/
H A DAdjacencyMap.hs273 preSet x empty == Set.empty
276 preSet x (vertex x) == Set.empty
279 preSet 1 (shrink $ 1 * 2 :: AAI) == Set.empty
282 preSet 2 (shrink $ 1 * 2 :: AAI) == Set.fromList [1]
285 (Set.member x . preSet x) y == const False y
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/Labelled/
H A DGraph.hs245 T.preSet x (empty :: LAS) == Set.empty
248 T.preSet x (vertex x :: LAS) == Set.empty
251 T.preSet 1 (edge e 1 2 :: LAS) == Set.empty
254 T.preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
H A DAdjacencyMap.hs266 preSet x (empty :: LAS) == Set.empty
269 preSet x (vertex x :: LAS) == Set.empty
272 preSet 1 (edge e 1 2 :: LAS) == Set.empty
275 preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/Labelled/
H A DAdjacencyMap.hs32 edgeList, vertexSet, edgeSet, preSet, postSet, skeleton,
436 preSet :: Ord a => a -> AdjacencyMap e a -> Set a
437 preSet x (AM m) = Set.fromAscList function
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/NonEmpty/
H A DAdjacencyMap.hs347 preSet x (vertex x) == Set.empty
350 preSet 1 (edge 1 2 :: G) == Set.empty
353 preSet y (edge x y) == Set.fromList [x]
/dports/lang/intel-compute-runtime/compute-runtime-21.52.22081/shared/test/unit_test/utilities/
H A Dcontainers_tests.cpp266 … void testCompareExchangeHead(DummyFNode *preSet, DummyFNode *&expected, DummyFNode *desired) { in TEST()
267 head = preSet; in TEST()