Safe Haskell	Safe-Inferred
Language	Haskell2010

Potato.Flow.Deprecated.Layers

Synopsis

reindexSEltLayerPosForRemoval :: [LayerPos] -> [LayerPos]
reindexSEltLayerPosForInsertion :: [LayerPos] -> [LayerPos]
hasScopingProperty :: (a -> Maybe Bool) -> Seq a -> Bool
selectionHasScopingProperty :: (a -> Maybe Bool) -> Seq a -> [Int] -> Bool
findMatchingScope :: (a -> Maybe Bool) -> Seq a -> Int -> Int
scopeSelection :: (a -> Maybe Bool) -> Seq a -> [Int] -> [Int]
insertElts :: Int -> Seq a -> Seq a -> Seq a
insertElt :: Int -> a -> Seq a -> Seq a
removeElts :: Int -> Int -> Seq a -> Seq a
insertEltList_indexBeforeInsertion :: [(Int, a)] -> Seq a -> Seq a
insertEltList_indexAfterInsertion :: [(Int, a)] -> Seq a -> Seq a
removeEltList :: [Int] -> Seq a -> Seq a
moveEltList :: [Int] -> Int -> Seq a -> Seq a
undoMoveEltList :: [Int] -> Int -> Seq a -> Seq a

Documentation

reindexSEltLayerPosForRemoval :: [LayerPos] -> [LayerPos] Source #

reindexes list of LayerPos such that each element is indexed as if all previous elements have been removed O(n^2) lol

reindexSEltLayerPosForInsertion :: [LayerPos] -> [LayerPos] Source #

inverse of reindexSEltLayerPosForRemoval input indices are before any elements are inserted O(n^2) lol

hasScopingProperty :: (a -> Maybe Bool) -> Seq a -> Bool Source #

selectionHasScopingProperty :: (a -> Maybe Bool) -> Seq a -> [Int] -> Bool Source #

assumes selection is ordered and is valid

findMatchingScope :: (a -> Maybe Bool) -> Seq a -> Int -> Int Source #

scopeSelection :: (a -> Maybe Bool) -> Seq a -> [Int] -> [Int] Source #

converts selection so that it satisfies the scoping property by adding matching folders assumes input sequence satisfies scoping property??? simple and inefficient implementation, do not use in prod

insertElts :: Int -> Seq a -> Seq a -> Seq a Source #

inserts ys at index i into xs

insertElt :: Int -> a -> Seq a -> Seq a Source #

inserts y at index y into xs

removeElts :: Int -> Int -> Seq a -> Seq a Source #

removes n elts at index i from xs

insertEltList_indexBeforeInsertion :: [(Int, a)] -> Seq a -> Seq a Source #

inserts ys into xs, positions are before insertion

insertEltList_indexAfterInsertion :: [(Int, a)] -> Seq a -> Seq a Source #

inserts ys into xs, positions are after insertion

removeEltList :: [Int] -> Seq a -> Seq a Source #

removes is' from xs, positions are before removal

moveEltList :: [Int] -> Int -> Seq a -> Seq a Source #

moves all elts, new position is before removal, ys must be sorted

undoMoveEltList :: [Int] -> Int -> Seq a -> Seq a Source #