Yi.Utils

Various utility functions and instances used throughout Yi. Some of the functions from the now-removed Yi.Prelude found a new home here.

Documentation

io :: MonadBase IO m => IO a -> m a

fst3 :: (a, b, c) -> a

snd3 :: (a, b, c) -> b

trd3 :: (a, b, c) -> c

class SemiNum absolute relative | absolute -> relative where

Minimal complete definition

(+~), (-~), (~-)

Methods

(+~) :: absolute -> relative -> absolute

(-~) :: absolute -> relative -> absolute

(~-) :: absolute -> absolute -> relative

Instances

SemiNum Point Size

Defined in Yi.Buffer.Basic

Methods

(+~) :: Point -> Size -> Point

(-~) :: Point -> Size -> Point

(~-) :: Point -> Point -> Size

nubSet :: Ord a => [a] -> [a]

As nub, but with O(n*log(n)) behaviour.

mapAdjust' :: Ord k => (a -> a) -> k -> Map k a -> Map k a

As Map.adjust, but the combining function is applied strictly.

mapFromFoldable :: (Foldable t, Ord k) => t (k, a) -> Map k a

Generalisation of fromList to arbitrary foldables.

groupBy' :: (a -> a -> Bool) -> [a] -> [[a]]

Alternative to groupBy.

groupBy' (\a b -> abs (a - b) <= 1) [1,2,3] = [[1,2,3]]

whereas

groupBy (\a b -> abs (a - b) <= 1) [1,2,3] = [[1,2],[3]]

TODO: Check in ghc 6.12 release if groupBy == groupBy'.

chain :: (a -> a -> Bool) -> [a] -> ([a], [a])

commonPrefix :: Eq a => [[a]] -> [a]

Return the longest common prefix of a set of lists.

P(xs) === all (isPrefixOf (commonPrefix xs)) xs
length s > length (commonPrefix xs) --> not (all (isPrefixOf s) xs)

findPL :: (a -> Bool) -> [a] -> Maybe (PointedList a)

Finds the first element satisfying the predicate, and returns a zipper pointing at it.

swapFocus :: (PointedList a -> PointedList a) -> PointedList a -> PointedList a

Given a function which moves the focus from index A to index B, return a function which swaps the elements at indexes A and B and then moves the focus. See Yi.Editor.swapWinWithFirstE for an example.

makeClassyWithSuffix :: String -> Name -> Q [Dec]

addSuffix :: Name -> String -> [DefName]

makeLensesWithSuffix :: String -> Name -> Q [Dec]

Orphan instances

(Eq k, Hashable k, Binary k, Binary v) => Binary (HashMap k v)

Methods

put :: HashMap k v -> Put

get :: Get (HashMap k v)

putList :: [HashMap k v] -> Put