yi-language-0.18.0: Collection of language-related Yi libraries.

Yi.Utils

Contents

Description

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

Synopsis

# Documentation

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

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

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

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

class SemiNum absolute relative | absolute -> relative where Source #

Minimal complete definition

Methods

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

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

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

Instances
 Source # Instance detailsDefined in Yi.Buffer.Basic Methods

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

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

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

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

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

Generalisation of fromList to arbitrary foldables.

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

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]) Source #

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

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) Source #

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

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

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.

# Orphan instances

 (Eq k, Hashable k, Binary k, Binary v) => Binary (HashMap k v) Source # Instance details Methodsput :: HashMap k v -> Put #get :: Get (HashMap k v) #putList :: [HashMap k v] -> Put #