├── .gitignore ├── .gitmodules ├── Avg └── Demo.hs ├── AvgInt └── Demo.hs ├── CoinsChange └── Demo.hs ├── Compose └── Demo.hs ├── Const42 └── Demo.hs ├── DelAllUpper └── Demo.hs ├── DemoFactorial └── DemoFactorial.hs ├── DemoImport └── DemoImport.hs ├── Distance └── Demo.hs ├── Enum └── Demo.hs ├── Eq └── Demo.hs ├── EvenOnly └── Demo.hs ├── ExecLoggers └── Demo.hs ├── FibStream └── Demo.hs ├── Fibonacci └── Fibonacci.hs ├── FilterDisj └── Demo.hs ├── FunctorForMap └── Demo.hs ├── GroupElems └── Demo.hs ├── Hello ├── Hello.hs └── Test.hs ├── Integration └── Integration.hs ├── IpAddr └── Demo.hs ├── KnownToGorkAndMork └── Demo.hs ├── LICENSE ├── LogEntry └── Demo.hs ├── Max3 └── Demo.hs ├── MeanList └── Demo.hs ├── Mono └── Demo.hs ├── MultSecond └── Demo.hs ├── NTimes └── Demo.hs ├── Num └── Demo.hs ├── OddCont └── Demo.hs ├── OddsOnly └── Demo.hs ├── On3 └── Demo.hs ├── Operator └── Demo.hs ├── ParsePerson └── Demo.hs ├── Perms └── Demo.hs ├── Person └── Demo.hs ├── PlaneWithCells └── Demo.hs ├── Printable └── Demo.hs ├── Qsort └── Demo.hs ├── README.md ├── ReadDigits └── Demo.hs ├── RevRange └── Demo.hs ├── Roots └── Roots.hs ├── RotateList └── Demo.hs ├── SafeEnum └── Demo.hs ├── Seq └── Demo.hs ├── SeqA └── SeqA.hs ├── Sum3 └── Demo.hs ├── SumAndCount └── SumAndCount.hs ├── SumFstFst └── Demo.hs ├── SumIt └── Demo.hs ├── SumOdd └── Demo.hs ├── TheListMonad └── Demo.hs ├── Token └── Demo.hs └── TwoDigits2Int └── TwoDigits2Int.hs /.gitignore: -------------------------------------------------------------------------------- 1 | dist 2 | cabal-dev 3 | *.o 4 | *.hi 5 | *.chi 6 | *.chs.h 7 | *.dyn_o 8 | *.dyn_hi 9 | .hpc 10 | .hsenv 11 | .cabal-sandbox/ 12 | cabal.sandbox.config 13 | *.prof 14 | *.aux 15 | *.hp 16 | .stack-work/ 17 | -------------------------------------------------------------------------------- /.gitmodules: -------------------------------------------------------------------------------- 1 | [submodule "st_hs"] 2 | path = st_hs 3 | url = https://github.com/ovcharenkodi/st_hs.git 4 | [submodule "stepic-haskell"] 5 | path = stepic-haskell 6 | url = https://github.com/dstarcev/stepic-haskell.git 7 | [submodule "Stepic-FP-Haskell"] 8 | path = Stepic-FP-Haskell 9 | url = https://github.com/AlexMckey/Stepic-FP-Haskell.git 10 | -------------------------------------------------------------------------------- /Avg/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Avg/Demo.hs -------------------------------------------------------------------------------- /AvgInt/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/AvgInt/Demo.hs -------------------------------------------------------------------------------- /CoinsChange/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/CoinsChange/Demo.hs -------------------------------------------------------------------------------- /Compose/Demo.hs: -------------------------------------------------------------------------------- 1 | module Demo where 2 | 3 | doItYourself = f . g . h 4 | f = logBase 2 5 | g = (^3) 6 | h = max 42 -------------------------------------------------------------------------------- /Const42/Demo.hs: -------------------------------------------------------------------------------- 1 | module Demo where 2 | 3 | const42 :: a -> Int 4 | const42 = const 42 5 | -------------------------------------------------------------------------------- /DelAllUpper/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/DelAllUpper/Demo.hs -------------------------------------------------------------------------------- /DemoFactorial/DemoFactorial.hs: -------------------------------------------------------------------------------- 1 | module DemoFactorial where 2 | 3 | 4 | factorial n = if n == 0 then 1 else n * factorial (n - 1) 5 | 6 | 7 | factorial' 0 = 1 8 | factorial' n = n * factorial' (n - 1) 9 | 10 | 11 | doubleFact :: Integer -> Integer 12 | doubleFact n = if n <= 0 then 1 else n * doubleFact (n - 2) 13 | 14 | 15 | factorial'' 0 = 1 16 | factorial'' n = if n < 0 then error "arg must be >= 0" else n * factorial'' (n - 1) 17 | 18 | 19 | factorial''' 0 = 1 20 | factorial''' n | n < 0 = error "arg must be >= 0" 21 | | n > 0 = n * factorial''' (n - 1) 22 | 23 | 24 | factorial4 :: Integer -> Integer 25 | factorial4 n | n == 0 = 1 26 | | n > 0 = n * factorial4 (n - 1) 27 | | otherwise = error "arg must be >= 0" 28 | 29 | 30 | factorial5 n | n >= 0 = helper 1 n 31 | | otherwise = error "arg must be >= 0" 32 | helper acc 0 = acc 33 | helper acc n = helper (acc * n) (n - 1) 34 | 35 | 36 | factorial6 n | n >= 0 = let 37 | helper acc 0 = acc 38 | helper acc n = helper (acc * n) (n - 1) 39 | in helper 1 n 40 | | otherwise = error "arg must be >= 0" 41 | 42 | 43 | factorial7 :: Integer -> Integer 44 | factorial7 n | n >= 0 = helper 1 n 45 | | otherwise = error "arg must be >= 0" 46 | where 47 | helper acc 0 = acc 48 | helper acc n = helper (acc * n) (n - 1) 49 | 50 | 51 | factorial8 :: Integer -> Integer 52 | factorial8 n | n >= 0 = helper 1 n 53 | | otherwise = error "arg must be >= 0" 54 | where 55 | helper acc 0 = acc 56 | helper acc n = (helper $! (acc * n)) (n - 1) 57 | -------------------------------------------------------------------------------- /DemoImport/DemoImport.hs: -------------------------------------------------------------------------------- 1 | module DemoImport where 2 | 3 | import Data.Char 4 | 5 | test = isDigit '7' -------------------------------------------------------------------------------- /Distance/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Distance/Demo.hs -------------------------------------------------------------------------------- /Enum/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Enum/Demo.hs -------------------------------------------------------------------------------- /Eq/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Eq/Demo.hs -------------------------------------------------------------------------------- /EvenOnly/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/EvenOnly/Demo.hs -------------------------------------------------------------------------------- /ExecLoggers/Demo.hs: -------------------------------------------------------------------------------- 1 | module Demo where 2 | 3 | import Control.Monad (liftM, ap) 4 | 5 | {- Введём следующий тип: -} 6 | data Log a = Log [String] a deriving Show 7 | {- Реализуйте вычисление с логированием, используя Log. Для начала определите функцию toLogger -} 8 | toLogger :: (a -> b) -> String -> (a -> Log b) 9 | {- которая превращает обычную функцию, в функцию с логированием: -} 10 | 11 | {- 12 | GHCi> let add1Log = toLogger (+1) "added one" 13 | GHCi> add1Log 3 14 | Log ["added one"] 4 15 | 16 | GHCi> let mult2Log = toLogger (* 2) "multiplied by 2" 17 | GHCi> mult2Log 3 18 | Log ["multiplied by 2"] 6 19 | 20 | Далее, определите функцию execLoggers -} 21 | execLoggers :: a -> (a -> Log b) -> (b -> Log c) -> Log c 22 | 23 | {- 24 | Которая принимает некоторый элемент и две функции с логированием. 25 | execLoggers возвращает результат последовательного применения функций к элементу и список сообщений, 26 | которые были выданы при применении каждой из функций: 27 | 28 | GHCi> execLoggers 3 add1Log mult2Log 29 | Log ["added one","multiplied by 2"] 8 30 | -} 31 | 32 | toLogger f msg = \x -> Log [msg] (f x) 33 | execLoggers x f g = Log ( (getMsg (f x)) ++ (getMsg (g (getValue (f x)))) ) (getValue (g (getValue (f x)))) 34 | 35 | getValue :: Log b -> b 36 | getValue (Log _ a) = a 37 | 38 | getMsg :: Log b -> [String] 39 | getMsg (Log msg _) = msg 40 | 41 | add1Log = toLogger (+1) "added one" 42 | mult2Log = toLogger (* 2) "multiplied by 2" 43 | 44 | 45 | 46 | {- 47 | Функции с логированием из предыдущего задания возвращают в качестве результата значение с некоторой дополнительной информацией в виде списка сообщений. 48 | Этот список является контекстом. Реализуйте функцию returnLog 49 | returnLog :: a -> Log a 50 | которая является аналогом функции return для контекста Log. 51 | Данная функция должна возвращать переданное ей значение с пустым контекстом. 52 | -} 53 | returnLog :: a -> Log a 54 | returnLog a = Log [] a 55 | 56 | 57 | 58 | 59 | {- 60 | Реализуйте фукцию bindLog 61 | 62 | bindLog :: Log a -> (a -> Log b) -> Log b 63 | которая работает подобно оператору >>= для контекста Log. 64 | 65 | GHCi> Log ["nothing done yet"] 0 `bindLog` add1Log 66 | Log ["nothing done yet","added one"] 1 67 | 68 | GHCi> Log ["nothing done yet"] 3 `bindLog` add1Log `bindLog` mult2Log 69 | Log ["nothing done yet","added one","multiplied by 2"] 8 70 | -} 71 | bindLog :: Log a -> (a -> Log b) -> Log b 72 | bindLog (Log s a) l = (\(Log (ms) r) -> Log (s ++ ms) r) (l a) 73 | 74 | 75 | {- 76 | Реализованные ранее returnLog и bindLog позволяют объявить тип Log представителем класса Monad:-} 77 | instance Monad Log where 78 | return = returnLog 79 | (>>=) = bindLog 80 | -- Используя return и >>=, определите функцию execLoggersList 81 | 82 | execLoggersList :: a -> [a -> Log a] -> Log a 83 | {- которая принимает некоторый элемент, список функций с логированием 84 | и возвращает результат последовательного применения всех функций в списке к переданному элементу вместе со списком сообщений, 85 | которые возвращались данными функциями: 86 | 87 | GHCi> execLoggersList 3 [add1Log, mult2Log, \x -> Log ["multiplied by 100"] (x * 100)] 88 | Log ["added one","multiplied by 2","multiplied by 100"] 800 89 | -} 90 | 91 | execLoggersList x (f:[]) = f x 92 | execLoggersList x (f:fs) = (\(Log (msg:_) _) (Log ms a) -> Log (msg:ms) a) (f x) (execLoggersList (getValue (f x)) fs) 93 | 94 | {- 95 | Любой тип, реализующий Monad, должен также реализовать Applicative, а любой тип, реализующий Applicative, должен реализовать функтор. 96 | Поскольку любая монада всегда является аппликативным функтором, а любой аалпикативный функтор — функтором, 97 | соответствущие инстансы можно получить универсальным способом, подходящим для любого типа: 98 | -} 99 | instance Functor Log where 100 | fmap = liftM 101 | 102 | instance Applicative Log where 103 | pure = return 104 | (<*>) = ap 105 | -------------------------------------------------------------------------------- /FibStream/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/FibStream/Demo.hs -------------------------------------------------------------------------------- /Fibonacci/Fibonacci.hs: -------------------------------------------------------------------------------- 1 | module Fibonacci where 2 | 3 | 4 | fibonacci :: Integer -> Integer 5 | fibonacci n | n == 0 = 0 6 | | n == 1 = 1 7 | | n > 1 = fibonacci (n - 1) + fibonacci (n - 2) 8 | | n < 0 = fibonacci (n + 2) - fibonacci (n + 1) 9 | | otherwise = undefined 10 | 11 | 12 | -- https://wiki.haskell.org/The_Fibonacci_sequence#Tail_recursive 13 | fibonacci' :: Integer -> Integer 14 | fibonacci' n = helper n 0 1 15 | helper n a b | n == 0 = a 16 | | n > 0 = helper (n - 1) b (a + b) 17 | | n < 0 = helper (n + 1) b (a - b) 18 | | otherwise = undefined 19 | -------------------------------------------------------------------------------- /FilterDisj/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/FilterDisj/Demo.hs -------------------------------------------------------------------------------- /FunctorForMap/Demo.hs: -------------------------------------------------------------------------------- 1 | module Demo where 2 | 3 | {- 4 | Определите представителя класса Functor для типов данных Entry и Map. Тип Map представляет словарь, ключами которого являются пары: 5 | -} 6 | data Entry k1 k2 v = Entry (k1, k2) v deriving Show 7 | data Map k1 k2 v = Map [Entry k1 k2 v] deriving Show 8 | {- 9 | В результате должно обеспечиваться следующее поведение: fmap применяет функцию к значениям в словаре, не изменяя при этом ключи. 10 | 11 | GHCi> fmap (map toUpper) $ Map [] 12 | Map [] 13 | 14 | GHCi> fmap (map toUpper) $ Map [Entry (0, 0) "origin", Entry (800, 0) "right corner"] 15 | Map [Entry (0,0) "ORIGIN",Entry (800,0) "RIGHT CORNER"] 16 | -} 17 | 18 | {- 19 | class Functor f where -- класс типа Functor параметризован переменной f 20 | fmap :: (a -> b) -> f a -> f b -- f используется не как тип, а как некоторая функция над типом, поэтому у этой переменной должен быть стрелочный kind 21 | 22 | Функция fmap принимает: 23 | 1) некоторую произвольную функцию; 24 | 2) некоторый контейнерный тип (вместо f подставляется [] или Maybe) с типом элементов a. 25 | Возвращает она тот же самый контейнерный тип, но с типом элементов b. 26 | К каждому элементу контейнера применяется функция f и дальше упаковывается в тот же самый контейнер. 27 | -} 28 | 29 | instance Functor (Entry k1 k2) where 30 | fmap f (Entry (k1, k2) v) = Entry (k1,k2) (f v) 31 | -- (a -> b) -> f a -> f b 32 | -- (a -> b) -> Entry k1 k2 a -> Entry k1 k2 b 33 | 34 | instance Functor (Map k1 k2) where 35 | fmap f (Map []) = Map [] 36 | fmap f (Map (x:xs)) = (\x (Map xs) -> Map (x:xs)) (fmap f x) (fmap f (Map xs)) 37 | -- (a -> b) -> f a -> f b 38 | -- (a -> b) -> Map k1 k2 a -> Map k1 k2 b 39 | -------------------------------------------------------------------------------- /GroupElems/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/GroupElems/Demo.hs -------------------------------------------------------------------------------- /Hello/Hello.hs: -------------------------------------------------------------------------------- 1 | main = putStrLn "Hello, world!" 2 | -------------------------------------------------------------------------------- /Hello/Test.hs: -------------------------------------------------------------------------------- 1 | module Test where 2 | 3 | sayHello = putStrLn "Hello World from module Test!" -------------------------------------------------------------------------------- /Integration/Integration.hs: -------------------------------------------------------------------------------- 1 | module Integration where 2 | 3 | -- https://stepic.org/lesson/%D0%9B%D0%BE%D0%BA%D0%B0%D0%BB%D1%8C%D0%BD%D1%8B%D0%B5-%D1%81%D0%B2%D1%8F%D0%B7%D1%8B%D0%B2%D0%B0%D0%BD%D0%B8%D1%8F-%D0%B8-%D0%BF%D1%80%D0%B0%D0%B2%D0%B8%D0%BB%D0%B0-%D0%BE%D1%82%D1%81%D1%82%D1%83%D0%BF%D0%BE%D0%B2-8414/step/9?unit=1553 4 | 5 | integration :: (Double -> Double) -> Double -> Double -> Double 6 | integration f a b = 7 | let 8 | h = (b - a) / 1000 9 | aHalf = h / 2 10 | y x s i | a == 0 && b == 0 = 0 11 | | i == 0 = y (a + h) (s + f a) (i + 1) 12 | | i == 1000 = s + (f b) 13 | | otherwise = y (x + h) (s + 2 * f x) (i + 1) 14 | in aHalf * (y a 0 0) -------------------------------------------------------------------------------- /IpAddr/Demo.hs: -------------------------------------------------------------------------------- 1 | module Demo where 2 | 3 | a = 12 4 | b = 7.22 5 | c = 4.12 6 | d = 0.12 7 | 8 | ip = show a ++ show b ++ show c ++ show d -------------------------------------------------------------------------------- /KnownToGorkAndMork/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/KnownToGorkAndMork/Demo.hs -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /LogEntry/Demo.hs: -------------------------------------------------------------------------------- 1 | {- 2 | Определите тип записи, который хранит элементы лога. Имя конструктора должно совпадать с именем типа, 3 | и запись должна содержать три поля: 4 | timestamp — время, когда произошло событие (типа UTCTime); 5 | logLevel — уровень события (типа LogLevel); 6 | message — сообщение об ошибке (типа String). 7 | 8 | Определите функцию logLevelToString, возвращающую текстуальное представление типа LogLevel, 9 | и функцию logEntryToString, возвращающую текстуальное представление записи в виде: 10 | <время>: <уровень>: <сообщение> 11 | 12 | Для преобразование типа UTCTime в строку используйте функцию timeToString. 13 | -} 14 | 15 | module Demo where 16 | 17 | import Data.Time.Clock 18 | import Data.Time.Format 19 | --import System.Locale 20 | 21 | timeToString :: UTCTime -> String 22 | timeToString = formatTime defaultTimeLocale "%a %d %T" 23 | 24 | data LogLevel = Error | Warning | Info 25 | instance Show LogLevel where 26 | show Error = "Error" 27 | show Warning = "Warning" 28 | show Info = "Info" 29 | 30 | {- 31 | data LogEntry' = LogEntry' UTCTime LogLevel String 32 | timestamp' :: LogEntry' -> UTCTime 33 | timestamp' (LogEntry' t _ _) = t 34 | logLevel' :: LogEntry' -> LogLevel 35 | logLevel' (LogEntry' _ l _) = l 36 | message' :: LogEntry' -> String 37 | message' (LogEntry' _ _ s) = s 38 | -} 39 | data LogEntry = LogEntry { timestamp :: UTCTime, logLevel :: LogLevel, message :: String } deriving (Show) 40 | 41 | logLevelToString :: LogLevel -> String 42 | logLevelToString Error = "Error" 43 | logLevelToString Warning = "Warning" 44 | logLevelToString Info = "Info" 45 | 46 | logEntryToString :: LogEntry -> String 47 | logEntryToString (LogEntry t l s) = (timeToString t) ++ ": " ++ (show l) ++ ": " ++ s 48 | -------------------------------------------------------------------------------- /Max3/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Max3/Demo.hs -------------------------------------------------------------------------------- /MeanList/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/MeanList/Demo.hs -------------------------------------------------------------------------------- /Mono/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Mono/Demo.hs -------------------------------------------------------------------------------- /MultSecond/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/MultSecond/Demo.hs -------------------------------------------------------------------------------- /NTimes/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/NTimes/Demo.hs -------------------------------------------------------------------------------- /Num/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Num/Demo.hs -------------------------------------------------------------------------------- /OddCont/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/OddCont/Demo.hs -------------------------------------------------------------------------------- /OddsOnly/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/OddsOnly/Demo.hs -------------------------------------------------------------------------------- /On3/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/On3/Demo.hs -------------------------------------------------------------------------------- /Operator/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Operator/Demo.hs -------------------------------------------------------------------------------- /ParsePerson/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/ParsePerson/Demo.hs -------------------------------------------------------------------------------- /Perms/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Perms/Demo.hs -------------------------------------------------------------------------------- /Person/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Person/Demo.hs -------------------------------------------------------------------------------- /PlaneWithCells/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/PlaneWithCells/Demo.hs -------------------------------------------------------------------------------- /Printable/Demo.hs: -------------------------------------------------------------------------------- 1 | module Demo where 2 | 3 | class Printable p where 4 | toString :: p -> [Char] 5 | 6 | instance Printable Bool where 7 | toString True = "true" 8 | toString False = "false" 9 | 10 | instance Printable () where 11 | toString () = "unit type" 12 | 13 | instance (Printable a, Printable b) => Printable (a, b) where 14 | toString x = "(" ++ toString (fst x) ++ "," ++ toString (snd x) ++ ")" -------------------------------------------------------------------------------- /Qsort/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Qsort/Demo.hs -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Haskell-Examples 2 | Примеры программ на языке Haskell 3 | -------------------------------------------------------------------------------- /ReadDigits/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/ReadDigits/Demo.hs -------------------------------------------------------------------------------- /RevRange/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/RevRange/Demo.hs -------------------------------------------------------------------------------- /Roots/Roots.hs: -------------------------------------------------------------------------------- 1 | module Roots where 2 | 3 | 4 | roots :: Double 5 | -> Double 6 | -> Double 7 | -> (Double, Double) 8 | roots a b c = 9 | ( 10 | (-b - sqrt (b ^ 2 - 4 * a * c)) / (2 * a) 11 | , 12 | (-b + sqrt (b ^ 2 - 4 * a * c)) / (2 * a) 13 | ) 14 | 15 | 16 | roots' a b c = 17 | let d = sqrt (b ^ 2 - 4 * a * c) in 18 | ((-b - d) / (2 * a), (-b + d) / (2 * a)) 19 | 20 | 21 | roots'' a b c = 22 | let {d = sqrt (b ^ 2 - 4 * a * c); x1 = (-b - d) / (2 * a); x2 = (-b + d) / (2 * a)} 23 | in (x1, x2) 24 | 25 | 26 | roots''' a b c = 27 | let 28 | x1 = (-b - d) / aTwice 29 | x2 = (-b + d) / aTwice 30 | d = sqrt $ b ^ 2 - 4 * a * c 31 | aTwice = 2 * a 32 | in (x1, x2) 33 | 34 | 35 | rootsDiff a b c = let 36 | (x1,x2) = roots a b c 37 | in x2 - x1 38 | 39 | 40 | roots'''' a b c = (x1, x2) where 41 | x1 = (-b - d) / aTwice 42 | x2 = (-b + d) / aTwice 43 | d = sqrt $ b ^ 2 - 4 * a * c 44 | aTwice = 2 * a -------------------------------------------------------------------------------- /RotateList/Demo.hs: -------------------------------------------------------------------------------- 1 | {- 2 | Реализуйте функцию, задающую циклическое вращение списка. 3 | 4 | rotate :: Int -> [a] -> [a] 5 | rotate n xs = undefined 6 | 7 | При положительном значении целочисленного аргумента вращение должно осуществляться влево, при отрицательном - вправо. 8 | 9 | GHCi> rotate 2 "abcdefghik" 10 | "cdefghikab" 11 | GHCi> rotate (-2) "abcdefghik" 12 | "ikabcdefgh" 13 | 14 | Не забывайте обеспечить работоспособность вашей реализации на бесконечных списках (для сценариев, когда это имеет смысл) и разумную эффективность при большом числе вращений небольшого списка: 15 | 16 | GHCi> :set +s 17 | GHCi> rotate 1234567890 [1..10] 18 | [1,2,3,4,5,6,7,8,9,10] 19 | (0.00 secs, 0 bytes) 20 | -} 21 | 22 | module Demo where 23 | 24 | rotate :: Int -> [a] -> [a] 25 | rotate _ [] = [] 26 | rotate n xs = case drop n xs of 27 | [] -> helper (mod n $ length xs) xs 28 | _ -> helper n xs 29 | 30 | helper _ [] = [] 31 | helper 0 xs = xs 32 | helper n xs | n > 0 = drop n xs ++ take n xs 33 | | n < 0 = let shift = length xs - (-n) in helper shift xs 34 | 35 | {- 36 | https://wiki.haskell.org/99_questions/Solutions/19 37 | http://langref.org/fsharp+clojure+scala+haskell/lists/modification/rotate 38 | http://www.cs.unc.edu/~bcw/comp524-sp14/examples/haskell/soln.hs 39 | -} -------------------------------------------------------------------------------- /SafeEnum/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/SafeEnum/Demo.hs -------------------------------------------------------------------------------- /Seq/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Seq/Demo.hs -------------------------------------------------------------------------------- /SeqA/SeqA.hs: -------------------------------------------------------------------------------- 1 | module SeqA where 2 | 3 | // https://stepic.org/lesson/%D0%9B%D0%BE%D0%BA%D0%B0%D0%BB%D1%8C%D0%BD%D1%8B%D0%B5-%D1%81%D0%B2%D1%8F%D0%B7%D1%8B%D0%B2%D0%B0%D0%BD%D0%B8%D1%8F-%D0%B8-%D0%BF%D1%80%D0%B0%D0%B2%D0%B8%D0%BB%D0%B0-%D0%BE%D1%82%D1%81%D1%82%D1%83%D0%BF%D0%BE%D0%B2-8414/step/6?unit=1553 4 | 5 | seqA :: Integer -> Integer 6 | seqA n | n == 0 = 1 7 | | n == 1 = 2 8 | | n == 2 = 3 9 | | otherwise = helper (n - 2) 1 2 3 10 | where 11 | helper n a b c | n == 0 = c 12 | | otherwise = helper (n - 1) b c (c + b - 2 * a) -------------------------------------------------------------------------------- /Sum3/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/Sum3/Demo.hs -------------------------------------------------------------------------------- /SumAndCount/SumAndCount.hs: -------------------------------------------------------------------------------- 1 | module SumAndCount where 2 | 3 | // https://stepic.org/lesson/%D0%9B%D0%BE%D0%BA%D0%B0%D0%BB%D1%8C%D0%BD%D1%8B%D0%B5-%D1%81%D0%B2%D1%8F%D0%B7%D1%8B%D0%B2%D0%B0%D0%BD%D0%B8%D1%8F-%D0%B8-%D0%BF%D1%80%D0%B0%D0%B2%D0%B8%D0%BB%D0%B0-%D0%BE%D1%82%D1%81%D1%82%D1%83%D0%BF%D0%BE%D0%B2-8414/step/8?unit=1553 4 | 5 | sum'n'count :: Integer -> (Integer, Integer) 6 | sum'n'count x | x == 0 = (0, 1) 7 | | otherwise = let 8 | helper 0 s c = (s,c) 9 | helper n s c = helper (quot n 10) (s + rem n 10) (c + 1) 10 | in helper (abs x) 0 0 -------------------------------------------------------------------------------- /SumFstFst/Demo.hs: -------------------------------------------------------------------------------- 1 | module Demo where 2 | 3 | import Data.Function 4 | 5 | sumFstFst = (+) `on` helper where helper pp = fst $ fst pp 6 | 7 | sumFstFst' = (+) `on` (\pp -> fst $ fst pp) 8 | 9 | sumFstFst'' = (+) `on` (fst . fst) 10 | 11 | p1 = ((1,2),(3,4)) 12 | p2 = ((3,4),(5,6)) 13 | -------------------------------------------------------------------------------- /SumIt/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/SumIt/Demo.hs -------------------------------------------------------------------------------- /SumOdd/Demo.hs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gusenov/stepik-functional-programming-hs/904164012b9b842a15d5ba3af05cfe589295fa5c/SumOdd/Demo.hs -------------------------------------------------------------------------------- /TheListMonad/Demo.hs: -------------------------------------------------------------------------------- 1 | -- import Control.Monad 2 | import Prelude hiding (Monad, return, fail, (>>=), (>>)) 3 | 4 | class Monad m where 5 | return :: a -> m a 6 | (>>=) :: m a -> (a -> m b) -> m b 7 | (>>) :: m a -> m b -> m b 8 | fail :: String -> m a 9 | 10 | instance Monad [] where 11 | return x = [x] 12 | xs >>= k = concat (map k xs) 13 | fail _ = [] 14 | 15 | foo1 = do { x <- [1,2,3]; y <- [4,5,6]; return(x, y) } 16 | foo2 = 17 | [1, 2, 3] >>= ( 18 | \x -> [4, 5, 6] >>= ( 19 | \y -> return (x,y) 20 | ) 21 | ) -------------------------------------------------------------------------------- /Token/Demo.hs: -------------------------------------------------------------------------------- 1 | module Demo where 2 | 3 | import Data.Char 4 | 5 | {- 6 | Рассмотрим язык арифметические выражения, которые состоят из чисел, скобок, операций сложения и вычитания. 7 | Конструкции данного языка можно представить следующим типом данных: 8 | -} 9 | data Token = Number Int | Plus | Minus | LeftBrace | RightBrace 10 | deriving (Eq, Show) 11 | 12 | {- 13 | Реализуйте лексер арифметических выражений. Для начала реализуйте следующую функцию: 14 | -} 15 | asToken :: String -> Maybe Token 16 | {- 17 | Она проверяет, является ли переданная строка числом (используйте функцию isDigit из модуля Data.Char), 18 | знаком "+" или "-", открывающейся или закрывающейся скобкой. 19 | Если является, то она возвращает нужное значение обёрнутое в Just, в противном случае - Nothing: 20 | 21 | GHCi> asToken "123" 22 | Just (Number 123) 23 | 24 | GHCi> asToken "abc" 25 | Nothing 26 | -} 27 | asToken "+" = Just Plus 28 | asToken "-" = Just Minus 29 | asToken "(" = Just LeftBrace 30 | asToken ")" = Just RightBrace 31 | asToken s = if all isDigit s then Just (Number (read s :: Int)) else Nothing 32 | 33 | -- Далее, реализуйте функцию tokenize: 34 | tokenize :: String -> Maybe [Token] 35 | {- 36 | Функция принимает на вход строку и если каждое слово является корректным токеном, 37 | то она возвращает список этих токенов, завёрнутый в Just. В противном случае возвращается Nothing. 38 | 39 | Функция должна разбивать входную строку на отдельные слова по пробелам (используйте библиотечную функцию words). 40 | Далее, полученный список строк должен быть свёрнут с использованием функции asToken и свойств монады Maybe: 41 | 42 | GHCi> tokenize "1 + 2" 43 | Just [Number 1,Plus,Number 2] 44 | 45 | GHCi> tokenize "1 + ( 7 - 2 )" 46 | Just [Number 1,Plus,LeftBrace,Number 7,Minus,Number 2,RightBrace] 47 | 48 | GHCi> tokenize "1 + abc" 49 | Nothing 50 | 51 | Обратите внимание, что скобки отделяются пробелами от остальных выражений! 52 | -} 53 | tokenize s = if all (\x -> x /= Nothing) (tokenizeHelper s) then Just ((tokenizeHelper2 . tokenizeHelper) s) else Nothing 54 | 55 | tokenizeHelper s = fmap asToken (words s) 56 | 57 | tokenizeHelper2 [] = [] 58 | tokenizeHelper2 ((Just x):xs) = x:(tokenizeHelper2 xs) -------------------------------------------------------------------------------- /TwoDigits2Int/TwoDigits2Int.hs: -------------------------------------------------------------------------------- 1 | import Data.Char 2 | twoDigits2Int :: Char -> Char -> Int 3 | twoDigits2Int x y = if isDigit x && isDigit y then digitToInt x * 10 + digitToInt y else 100 --------------------------------------------------------------------------------