dequeue 0.1.10 → 0.1.11

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.10+Version: 0.1.11 Cabal-Version: >= 1.9.2 Synopsis: A typeclass and an implementation for double-ended queues. Description:

@@ -341,7 +341,7 @@  -- | Validates that a 'BankersDequeue' remains balanced despite repeated --   pops from the front.-prop_pop_front_bq_balance :: BankersDequeue Int -> Int -> Gen Prop+prop_pop_front_bq_balance :: BankersDequeue Int -> Int -> Property prop_pop_front_bq_balance q count = count < qcLimit ==>     let pop queue _ = (fromJustDef queue . liftM snd . popFront) queue         q' = foldl pop q [0 .. count] in@@ -349,7 +349,7 @@  -- | Validates that a 'BankersDequeue' remains balanced despite repeated --   pops from the back.-prop_pop_back_bq_balance :: BankersDequeue Int -> Int -> Gen Prop+prop_pop_back_bq_balance :: BankersDequeue Int -> Int -> Property prop_pop_back_bq_balance q count = count < qcLimit ==>     let pop queue _ = (fromJustDef queue . liftM snd . popBack) queue         q' = foldl pop q [0 .. count] in