Home
last modified time | relevance | path

Searched refs:removeMin (Results 1 – 25 of 225) sorted by relevance

123456789

/dports/math/py-cryptominisat/cryptominisat-5.8.0/tests/
H A Dheap_test.cpp55 EXPECT_EQ(heap.removeMin(), 1); in TEST()
56 EXPECT_EQ(heap.removeMin(), 2); in TEST()
67 EXPECT_EQ(heap.removeMin(), 1); in TEST()
68 EXPECT_EQ(heap.removeMin(), 2); in TEST()
69 EXPECT_EQ(heap.removeMin(), 3); in TEST()
82 EXPECT_EQ(heap.removeMin(), i); in TEST()
/dports/math/cryptominisat/cryptominisat-5.8.0/tests/
H A Dheap_test.cpp55 EXPECT_EQ(heap.removeMin(), 1); in TEST()
56 EXPECT_EQ(heap.removeMin(), 2); in TEST()
67 EXPECT_EQ(heap.removeMin(), 1); in TEST()
68 EXPECT_EQ(heap.removeMin(), 2); in TEST()
69 EXPECT_EQ(heap.removeMin(), 3); in TEST()
82 EXPECT_EQ(heap.removeMin(), i); in TEST()
/dports/lang/zig-devel/zig-0.9.0/lib/std/
H A Dpriority_dequeue.zig164 pub fn removeMin(self: *Self) T {
477 try expectEqual(@as(u32, 7), queue.removeMin());
542 try expectEqual(@as(u32, 1), queue.removeMin());
543 try expectEqual(@as(u32, 1), queue.removeMin());
641 try expectEqual(e, queue.removeMin());
667 try expectEqual(e, queue.removeMin());
699 try expectEqual(items[0], queue.removeMin());
711 try expectEqual(e, queue.removeMin());
818 try expectEqual(queue.removeMin(), 1);
819 try expectEqual(queue.removeMin(), 3);
[all …]
/dports/lang/zig/zig-0.9.0/lib/std/
H A Dpriority_dequeue.zig164 pub fn removeMin(self: *Self) T {
477 try expectEqual(@as(u32, 7), queue.removeMin());
542 try expectEqual(@as(u32, 1), queue.removeMin());
543 try expectEqual(@as(u32, 1), queue.removeMin());
641 try expectEqual(e, queue.removeMin());
667 try expectEqual(e, queue.removeMin());
699 try expectEqual(items[0], queue.removeMin());
711 try expectEqual(e, queue.removeMin());
818 try expectEqual(queue.removeMin(), 1);
819 try expectEqual(queue.removeMin(), 3);
[all …]
/dports/net-im/matterhorn/matterhorn-50200.13.0/_cabal_deps/QuickCheck-2.14.1/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
/dports/finance/hs-hledger-ui/hledger-ui-1.19/_cabal_deps/QuickCheck-2.14.2/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
H A DHeap.hs44 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
45 removeMin Empty = Nothing function
46 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
111 case removeMin h of
/dports/devel/hs-hoogle/hoogle-5.0.18.2/_cabal_deps/QuickCheck-2.14/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
H A DHeap.hs44 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
45 removeMin Empty = Nothing function
46 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
111 case removeMin h of
/dports/devel/hs-ShellCheck/ShellCheck-0.8.0/_cabal_deps/QuickCheck-2.14.2/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
H A DHeap.hs44 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
45 removeMin Empty = Nothing function
46 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
111 case removeMin h of
/dports/devel/hs-git-brunch/git-brunch-1.5.1.0/_cabal_deps/QuickCheck-2.14.2/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
H A DHeap.hs44 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
45 removeMin Empty = Nothing function
46 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
111 case removeMin h of
/dports/devel/hs-mueval/mueval-0.9.3/_cabal_deps/QuickCheck-2.14/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
H A DHeap.hs44 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
45 removeMin Empty = Nothing function
46 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
111 case removeMin h of
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/QuickCheck-2.14.2/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
H A DHeap.hs44 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
45 removeMin Empty = Nothing function
46 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
111 case removeMin h of
/dports/devel/hs-git-annex/git-annex-8.20210903/_cabal_deps/QuickCheck-2.14/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
/dports/security/hs-cryptol/cryptol-2.11.0/_cabal_deps/QuickCheck-2.14.2/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
H A DHeap.hs44 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
45 removeMin Empty = Nothing function
46 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
111 case removeMin h of
/dports/www/hs-postgrest/postgrest-8.0.0/_cabal_deps/QuickCheck-2.14.2/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
H A DHeap.hs44 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
45 removeMin Empty = Nothing function
46 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
111 case removeMin h of
/dports/misc/hs-hascard/hascard-0.3.0.1/_cabal_deps/QuickCheck-2.14.2/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
/dports/textproc/hs-pandoc-crossref/pandoc-crossref-0.3.12.0/_cabal_deps/QuickCheck-2.14.2/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))
/dports/textproc/hs-pandoc/pandoc-2.14.2/_cabal_deps/QuickCheck-2.14.2/examples/
H A DHeap_ProgramAlgebraic.hs50 removeMin :: Ord a => Heap a -> Maybe (a, Heap a)
51 removeMin Nil = Nothing function
52 removeMin (Node x h1 h2) = Just (x, h1 `merge` h2) function
93 safeRemoveMin h = case removeMin h of
203 removeMin (empty :: Heap OrdA) == Nothing
206 removeMin (insert x empty :: Heap OrdA) == Just (x, empty)
209 removeMin (insert x (insert y h)) ==~
210 (insert (max x y) `maph` removeMin (insert (min x y) h))

123456789