diff options
| author | hallgren <hallgren@chalmers.se> | 2014-06-12 14:43:18 +0000 |
|---|---|---|
| committer | hallgren <hallgren@chalmers.se> | 2014-06-12 14:43:18 +0000 |
| commit | d6252d1c16d59ad26db0d08a531cddf39864d9db (patch) | |
| tree | 93d4c2be28e430bb64a1cb2db22299b1b4b8afb7 /src/runtime/haskell/PGF/Utilities.hs | |
| parent | 352ecb7eb89b3f427667c7c51f71812b619393af (diff) | |
PGF library: expose only PGF and PGF.Internal instead of all modules
PGF exports the public, stable API.
PGF.Internal exports additional things needed in the GF compiler & shell,
including the nonstardard version of Data.Binary.
Diffstat (limited to 'src/runtime/haskell/PGF/Utilities.hs')
| -rw-r--r-- | src/runtime/haskell/PGF/Utilities.hs | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/runtime/haskell/PGF/Utilities.hs b/src/runtime/haskell/PGF/Utilities.hs index 5af5b9b5d..ab1b4e2fe 100644 --- a/src/runtime/haskell/PGF/Utilities.hs +++ b/src/runtime/haskell/PGF/Utilities.hs @@ -3,10 +3,10 @@ module PGF.Utilities where import Data.Set(empty,member,insert) --- | Like 'nub', but O(n log n) instead of O(n^2), since it uses a set to lookup previous things. +-- | Like 'Data.List.nub', but O(n log n) instead of O(n^2), since it uses a set to lookup previous things. -- The result list is stable (the elements are returned in the order they occur), and lazy. -- Requires that the list elements can be compared by Ord. --- Code ruthlessly taken from http://hpaste.org/54411 +-- Code ruthlessly taken from <http://hpaste.org/54411> nub' :: Ord a => [a] -> [a] nub' = loop empty where loop _ [] = [] |