1 files changed, 0 insertions, 60 deletions
diff --git a/js/codemirror/mode/haskell/index.html b/js/codemirror/mode/haskell/index.html
deleted file mode 100644
index 6ea7f5ed..00000000
--- a/js/codemirror/mode/haskell/index.html
+++ /dev/null
@@ -1,60 +0,0 @@
-<!doctype html>
-<html>
-  <head>
-    <title>CodeMirror 2: Haskell mode</title>
-    <link rel="stylesheet" href="../../lib/codemirror.css">
-    <script src="../../lib/codemirror.js"></script>
-    <script src="haskell.js"></script>
-    <link rel="stylesheet" href="../../theme/elegant.css">
-    <style type="text/css">.CodeMirror {border-top: 1px solid black; border-bottom: 1px solid black;}</style>
-    <link rel="stylesheet" href="../../css/docs.css">
-  </head>
-  <body>
-    <h1>CodeMirror 2: Haskell mode</h1>
-<form><textarea id="code" name="code">
-module UniquePerms (
-    uniquePerms
-    )
-where
-- | Find all unique permutations of a list where there might be duplicates.
-uniquePerms :: (Eq a) => [a] -> [[a]]
-uniquePerms = permBag . makeBag
-- | An unordered collection where duplicate values are allowed,
-- but represented with a single value and a count.
-type Bag a = [(a, Int)]
-makeBag :: (Eq a) => [a] -> Bag a
-makeBag [] = []
-makeBag (a:as) = mix a $ makeBag as
-  where
-    mix a []                        = [(a,1)]
-    mix a (bn@(b,n):bs) | a == b    = (b,n+1):bs
-                        | otherwise = bn : mix a bs
-permBag :: Bag a -> [[a]]
-permBag [] = [[]]
-permBag bs = concatMap (\(f,cs) -> map (f:) $ permBag cs) . oneOfEach $ bs
-  where
-    oneOfEach [] = []
-    oneOfEach (an@(a,n):bs) =
-        let bs' = if n == 1 then bs else (a,n-1):bs
-        in (a,bs') : mapSnd (an:) (oneOfEach bs)
-    
-    apSnd f (a,b) = (a, f b)
-    mapSnd = map . apSnd
-</textarea></form>
-    <script>
-      var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
-        lineNumbers: true,
-        matchBrackets: true,
-        theme: "elegant"
-      });
-    </script>
-    <p><strong>MIME types defined:</strong> <code>text/x-haskell</code>.</p>
-  </body>
-</html>

diff --git a/js/codemirror/mode/haskell/index.html b/js/codemirror/mode/haskell/index.html deleted file mode 100644 index 6ea7f5ed..00000000 --- a/js/codemirror/mode/haskell/index.html +++ /dev/null
@@ -1,60 +0,0 @@
1	<!doctype html>
2	<html>
3	<head>
4	<title>CodeMirror 2: Haskell mode</title>
5	<link rel="stylesheet" href="../../lib/codemirror.css">
6	<script src="../../lib/codemirror.js"></script>
7	<script src="haskell.js"></script>
8	<link rel="stylesheet" href="../../theme/elegant.css">
9	<style type="text/css">.CodeMirror {border-top: 1px solid black; border-bottom: 1px solid black;}</style>
10	<link rel="stylesheet" href="../../css/docs.css">
11	</head>
12	<body>
13	<h1>CodeMirror 2: Haskell mode</h1>
14
15	<form><textarea id="code" name="code">
16	module UniquePerms (
17	uniquePerms
18	)
19	where
20
21	-- \| Find all unique permutations of a list where there might be duplicates.
22	uniquePerms :: (Eq a) => [a] -> [[a]]
23	uniquePerms = permBag . makeBag
24
25	-- \| An unordered collection where duplicate values are allowed,
26	-- but represented with a single value and a count.
27	type Bag a = [(a, Int)]
28
29	makeBag :: (Eq a) => [a] -> Bag a
30	makeBag [] = []
31	makeBag (a:as) = mix a $ makeBag as
32	where
33	mix a [] = [(a,1)]
34	mix a (bn@(b,n):bs) \| a == b = (b,n+1):bs
35	\| otherwise = bn : mix a bs
36
37	permBag :: Bag a -> [[a]]
38	permBag [] = [[]]
39	permBag bs = concatMap (\(f,cs) -> map (f:) $ permBag cs) . oneOfEach $ bs
40	where
41	oneOfEach [] = []
42	oneOfEach (an@(a,n):bs) =
43	let bs' = if n == 1 then bs else (a,n-1):bs
44	in (a,bs') : mapSnd (an:) (oneOfEach bs)
45
46	apSnd f (a,b) = (a, f b)
47	mapSnd = map . apSnd
48	</textarea></form>
49
50	<script>
51	var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
52	lineNumbers: true,
53	matchBrackets: true,
54	theme: "elegant"
55	});
56	</script>
57
58	<p><strong>MIME types defined:</strong> <code>text/x-haskell</code>.</p>
59	</body>
60	</html>