| Copyright | Copyright (c) 1998-1999, 2008 Chris Okasaki |
|---|---|
| License | MIT; see COPYRIGHT file for terms and conditions |
| Maintainer | robdockins AT fastmail DOT fm |
| Stability | stable |
| Portability | GHC, Hugs (MPTC and FD) |
| Safe Haskell | None |
| Language | Haskell2010 |
Data.Edison.Coll.LazyPairingHeap
Contents
Description
Lazy Paring Heaps
References:
- Chris Okasaki. Purely Functional Data Structures. 1998. Section 6.5.
- data Heap a
- empty :: Heap a
- singleton :: a -> Heap a
- fromSeq :: (Ord a, Sequence seq) => seq a -> Heap a
- insert :: Ord a => a -> Heap a -> Heap a
- insertSeq :: (Ord a, Sequence seq) => seq a -> Heap a -> Heap a
- union :: Ord a => Heap a -> Heap a -> Heap a
- unionSeq :: (Ord a, Sequence seq) => seq (Heap a) -> Heap a
- delete :: Ord a => a -> Heap a -> Heap a
- deleteAll :: Ord a => a -> Heap a -> Heap a
- deleteSeq :: (Ord a, Sequence seq) => seq a -> Heap a -> Heap a
- null :: Heap a -> Bool
- size :: Heap a -> Int
- member :: Ord a => a -> Heap a -> Bool
- count :: Ord a => a -> Heap a -> Int
- strict :: Heap a -> Heap a
- structuralInvariant :: Heap a -> Bool
- toSeq :: Sequence seq => Heap a -> seq a
- lookup :: Ord a => a -> Heap a -> a
- lookupM :: (Ord a, Monad m) => a -> Heap a -> m a
- lookupAll :: (Ord a, Sequence seq) => a -> Heap a -> seq a
- lookupWithDefault :: Ord a => a -> a -> Heap a -> a
- fold :: (a -> b -> b) -> b -> Heap a -> b
- fold' :: (a -> b -> b) -> b -> Heap a -> b
- fold1 :: (a -> a -> a) -> Heap a -> a
- fold1' :: (a -> a -> a) -> Heap a -> a
- filter :: Ord a => (a -> Bool) -> Heap a -> Heap a
- partition :: Ord a => (a -> Bool) -> Heap a -> (Heap a, Heap a)
- strictWith :: (a -> b) -> Heap a -> Heap a
- deleteMin :: Ord a => Heap a -> Heap a
- deleteMax :: Ord a => Heap a -> Heap a
- unsafeInsertMin :: Ord a => a -> Heap a -> Heap a
- unsafeInsertMax :: Ord a => a -> Heap a -> Heap a
- unsafeFromOrdSeq :: (Ord a, Sequence seq) => seq a -> Heap a
- unsafeAppend :: Ord a => Heap a -> Heap a -> Heap a
- filterLT :: Ord a => a -> Heap a -> Heap a
- filterLE :: Ord a => a -> Heap a -> Heap a
- filterGT :: Ord a => a -> Heap a -> Heap a
- filterGE :: Ord a => a -> Heap a -> Heap a
- partitionLT_GE :: Ord a => a -> Heap a -> (Heap a, Heap a)
- partitionLE_GT :: Ord a => a -> Heap a -> (Heap a, Heap a)
- partitionLT_GT :: Ord a => a -> Heap a -> (Heap a, Heap a)
- minView :: (Ord a, Monad m) => Heap a -> m (a, Heap a)
- minElem :: Heap a -> a
- maxView :: (Ord a, Monad m) => Heap a -> m (a, Heap a)
- maxElem :: Ord a => Heap a -> a
- foldr :: Ord a => (a -> b -> b) -> b -> Heap a -> b
- foldr' :: Ord a => (a -> b -> b) -> b -> Heap a -> b
- foldl :: Ord a => (b -> a -> b) -> b -> Heap a -> b
- foldl' :: Ord a => (b -> a -> b) -> b -> Heap a -> b
- foldr1 :: Ord a => (a -> a -> a) -> Heap a -> a
- foldr1' :: Ord a => (a -> a -> a) -> Heap a -> a
- foldl1 :: Ord a => (a -> a -> a) -> Heap a -> a
- foldl1' :: Ord a => (a -> a -> a) -> Heap a -> a
- toOrdSeq :: (Ord a, Sequence seq) => Heap a -> seq a
- unsafeMapMonotonic :: (Ord a, Ord b) => (a -> b) -> Heap a -> Heap b
- moduleName :: String
Type of pairing heaps
Instances
| Ord a => Eq (Heap a) Source | |
| Ord a => Ord (Heap a) Source | |
| (Ord a, Read a) => Read (Heap a) Source | |
| (Ord a, Show a) => Show (Heap a) Source | |
| (Ord a, Arbitrary a) => Arbitrary (Heap a) Source | |
| (Ord a, CoArbitrary a) => CoArbitrary (Heap a) Source | |
| Ord a => Monoid (Heap a) Source | |
| Ord a => CollX (Heap a) a Source | |
| Ord a => OrdCollX (Heap a) a Source | |
| Ord a => Coll (Heap a) a Source | |
| Ord a => OrdColl (Heap a) a Source |
CollX operations
structuralInvariant :: Heap a -> Bool Source
Coll operations
lookupWithDefault :: Ord a => a -> a -> Heap a -> a Source
strictWith :: (a -> b) -> Heap a -> Heap a Source
OrdCollX operations
unsafeInsertMin :: Ord a => a -> Heap a -> Heap a Source
unsafeInsertMax :: Ord a => a -> Heap a -> Heap a Source
unsafeFromOrdSeq :: (Ord a, Sequence seq) => seq a -> Heap a Source