Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

Exact lookup

1. id :: Match -> Text

   pinecone	Pinecone.Search

   No documentation available.

2. id :: UpdateVector -> Text

   pinecone	Pinecone.Vectors

   No documentation available.

3. id :: Record -> Text

   pinecone	Pinecone.Vectors

   No documentation available.

4. id :: VectorObject -> Text

   pinecone	Pinecone.Vectors

   No documentation available.

5. id :: Attribute -> CompressedWord

   rattletrap	Rattletrap.Type.Attribute

   No documentation available.

6. id :: CustomDemolish -> I32

   rattletrap	Rattletrap.Type.Attribute.CustomDemolish

   No documentation available.

7. id :: RBool -> RBool

   rec-def	Data.Recursive.Bool

   The identity function. This is useful when tying the knot, to avoid a loop that bottoms out:

   let x = x in RB.get x
   

   will not work, but

   >>> let x = RB.id x in RB.get x
   False
   

   does.

   RB.get (RB.id r) === RB.get r
   

8. id :: RDualBool -> RDualBool

   rec-def	Data.Recursive.DualBool

   The identity function. This is useful when tying the knot, to avoid a loop that bottoms out:

   let x = x in RDB.get x
   

   will not work, but

   >>> let x = RDB.id x in RDB.get x
   True
   

   does. | prop> RDB.get (RDB.id r) === RDB.get r

9. id :: RSet a -> RSet a

   rec-def	Data.Recursive.Set

   The identity function. This is useful when tying the knot, to avoid a loop that bottoms out:

   let x = x in RS.get x
   

   will not work, but

   >>> let x = RS.id x in RS.get x
   fromList []
   

   does. | prop> RS.get (RS.id s) === RS.get s

10. id :: Sort2 a -> Int8

    rhythmic-sequences	Rhythmicity.MarkerSeqs

    No documentation available.

Page 16 of many | Previous | Next