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. valid :: NEIntSet -> Bool

   nonempty-containers	Data.IntSet.NonEmpty.Internal

   O(n). Test if the internal set structure is valid.

2. valid :: Ord k => NEMap k a -> Bool

   nonempty-containers	Data.Map.NonEmpty

   O(n). Test if the internal map structure is valid.

3. valid :: Ord k => NEMap k a -> Bool

   nonempty-containers	Data.Map.NonEmpty.Internal

   O(n). Test if the internal map structure is valid.

4. valid :: Ord a => NESet a -> Bool

   nonempty-containers	Data.Set.NonEmpty

   O(n). Test if the internal set structure is valid.

5. valid :: Ord a => NESet a -> Bool

   nonempty-containers	Data.Set.NonEmpty.Internal

   O(n). Test if the internal set structure is valid.

6. type family Grid s

   numhask-space	NumHask.Space

   the type that divides or quotients the space

7. MidPos :: Pos

   numhask-space	NumHask.Space

   use the mid-point of the space

8. grid :: FieldSpace s => Pos -> s -> Grid s -> [Element s]

   numhask-space	NumHask.Space

   create equally-spaced elements across a space

9. gridSpace :: FieldSpace s => s -> Grid s -> [s]

   numhask-space	NumHask.Space

   create equally-spaced spaces from a space

10. mid :: (Space s, Field (Element s)) => s -> Element s

    numhask-space	NumHask.Space

    middle element of the space

Page 1319 of many | Previous | Next