http://obfuscatedcode.wordpress.com/2008/02/16/functional-pearl-trees/
data Tree a = Leaf a -- The leaf holds data of any type. | Branch (Tree a) (Tree a) deriving (Show) replaceMin :: Tree Int -> Tree Int replaceMin t = let (t', m) = rpMin (t, m) in t' rpMin :: (Tree Int, Int) -> (Tree Int, Int) rpMin (Leaf a, m) = (Leaf m, a) rpMin (Branch l r, m) = let (l', ml) = rpMin (l, m) (r', mr) = rpMin (r, m) in (Branch l' r', ml `min` mr)
これは、permutationを返す関数:
permutation' :: [[Int]] -> Int -> [Int] -> [[Int]] permutation' result 0 _ = result permutation' result n cand = do a <- cand permutation' (map (a:) result) (n-1) [x|x<-cand,x/=a]
使い方
permutation' [[]] [1,2,3] 2
のように使う。
これをStateTを使ってわざと分かりにくくしてみる:
permutation :: [[Int]] -> Int -> StateT [Int] [] [[Int]] permutation result 0 = return result permutation result n = do cand <- get a <- lift cand put [x|x<-cand,x/=a] permutation (map (a:) result) (n-1)
これは
runStateT (permutation [[]] 2) [1,2,3]
のように使う。
書いてみました。いまのところ日本語は使えません。 http://icecs.ice.nuie.nagoya-u.ac.jp/~h043078b/wiki.cgi
http://www.cse.ogi.edu/~hallgren/House/ -- 源馬? 2006-07-04 (火) 16:16:05
The Evolution of a Haskell Programmer かなりハイレベルにバカやってる感じ