Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. listBits :: Vector Bit -> [Int]

   bitvec	Data.Bit.ThreadSafe

   Return 0-based indices of set bits in a vector.

   >>> :set -XOverloadedLists
   
   >>> listBits [1,1,0,1,0,1]
   [0,1,3,5]
   

2. listArray :: Ix i => (i, i) -> [Bool] -> BitArray i

   bitwise	Data.Array.BitArray

   Create an array from a list of elements.

3. listCs :: forall (m :: Type -> Type) . DataDef m -> [C]

   boltzmann-samplers	Boltzmann.Data.Oracle

   dd ? (listCs dd !! i) = i
   

4. listWithSeparator :: IsList l => Text -> (Text -> Either String (Item l)) -> Text -> Either String l

   config-ini	Data.Ini.Config

   Convert a reader for a value into a reader for a list of those values, separated by a chosen separator. This will split apart the string on that separator, get rid of leading and trailing whitespace on the individual chunks, and then attempt to parse each of them according to the function provided, turning the result into a list. This is overloaded with the IsList typeclass, so it can be used transparently to parse other list-like types.

   >>> listWithSeparator "," number "2, 3, 4" :: Either String [Int]
   Right [2,3,4]
   
   >>> listWithSeparator " " number "7 8 9" :: Either String [Int]
   Right [7,8,9]
   
   >>> listWithSeparator ":" string "/bin:/usr/bin" :: Either String [FilePath]
   Right ["/bin","/usr/bin"]
   
   >>> listWithSeparator "," number "7 8 9" :: Either String [Int]
   Left "Unable to parse \"7 8 9\" as a value of type Int"
   

5. listWithSeparator :: IsList l => Text -> FieldValue (Item l) -> FieldValue l

   config-ini	Data.Ini.Config.Bidir

   Represents a field whose value is a sequence of other values which are delimited by a given string, and whose individual values are described by another FieldValue value. This uses GHC's IsList typeclass to convert back and forth between sequence types.

6. listFDiv :: forall (f :: Type -> Type) x . ListF f x -> Div f x

   functor-combinators	Data.Functor.Contravariant.Divisible.Free

   Div is isomorphic to ListF for contravariant f. This witnesses one way of that isomorphism.

7. listToTuple :: ListTuple tuple tuple' as bs => HList as -> tuple

   generic-lens-core	Data.Generics.Product.Internal.HList

   No documentation available.

8. listValues :: Values -> [Value]

   registry	Data.Registry.Internal.Types

   Return values as a list

9. listArray :: (SymVal a, SymVal b) => [(a, b)] -> b -> SArray a b

   sbv	Data.SBV

   Turn a constant association-list and a default into a symbolic array.

10. listToListAt :: SymVal a => SList a -> SInteger -> SList a

    sbv	Data.SBV.List

    listToListAt l offset. List of length 1 at offset in l. Unspecified if index is out of bounds.

    >>> prove $ \(l1 :: SList Integer) l2 -> listToListAt (l1 ++ l2) (length l1) .== listToListAt l2 0
    Q.E.D.
    
    >>> sat $ \(l :: SList Word16) -> length l .>= 2 .&& listToListAt l 0 ./= listToListAt l (length l - 1)
    Satisfiable. Model:
    s0 = [0,64] :: [Word16]
    

Page 26 of many | Previous | Next