Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

Exact lookup

1. Erts_internal'map_to_tuple_keys :: Erts_internal'map_to_tuple_keys

   codec-beam	Codec.Beam.Bifs

   No documentation available.

2. get_map_elements :: IsSource a2 => Label -> a2 -> [(Source, Register)] -> Op

   codec-beam	Codec.Beam.Instructions

   Get multiple values out of a map

3. has_map_fields :: IsSource a2 => Label -> a2 -> [Source] -> Op

   codec-beam	Codec.Beam.Instructions

   No documentation available.

4. is_map :: IsSource a2 => Label -> a2 -> Op

   codec-beam	Codec.Beam.Instructions

   No documentation available.

5. put_map_assoc :: (IsSource a2, IsRegister a3) => Label -> a2 -> a3 -> [(Source, Source)] -> Op

   codec-beam	Codec.Beam.Instructions

   No documentation available.

6. put_map_exact :: (IsSource a2, IsRegister a3) => Label -> a2 -> a3 -> [(Source, Source)] -> Op

   codec-beam	Codec.Beam.Instructions

   No documentation available.

7. foldMap :: (C sh, Storable a, Ord a, Semigroup m) => (a -> m) -> Array sh a -> m

   comfort-blas	Numeric.BLAS.Vector

   No documentation available.

8. defaultEdgeFoldMap :: (Edge edge, Monoid a) => edge a -> a

   comfort-graph	Data.Graph.Comfort

   No documentation available.

9. fromMap :: (Edge e, Ord n) => Map n nl -> Map (e n) el -> Graph e n el nl

   comfort-graph	Data.Graph.Comfort

   \(TestGraph gr) -> gr === Graph.fromMap (Graph.nodeLabels gr) (Graph.edgeLabels gr)
   

10. graphMap :: Graph edge node edgeLabel nodeLabel -> Map node (InOutMap edge node edgeLabel nodeLabel)

    comfort-graph	Data.Graph.Comfort

    No documentation available.

Page 1140 of many | Previous | Next