Safe Haskell	Safe-Inferred

Util.Array

Contents

searching

Description

Array utilities.

IArray is awkward and I don't like it. vector is nicer but it's a big library so I don't want to depend on it unless I have more than one data structure using arrays.

Synopsis

type Array = Array Int
empty :: Array a
null :: Array a -> Bool
length :: Array a -> Int
from_list :: [a] -> Array a
at :: String -> Array a -> Int -> a
assert_in_bounds :: String -> Int -> Array a -> Int
in_bounds :: Int -> Array a -> Bool
check :: Int -> Array a -> Maybe (Array a)
bsearch :: Ord k => Array k -> k -> Int
bsearch_on :: Ord k => (a -> k) -> Array a -> k -> Int
bsearch_with :: (k -> a -> Bool) -> Array a -> k -> Int
_do_bsearch :: (a -> Bool) -> Array a -> Int -> Int -> Int

Documentation

type Array = Array Int Source #

empty :: Array a Source #

null :: Array a -> Bool Source #

length :: Array a -> Int Source #

from_list :: [a] -> Array a Source #

at :: String -> Array a -> Int -> a Source #

Like IArray.!, except throw a more informative error, with msg prepended.

assert_in_bounds :: String -> Int -> Array a -> Int Source #

in_bounds :: Int -> Array a -> Bool Source #

Is the given index within the array's bounds?

check :: Int -> Array a -> Maybe (Array a) Source #

Just the array if the index is in bounds.

searching

bsearch :: Ord k => Array k -> k -> Int Source #

Find the index of the first element >= the given element in the sorted array.

bsearch_on :: Ord k => (a -> k) -> Array a -> k -> Int Source #

bsearch_with :: (k -> a -> Bool) -> Array a -> k -> Int Source #

_do_bsearch :: (a -> Bool) -> Array a -> Int -> Int -> Int Source #