Safe Haskell | None |
---|---|
Language | GHC2021 |
Test.Credit.Heap.Binomial
Documentation
rev :: MonadCredit m => [a] -> [a] -> m [a] Source #
removeMinTree :: (MonadCredit m, Ord a) => [Tree a] -> m (Tree a, [Tree a]) Source #
data Binomial a (m :: Type -> Type) Source #
Instances
BoundedHeap Binomial Source # | |
Heap Binomial Source # | |
Defined in Test.Credit.Heap.Binomial Methods empty :: MonadCredit m => m (Binomial a m) Source # insert :: (MonadCredit m, Ord a) => a -> Binomial a m -> m (Binomial a m) Source # merge :: (MonadCredit m, Ord a) => Binomial a m -> Binomial a m -> m (Binomial a m) Source # splitMin :: (MonadCredit m, Ord a) => Binomial a m -> m (Maybe (a, Binomial a m)) Source # | |
(MonadMemory m, MemoryCell m a) => MemoryCell m (Binomial a m) Source # | |
Defined in Test.Credit.Heap.Binomial Methods prettyCell :: Binomial a m -> m Memory Source # | |
Pretty a => MemoryStructure (Binomial (PrettyCell a)) Source # | |
Defined in Test.Credit.Heap.Binomial Methods prettyStructure :: MonadMemory m => Binomial (PrettyCell a) m -> m Memory Source # |