mirror of
https://github.com/BinRoot/Haskell-Data-Analysis-Cookbook.git
synced 2024-10-26 08:19:43 +03:00
Added Ch 5, fixed Ch 4
This commit is contained in:
parent
285a8e4ca7
commit
84ed7233dc
25
Ch05/Code01_tree/Code0501.cabal
Normal file
25
Ch05/Code01_tree/Code0501.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Code0401.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0501
|
||||
version: 0.1.0.0
|
||||
synopsis: Implementing a tree.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0501
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
11
Ch05/Code01_tree/Main.hs
Normal file
11
Ch05/Code01_tree/Main.hs
Normal file
@ -0,0 +1,11 @@
|
||||
data Tree a = Node { value :: a
|
||||
, left :: (Tree a)
|
||||
, right :: (Tree a) }
|
||||
| Leaf
|
||||
deriving Show
|
||||
|
||||
main = do
|
||||
let n1 = Node { value = 1, left = Leaf, right = Leaf }
|
||||
let n2 = Node { value = 2, left = Leaf, right = Leaf }
|
||||
let n3 = Node { value = 3, left = n1 , right = n2 }
|
||||
print n3
|
5
Ch05/Code01_tree/Makefile
Normal file
5
Ch05/Code01_tree/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0501 *~
|
25
Ch05/Code02_rose/Code0502.cabal
Normal file
25
Ch05/Code02_rose/Code0502.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Code0402.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0502
|
||||
version: 0.1.0.0
|
||||
synopsis: Implementing a rose tree.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0502
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
11
Ch05/Code02_rose/Main.hs
Normal file
11
Ch05/Code02_rose/Main.hs
Normal file
@ -0,0 +1,11 @@
|
||||
data Tree a = Node { value :: a
|
||||
, children :: [Tree a] }
|
||||
deriving Show
|
||||
|
||||
main = do
|
||||
let n1 = Node { value = 1, children = [] }
|
||||
let n2 = Node { value = 2, children = [] }
|
||||
let n3 = Node { value = 3, children = [] }
|
||||
let n4 = Node { value = 6, children = [n1, n2, n3] }
|
||||
print n4
|
||||
|
5
Ch05/Code02_rose/Makefile
Normal file
5
Ch05/Code02_rose/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0502 *~
|
25
Ch05/Code03_depth/Code0503.cabal
Normal file
25
Ch05/Code03_depth/Code0503.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Code0403.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0503
|
||||
version: 0.1.0.0
|
||||
synopsis: Depth first search.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0503
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7, containers >=0.5 && <0.6
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
20
Ch05/Code03_depth/Main.hs
Normal file
20
Ch05/Code03_depth/Main.hs
Normal file
@ -0,0 +1,20 @@
|
||||
import Data.Tree (rootLabel, subForest, Tree(..))
|
||||
import Data.List (tails)
|
||||
|
||||
main = do
|
||||
print $ depthFirst someTree
|
||||
print $ add someTree
|
||||
|
||||
depthFirst :: Tree a -> [a]
|
||||
depthFirst (Node r forest) = r : concat [depthFirst t | t <- forest]
|
||||
|
||||
add :: Tree Int -> Int
|
||||
add (Node r forest) = r + sum [add t | t <- forest]
|
||||
|
||||
someTree :: Tree Int
|
||||
someTree = r
|
||||
where r = Node { rootLabel = 0, subForest = [n1, n4] }
|
||||
n1 = Node { rootLabel = 1, subForest = [n2, n3] }
|
||||
n2 = Node { rootLabel = 2, subForest = [] }
|
||||
n3 = Node { rootLabel = 3, subForest = [] }
|
||||
n4 = Node { rootLabel = 4, subForest = [] }
|
5
Ch05/Code03_depth/Makefile
Normal file
5
Ch05/Code03_depth/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0503 *~
|
25
Ch05/Code04_breadth/Code0504.cabal
Normal file
25
Ch05/Code04_breadth/Code0504.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Code0404.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0504
|
||||
version: 0.1.0.0
|
||||
synopsis: Breadth-first search.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0504
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7, containers >=0.5 && <0.6
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
22
Ch05/Code04_breadth/Main.hs
Normal file
22
Ch05/Code04_breadth/Main.hs
Normal file
@ -0,0 +1,22 @@
|
||||
import Data.Tree
|
||||
import Data.List (tails)
|
||||
|
||||
main = do
|
||||
print $ breadthFirst someTree
|
||||
print $ add someTree
|
||||
|
||||
breadthFirst :: Tree a -> [a]
|
||||
breadthFirst t = bf [t]
|
||||
where bf forest | null forest = []
|
||||
| otherwise = map rootLabel forest ++
|
||||
bf (concat (map subForest forest))
|
||||
add :: Tree Int -> Int
|
||||
add t = sum $ breadthFirst t
|
||||
|
||||
someTree :: Tree Int
|
||||
someTree = root
|
||||
where root = Node { rootLabel = 0, subForest = [n1, n4] }
|
||||
n1 = Node { rootLabel = 1, subForest = [n2, n3] }
|
||||
n2 = Node { rootLabel = 2, subForest = [] }
|
||||
n3 = Node { rootLabel = 3, subForest = [] }
|
||||
n4 = Node { rootLabel = 4, subForest = [] }
|
5
Ch05/Code04_breadth/Makefile
Normal file
5
Ch05/Code04_breadth/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0504 *~
|
25
Ch05/Code05_fold/Code0505.cabal
Normal file
25
Ch05/Code05_fold/Code0505.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Code0405.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0505
|
||||
version: 0.1.0.0
|
||||
synopsis: Implementing a foldable instance of a tree.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0505
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
27
Ch05/Code05_fold/Main.hs
Normal file
27
Ch05/Code05_fold/Main.hs
Normal file
@ -0,0 +1,27 @@
|
||||
import Data.Monoid (mempty, mappend)
|
||||
import qualified Data.Foldable as F
|
||||
import Data.Foldable (Foldable, foldMap)
|
||||
|
||||
data Tree a = Node { value :: a
|
||||
, children :: [Tree a] }
|
||||
| Null
|
||||
deriving Show
|
||||
|
||||
main :: IO ()
|
||||
main = print $ add someTree
|
||||
|
||||
add :: Tree Integer -> Integer
|
||||
add = F.foldr1 (+)
|
||||
|
||||
instance Foldable Tree where
|
||||
foldMap f Null = mempty
|
||||
foldMap f (Node val xs) = foldr mappend (f val)
|
||||
[foldMap f x | x <- xs]
|
||||
|
||||
someTree :: Tree Integer
|
||||
someTree = root
|
||||
where root = Node { value = 0, children = [n1, n4] }
|
||||
n1 = Node { value = 1, children = [n2, n3] }
|
||||
n2 = Node { value = 2, children = [] }
|
||||
n3 = Node { value = 3, children = [] }
|
||||
n4 = Node { value = 4, children = [] }
|
5
Ch05/Code05_fold/Makefile
Normal file
5
Ch05/Code05_fold/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0505 *~
|
25
Ch05/Code06_height/Code0506.cabal
Normal file
25
Ch05/Code06_height/Code0506.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Code0406.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0506
|
||||
version: 0.1.0.0
|
||||
synopsis: Calculating height of tree.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0506
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7, containers >=0.5 && <0.6
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
17
Ch05/Code06_height/Main.hs
Normal file
17
Ch05/Code06_height/Main.hs
Normal file
@ -0,0 +1,17 @@
|
||||
import Data.List (maximum)
|
||||
import Data.Tree
|
||||
|
||||
main = do
|
||||
print $ height someTree
|
||||
|
||||
height :: Tree a -> Int
|
||||
height (Node val []) = 1
|
||||
height (Node val xs) = 1 + maximum (map height xs)
|
||||
|
||||
someTree :: Tree Integer
|
||||
someTree = root
|
||||
where root = Node 0 [n1, n4]
|
||||
n1 = Node 1 [n2, n3]
|
||||
n2 = Node 2 []
|
||||
n3 = Node 3 []
|
||||
n4 = Node 4 []
|
5
Ch05/Code06_height/Makefile
Normal file
5
Ch05/Code06_height/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0506 *~
|
30
Ch05/Code07_bst/BSTree.hs
Normal file
30
Ch05/Code07_bst/BSTree.hs
Normal file
@ -0,0 +1,30 @@
|
||||
module BSTree (insert, find, single) where
|
||||
|
||||
data Tree a = Node { value :: a
|
||||
, left :: (Tree a)
|
||||
, right :: (Tree a)}
|
||||
| Null
|
||||
deriving (Eq, Show)
|
||||
|
||||
valid :: Ord t => Tree t -> Bool
|
||||
valid (Node v l r) = leftValid && rightValid
|
||||
where leftValid = if notNull l then valid l && value l <= v else True
|
||||
rightValid = if notNull r then valid r && v <= value r else True
|
||||
notNull t = if t==Null then False else True
|
||||
|
||||
single :: a -> Tree a
|
||||
single n = Node n Null Null
|
||||
|
||||
insert :: Ord a => Tree a -> a -> Tree a
|
||||
insert (Node v l r) v'
|
||||
| v' < v = Node v (insert l v') r
|
||||
| v' > v = Node v l (insert r v')
|
||||
| otherwise = Node v l r
|
||||
insert _ v' = Node v' Null Null
|
||||
|
||||
find :: Ord a => Tree a -> a -> Bool
|
||||
find (Node v l r) v'
|
||||
| v' < v = find l v'
|
||||
| v' > v = find r v'
|
||||
| otherwise = True
|
||||
find Null v' = False
|
25
Ch05/Code07_bst/Code0507.cabal
Normal file
25
Ch05/Code07_bst/Code0507.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Codo0407.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0507
|
||||
version: 0.1.0.0
|
||||
synopsis: Binary search tree implementation.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0507
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
9
Ch05/Code07_bst/Main.hs
Normal file
9
Ch05/Code07_bst/Main.hs
Normal file
@ -0,0 +1,9 @@
|
||||
import BSTree
|
||||
|
||||
main = do
|
||||
let tree = single 5
|
||||
let nodes = [6,4,8,2,9]
|
||||
let bst = foldl insert tree nodes
|
||||
print bst
|
||||
print $ find bst 1
|
||||
print $ find bst 2
|
5
Ch05/Code07_bst/Makefile
Normal file
5
Ch05/Code07_bst/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0507 *~
|
25
Ch05/Code08_valid/Code0508.cabal
Normal file
25
Ch05/Code08_valid/Code0508.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Code0408.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0508
|
||||
version: 0.1.0.0
|
||||
synopsis: Validating a BST.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0508
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
22
Ch05/Code08_valid/Main.hs
Normal file
22
Ch05/Code08_valid/Main.hs
Normal file
@ -0,0 +1,22 @@
|
||||
data Tree a = Node { value :: a
|
||||
, left :: (Tree a)
|
||||
, right :: (Tree a)}
|
||||
| Null
|
||||
deriving (Eq, Show)
|
||||
|
||||
main = do
|
||||
print $ valid someTree
|
||||
|
||||
someTree :: Tree Int
|
||||
someTree = root
|
||||
where root = Node 0 n1 n4
|
||||
n1 = Node 1 n2 n3
|
||||
n2 = Node 2 Null Null
|
||||
n3 = Node 3 Null Null
|
||||
n4 = Node 4 Null Null
|
||||
|
||||
valid :: Ord t => Tree t -> Bool
|
||||
valid (Node v l r) = leftValid && rightValid
|
||||
where leftValid = if notNull l then valid l && value l <= v else True
|
||||
rightValid = if notNull r then valid r && v <= value r else True
|
||||
notNull t = t/=Null
|
5
Ch05/Code08_valid/Makefile
Normal file
5
Ch05/Code08_valid/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0508 *~
|
25
Ch05/Code09_avl/Code0509.cabal
Normal file
25
Ch05/Code09_avl/Code0509.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Code0409.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0509
|
||||
version: 0.1.0.0
|
||||
synopsis: Balancing trees.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0509
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7, containers >=0.5 && <0.6, AvlTree >=4.2 && <4.3, COrdering >=2.3 && <2.4
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
9
Ch05/Code09_avl/Main.hs
Normal file
9
Ch05/Code09_avl/Main.hs
Normal file
@ -0,0 +1,9 @@
|
||||
import Data.Tree.AVL
|
||||
import Data.COrdering
|
||||
|
||||
main = do
|
||||
let avl = asTree fstCC [4,2,1,5,3,6]
|
||||
let min = tryReadL avl
|
||||
let max = tryReadR avl
|
||||
print min
|
||||
print max
|
8
Ch05/Code09_avl/Main2.hs
Normal file
8
Ch05/Code09_avl/Main2.hs
Normal file
@ -0,0 +1,8 @@
|
||||
import qualified Data.Set as S
|
||||
|
||||
main = do
|
||||
let s = S.fromList [4,2,1,5,3,6]
|
||||
let min = S.findMin s
|
||||
let max = S.findMax s
|
||||
print min
|
||||
print max
|
5
Ch05/Code09_avl/Makefile
Normal file
5
Ch05/Code09_avl/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0509 *~
|
25
Ch05/Code10_heap/Code0510.cabal
Normal file
25
Ch05/Code10_heap/Code0510.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Code0410.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0510
|
||||
version: 0.1.0.0
|
||||
synopsis: Implementing a heap.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0510
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7, lens >=4.1 && <4.2, heap >=1.0 && <1.1
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
9
Ch05/Code10_heap/Main.hs
Normal file
9
Ch05/Code10_heap/Main.hs
Normal file
@ -0,0 +1,9 @@
|
||||
import MinHeap
|
||||
|
||||
main = do
|
||||
let heap = foldr (\x -> insert x x) empty [11, 5, 3, 4, 8]
|
||||
print $ weights heap
|
||||
print $ weights $ iterate deleteMin heap !! 1
|
||||
print $ weights $ iterate deleteMin heap !! 2
|
||||
print $ weights $ iterate deleteMin heap !! 3
|
||||
print $ weights $ iterate deleteMin heap !! 4
|
19
Ch05/Code10_heap/Main2.hs
Normal file
19
Ch05/Code10_heap/Main2.hs
Normal file
@ -0,0 +1,19 @@
|
||||
import Data.Heap (MinHeap, MaxHeap, empty, insert, view)
|
||||
|
||||
main = do
|
||||
let myList = [11, 5, 3, 4, 8]
|
||||
let minHeap = minheapFromList myList
|
||||
let maxHeap = maxheapFromList myList
|
||||
print $ view minHeap
|
||||
print $ view maxHeap
|
||||
|
||||
m = empty :: MinHeap Int
|
||||
|
||||
minheapFromList :: [Int] -> MinHeap Int
|
||||
minheapFromList ls = foldr insert empty ls
|
||||
|
||||
maxheapFromList :: [Int] -> MaxHeap Int
|
||||
maxheapFromList ls = foldr insert empty ls
|
||||
|
||||
-- Just (3,fromList [(4,()),(11,()),(5,()),(8,())])
|
||||
-- Just (11,fromList [(8,()),(3,()),(5,()),(4,())])
|
5
Ch05/Code10_heap/Makefile
Normal file
5
Ch05/Code10_heap/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0510 *~
|
50
Ch05/Code10_heap/MinHeap.hs
Normal file
50
Ch05/Code10_heap/MinHeap.hs
Normal file
@ -0,0 +1,50 @@
|
||||
module MinHeap (empty, insert, deleteMin, viewMin, weights) where
|
||||
|
||||
import Control.Lens (element, set)
|
||||
import Data.Maybe (isJust, fromJust)
|
||||
|
||||
|
||||
data Heap v = Heap { items :: [Node v] } deriving Show
|
||||
|
||||
data Node v = Node { value :: v, weight :: Int } deriving Show
|
||||
|
||||
empty = Heap []
|
||||
|
||||
insert v w (Heap xs) = percolateUp position items'
|
||||
where items' = xs ++ [Node v w]
|
||||
position = length items' - 1
|
||||
|
||||
deleteMin (Heap xs)
|
||||
| null xs = Heap xs
|
||||
| otherwise = percolateDown 1 items'
|
||||
where items' = set (element 1) (last xs) (init xs)
|
||||
|
||||
viewMin heap@(Heap (_:y:_)) = Just (y, deleteMin heap)
|
||||
viewMin _ = Nothing
|
||||
|
||||
percolateDown i items
|
||||
| isJust left && isJust right = percolateDown i' (swap i i' items)
|
||||
| isJust left = percolateDown l (swap i l items)
|
||||
| otherwise = Heap items
|
||||
where left = if l >= length items then Nothing
|
||||
else Just $ items !! l
|
||||
right = if r >= length items then Nothing
|
||||
else Just $ items !! r
|
||||
i' = if (weight (fromJust left)) < (weight (fromJust right))
|
||||
then l else r
|
||||
l = 2*i
|
||||
r = 2*i + 1
|
||||
|
||||
percolateUp i items
|
||||
| i == 1 = Heap items
|
||||
| w < w' = percolateUp c (swap i c items)
|
||||
| otherwise = Heap items
|
||||
where w = weight $ items !! i
|
||||
w' = weight $ items !! c
|
||||
c = i `div` 2
|
||||
|
||||
swap i j xs = set (element j) vi (set (element i) vj xs)
|
||||
where vi = xs !! i
|
||||
vj = xs !! j
|
||||
|
||||
weights heap = map weight ((tail.items) heap)
|
25
Ch05/Code11_huff/Code0511.cabal
Normal file
25
Ch05/Code11_huff/Code0511.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Code0411.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0511
|
||||
version: 0.1.0.0
|
||||
synopsis: Implementing a Huffman tree.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0511
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7, lens >=4.1 && <4.2, HTTP >=4000.2 && <4000.3, containers >=0.5 && <0.6
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
45
Ch05/Code11_huff/Main.hs
Normal file
45
Ch05/Code11_huff/Main.hs
Normal file
@ -0,0 +1,45 @@
|
||||
import Data.List (group, sort)
|
||||
import MinHeap
|
||||
import Network.HTTP (getRequest, getResponseBody, simpleHTTP)
|
||||
import Data.Char (isAscii)
|
||||
import Data.Maybe (fromJust)
|
||||
import Data.Map (fromList, (!))
|
||||
|
||||
freq xs = map (\x -> (head x, length x)) . group . sort $ xs
|
||||
|
||||
main = do
|
||||
rsp <- simpleHTTP (getRequest "http://norvig.com/big.txt")
|
||||
html <- fmap (takeWhile isAscii) (getResponseBody rsp)
|
||||
let freqs = freq html
|
||||
let heap = foldr (\(v,w) -> insert (single v) w) empty freqs
|
||||
let tree = htree heap
|
||||
let m = fromList $ codes tree
|
||||
print $ encode "hello world" m
|
||||
|
||||
encode str m = concat $ map (m !) str
|
||||
|
||||
data HTree = HTree { value :: Char
|
||||
, left :: HTree
|
||||
, right :: HTree }
|
||||
| Null
|
||||
deriving (Eq, Show)
|
||||
|
||||
single v = HTree v Null Null
|
||||
|
||||
htree heap = if length (items heap) == 2
|
||||
then case fromJust (viewMin heap) of (a,b,c) -> a
|
||||
else htree $ insert newNode (w1 + w2) heap3
|
||||
where (min1, w1, heap2) = fromJust $ viewMin heap
|
||||
(min2, w2, heap3) = fromJust $ viewMin heap2
|
||||
newNode = HTree { value = ' '
|
||||
, left = min1
|
||||
, right = min2 }
|
||||
|
||||
codes htree = codes' htree ""
|
||||
where codes' (HTree v l r) str
|
||||
| l==Null && r==Null = [(v, str)]
|
||||
| r==Null = leftCodes
|
||||
| l==Null = rightCodes
|
||||
| otherwise = leftCodes ++ rightCodes
|
||||
where leftCodes = codes' l (str ++ "0")
|
||||
rightCodes = codes' r (str ++ "1")
|
5
Ch05/Code11_huff/Makefile
Normal file
5
Ch05/Code11_huff/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0511 *~
|
51
Ch05/Code11_huff/MinHeap.hs
Normal file
51
Ch05/Code11_huff/MinHeap.hs
Normal file
@ -0,0 +1,51 @@
|
||||
module MinHeap (items, empty, insert, deleteMin, viewMin, weights) where
|
||||
|
||||
import Control.Lens (element, set)
|
||||
import Data.Maybe (isJust, fromJust)
|
||||
|
||||
|
||||
data Heap v = Heap { items :: [Node v] } deriving Show
|
||||
|
||||
data Node v = Node { value :: v, weight :: Int }
|
||||
| Null deriving Show
|
||||
|
||||
empty = Heap [Null]
|
||||
|
||||
insert v w (Heap xs) = percolateUp position items'
|
||||
where items' = xs ++ [Node v w]
|
||||
position = length items' - 1
|
||||
|
||||
deleteMin (Heap xs)
|
||||
| null xs = Heap xs
|
||||
| otherwise = percolateDown 1 items'
|
||||
where items' = set (element 1) (last xs) (init xs)
|
||||
|
||||
viewMin heap@(Heap (_:y:_)) = Just (value y, weight y, deleteMin heap)
|
||||
viewMin _ = Nothing
|
||||
|
||||
percolateDown i items
|
||||
| isJust left && isJust right = percolateDown i' (swap i i' items)
|
||||
| isJust left = percolateDown l (swap i l items)
|
||||
| otherwise = Heap items
|
||||
where left = if l >= length items then Nothing
|
||||
else Just $ items !! l
|
||||
right = if r >= length items then Nothing
|
||||
else Just $ items !! r
|
||||
i' = if (weight (fromJust left)) < (weight (fromJust right))
|
||||
then l else r
|
||||
l = 2*i
|
||||
r = 2*i + 1
|
||||
|
||||
percolateUp i items
|
||||
| i == 1 = Heap items
|
||||
| w < w' = percolateUp c (swap i c items)
|
||||
| otherwise = Heap items
|
||||
where w = weight $ items !! i
|
||||
w' = weight $ items !! c
|
||||
c = i `div` 2
|
||||
|
||||
swap i j xs = set (element j) vi (set (element i) vj xs)
|
||||
where vi = xs !! i
|
||||
vj = xs !! j
|
||||
|
||||
weights heap = map weight ((tail.items) heap)
|
25
Ch05/Code12_huff/Code0512.cabal
Normal file
25
Ch05/Code12_huff/Code0512.cabal
Normal file
@ -0,0 +1,25 @@
|
||||
-- Initial Code0412.cabal generated by cabal init. For further
|
||||
-- documentation, see http://haskell.org/cabal/users-guide/
|
||||
|
||||
name: Code0512
|
||||
version: 0.1.0.0
|
||||
synopsis: Using a Huffman tree.
|
||||
-- description:
|
||||
homepage: haskelldata.com
|
||||
license: GPL-2
|
||||
license-file: ../LICENSE
|
||||
author: Nishant Shukla
|
||||
maintainer: nick722@gmail.com
|
||||
-- copyright:
|
||||
category: Data
|
||||
build-type: Simple
|
||||
-- extra-source-files:
|
||||
cabal-version: >=1.10
|
||||
|
||||
executable Code0512
|
||||
main-is: Main.hs
|
||||
-- other-modules:
|
||||
-- other-extensions:
|
||||
build-depends: base >=4.6 && <4.7, lens >=4.1 && <4.2, HTTP >=4000.2 && <4000.3, containers >=0.5 && <0.6
|
||||
-- hs-source-dirs:
|
||||
default-language: Haskell2010
|
56
Ch05/Code12_huff/Main.hs
Normal file
56
Ch05/Code12_huff/Main.hs
Normal file
@ -0,0 +1,56 @@
|
||||
import Data.List (group, sort)
|
||||
import MinHeap
|
||||
import Network.HTTP (getRequest, getResponseBody, simpleHTTP)
|
||||
import Data.Char (isAscii)
|
||||
import Data.Maybe (fromJust)
|
||||
import Data.Map (fromList, (!))
|
||||
|
||||
freq xs = map (\x -> (head x, length x)) . group . sort $ xs
|
||||
|
||||
main = do
|
||||
rsp <- simpleHTTP (getRequest "http://norvig.com/big.txt")
|
||||
html <- fmap (takeWhile isAscii) (getResponseBody rsp)
|
||||
let freqs = freq html
|
||||
let heap = foldr (\(v,w) -> insert (single v) w) empty freqs
|
||||
let tree = htree heap
|
||||
let m = fromList $ codes tree
|
||||
print $ encode "hello world" m
|
||||
print $ decode (encode "hello world" m) tree
|
||||
|
||||
encode str m = concat $ map (m !) str
|
||||
|
||||
decode str htree = decode' str htree
|
||||
where decode' "" _ = ""
|
||||
decode' ('0':str) (HTree _ l _)
|
||||
| leaf l = value l : decode' str htree
|
||||
| otherwise = decode' str l
|
||||
decode' ('1':str) (HTree v _ r)
|
||||
| leaf r = value r : decode' str htree
|
||||
| otherwise = decode' str r
|
||||
leaf tree = left tree == Null && right tree == Null
|
||||
|
||||
data HTree = HTree { value :: Char
|
||||
, left :: HTree
|
||||
, right :: HTree }
|
||||
| Null
|
||||
deriving (Eq, Show)
|
||||
|
||||
single v = HTree v Null Null
|
||||
|
||||
htree heap = if length (items heap) == 2
|
||||
then case fromJust (viewMin heap) of (a,b,c) -> a
|
||||
else htree $ insert newNode (w1 + w2) heap3
|
||||
where (min1, w1, heap2) = fromJust $ viewMin heap
|
||||
(min2, w2, heap3) = fromJust $ viewMin heap2
|
||||
newNode = HTree { value = ' '
|
||||
, left = min1
|
||||
, right = min2 }
|
||||
|
||||
codes htree = codes' htree ""
|
||||
where codes' (HTree v l r) str
|
||||
| l==Null && r==Null = [(v, str)]
|
||||
| r==Null = leftCodes
|
||||
| l==Null = rightCodes
|
||||
| otherwise = leftCodes ++ rightCodes
|
||||
where leftCodes = codes' l (str ++ "0")
|
||||
rightCodes = codes' r (str ++ "1")
|
5
Ch05/Code12_huff/Makefile
Normal file
5
Ch05/Code12_huff/Makefile
Normal file
@ -0,0 +1,5 @@
|
||||
default:
|
||||
cabal install --bindir=./
|
||||
|
||||
clean:
|
||||
rm -rf dist Setup.hs Code0512 *~
|
51
Ch05/Code12_huff/MinHeap.hs
Normal file
51
Ch05/Code12_huff/MinHeap.hs
Normal file
@ -0,0 +1,51 @@
|
||||
module MinHeap (items, empty, insert, deleteMin, viewMin, weights) where
|
||||
|
||||
import Control.Lens (element, set)
|
||||
import Data.Maybe (isJust, fromJust)
|
||||
|
||||
|
||||
data Heap v = Heap { items :: [Node v] } deriving Show
|
||||
|
||||
data Node v = Node { value :: v, weight :: Int }
|
||||
| Null deriving Show
|
||||
|
||||
empty = Heap [Null]
|
||||
|
||||
insert v w (Heap xs) = percolateUp position items'
|
||||
where items' = xs ++ [Node v w]
|
||||
position = length items' - 1
|
||||
|
||||
deleteMin (Heap xs)
|
||||
| null xs = Heap xs
|
||||
| otherwise = percolateDown 1 items'
|
||||
where items' = set (element 1) (last xs) (init xs)
|
||||
|
||||
viewMin heap@(Heap (_:y:_)) = Just (value y, weight y, deleteMin heap)
|
||||
viewMin _ = Nothing
|
||||
|
||||
percolateDown i items
|
||||
| isJust left && isJust right = percolateDown i' (swap i i' items)
|
||||
| isJust left = percolateDown l (swap i l items)
|
||||
| otherwise = Heap items
|
||||
where left = if l >= length items then Nothing
|
||||
else Just $ items !! l
|
||||
right = if r >= length items then Nothing
|
||||
else Just $ items !! r
|
||||
i' = if (weight (fromJust left)) < (weight (fromJust right))
|
||||
then l else r
|
||||
l = 2*i
|
||||
r = 2*i + 1
|
||||
|
||||
percolateUp i items
|
||||
| i == 1 = Heap items
|
||||
| w < w' = percolateUp c (swap i c items)
|
||||
| otherwise = Heap items
|
||||
where w = weight $ items !! i
|
||||
w' = weight $ items !! c
|
||||
c = i `div` 2
|
||||
|
||||
swap i j xs = set (element j) vi (set (element i) vj xs)
|
||||
where vi = xs !! i
|
||||
vj = xs !! j
|
||||
|
||||
weights heap = map weight ((tail.items) heap)
|
339
Ch05/LICENSE
Normal file
339
Ch05/LICENSE
Normal file
@ -0,0 +1,339 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 2, June 1991
|
||||
|
||||
Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
|
||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The licenses for most software are designed to take away your
|
||||
freedom to share and change it. By contrast, the GNU General Public
|
||||
License is intended to guarantee your freedom to share and change free
|
||||
software--to make sure the software is free for all its users. This
|
||||
General Public License applies to most of the Free Software
|
||||
Foundation's software and to any other program whose authors commit to
|
||||
using it. (Some other Free Software Foundation software is covered by
|
||||
the GNU Lesser General Public License instead.) You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
this service if you wish), that you receive source code or can get it
|
||||
if you want it, that you can change the software or use pieces of it
|
||||
in new free programs; and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to make restrictions that forbid
|
||||
anyone to deny you these rights or to ask you to surrender the rights.
|
||||
These restrictions translate to certain responsibilities for you if you
|
||||
distribute copies of the software, or if you modify it.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must give the recipients all the rights that
|
||||
you have. You must make sure that they, too, receive or can get the
|
||||
source code. And you must show them these terms so they know their
|
||||
rights.
|
||||
|
||||
We protect your rights with two steps: (1) copyright the software, and
|
||||
(2) offer you this license which gives you legal permission to copy,
|
||||
distribute and/or modify the software.
|
||||
|
||||
Also, for each author's protection and ours, we want to make certain
|
||||
that everyone understands that there is no warranty for this free
|
||||
software. If the software is modified by someone else and passed on, we
|
||||
want its recipients to know that what they have is not the original, so
|
||||
that any problems introduced by others will not reflect on the original
|
||||
authors' reputations.
|
||||
|
||||
Finally, any free program is threatened constantly by software
|
||||
patents. We wish to avoid the danger that redistributors of a free
|
||||
program will individually obtain patent licenses, in effect making the
|
||||
program proprietary. To prevent this, we have made it clear that any
|
||||
patent must be licensed for everyone's free use or not licensed at all.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
||||
|
||||
0. This License applies to any program or other work which contains
|
||||
a notice placed by the copyright holder saying it may be distributed
|
||||
under the terms of this General Public License. The "Program", below,
|
||||
refers to any such program or work, and a "work based on the Program"
|
||||
means either the Program or any derivative work under copyright law:
|
||||
that is to say, a work containing the Program or a portion of it,
|
||||
either verbatim or with modifications and/or translated into another
|
||||
language. (Hereinafter, translation is included without limitation in
|
||||
the term "modification".) Each licensee is addressed as "you".
|
||||
|
||||
Activities other than copying, distribution and modification are not
|
||||
covered by this License; they are outside its scope. The act of
|
||||
running the Program is not restricted, and the output from the Program
|
||||
is covered only if its contents constitute a work based on the
|
||||
Program (independent of having been made by running the Program).
|
||||
Whether that is true depends on what the Program does.
|
||||
|
||||
1. You may copy and distribute verbatim copies of the Program's
|
||||
source code as you receive it, in any medium, provided that you
|
||||
conspicuously and appropriately publish on each copy an appropriate
|
||||
copyright notice and disclaimer of warranty; keep intact all the
|
||||
notices that refer to this License and to the absence of any warranty;
|
||||
and give any other recipients of the Program a copy of this License
|
||||
along with the Program.
|
||||
|
||||
You may charge a fee for the physical act of transferring a copy, and
|
||||
you may at your option offer warranty protection in exchange for a fee.
|
||||
|
||||
2. You may modify your copy or copies of the Program or any portion
|
||||
of it, thus forming a work based on the Program, and copy and
|
||||
distribute such modifications or work under the terms of Section 1
|
||||
above, provided that you also meet all of these conditions:
|
||||
|
||||
a) You must cause the modified files to carry prominent notices
|
||||
stating that you changed the files and the date of any change.
|
||||
|
||||
b) You must cause any work that you distribute or publish, that in
|
||||
whole or in part contains or is derived from the Program or any
|
||||
part thereof, to be licensed as a whole at no charge to all third
|
||||
parties under the terms of this License.
|
||||
|
||||
c) If the modified program normally reads commands interactively
|
||||
when run, you must cause it, when started running for such
|
||||
interactive use in the most ordinary way, to print or display an
|
||||
announcement including an appropriate copyright notice and a
|
||||
notice that there is no warranty (or else, saying that you provide
|
||||
a warranty) and that users may redistribute the program under
|
||||
these conditions, and telling the user how to view a copy of this
|
||||
License. (Exception: if the Program itself is interactive but
|
||||
does not normally print such an announcement, your work based on
|
||||
the Program is not required to print an announcement.)
|
||||
|
||||
These requirements apply to the modified work as a whole. If
|
||||
identifiable sections of that work are not derived from the Program,
|
||||
and can be reasonably considered independent and separate works in
|
||||
themselves, then this License, and its terms, do not apply to those
|
||||
sections when you distribute them as separate works. But when you
|
||||
distribute the same sections as part of a whole which is a work based
|
||||
on the Program, the distribution of the whole must be on the terms of
|
||||
this License, whose permissions for other licensees extend to the
|
||||
entire whole, and thus to each and every part regardless of who wrote it.
|
||||
|
||||
Thus, it is not the intent of this section to claim rights or contest
|
||||
your rights to work written entirely by you; rather, the intent is to
|
||||
exercise the right to control the distribution of derivative or
|
||||
collective works based on the Program.
|
||||
|
||||
In addition, mere aggregation of another work not based on the Program
|
||||
with the Program (or with a work based on the Program) on a volume of
|
||||
a storage or distribution medium does not bring the other work under
|
||||
the scope of this License.
|
||||
|
||||
3. You may copy and distribute the Program (or a work based on it,
|
||||
under Section 2) in object code or executable form under the terms of
|
||||
Sections 1 and 2 above provided that you also do one of the following:
|
||||
|
||||
a) Accompany it with the complete corresponding machine-readable
|
||||
source code, which must be distributed under the terms of Sections
|
||||
1 and 2 above on a medium customarily used for software interchange; or,
|
||||
|
||||
b) Accompany it with a written offer, valid for at least three
|
||||
years, to give any third party, for a charge no more than your
|
||||
cost of physically performing source distribution, a complete
|
||||
machine-readable copy of the corresponding source code, to be
|
||||
distributed under the terms of Sections 1 and 2 above on a medium
|
||||
customarily used for software interchange; or,
|
||||
|
||||
c) Accompany it with the information you received as to the offer
|
||||
to distribute corresponding source code. (This alternative is
|
||||
allowed only for noncommercial distribution and only if you
|
||||
received the program in object code or executable form with such
|
||||
an offer, in accord with Subsection b above.)
|
||||
|
||||
The source code for a work means the preferred form of the work for
|
||||
making modifications to it. For an executable work, complete source
|
||||
code means all the source code for all modules it contains, plus any
|
||||
associated interface definition files, plus the scripts used to
|
||||
control compilation and installation of the executable. However, as a
|
||||
special exception, the source code distributed need not include
|
||||
anything that is normally distributed (in either source or binary
|
||||
form) with the major components (compiler, kernel, and so on) of the
|
||||
operating system on which the executable runs, unless that component
|
||||
itself accompanies the executable.
|
||||
|
||||
If distribution of executable or object code is made by offering
|
||||
access to copy from a designated place, then offering equivalent
|
||||
access to copy the source code from the same place counts as
|
||||
distribution of the source code, even though third parties are not
|
||||
compelled to copy the source along with the object code.
|
||||
|
||||
4. You may not copy, modify, sublicense, or distribute the Program
|
||||
except as expressly provided under this License. Any attempt
|
||||
otherwise to copy, modify, sublicense or distribute the Program is
|
||||
void, and will automatically terminate your rights under this License.
|
||||
However, parties who have received copies, or rights, from you under
|
||||
this License will not have their licenses terminated so long as such
|
||||
parties remain in full compliance.
|
||||
|
||||
5. You are not required to accept this License, since you have not
|
||||
signed it. However, nothing else grants you permission to modify or
|
||||
distribute the Program or its derivative works. These actions are
|
||||
prohibited by law if you do not accept this License. Therefore, by
|
||||
modifying or distributing the Program (or any work based on the
|
||||
Program), you indicate your acceptance of this License to do so, and
|
||||
all its terms and conditions for copying, distributing or modifying
|
||||
the Program or works based on it.
|
||||
|
||||
6. Each time you redistribute the Program (or any work based on the
|
||||
Program), the recipient automatically receives a license from the
|
||||
original licensor to copy, distribute or modify the Program subject to
|
||||
these terms and conditions. You may not impose any further
|
||||
restrictions on the recipients' exercise of the rights granted herein.
|
||||
You are not responsible for enforcing compliance by third parties to
|
||||
this License.
|
||||
|
||||
7. If, as a consequence of a court judgment or allegation of patent
|
||||
infringement or for any other reason (not limited to patent issues),
|
||||
conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot
|
||||
distribute so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you
|
||||
may not distribute the Program at all. For example, if a patent
|
||||
license would not permit royalty-free redistribution of the Program by
|
||||
all those who receive copies directly or indirectly through you, then
|
||||
the only way you could satisfy both it and this License would be to
|
||||
refrain entirely from distribution of the Program.
|
||||
|
||||
If any portion of this section is held invalid or unenforceable under
|
||||
any particular circumstance, the balance of the section is intended to
|
||||
apply and the section as a whole is intended to apply in other
|
||||
circumstances.
|
||||
|
||||
It is not the purpose of this section to induce you to infringe any
|
||||
patents or other property right claims or to contest validity of any
|
||||
such claims; this section has the sole purpose of protecting the
|
||||
integrity of the free software distribution system, which is
|
||||
implemented by public license practices. Many people have made
|
||||
generous contributions to the wide range of software distributed
|
||||
through that system in reliance on consistent application of that
|
||||
system; it is up to the author/donor to decide if he or she is willing
|
||||
to distribute software through any other system and a licensee cannot
|
||||
impose that choice.
|
||||
|
||||
This section is intended to make thoroughly clear what is believed to
|
||||
be a consequence of the rest of this License.
|
||||
|
||||
8. If the distribution and/or use of the Program is restricted in
|
||||
certain countries either by patents or by copyrighted interfaces, the
|
||||
original copyright holder who places the Program under this License
|
||||
may add an explicit geographical distribution limitation excluding
|
||||
those countries, so that distribution is permitted only in or among
|
||||
countries not thus excluded. In such case, this License incorporates
|
||||
the limitation as if written in the body of this License.
|
||||
|
||||
9. The Free Software Foundation may publish revised and/or new versions
|
||||
of the General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the Program
|
||||
specifies a version number of this License which applies to it and "any
|
||||
later version", you have the option of following the terms and conditions
|
||||
either of that version or of any later version published by the Free
|
||||
Software Foundation. If the Program does not specify a version number of
|
||||
this License, you may choose any version ever published by the Free Software
|
||||
Foundation.
|
||||
|
||||
10. If you wish to incorporate parts of the Program into other free
|
||||
programs whose distribution conditions are different, write to the author
|
||||
to ask for permission. For software which is copyrighted by the Free
|
||||
Software Foundation, write to the Free Software Foundation; we sometimes
|
||||
make exceptions for this. Our decision will be guided by the two goals
|
||||
of preserving the free status of all derivatives of our free software and
|
||||
of promoting the sharing and reuse of software generally.
|
||||
|
||||
NO WARRANTY
|
||||
|
||||
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
|
||||
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
|
||||
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
|
||||
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
|
||||
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
||||
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
|
||||
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
|
||||
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
|
||||
REPAIR OR CORRECTION.
|
||||
|
||||
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
|
||||
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
|
||||
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
|
||||
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
|
||||
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
|
||||
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
|
||||
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
|
||||
POSSIBILITY OF SUCH DAMAGES.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
convey the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License along
|
||||
with this program; if not, write to the Free Software Foundation, Inc.,
|
||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program is interactive, make it output a short notice like this
|
||||
when it starts in an interactive mode:
|
||||
|
||||
Gnomovision version 69, Copyright (C) year name of author
|
||||
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, the commands you use may
|
||||
be called something other than `show w' and `show c'; they could even be
|
||||
mouse-clicks or menu items--whatever suits your program.
|
||||
|
||||
You should also get your employer (if you work as a programmer) or your
|
||||
school, if any, to sign a "copyright disclaimer" for the program, if
|
||||
necessary. Here is a sample; alter the names:
|
||||
|
||||
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
|
||||
`Gnomovision' (which makes passes at compilers) written by James Hacker.
|
||||
|
||||
<signature of Ty Coon>, 1 April 1989
|
||||
Ty Coon, President of Vice
|
||||
|
||||
This General Public License does not permit incorporating your program into
|
||||
proprietary programs. If your program is a subroutine library, you may
|
||||
consider it more useful to permit linking proprietary applications with the
|
||||
library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License.
|
@ -6,8 +6,21 @@ Refer to the book for step-by-step explanations.
|
||||
|
||||
<p align="center"><a href="http://haskelldata.com" target="_blank"><img src="http://haskelldata.com/images/ch05.png"/></a></p>
|
||||
|
||||
# How to use
|
||||
# Recipes:
|
||||
* **Code01**: Defining a binary tree data type
|
||||
* **Code02**: Defining a rose tree (multiway tree) data type
|
||||
* **Code03**: Traversing a tree depth-first
|
||||
* **Code04**: Traversing a tree breadth-first
|
||||
* **Code05**: Implementing a Foldable instance for a tree
|
||||
* **Code06**: Calculating the height of a tree
|
||||
* **Code07**: Implementing a binary search tree data structure
|
||||
* **Code08**: Verifying the order property of a binary search tree
|
||||
* **Code09**: Using a self-balancing tree
|
||||
* **Code10**: Implementing a min-heap data structure
|
||||
* **Code11**: Encoding a string using a Huffman tree
|
||||
* **Code12**: Decoding a Huffman code
|
||||
|
||||
# How to use
|
||||
### Setting up the environment
|
||||
Install the [Haskell Platform](http://www.haskell.org/platform/).
|
||||
|
||||
|
339
Ch06/LICENSE
Normal file
339
Ch06/LICENSE
Normal file
@ -0,0 +1,339 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 2, June 1991
|
||||
|
||||
Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
|
||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The licenses for most software are designed to take away your
|
||||
freedom to share and change it. By contrast, the GNU General Public
|
||||
License is intended to guarantee your freedom to share and change free
|
||||
software--to make sure the software is free for all its users. This
|
||||
General Public License applies to most of the Free Software
|
||||
Foundation's software and to any other program whose authors commit to
|
||||
using it. (Some other Free Software Foundation software is covered by
|
||||
the GNU Lesser General Public License instead.) You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
this service if you wish), that you receive source code or can get it
|
||||
if you want it, that you can change the software or use pieces of it
|
||||
in new free programs; and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to make restrictions that forbid
|
||||
anyone to deny you these rights or to ask you to surrender the rights.
|
||||
These restrictions translate to certain responsibilities for you if you
|
||||
distribute copies of the software, or if you modify it.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must give the recipients all the rights that
|
||||
you have. You must make sure that they, too, receive or can get the
|
||||
source code. And you must show them these terms so they know their
|
||||
rights.
|
||||
|
||||
We protect your rights with two steps: (1) copyright the software, and
|
||||
(2) offer you this license which gives you legal permission to copy,
|
||||
distribute and/or modify the software.
|
||||
|
||||
Also, for each author's protection and ours, we want to make certain
|
||||
that everyone understands that there is no warranty for this free
|
||||
software. If the software is modified by someone else and passed on, we
|
||||
want its recipients to know that what they have is not the original, so
|
||||
that any problems introduced by others will not reflect on the original
|
||||
authors' reputations.
|
||||
|
||||
Finally, any free program is threatened constantly by software
|
||||
patents. We wish to avoid the danger that redistributors of a free
|
||||
program will individually obtain patent licenses, in effect making the
|
||||
program proprietary. To prevent this, we have made it clear that any
|
||||
patent must be licensed for everyone's free use or not licensed at all.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
||||
|
||||
0. This License applies to any program or other work which contains
|
||||
a notice placed by the copyright holder saying it may be distributed
|
||||
under the terms of this General Public License. The "Program", below,
|
||||
refers to any such program or work, and a "work based on the Program"
|
||||
means either the Program or any derivative work under copyright law:
|
||||
that is to say, a work containing the Program or a portion of it,
|
||||
either verbatim or with modifications and/or translated into another
|
||||
language. (Hereinafter, translation is included without limitation in
|
||||
the term "modification".) Each licensee is addressed as "you".
|
||||
|
||||
Activities other than copying, distribution and modification are not
|
||||
covered by this License; they are outside its scope. The act of
|
||||
running the Program is not restricted, and the output from the Program
|
||||
is covered only if its contents constitute a work based on the
|
||||
Program (independent of having been made by running the Program).
|
||||
Whether that is true depends on what the Program does.
|
||||
|
||||
1. You may copy and distribute verbatim copies of the Program's
|
||||
source code as you receive it, in any medium, provided that you
|
||||
conspicuously and appropriately publish on each copy an appropriate
|
||||
copyright notice and disclaimer of warranty; keep intact all the
|
||||
notices that refer to this License and to the absence of any warranty;
|
||||
and give any other recipients of the Program a copy of this License
|
||||
along with the Program.
|
||||
|
||||
You may charge a fee for the physical act of transferring a copy, and
|
||||
you may at your option offer warranty protection in exchange for a fee.
|
||||
|
||||
2. You may modify your copy or copies of the Program or any portion
|
||||
of it, thus forming a work based on the Program, and copy and
|
||||
distribute such modifications or work under the terms of Section 1
|
||||
above, provided that you also meet all of these conditions:
|
||||
|
||||
a) You must cause the modified files to carry prominent notices
|
||||
stating that you changed the files and the date of any change.
|
||||
|
||||
b) You must cause any work that you distribute or publish, that in
|
||||
whole or in part contains or is derived from the Program or any
|
||||
part thereof, to be licensed as a whole at no charge to all third
|
||||
parties under the terms of this License.
|
||||
|
||||
c) If the modified program normally reads commands interactively
|
||||
when run, you must cause it, when started running for such
|
||||
interactive use in the most ordinary way, to print or display an
|
||||
announcement including an appropriate copyright notice and a
|
||||
notice that there is no warranty (or else, saying that you provide
|
||||
a warranty) and that users may redistribute the program under
|
||||
these conditions, and telling the user how to view a copy of this
|
||||
License. (Exception: if the Program itself is interactive but
|
||||
does not normally print such an announcement, your work based on
|
||||
the Program is not required to print an announcement.)
|
||||
|
||||
These requirements apply to the modified work as a whole. If
|
||||
identifiable sections of that work are not derived from the Program,
|
||||
and can be reasonably considered independent and separate works in
|
||||
themselves, then this License, and its terms, do not apply to those
|
||||
sections when you distribute them as separate works. But when you
|
||||
distribute the same sections as part of a whole which is a work based
|
||||
on the Program, the distribution of the whole must be on the terms of
|
||||
this License, whose permissions for other licensees extend to the
|
||||
entire whole, and thus to each and every part regardless of who wrote it.
|
||||
|
||||
Thus, it is not the intent of this section to claim rights or contest
|
||||
your rights to work written entirely by you; rather, the intent is to
|
||||
exercise the right to control the distribution of derivative or
|
||||
collective works based on the Program.
|
||||
|
||||
In addition, mere aggregation of another work not based on the Program
|
||||
with the Program (or with a work based on the Program) on a volume of
|
||||
a storage or distribution medium does not bring the other work under
|
||||
the scope of this License.
|
||||
|
||||
3. You may copy and distribute the Program (or a work based on it,
|
||||
under Section 2) in object code or executable form under the terms of
|
||||
Sections 1 and 2 above provided that you also do one of the following:
|
||||
|
||||
a) Accompany it with the complete corresponding machine-readable
|
||||
source code, which must be distributed under the terms of Sections
|
||||
1 and 2 above on a medium customarily used for software interchange; or,
|
||||
|
||||
b) Accompany it with a written offer, valid for at least three
|
||||
years, to give any third party, for a charge no more than your
|
||||
cost of physically performing source distribution, a complete
|
||||
machine-readable copy of the corresponding source code, to be
|
||||
distributed under the terms of Sections 1 and 2 above on a medium
|
||||
customarily used for software interchange; or,
|
||||
|
||||
c) Accompany it with the information you received as to the offer
|
||||
to distribute corresponding source code. (This alternative is
|
||||
allowed only for noncommercial distribution and only if you
|
||||
received the program in object code or executable form with such
|
||||
an offer, in accord with Subsection b above.)
|
||||
|
||||
The source code for a work means the preferred form of the work for
|
||||
making modifications to it. For an executable work, complete source
|
||||
code means all the source code for all modules it contains, plus any
|
||||
associated interface definition files, plus the scripts used to
|
||||
control compilation and installation of the executable. However, as a
|
||||
special exception, the source code distributed need not include
|
||||
anything that is normally distributed (in either source or binary
|
||||
form) with the major components (compiler, kernel, and so on) of the
|
||||
operating system on which the executable runs, unless that component
|
||||
itself accompanies the executable.
|
||||
|
||||
If distribution of executable or object code is made by offering
|
||||
access to copy from a designated place, then offering equivalent
|
||||
access to copy the source code from the same place counts as
|
||||
distribution of the source code, even though third parties are not
|
||||
compelled to copy the source along with the object code.
|
||||
|
||||
4. You may not copy, modify, sublicense, or distribute the Program
|
||||
except as expressly provided under this License. Any attempt
|
||||
otherwise to copy, modify, sublicense or distribute the Program is
|
||||
void, and will automatically terminate your rights under this License.
|
||||
However, parties who have received copies, or rights, from you under
|
||||
this License will not have their licenses terminated so long as such
|
||||
parties remain in full compliance.
|
||||
|
||||
5. You are not required to accept this License, since you have not
|
||||
signed it. However, nothing else grants you permission to modify or
|
||||
distribute the Program or its derivative works. These actions are
|
||||
prohibited by law if you do not accept this License. Therefore, by
|
||||
modifying or distributing the Program (or any work based on the
|
||||
Program), you indicate your acceptance of this License to do so, and
|
||||
all its terms and conditions for copying, distributing or modifying
|
||||
the Program or works based on it.
|
||||
|
||||
6. Each time you redistribute the Program (or any work based on the
|
||||
Program), the recipient automatically receives a license from the
|
||||
original licensor to copy, distribute or modify the Program subject to
|
||||
these terms and conditions. You may not impose any further
|
||||
restrictions on the recipients' exercise of the rights granted herein.
|
||||
You are not responsible for enforcing compliance by third parties to
|
||||
this License.
|
||||
|
||||
7. If, as a consequence of a court judgment or allegation of patent
|
||||
infringement or for any other reason (not limited to patent issues),
|
||||
conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot
|
||||
distribute so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you
|
||||
may not distribute the Program at all. For example, if a patent
|
||||
license would not permit royalty-free redistribution of the Program by
|
||||
all those who receive copies directly or indirectly through you, then
|
||||
the only way you could satisfy both it and this License would be to
|
||||
refrain entirely from distribution of the Program.
|
||||
|
||||
If any portion of this section is held invalid or unenforceable under
|
||||
any particular circumstance, the balance of the section is intended to
|
||||
apply and the section as a whole is intended to apply in other
|
||||
circumstances.
|
||||
|
||||
It is not the purpose of this section to induce you to infringe any
|
||||
patents or other property right claims or to contest validity of any
|
||||
such claims; this section has the sole purpose of protecting the
|
||||
integrity of the free software distribution system, which is
|
||||
implemented by public license practices. Many people have made
|
||||
generous contributions to the wide range of software distributed
|
||||
through that system in reliance on consistent application of that
|
||||
system; it is up to the author/donor to decide if he or she is willing
|
||||
to distribute software through any other system and a licensee cannot
|
||||
impose that choice.
|
||||
|
||||
This section is intended to make thoroughly clear what is believed to
|
||||
be a consequence of the rest of this License.
|
||||
|
||||
8. If the distribution and/or use of the Program is restricted in
|
||||
certain countries either by patents or by copyrighted interfaces, the
|
||||
original copyright holder who places the Program under this License
|
||||
may add an explicit geographical distribution limitation excluding
|
||||
those countries, so that distribution is permitted only in or among
|
||||
countries not thus excluded. In such case, this License incorporates
|
||||
the limitation as if written in the body of this License.
|
||||
|
||||
9. The Free Software Foundation may publish revised and/or new versions
|
||||
of the General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the Program
|
||||
specifies a version number of this License which applies to it and "any
|
||||
later version", you have the option of following the terms and conditions
|
||||
either of that version or of any later version published by the Free
|
||||
Software Foundation. If the Program does not specify a version number of
|
||||
this License, you may choose any version ever published by the Free Software
|
||||
Foundation.
|
||||
|
||||
10. If you wish to incorporate parts of the Program into other free
|
||||
programs whose distribution conditions are different, write to the author
|
||||
to ask for permission. For software which is copyrighted by the Free
|
||||
Software Foundation, write to the Free Software Foundation; we sometimes
|
||||
make exceptions for this. Our decision will be guided by the two goals
|
||||
of preserving the free status of all derivatives of our free software and
|
||||
of promoting the sharing and reuse of software generally.
|
||||
|
||||
NO WARRANTY
|
||||
|
||||
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
|
||||
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
|
||||
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
|
||||
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
|
||||
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
||||
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
|
||||
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
|
||||
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
|
||||
REPAIR OR CORRECTION.
|
||||
|
||||
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
|
||||
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
|
||||
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
|
||||
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
|
||||
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
|
||||
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
|
||||
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
|
||||
POSSIBILITY OF SUCH DAMAGES.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
convey the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License along
|
||||
with this program; if not, write to the Free Software Foundation, Inc.,
|
||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program is interactive, make it output a short notice like this
|
||||
when it starts in an interactive mode:
|
||||
|
||||
Gnomovision version 69, Copyright (C) year name of author
|
||||
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, the commands you use may
|
||||
be called something other than `show w' and `show c'; they could even be
|
||||
mouse-clicks or menu items--whatever suits your program.
|
||||
|
||||
You should also get your employer (if you work as a programmer) or your
|
||||
school, if any, to sign a "copyright disclaimer" for the program, if
|
||||
necessary. Here is a sample; alter the names:
|
||||
|
||||
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
|
||||
`Gnomovision' (which makes passes at compilers) written by James Hacker.
|
||||
|
||||
<signature of Ty Coon>, 1 April 1989
|
||||
Ty Coon, President of Vice
|
||||
|
||||
This General Public License does not permit incorporating your program into
|
||||
proprietary programs. If your program is a subroutine library, you may
|
||||
consider it more useful to permit linking proprietary applications with the
|
||||
library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License.
|
Loading…
Reference in New Issue
Block a user