Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

  1. singleton :: (Bits w, Enum a) => a -> EnumSet w a

    bitwise-enum Data.Enum.Set.Base

    O(1). A set of one element.

  2. singleton :: (a -> [Hash]) -> Int -> a -> Bloom a

    bloomfilter Data.BloomFilter

    Create a Bloom filter with a single element. This function is subject to fusion with insert and insertList.

  3. singleton :: Enum a => a -> T a

    board-games Game.Mastermind.NonEmptyEnumSet

    No documentation available.

  4. singleton :: Int -> a -> BQueue a

    bounded-queue Data.Queue.Bounded

    Given a limit value and an initial value, yield a singleton BQueue.

  5. singleton :: ByteString -> a -> Trie a

    bytestring-trie Data.Trie

    Construct a singleton trie.

  6. singleton :: ByteString -> a -> Trie a

    bytestring-trie Data.Trie.Internal

    Construct a singleton trie.

  7. singleton :: Typeable bean => bean -> Beans

    cauldron Cauldron.Beans

    No documentation available.

  8. singleton :: Uniquable a => a -> b -> UniqMap b

    clash-lib Clash.Data.UniqMap

    A map containing a single value indexed by the given key's unique.

  9. singleton :: Storable a => a -> Array () a

    comfort-blas Numeric.BLAS.Vector 

    \x  ->  Array.singleton x ! () == (x::Word16)

  10. singleton :: Integer -> IntegerInterval

    data-interval Data.IntegerInterval

    singleton set [x,x]

Page 30 of many | Previous | Next