author | nemo |
Wed, 10 Aug 2011 17:20:21 -0400 | |
changeset 5539 | 7bb3d679e648 |
parent 5119 | f475e10c4081 |
child 6805 | 097289be7200 |
permissions | -rw-r--r-- |
4905 | 1 |
module Store( |
2 |
ElemIndex(), |
|
3 |
MStore(), |
|
4 |
IStore(), |
|
5 |
newStore, |
|
6 |
addElem, |
|
7 |
removeElem, |
|
8 |
readElem, |
|
9 |
writeElem, |
|
10 |
modifyElem, |
|
11 |
elemExists, |
|
12 |
firstIndex, |
|
13 |
indicesM, |
|
14 |
withIStore, |
|
15 |
withIStore2, |
|
16 |
(!), |
|
17 |
indices |
|
18 |
) where |
|
19 |
||
20 |
import qualified Data.Array.IArray as IA |
|
21 |
import qualified Data.Array.IO as IOA |
|
22 |
import qualified Data.IntSet as IntSet |
|
23 |
import Data.IORef |
|
24 |
import Control.Monad |
|
25 |
||
26 |
||
27 |
newtype ElemIndex = ElemIndex Int |
|
28 |
deriving (Eq, Show, Read, Ord) |
|
29 |
newtype MStore e = MStore (IORef (IntSet.IntSet, IntSet.IntSet, IOA.IOArray Int e)) |
|
30 |
newtype IStore e = IStore (IntSet.IntSet, IA.Array Int e) |
|
31 |
||
32 |
||
33 |
firstIndex :: ElemIndex |
|
34 |
firstIndex = ElemIndex 0 |
|
35 |
||
36 |
-- MStore code |
|
37 |
initialSize :: Int |
|
5003
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
38 |
initialSize = 16 |
4905 | 39 |
|
40 |
||
41 |
growFunc :: Int -> Int |
|
42 |
growFunc a = a * 3 `div` 2 |
|
43 |
||
5003
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
44 |
truncFunc :: Int -> Int |
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
45 |
truncFunc a | a > growFunc initialSize = (a `div` 2) |
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
46 |
| otherwise = a |
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
47 |
|
4905 | 48 |
|
49 |
newStore :: IO (MStore e) |
|
50 |
newStore = do |
|
51 |
newar <- IOA.newArray_ (0, initialSize - 1) |
|
52 |
new <- newIORef (IntSet.empty, IntSet.fromAscList [0..initialSize - 1], newar) |
|
53 |
return (MStore new) |
|
54 |
||
55 |
||
56 |
growStore :: MStore e -> IO () |
|
57 |
growStore (MStore ref) = do |
|
58 |
(busyElems, freeElems, arr) <- readIORef ref |
|
59 |
(_, m') <- IOA.getBounds arr |
|
60 |
let newM' = growFunc (m' + 1) - 1 |
|
61 |
newArr <- IOA.newArray_ (0, newM') |
|
62 |
sequence_ [IOA.readArray arr i >>= IOA.writeArray newArr i | i <- [0..m']] |
|
4932 | 63 |
writeIORef ref (busyElems, freeElems `IntSet.union` IntSet.fromAscList [m'+1..newM'], newArr) |
4905 | 64 |
|
65 |
||
66 |
growIfNeeded :: MStore e -> IO () |
|
67 |
growIfNeeded m@(MStore ref) = do |
|
68 |
(_, freeElems, _) <- readIORef ref |
|
69 |
when (IntSet.null freeElems) $ growStore m |
|
70 |
||
71 |
||
5003
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
72 |
truncateIfNeeded :: MStore e -> IO () |
5119 | 73 |
truncateIfNeeded (MStore ref) = do |
5003
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
74 |
(busyElems, _, arr) <- readIORef ref |
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
75 |
(_, m') <- IOA.getBounds arr |
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
76 |
let newM' = truncFunc (m' + 1) - 1 |
5119 | 77 |
when (newM' < m' && (not $ IntSet.null busyElems) && IntSet.findMax busyElems <= newM') $ do |
78 |
newArr <- IOA.newArray_ (0, newM') |
|
79 |
sequence_ [IOA.readArray arr i >>= IOA.writeArray newArr i | i <- IntSet.toList busyElems] |
|
80 |
writeIORef ref (busyElems, IntSet.fromAscList [0..newM'] `IntSet.difference` busyElems, newArr) |
|
5003
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
81 |
|
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
82 |
|
4905 | 83 |
addElem :: MStore e -> e -> IO ElemIndex |
84 |
addElem m@(MStore ref) element = do |
|
85 |
growIfNeeded m |
|
86 |
(busyElems, freeElems, arr) <- readIORef ref |
|
87 |
let (n, freeElems') = IntSet.deleteFindMin freeElems |
|
88 |
IOA.writeArray arr n element |
|
89 |
writeIORef ref (IntSet.insert n busyElems, freeElems', arr) |
|
90 |
return $ ElemIndex n |
|
91 |
||
92 |
||
93 |
removeElem :: MStore e -> ElemIndex -> IO () |
|
5003
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
94 |
removeElem m@(MStore ref) (ElemIndex n) = do |
4905 | 95 |
(busyElems, freeElems, arr) <- readIORef ref |
96 |
IOA.writeArray arr n (error $ "Store: no element " ++ show n) |
|
97 |
writeIORef ref (IntSet.delete n busyElems, IntSet.insert n freeElems, arr) |
|
5003
db4726bf9205
Implement Store truncating, so the memory even gets freed sometimes
unc0rr
parents:
4932
diff
changeset
|
98 |
truncateIfNeeded m |
4905 | 99 |
|
100 |
||
101 |
readElem :: MStore e -> ElemIndex -> IO e |
|
102 |
readElem (MStore ref) (ElemIndex n) = readIORef ref >>= \(_, _, arr) -> IOA.readArray arr n |
|
103 |
||
104 |
||
105 |
writeElem :: MStore e -> ElemIndex -> e -> IO () |
|
106 |
writeElem (MStore ref) (ElemIndex n) el = readIORef ref >>= \(_, _, arr) -> IOA.writeArray arr n el |
|
107 |
||
108 |
||
109 |
modifyElem :: MStore e -> (e -> e) -> ElemIndex -> IO () |
|
110 |
modifyElem (MStore ref) f (ElemIndex n) = do |
|
111 |
(_, _, arr) <- readIORef ref |
|
112 |
IOA.readArray arr n >>= IOA.writeArray arr n . f |
|
113 |
||
114 |
elemExists :: MStore e -> ElemIndex -> IO Bool |
|
115 |
elemExists (MStore ref) (ElemIndex n) = do |
|
116 |
(_, free, _) <- readIORef ref |
|
117 |
return $ n `IntSet.notMember` free |
|
118 |
||
119 |
indicesM :: MStore e -> IO [ElemIndex] |
|
120 |
indicesM (MStore ref) = do |
|
121 |
(busy, _, _) <- readIORef ref |
|
122 |
return $ map ElemIndex $ IntSet.toList busy |
|
123 |
||
124 |
||
125 |
-- A way to see MStore elements in pure code via IStore |
|
126 |
m2i :: MStore e -> IO (IStore e) |
|
127 |
m2i (MStore ref) = do |
|
128 |
(a, _, c') <- readIORef ref |
|
129 |
c <- IOA.unsafeFreeze c' |
|
130 |
return $ IStore (a, c) |
|
131 |
||
4932 | 132 |
i2m :: MStore e -> IStore e -> IO () |
4905 | 133 |
i2m (MStore ref) (IStore (_, arr)) = do |
134 |
(b, e, _) <- readIORef ref |
|
135 |
a <- IOA.unsafeThaw arr |
|
136 |
writeIORef ref (b, e, a) |
|
137 |
||
138 |
withIStore :: MStore e -> (IStore e -> a) -> IO a |
|
139 |
withIStore m f = do |
|
140 |
i <- m2i m |
|
141 |
let res = f i |
|
142 |
res `seq` i2m m i |
|
143 |
return res |
|
144 |
||
145 |
||
146 |
withIStore2 :: MStore e1 -> MStore e2 -> (IStore e1 -> IStore e2 -> a) -> IO a |
|
147 |
withIStore2 m1 m2 f = do |
|
148 |
i1 <- m2i m1 |
|
149 |
i2 <- m2i m2 |
|
150 |
let res = f i1 i2 |
|
151 |
res `seq` i2m m1 i1 |
|
152 |
i2m m2 i2 |
|
153 |
return res |
|
154 |
||
155 |
||
156 |
-- IStore code |
|
157 |
(!) :: IStore e -> ElemIndex -> e |
|
158 |
(!) (IStore (_, arr)) (ElemIndex i) = (IA.!) arr i |
|
159 |
||
160 |
indices :: IStore e -> [ElemIndex] |
|
161 |
indices (IStore (busy, _)) = map ElemIndex $ IntSet.toList busy |