Add general examples

Author: koladilip

general-examples/CHANGELOG.md

@@ -0,0 +1,5 @@
+# Revision history for general-examples
+
+## 0.1.0.0 -- YYYY-mm-dd
+
+* First version. Released on an unsuspecting world.

general-examples/Main.hs

@@ -0,0 +1,4 @@
+module Main where
+
+main :: IO ()
+main = putStrLn "Hello, Haskell!"

general-examples/Setup.hs

@@ -0,0 +1,2 @@
+import Distribution.Simple
+main = defaultMain

general-examples/general-examples.cabal

@@ -0,0 +1,26 @@
+cabal-version:       >=1.10
+-- Initial package description 'general-examples.cabal' generated by 'cabal
+--  init'.  For further documentation, see
+-- http://haskell.org/cabal/users-guide/
+
+name:                general-examples
+version:             0.1.0.0
+-- synopsis:
+-- description:
+-- bug-reports:
+-- license:
+license-file:        LICENSE
+author:              Dilip Kola
+maintainer:          [email protected]
+-- copyright:
+-- category:
+build-type:          Simple
+extra-source-files:  CHANGELOG.md
+
+executable general-examples
+  main-is:             Main.hs
+  -- other-modules:
+  -- other-extensions:
+  build-depends:       base >=4.13 && <4.14
+  -- hs-source-dirs:
+  default-language:    Haskell2010

general-examples/infinite-datastructures

@@ -0,0 +1,73 @@
+module Main where
+
+elm :: (Eq a) => a -> [a] -> Bool
+elm _ [] = False
+elm a (x:xs) = (a == x) || (elm a xs)
+
+nub :: (Eq a) => [a] -> [a]
+
+nub [] = []
+nub (x:xs)
+    | elm x xs = nub xs
+    | otherwise = (x : nub xs)
+
+isAsc :: [Int] -> Bool
+isAsc [] = True
+isAsc [x] = True
+isAsc (x:y:xs) = (x <= y) && isAsc(y:xs)
+
+hasPath :: [(Int, Int)] -> Int -> Int -> Bool
+hasPath xs x y 
+    | (x == y ) = True
+    | otherwise = or [hasPath xs' n y | (m, n) <- xs, m == x]
+        where
+            xs' = [(m, n) | (m, n) <- xs, m /= x] 
+
+rev :: [a] ->[a]
+rev xs = rev' xs []
+    where 
+        rev' [] ys = ys
+        rev' (x:xs') ys = rev' xs' (x:ys)
+
+-- Reverse using fold
+revf :: [a] ->[a]
+revf xs = foldl (\acc x -> x:acc) [] xs
+
+-- Reverse using fold with flip
+revff :: [a] ->[a]
+revff = foldl (flip (:)) []
+
+prefixes :: [a] -> [[a]]
+prefixes l = rev $ map rev $ foldl customAdd [] l
+    where
+        customAdd [] y = [[y]]
+        customAdd (x:xs) y = ((y:x):(x:xs))
+
+prefixes2 :: [a] -> [[a]]
+prefixes2 = foldr (\x acc -> [x] : map (x:) acc) []
+
+lagrange :: [(Float, Float)] -> Float -> Float
+lagrange xs a = foldl (\acc (x, y) -> acc + (y * (lbp x))) 0 xs
+    where lbp x' = foldl (\acc (x, _) -> acc * (a - x) / (x' - x) ) 1 [(x,y) | (x,y) <- xs, x /= x']
+
+data Trie a = Leaf a | Node a [Trie a]
+foldtrie :: (b -> a -> b) -> b -> Trie a -> b 
+foldtrie f acc (Leaf a) = f acc a
+foldtrie f acc (Node a as) = foldl (foldtrie f) (f acc a) as
+
+main = do
+    print (elm 2 [1, 3, 2])
+    print (nub [2, 1, 2, 3, 1, 4])
+    print (isAsc [1, 2, 3]) 
+    print (isAsc [1, 2, 3, 1]) 
+    print (hasPath [(1, 2), (2, 3), (3, 4)] 1 4)
+    print (hasPath [(1, 2), (2, 3), (3, 4)] 3 1)
+    print (hasPath [(1, 2), (2, 3), (3, 4)] 2 4)
+    print (rev [1, 2, 3])
+    print (revf [1, 2, 3])
+    print (revff [1, 2, 3])
+    print $ prefixes [1, 2, 3]
+    print $ prefixes2 [1, 2, 3]
+    print $ lagrange [(1, 1), (2, 8), (3, 27), (4, 64)] 6
+    print $ foldtrie (flip (:)) [] (Node 'c' [(Node 'a' [Leaf 'r', Leaf 't']),(Node 'o' [Node 'o' [Leaf 'l']])])
+

general-examples/ist-funcs

@@ -0,0 +1,13 @@
+Lorem ipsum dolor sit amet, consetetur sadipscing elitr,  sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr,  sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr,  sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet.
+
+Duis autem vel eum iriure dolor in hendrerit in vulputate velit esse molestie consequat, vel illum dolore eu feugiat nulla facilisis at vero eros et accumsan et iusto odio dignissim qui blandit praesent luptatum zzril delenit augue duis dolore te feugait nulla facilisi. Lorem ipsum dolor sit amet, consectetuer adipiscing elit, sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna aliquam erat volutpat.
+
+Ut wisi enim ad minim veniam, quis nostrud exerci tation ullamcorper suscipit lobortis nisl ut aliquip ex ea commodo consequat. Duis autem vel eum iriure dolor in hendrerit in vulputate velit esse molestie consequat, vel illum dolore eu feugiat nulla facilisis at vero eros et accumsan et iusto odio dignissim qui blandit praesent luptatum zzril delenit augue duis dolore te feugait nulla facilisi.
+
+Nam liber tempor cum soluta nobis eleifend option congue nihil imperdiet doming id quod mazim placerat facer possim assum. Lorem ipsum dolor sit amet, consectetuer adipiscing elit, sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna aliquam erat volutpat. Ut wisi enim ad minim veniam, quis nostrud exerci tation ullamcorper suscipit lobortis nisl ut aliquip ex ea commodo consequat.
+
+Duis autem vel eum iriure dolor in hendrerit in vulputate velit esse molestie consequat, vel illum dolore eu feugiat nulla facilisis.
+
+At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr,  sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr,  At accusam aliquyam diam diam dolore dolores duo eirmod eos erat, et nonumy sed tempor et et invidunt justo labore Stet clita ea et gubergren, kasd magna no rebum. sanctus sea sed takimata ut vero voluptua. est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr,  sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat. 
+
+Consetetur sadipscing elitr,  sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr,  sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr,  sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet.

general-examples/list-funcs

@@ -0,0 +1,52 @@
+module Main where
+
+import System.IO
+import Data.List
+import Data.Char
+
+
+getUserLines :: [String] -> IO [String]                      -- optional type signature
+getUserLines lines =  do
+    line <- getLine
+    if null line
+        then return (reverse lines)
+        else getUserLines (line:lines)
+
+printSearchResult :: (String, Maybe Int) -> IO ()
+printSearchResult (a, Just _) = do
+    print $ a <> " is found"
+
+printSearchResult (a, Nothing) = do
+    print $ a <> " is not found"
+
+printSearchResults :: [(String, Maybe Int)] -> IO ()                  -- optional type signature
+printSearchResults [] = do
+    return ()
+
+printSearchResults (result:otherResults) = do
+    printSearchResult result
+    printSearchResults otherResults
+
+split :: [Char] -> [Char] -> [[Char]]
+split [] _  = []
+split s d = filter (not.null) $ foldr (\c (w:ws) -> if (elemIndex c d) == Nothing then (((toLower c) : w) : ws) else ([]:(w:ws))) [[]] s
+
+search inputWords fileWords = sortBy compareSearchResults $ map (\(word, lword) -> (word, elemIndex lword fileWords)) inputWordsWithLowerCase
+        where inputWordsWithLowerCase = map (\word -> (word, map toLower word)) inputWords
+
+compareSearchResults (_, Just _) (_, Just _) = EQ
+compareSearchResults (_, Nothing) (_, Nothing)= EQ
+compareSearchResults (_, Nothing) (_, Just _) = GT
+compareSearchResults (_, Just _) (_, Nothing) = LT
+
+main :: IO ()
+main = do
+    hSetBuffering stdout NoBuffering
+    print $ "Enter path of the file:"
+    filePath <- getLine
+    print $ "Enter words to search:"
+    inputWords <- getUserLines []
+    contents <- readFile filePath
+    let fileWords = split contents ", ?;.\t\n\r"
+    let searchResults = search inputWords fileWords 
+    printSearchResults searchResults

general-examples/list-funcs.hs

@@ -0,0 +1,40 @@
+module Main where
+import Data.List hiding (insert)
+-- import Test.QuickCheck
+
+data Tree a = Leaf | Node (Tree a) a (Tree a) deriving Show
+
+
+infinite_tree :: Tree (Integer, Integer)
+infinite_tree = infinite_tree_gen (0, 0) 
+    where 
+        infinite_tree_gen (a, b) = Node (infinite_tree_gen (a+1, b)) (a, b) (infinite_tree_gen (a, b + 1))
+
+cut :: Integer -> Tree a -> Tree a
+cut 0 _ = Leaf 
+cut n Leaf = Leaf
+cut n (Node l p r ) = Node (cut (n-1) l) p (cut (n-1) r)
+
+insert :: (Ord a) => a -> Tree a -> Tree a
+insert a Leaf = Node (Leaf) a (Leaf)
+insert a (Node l p r)
+    | a < p = Node (insert a l) p r
+    | otherwise = Node l p (insert a r)
+
+insert_list :: (Ord a) => [a] -> Tree a
+insert_list xs = foldr insert Leaf xs
+
+inorder :: Tree a -> [a]
+inorder Leaf = []
+inorder (Node l p r) = (inorder l) ++ [p] ++ (inorder r)
+
+-- prop_IIS xs = sort xs === xs'
+--     where
+--         types = xs :: [Int]
+--         xs' = inorder $ insert_list xs
+
+main = do
+    -- print $ cut 3 infinite_tree
+    let t = insert_list [5, 6, 2, 1, 4, 7, 3]
+    print $ inorder t
+    

general-examples/lorem.txt

@@ -4,10 +4,12 @@ cabal-version: 1.12
 --
 -- see: https://github.com/sol/hpack
 --
--- hash: 7239b8d1fd50ebc9412accddb5ef13cbd655dcca3bf4e413e9822303f1d2e2ae
+-- hash: 699c6241fcb2a9a8821d06a32c9a1b049840888bad581df82d4dbc479252a3b3
 
 name:           hello-world
 version:        1.1.0.5
+license:        MIT
+license-file:   LICENSE
 build-type:     Simple
 
 library

general-examples/search-file

@@ -0,0 +1,82 @@
+# RNA Transcription
+
+Given a DNA strand, return its RNA complement (per RNA transcription).
+
+Both DNA and RNA strands are a sequence of nucleotides.
+
+The four nucleotides found in DNA are adenine (**A**), cytosine (**C**),
+guanine (**G**) and thymine (**T**).
+
+The four nucleotides found in RNA are adenine (**A**), cytosine (**C**),
+guanine (**G**) and uracil (**U**).
+
+Given a DNA strand, its transcribed RNA strand is formed by replacing
+each nucleotide with its complement:
+
+* `G` -> `C`
+* `C` -> `G`
+* `T` -> `A`
+* `A` -> `U`
+
+Given invalid output, your program should return the first invalid character.
+
+
+
+## Getting Started
+
+Please refer to the [installation](https://exercism.io/tracks/haskell/installation)
+and [learning](https://exercism.io/tracks/haskell/learning) help pages.
+
+## Running the tests
+
+To run the test suite, execute the following command:
+
+```bash
+stack test
+```
+
+#### If you get an error message like this...
+
+```
+No .cabal file found in directory
+```
+
+You are probably running an old stack version and need
+to upgrade it.
+
+#### Otherwise, if you get an error message like this...
+
+```
+No compiler found, expected minor version match with...
+Try running "stack setup" to install the correct GHC...
+```
+
+Just do as it says and it will download and install
+the correct compiler version:
+
+```bash
+stack setup
+```
+
+## Running *GHCi*
+
+If you want to play with your solution in GHCi, just run the command:
+
+```bash
+stack ghci
+```
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/haskell](https://github.com/exercism/haskell) repository on
+GitHub is the home for all of the Haskell exercises.
+
+If you have feedback about an exercise, or want to help implementing a new
+one, head over there and create an issue.  We'll do our best to help you!
+
+## Source
+
+Hyperphysics [http://hyperphysics.phy-astr.gsu.edu/hbase/Organic/transcription.html](http://hyperphysics.phy-astr.gsu.edu/hbase/Organic/transcription.html)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

general-examples/search-file.hs

@@ -0,0 +1,21 @@
+name: rna-transcription
+version: 1.3.0.10
+
+dependencies:
+  - base
+
+library:
+  exposed-modules: DNA
+  source-dirs: src
+  ghc-options: -Wall
+  # dependencies:
+  # - foo       # List here the packages you
+  # - bar       # want to use in your solution.
+
+tests:
+  test:
+    main: Tests.hs
+    source-dirs: test
+    dependencies:
+      - rna-transcription
+      - hspec

general-examples/tree-funcs.hs

@@ -0,0 +1,36 @@
+cabal-version: 1.12
+
+-- This file has been generated from package.yaml by hpack version 0.33.0.
+--
+-- see: https://github.com/sol/hpack
+--
+-- hash: 6a65545b4ce412dfa8d34a288540e955171791710b3e6c35eb759bd2bd084aae
+
+name:           rna-transcription
+version:        1.3.0.10
+build-type:     Simple
+
+library
+  exposed-modules:
+      DNA
+  other-modules:
+      Paths_rna_transcription
+  hs-source-dirs:
+      src
+  ghc-options: -Wall
+  build-depends:
+      base
+  default-language: Haskell2010
+
+test-suite test
+  type: exitcode-stdio-1.0
+  main-is: Tests.hs
+  other-modules:
+      Paths_rna_transcription
+  hs-source-dirs:
+      test
+  build-depends:
+      base
+    , hspec
+    , rna-transcription
+  default-language: Haskell2010

hello-world/hello-world.cabal

@@ -0,0 +1,11 @@
+module DNA (toRNA) where
+
+dnaToRNA :: Char -> Either Char Char
+dnaToRNA 'G' = Right 'C'
+dnaToRNA 'C' = Right 'G'
+dnaToRNA 'T' = Right 'A'
+dnaToRNA 'A' = Right 'U'
+dnaToRNA c = Left c
+
+toRNA :: String -> Either Char String
+toRNA = mapM dnaToRNA

rna-transcription/README.md

@@ -0,0 +1 @@
+resolver: lts-15.8