{-# LANGUAGE OverloadedStrings #-} module Sound.Tidal.UITest where import TestUtils import Test.Microspec import Prelude hiding ((<*), (*>)) import qualified Data.Map.Strict as Map -- import Sound.Tidal.Pattern import Sound.Tidal.Control import Sound.Tidal.Core import Sound.Tidal.Params import Sound.Tidal.ParseBP import Sound.Tidal.Pattern import Sound.Tidal.UI run :: Microspec () run = describe "Sound.Tidal.UI" $ do describe "_chop" $ do it "can chop in two bits" $ do compareP (Arc 0 1) (_chop 2 $ s (pure "a")) (begin (fastcat [pure 0, pure 0.5]) # end (fastcat [pure 0.5, pure 1]) # (s (pure "a"))) it "can be slowed" $ do compareP (Arc 0 1) (slow 2 $ _chop 2 $ s (pure "a")) (begin (pure 0) # end (pure 0.5) # (s (pure "a"))) it "can chop a chop" $ property $ compareTol (Arc 0 1) (_chop 6 $ s $ pure "a") (_chop 2 $ _chop 3 $ s $ pure "a") describe "segment" $ do it "can turn a single event into multiple events" $ do compareP (Arc 0 3) (segment 4 "x") ("x*4" :: Pattern String) it "can turn a continuous pattern into multiple discrete events" $ do compareP (Arc 0 3) (segment 4 saw) ("0 0.25 0.5 0.75" :: Pattern Double) it "can hold a value over multiple cycles" $ do comparePD (Arc 0 8) (segment 0.5 saw) (slow 2 "0" :: Pattern Double) it "holding values over multiple cycles works in combination" $ do comparePD (Arc 0 8) ("0*4" |+ (_segment (1/8) $ saw)) ("0*4" :: Pattern Double) describe "sometimesBy" $ do it "does nothing when set at 0% probability" $ do let overTimeSpan = (Arc 0 1) testMe = sometimesBy 0 (rev) (ps "bd*2 hh sn") expectedResult = ps "bd*2 hh sn" in compareP overTimeSpan testMe expectedResult it "does nothing when set at 0% probability -- const" $ do let overTimeSpan = (Arc 0 2) testMe = sometimesBy 0 (const $ s "cp") (s "bd*8") expectedResult = s "bd*8" in compareP overTimeSpan testMe expectedResult it "applies the 'rev' function when set at 100% probability" $ do let overTimeSpan = (Arc 0 1) testMe = sometimesBy 1 (rev) (ps "bd*2 hh cp") expectedResult = ps "cp hh bd*2" in compareP overTimeSpan testMe expectedResult describe "rand" $ do it "generates a (pseudo-)random number between zero & one" $ do it "at the start of a cycle" $ (queryArc rand (Arc 0 0)) `shouldBe` fmap toEvent [(((0, 0), (0, 0)), 0.5000844 :: Float)] it "at 1/4 of a cycle" $ (queryArc rand (Arc 0.25 0.25)) `shouldBe` fmap toEvent [(((0.25, 0.25), (0.25, 0.25)), 0.8587171 :: Float)] it "at 3/4 of a cycle" $ (queryArc rand (Arc 0.75 0.75)) `shouldBe` fmap toEvent [(((0.75, 0.75), (0.75, 0.75)), 0.7277789 :: Float)] describe "range" $ do describe "scales a pattern to the supplied range" $ do describe "from 3 to 4" $ do it "at the start of a cycle" $ (queryArc (Sound.Tidal.UI.range 3 4 saw) (Arc 0 0)) `shouldBe` fmap toEvent [(((0, 0), (0, 0)), 3 :: Float)] it "at 1/4 of a cycle" $ (queryArc (Sound.Tidal.UI.range 3 4 saw) (Arc 0.25 0.25)) `shouldBe` fmap toEvent [(((0.25, 0.25), (0.25, 0.25)), 3.25 :: Float)] it "at 3/4 of a cycle" $ (queryArc (Sound.Tidal.UI.range 3 4 saw) (Arc 0.75 0.75)) `shouldBe` fmap toEvent [(((0.75, 0.75), (0.75, 0.75)), 3.75 :: Float)] describe "from -1 to 1" $ do it "at 1/2 of a cycle" $ (queryArc (Sound.Tidal.UI.range (-1) 1 saw) (Arc 0.5 0.5)) `shouldBe` fmap toEvent [(((0.5, 0.5), (0.5, 0.5)), 0 :: Float)] describe "from 4 to 2" $ do it "at the start of a cycle" $ (queryArc (Sound.Tidal.UI.range 4 2 saw) (Arc 0 0)) `shouldBe` fmap toEvent [(((0, 0), (0, 0)), 4 :: Float)] it "at 1/4 of a cycle" $ (queryArc (Sound.Tidal.UI.range 4 2 saw) (Arc 0.25 0.25)) `shouldBe` fmap toEvent [(((0.25, 0.25), (0.25, 0.25)), 3.5 :: Float)] it "at 3/4 of a cycle" $ (queryArc (Sound.Tidal.UI.range 4 2 saw) (Arc 0.75 0.75)) `shouldBe` fmap toEvent [(((0.75, 0.75), (0.75, 0.75)), 2.5 :: Float)] describe "from 10 to 10" $ do it "at 1/2 of a cycle" $ (queryArc (Sound.Tidal.UI.range 10 10 saw) (Arc 0.5 0.5)) `shouldBe` fmap toEvent [(((0.5, 0.5), (0.5, 0.5)), 10 :: Float)] describe "rot" $ do it "rotates values in a pattern irrespective of structure" $ property $ comparePD (Arc 0 2) (rot 1 "a ~ b c" :: Pattern String) ( "b ~ c a" :: Pattern String) it "works with negative values" $ property $ comparePD (Arc 0 2) (rot (-1) "a ~ b c" :: Pattern String) ( "c ~ a b" :: Pattern String) it "works with complex patterns" $ property $ comparePD (Arc 0 2) (rot (1) "a ~ [b [c ~ d]] [e ]" :: Pattern String) ( "b ~ [c [d ~ e]] [ a]" :: Pattern String) describe "fix" $ do it "can apply functions conditionally" $ do compareP (Arc 0 1) (fix (|+ n 1) (s "sn") (s "bd sn cp" # n 1)) (s "bd sn cp" # n "1 2 1") it "works with complex matches" $ do compareP (Arc 0 1) (fix (|+ n 2) (s "sn" # n 2) (s "bd sn*4 cp" # n "1 2")) (s "bd sn*4 cp" # n "1 [1 4] 2") it "leaves unmatched controls in place" $ do compareP (Arc 0 1) (fix (|+ n 2) (s "sn" # n 2) (s "bd sn*4 cp" # n "1 2" # speed (sine + 1))) (s "bd sn*4 cp" # n "1 [1 4] 2" # speed (sine + 1)) it "ignores silence" $ do compareP (Arc 0 1) (fix (|+ n 2) (silence) $ s "bd sn*4 cp" # n "1 2" # speed (sine + 1)) (s "bd sn*4 cp" # n "1 2" # speed (sine + 1)) it "treats polyphony as 'or'" $ do compareP (Arc 0 1) (fix (# crush 2) (n "[1,2]") $ s "bd sn" # n "1 2") (s "bd sn" # n "1 2" # crush 2) describe "unfix" $ do it "does the opposite of fix" $ do compareP (Arc 0 1) (unfix (|+ n 2) (s "sn" # n 2) (s "bd sn*4 cp" # n "1 2" # speed (sine + 1))) (s "bd sn*4 cp" # n "3 [3 2] 4" # speed (sine + 1)) describe "contrast" $ do it "does both fix and unfix" $ do compareP (Arc 0 1) (contrast (|+ n 2) (|+ n 10) (s "sn" # n 2) (s "bd sn*4 cp" # n "1 2" # speed (sine + 1))) (s "bd sn*4 cp" # n "11 [11 4] 12" # speed (sine + 1)) describe "contrastRange" $ do it "matches using a pattern of ranges" $ do compareP (Arc 0 1) (contrastRange (# crush 3) (# crush 0) (pure $ Map.singleton "n" $ (VF 0, VF 3)) $ s "bd" >| n "1 4") (s "bd" >| n "1 4" >| crush "3 0") describe "euclidFull" $ do it "can match against silence" $ do compareP (Arc 0 1) (euclidFull 3 8 "bd" silence) ("bd(3,8)" :: Pattern String) describe "snowball" $ do let testPattern = ("1 2 3 4"::Pattern Int) it "acummulates a transform version of a pattern and appends the result - addition" $ do compareP (Arc 0 1) (snowball 3 (+) (slow 2) (testPattern)) (cat [testPattern,(testPattern+(slow 2 testPattern)),((testPattern+(slow 2 testPattern))+slow 2 (testPattern+(slow 2 testPattern)))]) describe "soak" $ do it "applies a transform and then appends the result -- addition" $ do compareP (Arc 0 3) (soak 3 (+ 1) "4 ~ 0 1") (cat ["4 ~ 0 1"::Pattern Int,"5 ~ 1 2"::Pattern Int,"6 ~ 2 3"::Pattern Int]) it "applies a transform and then appends the result -- slow" $ do compareP (Arc 0 7) (soak 3 (slow 2) "4 ~ 0 1") (cat ["4 ~ 0 1"::Pattern Int, slow 2 "4 ~ 0 1"::Pattern Int, slow 4 "4 ~ 0 1"::Pattern Int]) it "applies a transform and then appends the result -- addition patterns" $ do compareP (Arc 0 3) (soak 3 (+ "1 2 3") "1 1") (cat ["1 1"::Pattern Int,"2 [3 3] 4"::Pattern Int,"3 [5 5] 7"::Pattern Int]) describe "euclid" $ do it "matches examples in Toussaint's paper" $ do sequence_ $ map (\(a,b) -> it b $ compareP (Arc 0 1) a (parseBP_E b)) ([(euclid 1 2 "x", "x ~"), (euclid 1 3 "x", "x ~ ~"), (euclid 1 4 "x", "x ~ ~ ~"), (euclid 4 12 "x", "x ~ ~ x ~ ~ x ~ ~ x ~ ~"), (euclid 2 5 "x", "x ~ x ~ ~"), -- (euclid 3 4 "x", "x ~ x x"), -- Toussaint is wrong.. (euclid 3 4 "x", "x x x ~"), -- correction (euclid 3 5 "x", "x ~ x ~ x"), (euclid 3 7 "x", "x ~ x ~ x ~ ~"), (euclid 3 8 "x", "x ~ ~ x ~ ~ x ~"), (euclid 4 7 "x", "x ~ x ~ x ~ x"), (euclid 4 9 "x", "x ~ x ~ x ~ x ~ ~"), (euclid 4 11 "x", "x ~ ~ x ~ ~ x ~ ~ x ~"), -- (euclid 5 6 "x", "x ~ x x x x"), -- Toussaint is wrong.. (euclid 5 6 "x", "x x x x x ~"), -- correction (euclid 5 7 "x", "x ~ x x ~ x x"), (euclid 5 8 "x", "x ~ x x ~ x x ~"), (euclid 5 9 "x", "x ~ x ~ x ~ x ~ x"), (euclid 5 11 "x", "x ~ x ~ x ~ x ~ x ~ ~"), (euclid 5 12 "x", "x ~ ~ x ~ x ~ ~ x ~ x ~"), -- (euclid 5 16 "x", "x ~ ~ x ~ ~ x ~ ~ x ~ ~ x ~ ~ ~ ~"), -- Toussaint is wrong.. (euclid 5 16 "x", "x ~ ~ x ~ ~ x ~ ~ x ~ ~ x ~ ~ ~"), -- correction -- (euclid 7 8 "x", "x ~ x x x x x x"), -- Toussaint is wrong.. (euclid 7 8 "x", "x x x x x x x ~"), -- Correction (euclid 7 12 "x", "x ~ x x ~ x ~ x x ~ x ~"), (euclid 7 16 "x", "x ~ ~ x ~ x ~ x ~ ~ x ~ x ~ x ~"), (euclid 9 16 "x", "x ~ x x ~ x ~ x ~ x x ~ x ~ x ~"), (euclid 11 24 "x", "x ~ ~ x ~ x ~ x ~ x ~ x ~ ~ x ~ x ~ x ~ x ~ x ~"), (euclid 13 24 "x", "x ~ x x ~ x ~ x ~ x ~ x ~ x x ~ x ~ x ~ x ~ x ~") ] :: [(Pattern String, String)]) describe "wedge" $ do it "should not freeze tidal amount is 1" $ do compareP (Arc 0 1) (wedge (1) (s "ho ho:2 ho:3 hc") (rev $ s "ho ho:2 ho:3 hc")) (s "ho ho:2 ho:3 hc") it "should not freeze tidal amount is 0" $ do compareP (Arc 0 1) (wedge (0) (s "ho ho:2 ho:3 hc") (rev $ s "ho ho:2 ho:3 hc")) (rev $ s "ho ho:2 ho:3 hc") describe "bite" $ do it "can slice a pattern into bits" $ do compareP (Arc 0 4) (bite 4 "0 2*2" (Sound.Tidal.Core.run 8)) ("[0 1] [4 5]*2" :: Pattern Int) describe "chooseBy" $ do it "chooses from elements based on closest scaled double value" $ do compareP (Arc 0 4) (("0"::Pattern Int) |+ chooseBy ((/ 4)$(sig fromRational)) [0,1,2,3]) ("<0 1 2 3>"::Pattern Int) it "never gets an index out of bounds" $ do compareP (Arc 0 4) (("0"::Pattern Int) |+ chooseBy (sig fromRational) [0,1,2,3]) ("<0>"::Pattern Int) describe "arpeggiate" $ do it "can arpeggiate" $ do compareP (Arc 0 1) (arpeggiate ("[bd, sn] [hh:1, cp]" :: Pattern String)) ("bd sn hh:1 cp" :: Pattern String) it "can arpeggiate" $ do compareP (Arc 0 4) (arpeggiate $ "[0,0] [0,0]") ("0 0 0 0" :: Pattern Int) it "can arpeggiate a 'sped up' pattern" $ do compareP (Arc 0 4) (arpeggiate $ "[0,0]*2") ("0 0 0 0" :: Pattern Int)