Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. runDeleteReturningList :: (MonadBeam be m, BeamSqlBackendSyntax be ~ SqliteCommandSyntax, FromBackendRow be a) => SqliteDeleteReturning a -> m [a]

   beam-sqlite	Database.Beam.Sqlite.Connection

   No documentation available.

2. runInsertReturningList :: (MonadBeam be m, BeamSqlBackendSyntax be ~ SqliteCommandSyntax, FromBackendRow be a) => SqliteInsertReturning a -> m [a]

   beam-sqlite	Database.Beam.Sqlite.Connection

   Runs a SqliteInsertReturning statement and returns a result for each inserted row.

3. runUpdateReturningList :: (MonadBeam be m, BeamSqlBackendSyntax be ~ SqliteCommandSyntax, FromBackendRow be a) => SqliteUpdateReturning a -> m [a]

   beam-sqlite	Database.Beam.Sqlite.Connection

   Use in conjunction with updateReturning.

4. fromList :: DomCodCnt l r => [(Dom l, Dom r)] -> Bimap l r

   bimaps	Data.Bijection.Class

   Given a list of pairs [(x,y)], turn it into a bimap (x->y, y->x).

5. fromListDC :: DomCod z => [(Dom z, Cod z)] -> z

   bimaps	Data.Bijection.Class

   No documentation available.

6. toList :: DomCodCnt l r => Bimap l r -> [(Dom l, Dom r)]

   bimaps	Data.Bijection.Class

   No documentation available.

7. toListDC :: DomCod z => z -> [(Dom z, Cod z)]

   bimaps	Data.Bijection.Class

   No documentation available.

8. module Data.BinaryList

   Binary lists are lists whose number of elements is a power of two. This data structure is efficient for some computations like:

   • Splitting a list in half.
   • Appending two lists of the same length.
   • Extracting an element from the list.
   All the functions exported are total except for fromListWithDefault. It is impossible for the user of this library to create a binary list whose length is not a power of two. Since many names in this module clash with the names of some Prelude functions, you probably want to import this module this way:

   import Data.BinaryList (BinList,Exponent)
   import qualified Data.BinaryList as BL
   

   Remember that binary lists are an instance of the Foldable and Traversable classes. If you are missing a function here, look for functions using those instances. Note that some functions like replicate, generate, or take, don't use the length of the list as argument, but the exponent of its length expressed as a power of two. Throughout this document, this is referred as the length exponent. For example, if the list has length 16, its length exponent is 4 since 2^4 = 16. Therefore replicate 4 0 will create a list with 16 zeroes. Keep this in mind when using this library. Note as well that this implies that there is no need to check that the length argument is or is not a power of two.

9. data BinList a

   binary-list	Data.BinaryList

   A binary list is a list containing a power of two elements. Note that a binary list is never empty because it has at least 2^0 = 1 element.

10. fromList :: [a] -> Maybe (BinList a)

    binary-list	Data.BinaryList

    O(n). Build a binary list from a linked list. If the input list has length different from a power of two, it returns Nothing.

Page 185 of many | Previous | Next