diff --git a/Data/List/Unique.hs b/Data/List/Unique.hs
--- a/Data/List/Unique.hs
+++ b/Data/List/Unique.hs
@@ -8,7 +8,7 @@
-- Stability : Unstable
-- Portability : portable
--
------------------------------------------------------------------------------
+-- Library provides the functions to find unique and duplicate elements in the list
module Data.List.Unique
(sortUniq
@@ -22,6 +22,7 @@
import Data.List (sort,group,nub,filter,map,length)
import Prelude hiding (map,filter,length)
+
-- | 'sortUniq' sorts the list and removes the duplicates of elements. Example:
--
-- sortUniq "foo bar" == " abfor"
@@ -39,7 +40,7 @@
repeated :: Ord a => [a] -> [a]
repeated = map head . filterByLength (>1)
--- | 'unique' gets only unique elements, those that do not have duplicates.
+-- | 'unique' gets only unique elements, that do not have duplicates.
-- It sorts them. Example:
--
-- unique "foo bar" == " abfr"
@@ -47,21 +48,21 @@
unique :: Ord a => [a] -> [a]
unique = concat . filterByLength (==1)
--- | 'count' the elements in the list, sorts by keys (elements). Example:
+-- | 'count' of each element in the list, it sorts by keys (elements). Example:
--
-- count "foo bar" == [(' ',1),('a',1),('b',1),('f',1),('o',2),('r',1)]
count :: Ord a => [a] -> [(a, Int)]
count = map (\x -> (head x,length x)) . group . sort
--- | 'count_' the elements in the list, sorts by values. Example:
+-- | 'count_' of each elements in the list, it sorts by their number. Example:
--
-- count_ "foo bar" == [(' ',1),('a',1),('b',1),('f',1),('r',1),('o',2)]
count_ :: Ord a => [a] -> [(a, Int)]
count_ = map (\(x,y) -> (y,x)) . sort . map (\x -> (length x,head x)) . group . sort
--- | 'countElem' gets the amount of occurrences of the specified element. Example:
+-- | 'countElem' gets the number of occurrences of the specified element. Example:
--
-- countElem 'o' "foo bar" == Just 2
diff --git a/Unique.cabal b/Unique.cabal
--- a/Unique.cabal
+++ b/Unique.cabal
@@ -10,13 +10,13 @@
-- PVP summary: +-+------- breaking API changes
-- | | +----- non-breaking API additions
-- | | | +--- code changes with no API change
-version: 0.1.0.1
+version: 0.1.0.2
-- A short (one-line) description of the package.
-synopsis: Provides with the functionality like unix "uniq" utility
+synopsis: It provides the functionality like unix "uniq" utility
-- A longer description of the package.
-description: Module provides with functions to find unique and duplicate elements in the list
+description: Library provides the functions to find unique and duplicate elements in the list
-- The license under which the package is released.
license: BSD3
diff --git a/docs/html/Unique/Data-List-Unique.html b/docs/html/Unique/Data-List-Unique.html
deleted file mode 100644
--- a/docs/html/Unique/Data-List-Unique.html
+++ /dev/null
@@ -1,5 +0,0 @@
-Data.List.Unique Documentation sortUniq :: Ord a => [a] -> [a] Source
sortUniq
sortUniq "foo bar" == " abfor"
repeated :: Ord a => [a] -> [a] Source
repeated
repeated "foo bar" == "o"
unique :: Ord a => [a] -> [a] Source
unique
unique "foo bar" == " abfr"
count :: Ord a => [a] -> [(a, Int )] Source
count
count "foo bar" == [(' ',1),(a,1),(b,1),(f,1),(o,2),(r,1)]
count_ :: Ord a => [a] -> [(a, Int )] Source
count_
count_ "foo bar" == [(' ',1),(a,1),(b,1),(f,1),(r,1),(o,2)]
Unique-0.1.0.1: Provides with the functionality like unix "uniq" utility (Index)
-
-
-
-
diff --git a/docs/html/Unique/haddock-util.js b/docs/html/Unique/haddock-util.js
deleted file mode 100644
--- a/docs/html/Unique/haddock-util.js
+++ /dev/null
@@ -1,344 +0,0 @@
-// Haddock JavaScript utilities
-
-var rspace = /\s\s+/g,
- rtrim = /^\s+|\s+$/g;
-
-function spaced(s) { return (" " + s + " ").replace(rspace, " "); }
-function trim(s) { return s.replace(rtrim, ""); }
-
-function hasClass(elem, value) {
- var className = spaced(elem.className || "");
- return className.indexOf( " " + value + " " ) >= 0;
-}
-
-function addClass(elem, value) {
- var className = spaced(elem.className || "");
- if ( className.indexOf( " " + value + " " ) < 0 ) {
- elem.className = trim(className + " " + value);
- }
-}
-
-function removeClass(elem, value) {
- var className = spaced(elem.className || "");
- className = className.replace(" " + value + " ", " ");
- elem.className = trim(className);
-}
-
-function toggleClass(elem, valueOn, valueOff, bool) {
- if (bool == null) { bool = ! hasClass(elem, valueOn); }
- if (bool) {
- removeClass(elem, valueOff);
- addClass(elem, valueOn);
- }
- else {
- removeClass(elem, valueOn);
- addClass(elem, valueOff);
- }
- return bool;
-}
-
-
-function makeClassToggle(valueOn, valueOff)
-{
- return function(elem, bool) {
- return toggleClass(elem, valueOn, valueOff, bool);
- }
-}
-
-toggleShow = makeClassToggle("show", "hide");
-toggleCollapser = makeClassToggle("collapser", "expander");
-
-function toggleSection(id)
-{
- var b = toggleShow(document.getElementById("section." + id));
- toggleCollapser(document.getElementById("control." + id), b);
- rememberCollapsed(id, b);
- return b;
-}
-
-var collapsed = {};
-function rememberCollapsed(id, b)
-{
- if(b)
- delete collapsed[id]
- else
- collapsed[id] = null;
-
- var sections = [];
- for(var i in collapsed)
- {
- if(collapsed.hasOwnProperty(i))
- sections.push(i);
- }
- // cookie specific to this page; don't use setCookie which sets path=/
- document.cookie = "collapsed=" + escape(sections.join('+'));
-}
-
-function restoreCollapsed()
-{
- var cookie = getCookie("collapsed");
- if(!cookie)
- return;
-
- var ids = cookie.split('+');
- for(var i in ids)
- {
- if(document.getElementById("section." + ids[i]))
- toggleSection(ids[i]);
- }
-}
-
-function setCookie(name, value) {
- document.cookie = name + "=" + escape(value) + ";path=/;";
-}
-
-function clearCookie(name) {
- document.cookie = name + "=;path=/;expires=Thu, 01-Jan-1970 00:00:01 GMT;";
-}
-
-function getCookie(name) {
- var nameEQ = name + "=";
- var ca = document.cookie.split(';');
- for(var i=0;i < ca.length;i++) {
- var c = ca[i];
- while (c.charAt(0)==' ') c = c.substring(1,c.length);
- if (c.indexOf(nameEQ) == 0) {
- return unescape(c.substring(nameEQ.length,c.length));
- }
- }
- return null;
-}
-
-
-
-var max_results = 75; // 50 is not enough to search for map in the base libraries
-var shown_range = null;
-var last_search = null;
-
-function quick_search()
-{
- perform_search(false);
-}
-
-function full_search()
-{
- perform_search(true);
-}
-
-
-function perform_search(full)
-{
- var text = document.getElementById("searchbox").value.toLowerCase();
- if (text == last_search && !full) return;
- last_search = text;
-
- var table = document.getElementById("indexlist");
- var status = document.getElementById("searchmsg");
- var children = table.firstChild.childNodes;
-
- // first figure out the first node with the prefix
- var first = bisect(-1);
- var last = (first == -1 ? -1 : bisect(1));
-
- if (first == -1)
- {
- table.className = "";
- status.innerHTML = "No results found, displaying all";
- }
- else if (first == 0 && last == children.length - 1)
- {
- table.className = "";
- status.innerHTML = "";
- }
- else if (last - first >= max_results && !full)
- {
- table.className = "";
- status.innerHTML = "More than " + max_results + ", press Search to display";
- }
- else
- {
- // decide what you need to clear/show
- if (shown_range)
- setclass(shown_range[0], shown_range[1], "indexrow");
- setclass(first, last, "indexshow");
- shown_range = [first, last];
- table.className = "indexsearch";
- status.innerHTML = "";
- }
-
-
- function setclass(first, last, status)
- {
- for (var i = first; i <= last; i++)
- {
- children[i].className = status;
- }
- }
-
-
- // do a binary search, treating 0 as ...
- // return either -1 (no 0's found) or location of most far match
- function bisect(dir)
- {
- var first = 0, finish = children.length - 1;
- var mid, success = false;
-
- while (finish - first > 3)
- {
- mid = Math.floor((finish + first) / 2);
-
- var i = checkitem(mid);
- if (i == 0) i = dir;
- if (i == -1)
- finish = mid;
- else
- first = mid;
- }
- var a = (dir == 1 ? first : finish);
- var b = (dir == 1 ? finish : first);
- for (var i = b; i != a - dir; i -= dir)
- {
- if (checkitem(i) == 0) return i;
- }
- return -1;
- }
-
-
- // from an index, decide what the result is
- // 0 = match, -1 is lower, 1 is higher
- function checkitem(i)
- {
- var s = getitem(i).toLowerCase().substr(0, text.length);
- if (s == text) return 0;
- else return (s > text ? -1 : 1);
- }
-
-
- // from an index, get its string
- // this abstracts over alternates
- function getitem(i)
- {
- for ( ; i >= 0; i--)
- {
- var s = children[i].firstChild.firstChild.data;
- if (s.indexOf(' ') == -1)
- return s;
- }
- return ""; // should never be reached
- }
-}
-
-function setSynopsis(filename) {
- if (parent.window.synopsis) {
- if (parent.window.synopsis.location.replace) {
- // In Firefox this avoids adding the change to the history.
- parent.window.synopsis.location.replace(filename);
- } else {
- parent.window.synopsis.location = filename;
- }
- }
-}
-
-function addMenuItem(html) {
- var menu = document.getElementById("page-menu");
- if (menu) {
- var btn = menu.firstChild.cloneNode(false);
- btn.innerHTML = html;
- menu.appendChild(btn);
- }
-}
-
-function adjustForFrames() {
- var bodyCls;
-
- if (parent.location.href == window.location.href) {
- // not in frames, so add Frames button
- addMenuItem("Frames ");
- bodyCls = "no-frame";
- }
- else {
- bodyCls = "in-frame";
- }
- addClass(document.body, bodyCls);
-}
-
-function reframe() {
- setCookie("haddock-reframe", document.URL);
- window.location = "frames.html";
-}
-
-function postReframe() {
- var s = getCookie("haddock-reframe");
- if (s) {
- parent.window.main.location = s;
- clearCookie("haddock-reframe");
- }
-}
-
-function styles() {
- var i, a, es = document.getElementsByTagName("link"), rs = [];
- for (i = 0; a = es[i]; i++) {
- if(a.rel.indexOf("style") != -1 && a.title) {
- rs.push(a);
- }
- }
- return rs;
-}
-
-function addStyleMenu() {
- var as = styles();
- var i, a, btns = "";
- for(i=0; a = as[i]; i++) {
- btns += ""
- + a.title + " Unique-0.1.0.1: Provides with the functionality like unix "uniq" utility Unique-0.1.0.1: Provides with the functionality like unix "uniq" utility Unique-0.1.0.1: Provides with the functionality like unix "uniq" utility Module provides with functions to find unique and duplicate elements in the list
Data.List.Unique Data/List/Unique.hs
-module Data . List . Unique
-( sortUniq
-, repeated
-, unique
-, count
-, count_
-, countElem
-) where
-import Data . List ( sort , group , nub , filter , map , length )
-import Prelude hiding ( map , filter , length )
-sortUniq :: Ord a => [ a ] -> [ a ]
-sortUniq = nub . sort
-filterByLength :: Ord a => ( Int -> Bool ) -> [ a ] -> [ [ a ] ]
-filterByLength p = filter ( p . length ) . group . sort
-repeated :: Ord a => [ a ] -> [ a ]
-repeated = map head . filterByLength ( > 1 )
-unique :: Ord a => [ a ] -> [ a ]
-unique = concat . filterByLength ( == 1 )
-count :: Ord a => [ a ] -> [ ( a , Int ) ]
-count = map ( \ x -> ( head x , length x ) ) . group . sort
-count_ :: Ord a => [ a ] -> [ ( a , Int ) ]
-count_ = map ( \ ( x , y ) -> ( y , x ) ) . sort . map ( \ x -> ( length x , head x ) ) . group . sort
-countElem :: Ord a => a -> [ a ] -> Maybe Int
-countElem x = lookup x . count
-