Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. fromListPrefix :: forall (n :: Nat) a . SNatI n => [a] -> Maybe (Vec n a)

    vec Data.Vec.DataFamily.SpineStrict

    Convert list [a] to Vec n a. Returns Nothing if input list is too short.

    >>> fromListPrefix "foo" :: Maybe (Vec N.Nat3 Char)
    Just ('f' ::: 'o' ::: 'o' ::: VNil)
    
    >>> fromListPrefix "quux" :: Maybe (Vec N.Nat3 Char)
    Just ('q' ::: 'u' ::: 'u' ::: VNil)
    
    >>> fromListPrefix "xy" :: Maybe (Vec N.Nat3 Char)
    Nothing
    

  2. reifyList :: [a] -> (forall (n :: Nat) . SNatI n => Vec n a -> r) -> r

    vec Data.Vec.DataFamily.SpineStrict

    Reify any list [a] to Vec n a.

    >>> reifyList "foo" length
    3
    

  3. toList :: forall (n :: Nat) a . SNatI n => Vec n a -> [a]

    vec Data.Vec.DataFamily.SpineStrict

    Convert Vec to list.

    >>> toList $ 'f' ::: 'o' ::: 'o' ::: VNil
    "foo"
    

  4. fromList :: forall (n :: Nat) a . SNatI n => [a] -> Maybe (Vec n a)

    vec Data.Vec.Lazy

    Convert list [a] to Vec n a. Returns Nothing if lengths don't match exactly.

    >>> fromList "foo" :: Maybe (Vec N.Nat3 Char)
    Just ('f' ::: 'o' ::: 'o' ::: VNil)
    
    >>> fromList "quux" :: Maybe (Vec N.Nat3 Char)
    Nothing
    
    >>> fromList "xy" :: Maybe (Vec N.Nat3 Char)
    Nothing
    

  5. fromListPrefix :: forall (n :: Nat) a . SNatI n => [a] -> Maybe (Vec n a)

    vec Data.Vec.Lazy

    Convert list [a] to Vec n a. Returns Nothing if input list is too short.

    >>> fromListPrefix "foo" :: Maybe (Vec N.Nat3 Char)
    Just ('f' ::: 'o' ::: 'o' ::: VNil)
    
    >>> fromListPrefix "quux" :: Maybe (Vec N.Nat3 Char)
    Just ('q' ::: 'u' ::: 'u' ::: VNil)
    
    >>> fromListPrefix "xy" :: Maybe (Vec N.Nat3 Char)
    Nothing
    

  6. reifyList :: [a] -> (forall (n :: Nat) . SNatI n => Vec n a -> r) -> r

    vec Data.Vec.Lazy

    Reify any list [a] to Vec n a.

    >>> reifyList "foo" length
    3
    

  7. toList :: forall (n :: Nat) a . Vec n a -> [a]

    vec Data.Vec.Lazy

    Convert Vec to list.

    >>> toList $ 'f' ::: 'o' ::: 'o' ::: VNil
    "foo"
    

  8. fromList :: forall (n :: Nat) a . SNatI n => [a] -> Maybe (Vec n a)

    vec Data.Vec.Lazy.Inline

    Convert list [a] to Vec n a. Returns Nothing if lengths don't match exactly.

    >>> fromList "foo" :: Maybe (Vec N.Nat3 Char)
    Just ('f' ::: 'o' ::: 'o' ::: VNil)
    
    >>> fromList "quux" :: Maybe (Vec N.Nat3 Char)
    Nothing
    
    >>> fromList "xy" :: Maybe (Vec N.Nat3 Char)
    Nothing
    

  9. fromListPrefix :: forall (n :: Nat) a . SNatI n => [a] -> Maybe (Vec n a)

    vec Data.Vec.Lazy.Inline

    Convert list [a] to Vec n a. Returns Nothing if input list is too short.

    >>> fromListPrefix "foo" :: Maybe (Vec N.Nat3 Char)
    Just ('f' ::: 'o' ::: 'o' ::: VNil)
    
    >>> fromListPrefix "quux" :: Maybe (Vec N.Nat3 Char)
    Just ('q' ::: 'u' ::: 'u' ::: VNil)
    
    >>> fromListPrefix "xy" :: Maybe (Vec N.Nat3 Char)
    Nothing
    

  10. reifyList :: [a] -> (forall (n :: Nat) . SNatI n => Vec n a -> r) -> r

    vec Data.Vec.Lazy.Inline

    Reify any list [a] to Vec n a.

    >>> reifyList "foo" length
    3
    

Page 230 of many | Previous | Next