- Implement CS2 min-cost-flow adaptor and generalize common min-cost-flow stuff

[match/match.git] / program / ArrayStuff.hs

diff --git a/program/ArrayStuff.hs b/program/ArrayStuff.hs
index abf14c7..8fcced9 100644 (file)
--- a/program/ArrayStuff.hs
+++ b/program/ArrayStuff.hs
@@ -4,6 +4,8 @@ import Data.Array.IArray
 
 funcArray lohi f = listArray lohi $ map f $ range lohi
 
+constArray lohi v = listArray lohi $ repeat v
+
 transposeArray arr =
        let swap (x, y) = (y, x) in
        let (lo, hi) = bounds arr in