Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. unifiedOffset :: (Indexed sh, Checking check) => sh -> Index sh -> Result check Int

    comfort-array Data.Array.Comfort.Shape

    No documentation available.

  2. unifiedSizeOffset :: (Indexed sh, Checking check) => sh -> (Int, Index sh -> Result check Int)

    comfort-array Data.Array.Comfort.Shape

    No documentation available.

  3. takeIntSet :: (Indexed sh, Index sh ~ Int, Storable a) => IntSet -> Array sh a -> Array IntSet a

    comfort-array Data.Array.Comfort.Storable 

    >>> Array.takeIntSet (IntSet.fromList [0,2,4,7,13]) (Array.vectorFromList [3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3::Word8])
StorableArray... (... [0,2,4,7,13]) [3,4,5,6,7]

  4. takeSet :: (Indexed sh, Index sh ~ ix, Ord ix, Storable a) => Set ix -> Array sh a -> Array (Set ix) a

    comfort-array Data.Array.Comfort.Storable 

    >>> Array.takeSet (Set.fromList [0,2,4,7,13]) (Array.vectorFromList [3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3::Word8])
StorableArray... (... [0,2,4,7,13]) [3,4,5,6,7]

  5. Format_Tz_Offset :: TimeFormatElem

    hourglass Data.Hourglass

    timeoffset in minutes

  6. localTimeSetTimezone :: Time t => TimezoneOffset -> LocalTime t -> LocalTime t

    hourglass Data.Hourglass

    Change the timezone, and adjust the local value to represent the new local value.

  7. timezoneOffset :: Timezone tz => tz -> Int

    hourglass Data.Hourglass

    offset in minutes from UTC. valid values should be between -12*60 to +14*60

  8. type family CollapseTo (h :: k -> Type -> l -> Type) x

    sop-core Data.SOP

    Maps products to lists, and sums to identities.

  9. type family CollapseTo (h :: k -> Type -> l -> Type) x

    sop-core Data.SOP.Classes

    Maps products to lists, and sums to identities.

  10. voronoiSet :: Node -> Voronoi b -> [Node]

    fgl Data.Graph.Inductive.Query.GVD

    Return the nodes reachable to/from (depending on how the Voronoi was constructed) from the specified root node (if the specified node is not one of the root nodes of the shortest path forest, an empty list will be returned).

Page 99 of many | Previous | Next