Copyright | Copyright (c) 2009-2017 David Sorokin <david.sorokin@gmail.com> |
---|---|

License | BSD3 |

Maintainer | David Sorokin <david.sorokin@gmail.com> |

Stability | experimental |

Safe Haskell | Safe |

Language | Haskell2010 |

Tested with: GHC 8.0.1

An imperative vector.

## Synopsis

- data Vector a
- newVector :: IO (Vector a)
- copyVector :: Vector a -> IO (Vector a)
- vectorCount :: Vector a -> IO Int
- appendVector :: Vector a -> a -> IO ()
- readVector :: Vector a -> Int -> IO a
- writeVector :: Vector a -> Int -> a -> IO ()
- vectorBinarySearch :: Ord a => Vector a -> a -> IO Int
- vectorInsert :: Vector a -> Int -> a -> IO ()
- vectorDeleteAt :: Vector a -> Int -> IO ()
- vectorDeleteRange :: Vector a -> Int -> Int -> IO ()
- vectorDelete :: Eq a => Vector a -> a -> IO Bool
- vectorDeleteBy :: Vector a -> (a -> Bool) -> IO (Maybe a)
- vectorIndex :: Eq a => Vector a -> a -> IO Int
- vectorIndexBy :: Vector a -> (a -> Bool) -> IO Int
- vectorContains :: Eq a => Vector a -> a -> IO Bool
- vectorContainsBy :: Vector a -> (a -> Bool) -> IO (Maybe a)
- freezeVector :: Vector a -> IO (Array Int a)

# Documentation

appendVector :: Vector a -> a -> IO () Source #

Add the specified element to the end of the vector.

readVector :: Vector a -> Int -> IO a Source #

Read a value from the vector, where indices are started from 0.

writeVector :: Vector a -> Int -> a -> IO () Source #

Set an array item at the specified index which is started from 0.

vectorBinarySearch :: Ord a => Vector a -> a -> IO Int Source #

Return the index of the specified element using binary search; otherwise, a negated insertion index minus one: 0 -> -0 - 1, ..., i -> -i - 1, ....

vectorInsert :: Vector a -> Int -> a -> IO () Source #

Insert the element in the vector at the specified index.

Delete the specified range of elements.

vectorDelete :: Eq a => Vector a -> a -> IO Bool Source #

Remove the specified element and return a flag indicating whether the element was found and removed.

vectorDeleteBy :: Vector a -> (a -> Bool) -> IO (Maybe a) Source #

Remove an element by the specified predicate and return the element if found.

vectorIndexBy :: Vector a -> (a -> Bool) -> IO Int Source #

Return an index of the item satisfying the predicate or -1.

vectorContains :: Eq a => Vector a -> a -> IO Bool Source #

Detect whether the specified element is contained in the vector.