dequeue 0.1.8 → 0.1.9

raw patch · 2 files changed

+3/−3 lines, 2 files

Files

• dequeue.cabal +1/−1
• src/Data/Dequeue.hs +2/−2

@@ -1,7 +1,7 @@ Build-Type: Simple Name: dequeue Category: Data Structures-Version: 0.1.8+Version: 0.1.9 Cabal-Version: >= 1.2 Synopsis: A typeclass and an implementation for double-ended queues. Description:

@@ -325,7 +325,7 @@  -- | Validates that a 'BankersDequeue' remains balanced despite repeated --   pushes to the front.-prop_push_front_bq_balance :: BankersDequeue Int -> Int -> Gen Prop+prop_push_front_bq_balance :: BankersDequeue Int -> Int -> Property prop_push_front_bq_balance q count = count < qcLimit ==>     let push queue _ = pushFront queue 0         q' = foldl push q [0 .. count] in@@ -333,7 +333,7 @@  -- | Validates that a 'BankersDequeue' remains balanced despite repeated --   pushes to the back.-prop_push_back_bq_balance :: BankersDequeue Int -> Int -> Gen Prop+prop_push_back_bq_balance :: BankersDequeue Int -> Int -> Property prop_push_back_bq_balance q count = count < qcLimit ==>     let push queue _ = pushBack queue 0         q' = foldl push q [0 .. count] in