úÎ#rŠSafeçlist-duplicate O(n log(n)).D Group the equal elements of the list together, in sorted order.group [1, 3, 2, 3, 2, 3][[1], [2, 2], [3, 3, 3]] group [1][[1]]group [][]list-duplicate O(n log(n)). Like C, with a custom comparison test. The grouping is stable, so if x, y are in the same group, and x appears before y in the original list, then x appears before y in the group.7groupBy (comparing head) ["b1", "c1", "a1", "b2", "a2"]$[["a1", "a2"], ["b1", "b2"], ["c1"]]list-duplicateO(n).| Group adjacent elements that are equal. Works with infinite lists. Useful for grouping equal elements of a sorted list.groupAdj [1, 3, 3, 3, 2, 2, 3][[1], [3, 3, 3], [2, 2], [3]]9take 4 $ groupAdj $ concatMap (\x -> replicate x x) [1..]&[[1], [2, 2], [3, 3, 3], [4, 4, 4, 4]] groupAdj [][] groupAdj [1][[1]]list-duplicateO(n). Like , with a custom equality test.@groupAdjBy ((==) `on` head) ["a1", "a2", "b1", "c1", "a3", "a4"],[["a1", "a2"], ["b1"], ["c1"], ["a3", "a4"]]list-duplicate O(n log(n)).< Delete duplicates from the list. Output is in sorted order.deleteDups [3, 1, 1, 2, 1, 3] [1, 2, 3]list-duplicate O(n log(n)). Like @, with a custom comparison test. First appearances are kept.<deleteDupsBy (comparing head) ["a1", "c1", "d1", "a2", "b1"]["a1", "b1", "c1", "d1"]list-duplicateO(n).³ Delete adjacent duplicates from the list. Works with infinite lists. Useful for deleting duplicates from a sorted list. Remaining elements are in the same relative order. deleteAdjDups [1, 3, 4, 4, 4, 3] [1, 3, 4, 3]list-duplicateO(n). Like >, with a custom equality test. First appearances are kept.EdeleteAdjDupsBy ((==) `on` head) ["a1", "a2", "b1", "b2", "a3", "a4"]["a1", "b1", "a3]Safee      -list-duplicate-0.1.0.0-Lf4mWEKx0ps3xcfqSM7fVkData.List.DuplicatePaths_list_duplicategroupgroupBygroupAdj groupAdjBy deleteDups deleteDupsBy deleteAdjDupsdeleteAdjDupsByversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName