Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. induceJust :: Ord a => AdjacencyMap (Maybe a) -> AdjacencyMap a

   algebraic-graphs	Algebra.Graph.Acyclic.AdjacencyMap

   Construct the induced subgraph of a given graph by removing the vertices that are Nothing. Complexity: O(n + m) time.

   induceJust (vertex Nothing) == empty
   induceJust . vertex . Just  == vertex
   

2. induceJust :: Ord a => AdjacencyMap (Maybe a) -> AdjacencyMap a

   algebraic-graphs	Algebra.Graph.AdjacencyMap

   Construct the induced subgraph of a given graph by removing the vertices that are Nothing. Complexity: O(n + m) time.

   induceJust (vertex Nothing)                               == empty
   induceJust (edge (Just x) Nothing)                        == vertex x
   induceJust . gmap Just                                    == id
   induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
   

3. induceJust :: Graph e (Maybe a) -> Graph e a

   algebraic-graphs	Algebra.Graph.Labelled

   Construct the induced subgraph of a given graph by removing the vertices that are Nothing. Complexity: O(s) time, memory and size.

   induceJust (vertex Nothing)                               == empty
   induceJust (edge (Just x) Nothing)                        == vertex x
   induceJust . fmap Just                                    == id
   induceJust . fmap (\x -> if p x then Just x else Nothing) == induce p
   

4. induceJust :: Ord a => AdjacencyMap e (Maybe a) -> AdjacencyMap e a

   algebraic-graphs	Algebra.Graph.Labelled.AdjacencyMap

   Construct the induced subgraph of a given graph by removing the vertices that are Nothing. Complexity: O(n + m) time.

   induceJust (vertex Nothing)                               == empty
   induceJust (edge (Just x) Nothing)                        == vertex x
   induceJust . gmap Just                                    == id
   induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
   

5. induceJust1 :: Graph (Maybe a) -> Maybe (Graph a)

   algebraic-graphs	Algebra.Graph.NonEmpty

   Construct the induced subgraph of a given graph by removing the vertices that are Nothing. Returns Nothing if the resulting graph is empty. Complexity: O(s) time, memory and size.

   induceJust1 (vertex Nothing)                               == Nothing
   induceJust1 (edge (Just x) Nothing)                        == Just (vertex x)
   induceJust1 . fmap Just                                    == Just
   induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
   

6. induceJust1 :: Ord a => AdjacencyMap (Maybe a) -> Maybe (AdjacencyMap a)

   algebraic-graphs	Algebra.Graph.NonEmpty.AdjacencyMap

   Construct the induced subgraph of a given graph by removing the vertices that are Nothing. Returns Nothing if the resulting graph is empty. Complexity: O(n + m) time.

   induceJust1 (vertex Nothing)                               == Nothing
   induceJust1 (edge (Just x) Nothing)                        == Just (vertex x)
   induceJust1 . gmap Just                                    == Just
   induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
   

7. induceJust :: Ord a => Relation (Maybe a) -> Relation a

   algebraic-graphs	Algebra.Graph.Relation

   Construct the induced subgraph of a given graph by removing the vertices that are Nothing. Complexity: O(n + m) time.

   induceJust (vertex Nothing)                               == empty
   induceJust (edge (Just x) Nothing)                        == vertex x
   induceJust . gmap Just                                    == id
   induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
   

8. induceJust :: Ord a => Relation (Maybe a) -> Relation a

   algebraic-graphs	Algebra.Graph.Relation.Symmetric

   Construct the induced subgraph of a given graph by removing the vertices that are Nothing. Complexity: O(n + m) time.

   induceJust (vertex Nothing)                               == empty
   induceJust (edge (Just x) Nothing)                        == vertex x
   induceJust . gmap Just                                    == id
   induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
   

9. induceJust :: Graph (Maybe a) -> Graph a

   algebraic-graphs	Algebra.Graph.Undirected

   Construct the induced subgraph of a given graph by removing the vertices that are Nothing. Complexity: O(s) time, memory and size.

   induceJust (vertex Nothing)                               == empty
   induceJust (edge (Just x) Nothing)                        == vertex x
   induceJust . fmap Just                                    == id
   induceJust . fmap (\x -> if p x then Just x else Nothing) == induce p
   

10. endsJust :: (HasCallStack, Show a, Eq a) => IO (Maybe a) -> a -> Expectation

    benri-hspec	Test.Hspec.Benri

    action `endsJust` expected sets the expectation that action returns Just expected.

    Example

    >>> pure (readMaybe "1" :: Maybe Int) `endsJust` 1
    

Page 71 of many | Previous | Next