feat: update Haskell language data (#670)

Author: apocelipes

SCC-OUTPUT-REPORT.html

@@ -13,23 +13,23 @@
 	<tbody><tr>
 		<th>Go</th>
 		<th>30</th>
-		<th>24601</th>
-		<th>1527</th>
-		<th>470</th>
-		<th>22604</th>
-		<th>1625</th>
-		<th>482875</th>
-		<th>6907</th>
+		<th>24855</th>
+		<th>1534</th>
+		<th>488</th>
+		<th>22833</th>
+		<th>1633</th>
+		<th>491109</th>
+		<th>7119</th>
 	</tr><tr>
 		<td>processor/constants.go</td>
 		<td></td>
-		<td>13693</td>
+		<td>13694</td>
 		<td>1</td>
 		<td>2</td>
-		<td>13690</td>
+		<td>13691</td>
 		<td>0</td>
-		<td>214817</td>
-		<td>2111</td>
+		<td>214836</td>
+		<td>2112</td>
 	</tr><tr>
 		<td>processor/formatters_test.go</td>
 		<td></td>
@@ -73,13 +73,13 @@
 	</tr><tr>
 		<td>main_test.go</td>
 		<td></td>
-		<td>687</td>
+		<td>688</td>
 		<td>54</td>
 		<td>15</td>
-		<td>618</td>
+		<td>619</td>
 		<td>179</td>
-		<td>16535</td>
-		<td>383</td>
+		<td>16548</td>
+		<td>384</td>
 	</tr><tr>
 		<td>processor/processor.go</td>
 		<td></td>
@@ -90,6 +90,16 @@
 		<td>79</td>
 		<td>18242</td>
 		<td>416</td>
+	</tr><tr>
+		<td>cmd/badges/main.go</td>
+		<td></td>
+		<td>615</td>
+		<td>82</td>
+		<td>30</td>
+		<td>503</td>
+		<td>73</td>
+		<td>17363</td>
+		<td>437</td>
 	</tr><tr>
 		<td>main.go</td>
 		<td></td>
@@ -100,16 +110,6 @@
 		<td>24</td>
 		<td>11384</td>
 		<td>304</td>
-	</tr><tr>
-		<td>cmd/badges/main.go</td>
-		<td></td>
-		<td>468</td>
-		<td>77</td>
-		<td>21</td>
-		<td>370</td>
-		<td>68</td>
-		<td>12982</td>
-		<td>297</td>
 	</tr><tr>
 		<td>processor/detector_test.go</td>
 		<td></td>
@@ -120,6 +120,16 @@
 		<td>109</td>
 		<td>7784</td>
 		<td>162</td>
+	</tr><tr>
+		<td>cmd/badges/main_test.go</td>
+		<td></td>
+		<td>304</td>
+		<td>8</td>
+		<td>9</td>
+		<td>287</td>
+		<td>13</td>
+		<td>7909</td>
+		<td>177</td>
 	</tr><tr>
 		<td>processor/workers_tokei_test.go</td>
 		<td></td>
@@ -170,16 +180,6 @@
 		<td>17</td>
 		<td>6072</td>
 		<td>142</td>
-	</tr><tr>
-		<td>cmd/badges/main_test.go</td>
-		<td></td>
-		<td>199</td>
-		<td>6</td>
-		<td>0</td>
-		<td>193</td>
-		<td>10</td>
-		<td>4088</td>
-		<td>106</td>
 	</tr><tr>
 		<td>processor/similar_flags_test.go</td>
 		<td></td>
@@ -324,15 +324,15 @@
 	<tfoot><tr>
 		<th>Total</th>
 		<th>30</th>
-		<th>24601</th>
-		<th>1527</th>
-		<th>470</th>
-		<th>22604</th>
-		<th>1625</th>
-		<th>482875</th>
-		<th>6907</th>
+		<th>24855</th>
+		<th>1534</th>
+		<th>488</th>
+		<th>22833</th>
+		<th>1633</th>
+		<th>491109</th>
+		<th>7119</th>
 	</tr>
 	<tr>
-		<th colspan="9">Estimated Cost to Develop (organic) $713,657<br>Estimated Schedule Effort (organic) 12.10 months<br>Estimated People Required (organic) 5.24<br></th>
+		<th colspan="9">Estimated Cost to Develop (organic) $721,251<br>Estimated Schedule Effort (organic) 12.15 months<br>Estimated People Required (organic) 5.27<br></th>
 	</tr></tfoot>
 	</table></body></html>

examples/language/haskell.hs

@@ -0,0 +1,51 @@
+module RBTree
+    ( RBTree
+    , empty
+    , insert
+    , member
+    , fromList
+    ) where
+
+data Color = Red | Black
+    deriving (Show, Eq)
+
+data RBTree a = Empty 
+              | Node Color (RBTree a) a (RBTree a)
+    deriving (Show, Eq)
+
+empty :: RBTree a
+empty = Empty
+
+member :: (Ord a) => a -> RBTree a -> Bool
+member _ Empty = False
+member x (Node _ left val right) =
+    case compare x val of
+        LT -> member x left
+        GT -> member x right
+        EQ -> True
+
+insert :: (Ord a) => a -> RBTree a -> RBTree a
+insert x s = makeBlack (ins s)
+  where
+    makeBlack Empty = Empty -- never come here
+    makeBlack (Node _ l v r) = Node Black l v r
+
+    ins Empty = Node Red Empty x Empty
+    ins (Node color l v r)
+        | x < v     = balance color (ins l) v r
+        | x > v     = balance color l v (ins r)
+        | otherwise = Node color l v r  -- discard duplicated value
+
+balance :: Color -> RBTree a -> a -> RBTree a -> RBTree a
+balance Black (Node Red (Node Red a x b) y c) z d =
+    Node Red (Node Black a x b) y (Node Black c z d)
+balance Black (Node Red a x (Node Red b y c)) z d =
+    Node Red (Node Black a x b) y (Node Black c z d)
+balance Black a x (Node Red (Node Red b y c) z d) =
+    Node Red (Node Black a x b) y (Node Black c z d)
+balance Black a x (Node Red b y (Node Red c z d)) =
+    Node Red (Node Black a x b) y (Node Black c z d)
+balance color l v r = Node color l v r
+
+fromList :: (Ord a) => [a] -> RBTree a
+fromList = foldr insert empty

languages.json

@@ -3232,8 +3232,9 @@
       "/= ",
       "== ",
       "case ",
-      "do {",
-      "forall "
+      "otherwise ",
+      "wildcard ",
+      "do {"
     ],
     "extensions": ["hs"],
     "line_comment": ["--"],

main_test.go

@@ -599,6 +599,7 @@ func TestSpecificLanguages(t *testing.T) {
 		"Gwion",
 		"HAML",
 		"Hare",
+		"Haskell",
 		"HCL",
 		"ignore",
 		"INI",