Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. nameWidth :: Int

   elynx-seq	ELynx.Sequence.Defaults

   Space reserved for sequence names when printing them.

2. midpoint :: Default a => Topology a -> Either String (Topology a)

   elynx-tree	ELynx.Topology.Phylogeny

   Root topology at the midpoint. See midpoint. Use depth to measure topology height. If the midpoint is ambiguous because the sum of the left and right depths is odd, the depth of the left sub-topology will be set to be one node greater than the one of the right sub-topology.

3. midpoint :: (Semigroup e, Splittable e, HasLength e, Default a) => Tree e a -> Either String (Tree e a)

   elynx-tree	ELynx.Tree.Phylogeny

   Root tree at midpoint. Branches are connected and split according to the provided Semigroup and Splittable instances. Return Left if

   • the root node is a leaf;
   • the root node has degree two.

4. isValidPath :: Tree e a -> Path -> Bool

   elynx-tree	ELynx.Tree.Zipper

   Check if a path is valid in that it leads to a node on a tree.

5. forMonoid :: Monoid i => (i -> IO ()) -> Args i i

   fold-debounce	Control.FoldDebounce

   Args for monoids. Input events are appended to the tail.

6. forVoid :: IO () -> Args i ()

   fold-debounce	Control.FoldDebounce

   Args that discards input events. Although input events are not folded, they still start the timer and activate the callback.

7. package genvalidity-aeson

   GenValidity support for aeson GenValidity support for aeson

8. package genvalidity-hspec-aeson

   Standard spec's for aeson-related instances Standard spec's for aeson-related instances

9. package genvalidity-sydtest-aeson

   Standard spec's for aeson-related instances in sydtest Standard spec's for aeson-related instances in sydtest

10. type FutureId = Word64

    ghc-events	GHC.RTS.Events

    No documentation available.

Page 1360 of many | Previous | Next