Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
forestCursorToggleCurrentForestRecursively :: ForestCursor a b -> Maybe (ForestCursor a b)cursor Cursor.Simple.Forest No documentation available.
mapCursorToggleSelected :: MapCursor k v -> MapCursor k vcursor Cursor.Simple.Map No documentation available.
keyValueCursorToggleSelected :: KeyValueCursor k v -> KeyValueCursor k vcursor Cursor.Simple.Map.KeyValue No documentation available.
treeCursorToggleCurrentForest :: TreeCursor a b -> Maybe (TreeCursor a b)cursor Cursor.Simple.Tree No documentation available.
treeCursorToggleCurrentForestRecursively :: TreeCursor a b -> Maybe (TreeCursor a b)cursor Cursor.Simple.Tree No documentation available.
treeCursorToggleCurrentForest :: TreeCursor a b -> Maybe (TreeCursor a b)cursor Cursor.Tree.Collapse No documentation available.
treeCursorToggleCurrentForestRecursively :: TreeCursor a b -> Maybe (TreeCursor a b)cursor Cursor.Tree.Collapse No documentation available.
isSorted :: Ord a => [a] -> Booldata-ordlist Data.List.Ordered The isSorted predicate returns True if the elements of a list occur in non-descending order, equivalent to isSortedBy (<=).
isSortedBy :: (a -> a -> Bool) -> [a] -> Booldata-ordlist Data.List.Ordered The isSortedBy function returns True iff the predicate returns true for all adjacent pairs of elements in the list.
nubSort :: Ord a => [a] -> [a]data-ordlist Data.List.Ordered The nubSort function is equivalent to nub . sort, except that duplicates are removed as it sorts. It is essentially the same implementation as Data.List.sort, with merge replaced by union. Thus the performance of nubSort should better than or nearly equal to sort alone. It is faster than both sort and nub . sort when the input contains significant quantities of duplicated elements.