Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

  1. (&.?) :: forall (key :: Symbol) (kvs :: [Type]) v f . (KnownSymbol key, HasKey key kvs v, Functor f) => f (KVList kvs) -> ListKey key -> f v

    type-level-kv-list Data.KVList

    Helper operator for optional chain.

    (&.?) mkvs k = fmap (&. k) mkvs
    
    >>> import Data.KVList ((&.?))
    
    >>> :{
    ( KVList.empty
    &= #foo := Just
    (KVList.empty
    &= #bar := "bar"
    )
    ) &. #foo &.? #bar
    :}
    Just "bar"
    

  2. (&.??) :: forall (key :: Symbol) (kvs :: [Type]) m v . (KnownSymbol key, HasKey key kvs (m v), Monad m) => m (KVList kvs) -> ListKey key -> m v

    type-level-kv-list Data.KVList

    Helper operator for optional chain.

    (&.??) mkvs k = (&. k) =<< mkvs
    
    >>> import Data.KVList ((&.??))
    
    >>> :{
    ( KVList.empty
    &= #foo := Just
    (KVList.empty
    &= #bar := Just "bar"
    )
    ) &. #foo &.?? #bar
    :}
    Just "bar"
    

  3. ($.//) :: Cursor node -> (Cursor node -> [a]) -> [a]

    xml-indexed-cursor Text.XML.Cursor.Indexed

    Apply an axis to a 'Cursor node' as well as its descendants.

  4. (&.//) :: Axis node -> (Cursor node -> [a]) -> Cursor node -> [a]

    xml-indexed-cursor Text.XML.Cursor.Indexed

    Combine two axes so that the second works on both the result nodes, and their descendants.

  5. (<.>) :: Vec -> Vec -> R

    LPFP-core LPFPCore

    Dot product of two vectors.

  6. (<.>) :: Vec -> Vec -> R

    LPFP-core LPFPCore.SimpleVec

    Dot product of two vectors.

  7. (*.) :: RightModule r m => m -> r -> m

    algebra Numeric.Algebra

    No documentation available.

  8. (*.) :: RightModule r m => m -> r -> m

    algebra Numeric.Algebra.Class

    No documentation available.

  9. (*.) :: RightModule r m => m -> r -> m

    algebra Numeric.Module.Class

    No documentation available.

  10. (!.) :: Integral ix => BV -> ix -> Bool

    bv Data.BitVector

    Reverse bit-indexing. Index starting from the most significant bit.

    u !. i == u @. (size u - i - 1)
    
    >>> [3]3 !. 0
    False
    

Page 154 of many | Previous | Next