module Simulation.Aivika.DoubleLinkedList
(DoubleLinkedList,
listNull,
listCount,
newList,
listInsertFirst,
listAddLast,
listRemoveFirst,
listRemoveLast,
listRemove,
listRemoveBy,
listContains,
listContainsBy,
listFirst,
listLast,
clearList,
freezeList) where
import Data.IORef
import Data.Maybe
import Control.Monad
data DoubleLinkedItem a =
DoubleLinkedItem { forall a. DoubleLinkedItem a -> a
itemVal :: a,
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemPrev :: IORef (Maybe (DoubleLinkedItem a)),
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemNext :: IORef (Maybe (DoubleLinkedItem a)) }
data DoubleLinkedList a =
DoubleLinkedList { forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead :: IORef (Maybe (DoubleLinkedItem a)),
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail :: IORef (Maybe (DoubleLinkedItem a)),
forall a. DoubleLinkedList a -> IORef Int
listSize :: IORef Int }
listNull :: DoubleLinkedList a -> IO Bool
listNull :: forall a. DoubleLinkedList a -> IO Bool
listNull DoubleLinkedList a
x =
do Maybe (DoubleLinkedItem a)
head <- IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x)
case Maybe (DoubleLinkedItem a)
head of
Maybe (DoubleLinkedItem a)
Nothing -> Bool -> IO Bool
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return Bool
True
Just DoubleLinkedItem a
_ -> Bool -> IO Bool
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return Bool
False
listCount :: DoubleLinkedList a -> IO Int
listCount :: forall a. DoubleLinkedList a -> IO Int
listCount DoubleLinkedList a
x = IORef Int -> IO Int
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
x)
newList :: IO (DoubleLinkedList a)
newList :: forall a. IO (DoubleLinkedList a)
newList =
do IORef (Maybe (DoubleLinkedItem a))
head <- Maybe (DoubleLinkedItem a)
-> IO (IORef (Maybe (DoubleLinkedItem a)))
forall a. a -> IO (IORef a)
newIORef Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
tail <- Maybe (DoubleLinkedItem a)
-> IO (IORef (Maybe (DoubleLinkedItem a)))
forall a. a -> IO (IORef a)
newIORef Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef Int
size <- Int -> IO (IORef Int)
forall a. a -> IO (IORef a)
newIORef Int
0
DoubleLinkedList a -> IO (DoubleLinkedList a)
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return DoubleLinkedList { listHead :: IORef (Maybe (DoubleLinkedItem a))
listHead = IORef (Maybe (DoubleLinkedItem a))
head,
listTail :: IORef (Maybe (DoubleLinkedItem a))
listTail = IORef (Maybe (DoubleLinkedItem a))
tail,
listSize :: IORef Int
listSize = IORef Int
size }
listInsertFirst :: DoubleLinkedList a -> a -> IO ()
listInsertFirst :: forall a. DoubleLinkedList a -> a -> IO ()
listInsertFirst DoubleLinkedList a
x a
v =
do Int
size <- IORef Int -> IO Int
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
x)
let size' :: Int
size' = Int
size Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1
Int
size' Int -> IO () -> IO ()
forall a b. a -> b -> b
`seq` IORef Int -> Int -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
x) Int
size'
Maybe (DoubleLinkedItem a)
head <- IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x)
case Maybe (DoubleLinkedItem a)
head of
Maybe (DoubleLinkedItem a)
Nothing ->
do IORef (Maybe (DoubleLinkedItem a))
prev <- Maybe (DoubleLinkedItem a)
-> IO (IORef (Maybe (DoubleLinkedItem a)))
forall a. a -> IO (IORef a)
newIORef Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
next <- Maybe (DoubleLinkedItem a)
-> IO (IORef (Maybe (DoubleLinkedItem a)))
forall a. a -> IO (IORef a)
newIORef Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
let item :: Maybe (DoubleLinkedItem a)
item = DoubleLinkedItem a -> Maybe (DoubleLinkedItem a)
forall a. a -> Maybe a
Just DoubleLinkedItem { itemVal :: a
itemVal = a
v,
itemPrev :: IORef (Maybe (DoubleLinkedItem a))
itemPrev = IORef (Maybe (DoubleLinkedItem a))
prev,
itemNext :: IORef (Maybe (DoubleLinkedItem a))
itemNext = IORef (Maybe (DoubleLinkedItem a))
next }
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
item
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
item
Just DoubleLinkedItem a
h ->
do IORef (Maybe (DoubleLinkedItem a))
prev <- Maybe (DoubleLinkedItem a)
-> IO (IORef (Maybe (DoubleLinkedItem a)))
forall a. a -> IO (IORef a)
newIORef Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
next <- Maybe (DoubleLinkedItem a)
-> IO (IORef (Maybe (DoubleLinkedItem a)))
forall a. a -> IO (IORef a)
newIORef Maybe (DoubleLinkedItem a)
head
let item :: Maybe (DoubleLinkedItem a)
item = DoubleLinkedItem a -> Maybe (DoubleLinkedItem a)
forall a. a -> Maybe a
Just DoubleLinkedItem { itemVal :: a
itemVal = a
v,
itemPrev :: IORef (Maybe (DoubleLinkedItem a))
itemPrev = IORef (Maybe (DoubleLinkedItem a))
prev,
itemNext :: IORef (Maybe (DoubleLinkedItem a))
itemNext = IORef (Maybe (DoubleLinkedItem a))
next }
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemPrev DoubleLinkedItem a
h) Maybe (DoubleLinkedItem a)
item
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
item
listAddLast :: DoubleLinkedList a -> a -> IO ()
listAddLast :: forall a. DoubleLinkedList a -> a -> IO ()
listAddLast DoubleLinkedList a
x a
v =
do Int
size <- IORef Int -> IO Int
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
x)
let size' :: Int
size' = Int
size Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1
Int
size' Int -> IO () -> IO ()
forall a b. a -> b -> b
`seq` IORef Int -> Int -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
x) Int
size'
Maybe (DoubleLinkedItem a)
tail <- IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x)
case Maybe (DoubleLinkedItem a)
tail of
Maybe (DoubleLinkedItem a)
Nothing ->
do IORef (Maybe (DoubleLinkedItem a))
prev <- Maybe (DoubleLinkedItem a)
-> IO (IORef (Maybe (DoubleLinkedItem a)))
forall a. a -> IO (IORef a)
newIORef Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
next <- Maybe (DoubleLinkedItem a)
-> IO (IORef (Maybe (DoubleLinkedItem a)))
forall a. a -> IO (IORef a)
newIORef Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
let item :: Maybe (DoubleLinkedItem a)
item = DoubleLinkedItem a -> Maybe (DoubleLinkedItem a)
forall a. a -> Maybe a
Just DoubleLinkedItem { itemVal :: a
itemVal = a
v,
itemPrev :: IORef (Maybe (DoubleLinkedItem a))
itemPrev = IORef (Maybe (DoubleLinkedItem a))
prev,
itemNext :: IORef (Maybe (DoubleLinkedItem a))
itemNext = IORef (Maybe (DoubleLinkedItem a))
next }
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
item
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
item
Just DoubleLinkedItem a
t ->
do IORef (Maybe (DoubleLinkedItem a))
prev <- Maybe (DoubleLinkedItem a)
-> IO (IORef (Maybe (DoubleLinkedItem a)))
forall a. a -> IO (IORef a)
newIORef Maybe (DoubleLinkedItem a)
tail
IORef (Maybe (DoubleLinkedItem a))
next <- Maybe (DoubleLinkedItem a)
-> IO (IORef (Maybe (DoubleLinkedItem a)))
forall a. a -> IO (IORef a)
newIORef Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
let item :: Maybe (DoubleLinkedItem a)
item = DoubleLinkedItem a -> Maybe (DoubleLinkedItem a)
forall a. a -> Maybe a
Just DoubleLinkedItem { itemVal :: a
itemVal = a
v,
itemPrev :: IORef (Maybe (DoubleLinkedItem a))
itemPrev = IORef (Maybe (DoubleLinkedItem a))
prev,
itemNext :: IORef (Maybe (DoubleLinkedItem a))
itemNext = IORef (Maybe (DoubleLinkedItem a))
next }
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemNext DoubleLinkedItem a
t) Maybe (DoubleLinkedItem a)
item
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
item
listRemoveFirst :: DoubleLinkedList a -> IO ()
listRemoveFirst :: forall a. DoubleLinkedList a -> IO ()
listRemoveFirst DoubleLinkedList a
x =
do Maybe (DoubleLinkedItem a)
head <- IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x)
case Maybe (DoubleLinkedItem a)
head of
Maybe (DoubleLinkedItem a)
Nothing ->
[Char] -> IO ()
forall a. HasCallStack => [Char] -> a
error [Char]
"Empty list: listRemoveFirst"
Just DoubleLinkedItem a
h ->
do Int
size <- IORef Int -> IO Int
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
x)
let size' :: Int
size' = Int
size Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1
Int
size' Int -> IO () -> IO ()
forall a b. a -> b -> b
`seq` IORef Int -> Int -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
x) Int
size'
Maybe (DoubleLinkedItem a)
head' <- IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemNext DoubleLinkedItem a
h)
case Maybe (DoubleLinkedItem a)
head' of
Maybe (DoubleLinkedItem a)
Nothing ->
do IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
Just DoubleLinkedItem a
h' ->
do IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemPrev DoubleLinkedItem a
h') Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
head'
listRemoveLast :: DoubleLinkedList a -> IO ()
listRemoveLast :: forall a. DoubleLinkedList a -> IO ()
listRemoveLast DoubleLinkedList a
x =
do Maybe (DoubleLinkedItem a)
tail <- IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x)
case Maybe (DoubleLinkedItem a)
tail of
Maybe (DoubleLinkedItem a)
Nothing ->
[Char] -> IO ()
forall a. HasCallStack => [Char] -> a
error [Char]
"Empty list: listRemoveLast"
Just DoubleLinkedItem a
t ->
do Int
size <- IORef Int -> IO Int
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
x)
let size' :: Int
size' = Int
size Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1
Int
size' Int -> IO () -> IO ()
forall a b. a -> b -> b
`seq` IORef Int -> Int -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
x) Int
size'
Maybe (DoubleLinkedItem a)
tail' <- IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemPrev DoubleLinkedItem a
t)
case Maybe (DoubleLinkedItem a)
tail' of
Maybe (DoubleLinkedItem a)
Nothing ->
do IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
Just DoubleLinkedItem a
t' ->
do IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemNext DoubleLinkedItem a
t') Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
tail'
listFirst :: DoubleLinkedList a -> IO a
listFirst :: forall a. DoubleLinkedList a -> IO a
listFirst DoubleLinkedList a
x =
do Maybe (DoubleLinkedItem a)
head <- IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x)
case Maybe (DoubleLinkedItem a)
head of
Maybe (DoubleLinkedItem a)
Nothing ->
[Char] -> IO a
forall a. HasCallStack => [Char] -> a
error [Char]
"Empty list: listFirst"
Just DoubleLinkedItem a
h ->
a -> IO a
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return (a -> IO a) -> a -> IO a
forall a b. (a -> b) -> a -> b
$ DoubleLinkedItem a -> a
forall a. DoubleLinkedItem a -> a
itemVal DoubleLinkedItem a
h
listLast :: DoubleLinkedList a -> IO a
listLast :: forall a. DoubleLinkedList a -> IO a
listLast DoubleLinkedList a
x =
do Maybe (DoubleLinkedItem a)
tail <- IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x)
case Maybe (DoubleLinkedItem a)
tail of
Maybe (DoubleLinkedItem a)
Nothing ->
[Char] -> IO a
forall a. HasCallStack => [Char] -> a
error [Char]
"Empty list: listLast"
Just DoubleLinkedItem a
t ->
a -> IO a
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return (a -> IO a) -> a -> IO a
forall a b. (a -> b) -> a -> b
$ DoubleLinkedItem a -> a
forall a. DoubleLinkedItem a -> a
itemVal DoubleLinkedItem a
t
listRemove :: Eq a => DoubleLinkedList a -> a -> IO Bool
listRemove :: forall a. Eq a => DoubleLinkedList a -> a -> IO Bool
listRemove DoubleLinkedList a
x a
v = (Maybe a -> Bool) -> IO (Maybe a) -> IO Bool
forall a b. (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Maybe a -> Bool
forall a. Maybe a -> Bool
isJust (IO (Maybe a) -> IO Bool) -> IO (Maybe a) -> IO Bool
forall a b. (a -> b) -> a -> b
$ DoubleLinkedList a -> (a -> Bool) -> IO (Maybe a)
forall a. DoubleLinkedList a -> (a -> Bool) -> IO (Maybe a)
listRemoveBy DoubleLinkedList a
x (a -> a -> Bool
forall a. Eq a => a -> a -> Bool
== a
v)
listRemoveBy :: DoubleLinkedList a -> (a -> Bool) -> IO (Maybe a)
listRemoveBy :: forall a. DoubleLinkedList a -> (a -> Bool) -> IO (Maybe a)
listRemoveBy DoubleLinkedList a
x a -> Bool
p = IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x) IO (Maybe (DoubleLinkedItem a))
-> (Maybe (DoubleLinkedItem a) -> IO (Maybe a)) -> IO (Maybe a)
forall a b. IO a -> (a -> IO b) -> IO b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= Maybe (DoubleLinkedItem a) -> IO (Maybe a)
loop
where loop :: Maybe (DoubleLinkedItem a) -> IO (Maybe a)
loop Maybe (DoubleLinkedItem a)
item =
case Maybe (DoubleLinkedItem a)
item of
Maybe (DoubleLinkedItem a)
Nothing -> Maybe a -> IO (Maybe a)
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return Maybe a
forall a. Maybe a
Nothing
Just DoubleLinkedItem a
item ->
do let f :: Bool
f = a -> Bool
p (DoubleLinkedItem a -> a
forall a. DoubleLinkedItem a -> a
itemVal DoubleLinkedItem a
item)
if Bool -> Bool
not Bool
f
then IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemNext DoubleLinkedItem a
item) IO (Maybe (DoubleLinkedItem a))
-> (Maybe (DoubleLinkedItem a) -> IO (Maybe a)) -> IO (Maybe a)
forall a b. IO a -> (a -> IO b) -> IO b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= Maybe (DoubleLinkedItem a) -> IO (Maybe a)
loop
else do Int
size <- IORef Int -> IO Int
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
x)
Maybe (DoubleLinkedItem a)
prev <- IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemPrev DoubleLinkedItem a
item)
Maybe (DoubleLinkedItem a)
next <- IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemNext DoubleLinkedItem a
item)
let size' :: Int
size' = Int
size Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1
Int
size' Int -> IO () -> IO ()
forall a b. a -> b -> b
`seq` IORef Int -> Int -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
x) Int
size'
case (Maybe (DoubleLinkedItem a)
prev, Maybe (DoubleLinkedItem a)
next) of
(Maybe (DoubleLinkedItem a)
Nothing, Maybe (DoubleLinkedItem a)
Nothing) ->
do IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
(Maybe (DoubleLinkedItem a)
Nothing, head' :: Maybe (DoubleLinkedItem a)
head'@(Just DoubleLinkedItem a
item')) ->
do IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemPrev DoubleLinkedItem a
item') Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
head'
(tail' :: Maybe (DoubleLinkedItem a)
tail'@(Just DoubleLinkedItem a
item'), Maybe (DoubleLinkedItem a)
Nothing) ->
do IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemNext DoubleLinkedItem a
item') Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x) Maybe (DoubleLinkedItem a)
tail'
(Just DoubleLinkedItem a
prev', Just DoubleLinkedItem a
next') ->
do IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemNext DoubleLinkedItem a
prev') (DoubleLinkedItem a -> Maybe (DoubleLinkedItem a)
forall a. a -> Maybe a
Just DoubleLinkedItem a
next')
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemPrev DoubleLinkedItem a
next') (DoubleLinkedItem a -> Maybe (DoubleLinkedItem a)
forall a. a -> Maybe a
Just DoubleLinkedItem a
prev')
Maybe a -> IO (Maybe a)
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return (a -> Maybe a
forall a. a -> Maybe a
Just (a -> Maybe a) -> a -> Maybe a
forall a b. (a -> b) -> a -> b
$ DoubleLinkedItem a -> a
forall a. DoubleLinkedItem a -> a
itemVal DoubleLinkedItem a
item)
listContains :: Eq a => DoubleLinkedList a -> a -> IO Bool
listContains :: forall a. Eq a => DoubleLinkedList a -> a -> IO Bool
listContains DoubleLinkedList a
x a
v = (Maybe a -> Bool) -> IO (Maybe a) -> IO Bool
forall a b. (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Maybe a -> Bool
forall a. Maybe a -> Bool
isJust (IO (Maybe a) -> IO Bool) -> IO (Maybe a) -> IO Bool
forall a b. (a -> b) -> a -> b
$ DoubleLinkedList a -> (a -> Bool) -> IO (Maybe a)
forall a. DoubleLinkedList a -> (a -> Bool) -> IO (Maybe a)
listContainsBy DoubleLinkedList a
x (a -> a -> Bool
forall a. Eq a => a -> a -> Bool
== a
v)
listContainsBy :: DoubleLinkedList a -> (a -> Bool) -> IO (Maybe a)
listContainsBy :: forall a. DoubleLinkedList a -> (a -> Bool) -> IO (Maybe a)
listContainsBy DoubleLinkedList a
x a -> Bool
p = IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
x) IO (Maybe (DoubleLinkedItem a))
-> (Maybe (DoubleLinkedItem a) -> IO (Maybe a)) -> IO (Maybe a)
forall a b. IO a -> (a -> IO b) -> IO b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= Maybe (DoubleLinkedItem a) -> IO (Maybe a)
loop
where loop :: Maybe (DoubleLinkedItem a) -> IO (Maybe a)
loop Maybe (DoubleLinkedItem a)
item =
case Maybe (DoubleLinkedItem a)
item of
Maybe (DoubleLinkedItem a)
Nothing -> Maybe a -> IO (Maybe a)
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return Maybe a
forall a. Maybe a
Nothing
Just DoubleLinkedItem a
item ->
do let f :: Bool
f = a -> Bool
p (DoubleLinkedItem a -> a
forall a. DoubleLinkedItem a -> a
itemVal DoubleLinkedItem a
item)
if Bool -> Bool
not Bool
f
then IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemNext DoubleLinkedItem a
item) IO (Maybe (DoubleLinkedItem a))
-> (Maybe (DoubleLinkedItem a) -> IO (Maybe a)) -> IO (Maybe a)
forall a b. IO a -> (a -> IO b) -> IO b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= Maybe (DoubleLinkedItem a) -> IO (Maybe a)
loop
else Maybe a -> IO (Maybe a)
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return (Maybe a -> IO (Maybe a)) -> Maybe a -> IO (Maybe a)
forall a b. (a -> b) -> a -> b
$ a -> Maybe a
forall a. a -> Maybe a
Just (DoubleLinkedItem a -> a
forall a. DoubleLinkedItem a -> a
itemVal DoubleLinkedItem a
item)
clearList :: DoubleLinkedList a -> IO ()
clearList :: forall a. DoubleLinkedList a -> IO ()
clearList DoubleLinkedList a
q =
do IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listHead DoubleLinkedList a
q) Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef (Maybe (DoubleLinkedItem a))
-> Maybe (DoubleLinkedItem a) -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
q) Maybe (DoubleLinkedItem a)
forall a. Maybe a
Nothing
IORef Int -> Int -> IO ()
forall a. IORef a -> a -> IO ()
writeIORef (DoubleLinkedList a -> IORef Int
forall a. DoubleLinkedList a -> IORef Int
listSize DoubleLinkedList a
q) Int
0
freezeList :: DoubleLinkedList a -> IO [a]
freezeList :: forall a. DoubleLinkedList a -> IO [a]
freezeList DoubleLinkedList a
x = IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedList a -> IORef (Maybe (DoubleLinkedItem a))
listTail DoubleLinkedList a
x) IO (Maybe (DoubleLinkedItem a))
-> (Maybe (DoubleLinkedItem a) -> IO [a]) -> IO [a]
forall a b. IO a -> (a -> IO b) -> IO b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= [a] -> Maybe (DoubleLinkedItem a) -> IO [a]
forall {a}. [a] -> Maybe (DoubleLinkedItem a) -> IO [a]
loop []
where loop :: [a] -> Maybe (DoubleLinkedItem a) -> IO [a]
loop [a]
acc Maybe (DoubleLinkedItem a)
Nothing = [a] -> IO [a]
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return [a]
acc
loop [a]
acc (Just DoubleLinkedItem a
item) = IORef (Maybe (DoubleLinkedItem a))
-> IO (Maybe (DoubleLinkedItem a))
forall a. IORef a -> IO a
readIORef (DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
forall a. DoubleLinkedItem a -> IORef (Maybe (DoubleLinkedItem a))
itemPrev DoubleLinkedItem a
item) IO (Maybe (DoubleLinkedItem a))
-> (Maybe (DoubleLinkedItem a) -> IO [a]) -> IO [a]
forall a b. IO a -> (a -> IO b) -> IO b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= [a] -> Maybe (DoubleLinkedItem a) -> IO [a]
loop (DoubleLinkedItem a -> a
forall a. DoubleLinkedItem a -> a
itemVal DoubleLinkedItem a
item a -> [a] -> [a]
forall a. a -> [a] -> [a]
: [a]
acc)