mtk 0.0.2 → 0.0.3

data/spec/mtk/pattern/sequence_spec.rb

@@ -1,151 +0,0 @@
-require 'spec_helper'
-
-describe MTK::Pattern::Sequence do
-
-  SEQUENCE = MTK::Pattern::Sequence
-
-  let(:elements) { [1,2,3] }
-  let(:sequence) { SEQUENCE.new(elements) }
-
-  it "is a MTK::Collection" do
-    sequence.should be_a MTK::Helper::Collection
-    # and now we won't test any other collection features here... see collection_spec
-  end
-
-  describe ".from_a" do
-    it "acts like .new" do
-      SEQUENCE.from_a(elements).should == sequence
-    end
-  end
-
-  describe "#elements" do
-    it "is the array the sequence was constructed with" do
-      sequence.elements.should == elements
-    end
-  end
-
-  describe "#next" do
-    it "enumerates the elements" do
-      nexts = []
-      elements.length.times do
-        nexts << sequence.next
-      end
-      nexts.should == elements
-    end
-
-    it "raises StopIteration when the end of the Sequence is reached" do
-      elements.length.times{ sequence.next }
-      lambda{ sequence.next }.should raise_error(StopIteration)
-    end
-
-    it "should automatically break out of Kernel#loop" do
-      nexts = []
-      loop do # loop rescues StopIteration and exits the loop
-        nexts << sequence.next
-      end
-      nexts.should == elements
-    end
-
-    it "enumerates the elements in sub-sequences" do
-      sub_sequence = SEQUENCE.new [2,3]
-      sequence = SEQUENCE.new [1,sub_sequence,4]
-      nexts = []
-      loop { nexts << sequence.next }
-      nexts.should == [1,2,3,4]
-    end
-
-    it "skips over empty sub-sequences" do
-      sub_sequence = SEQUENCE.new []
-      sequence = SEQUENCE.new [1,sub_sequence,4]
-      nexts = []
-      loop { nexts << sequence.next }
-      nexts.should == [1,4]
-    end
-
-  end
-
-  describe "#rewind" do
-    it "restarts at the beginning of the sequence" do
-      loop { sequence.next }
-      sequence.rewind
-      sequence.next.should == elements.first
-    end
-
-    it "returns self, so it can be chained to #next" do
-      first = sequence.next
-      sequence.rewind.next.should == first
-    end
-
-    it "causes sub-sequences to start from the beginning when encountered again after #rewind" do
-      sub_sequence = SEQUENCE.new [2,3]
-      sequence = SEQUENCE.new [1,sub_sequence,4]
-      loop { sequence.next }
-      sequence.rewind
-      nexts = []
-      loop { nexts << sequence.next }
-      nexts.should == [1,2,3,4]
-    end
-  end
-
-end
-
-
-describe MTK::Pattern do
-
-  describe "#Sequence" do
-    it "creates a Sequence" do
-      MTK::Pattern.Sequence(1,2,3).should be_a MTK::Pattern::Sequence
-    end
-
-    it "sets #elements from the varargs" do
-      MTK::Pattern.Sequence(1,2,3).elements.should == [1,2,3]
-    end
-
-    it "does not set a type" do
-      MTK::Pattern.Sequence(1,2,3).type.should be_nil
-    end
-  end
-
-  describe "#PitchSequence" do
-    it "creates a Sequence" do
-      MTK::Pattern.PitchSequence(1,2,3).should be_a MTK::Pattern::Sequence
-    end
-
-    it "sets #elements from the varargs" do
-      MTK::Pattern.PitchSequence(1,2,3).elements.should == [1,2,3]
-    end
-
-    it "sets #type to :pitch" do
-      MTK::Pattern.PitchSequence([]).type.should == :pitch
-    end
-  end
-
-  describe "#IntensitySequence" do
-    it "creates a Sequence" do
-      MTK::Pattern.IntensitySequence(1,2,3).should be_a MTK::Pattern::Sequence
-    end
-
-    it "sets #elements from the varargs" do
-      MTK::Pattern.IntensitySequence(1,2,3).elements.should == [1,2,3]
-    end
-
-    it "sets #type to :pitch" do
-      MTK::Pattern.IntensitySequence([]).type.should == :intensity
-    end
-  end
-
-  describe "#DurationSequence" do
-    it "creates a Sequence" do
-      MTK::Pattern.DurationSequence(1,2,3).should be_a MTK::Pattern::Sequence
-    end
-
-    it "sets #elements from the varargs" do
-      MTK::Pattern.DurationSequence(1,2,3).elements.should == [1,2,3]
-    end
-
-    it "sets #type to :pitch" do
-      MTK::Pattern.DurationSequence([]).type.should == :duration
-    end
-  end
-
-end

data/spec/mtk/pitch_set_spec.rb

@@ -1,198 +0,0 @@
-require 'spec_helper'
-
-describe MTK::PitchSet do
-
-  let(:pitches) { [C4, D4, E4, F4, G4, A4, B4] }
-  let(:pitch_set) { PitchSet.new(pitches) }
-  let(:c_major) { PitchSet.new([C4,E4,G4]) }
-
-  it "is Enumerable" do
-    pitch_set.should be_a Enumerable
-  end
-
-  describe '#pitches' do
-    it 'is the list of pitches used to construct the scale' do
-      pitch_set.pitches.should == pitches
-    end
-
-    it "is immutable" do
-      lambda { pitch_set.pitches << Db4 }.should raise_error
-    end
-
-    it "does not affect the immutabilty of the pitch list used to construct it" do
-      pitches << Db4
-      pitches.length.should == 8
-    end
-
-    it "is not affected by changes to the pitch list used to construct it" do
-      pitch_set # force construction before we modify the pitches array
-      pitches << Db4
-      pitch_set.pitches.length.should == 7
-    end
-
-    it "does not include duplicates" do
-      PitchSet.new([C4, E4, G4, C4]).pitches.should == [C4, E4, G4]
-    end
-
-    it "sorts the pitches" do
-      PitchSet.new([G4, E4, C4]).pitches.should == [C4, E4, G4]
-    end
-  end
-
-  describe "#to_a" do
-    it "is equal to #pitches" do
-      pitch_set.to_a.should == pitch_set.pitches
-    end
-
-    it "is mutable" do
-      (c_major.to_a << Bb4).should == [C4, E4, G4, Bb4]
-    end
-  end
-
-  describe "#each" do
-    it "yields each pitch" do
-      ps = []
-      pitch_set.each{|p| ps << p }
-      ps.should == pitches
-    end
-  end
-
-  describe "#map" do
-    it "returns a PitchSet with each Pitch replaced with the results of the block" do
-      c_major.map{|p| p + 2}.should == [D4, Gb4, A4]
-    end
-  end
-
-  describe "#to_pitch_class_set" do
-    it "is a PitchClassSet" do
-      pitch_set.to_pitch_class_set.should be_a PitchClassSet
-    end
-
-    it "contains all the pitch_classes in this PitchSet" do
-      pitch_set.to_pitch_class_set.pitch_classes.should == pitch_set.pitch_classes
-    end
-  end
-
-  describe '#pitch_classes' do
-    it 'is the list of pitch classes' do
-      pitch_set.pitch_classes.should == pitches.map { |p| p.pitch_class }
-    end
-
-    it "doesn't include duplicates" do
-      PitchSet.new([C4, C5, D5, C6, D4]).pitch_classes.should == [C, D]
-    end
-  end
-
-  describe '#transpose' do
-    it 'transposes upward by the given semitones' do
-      pitch_set.transpose(12).should == PitchSet.new([C5, D5, E5, F5, G5, A5, B5])
-    end
-  end
-
-  describe '#invert' do
-    it 'inverts all pitches around the given center pitch' do
-      (pitch_set.invert Gb4).should == PitchSet.new([C5, Bb4, Ab4, G4, F4, Eb4, Db4])
-    end
-
-    it 'inverts all pitches around the first pitch, when no center pitch is given' do
-      pitch_set.invert.should == PitchSet.new([C4, Bb3, Ab3, G3, F3, Eb3, Db3])
-    end
-  end
-
-  describe '#include?' do
-    it 'returns true if the Pitch is in the PitchList' do
-      (pitch_set.include? C4).should be_true
-    end
-
-    it 'returns false if the Pitch is not in the PitchList' do
-      (pitch_set.include? Db4).should be_false
-    end
-  end
-
-  describe '#==' do
-    it "is true when all the pitches are equal" do
-      PitchSet.new([C4, E4, G4]).should == PitchSet.new([Pitch.from_i(60), Pitch.from_i(64), Pitch.from_i(67)])
-    end
-
-    it "doesn't consider duplicates in the comparison" do
-      PitchSet.new([C4, C4]).should == PitchSet.new([C4])
-    end
-
-    it "doesn't consider the order of pitches" do
-      PitchSet.new([G4, E4, C4]).should == PitchSet.new([C4, E4, G4])
-    end
-  end
-
-  describe '#inversion' do
-    it "adds an octave to the chord's pitches starting from the lowest, for each whole number in a postive argument" do
-      c_major.inversion(2).should == PitchSet.new([G4,C5,E5])
-    end
-
-    it "subtracts an octave to the chord's pitches starting fromt he highest, for each whole number in a negative argument" do
-      c_major.inversion(-2).should == PitchSet.new([E3,G3,C4])
-    end
-
-    it "wraps around to the lowest pitch when the argument is bigger than the number of pitches in the chord (positive argument)" do
-      c_major.inversion(4).should == PitchSet.new([E5,G5,C6])
-    end
-
-    it "wraps around to the highest pitch when the magnitude of the argument is bigger than the number of pitches in the chord (negative argument)" do
-      c_major.inversion(-4).should == PitchSet.new([G2,C3,E3])
-    end
-  end
-
-  describe "#nearest" do
-    it "returns the nearest PitchSet where the first Pitch has the given PitchClass" do
-      c_major.nearest(F).should == c_major.transpose(5.semitones)
-      c_major.nearest(G).should == c_major.transpose(-5.semitones)
-    end
-  end
-
-  describe "#to_s" do
-    it "looks like an array of pitches" do
-      c_major.to_s.should == "[C4, E4, G4]"
-    end
-  end
-
-end
-
-describe MTK do
-
-  describe '#PitchSet' do
-
-    it "acts like new for a single Array argument" do
-      PitchSet([C4,D4]).should == PitchSet.new([C4,D4])
-    end
-
-    it "acts like new for multiple arguments, by treating them like an Array (splat)" do
-      PitchSet(C4,D4).should == PitchSet.new([C4,D4])
-    end
-
-    it "handles an Array with elements that can be converted to Pitches" do
-      PitchSet(['C4','D4']).should == PitchSet.new([C4,D4])
-    end
-
-    it "handles multiple arguments that can be converted to a Pitch" do
-      PitchSet(:C4,:D4).should == PitchSet.new([C4,D4])
-    end
-
-    it "handles a single Pitch" do
-      PitchSet(C4).should == PitchSet.new([C4])
-    end
-
-    it "handles single elements that can be converted to a Pitch" do
-      PitchSet('C4').should == PitchSet.new([C4])
-    end
-
-    it "returns the argument if it's already a PitchSet" do
-      pitch_set = PitchSet.new([C4,D4])
-      PitchSet(pitch_set).should be_equal pitch_set
-    end
-
-    it "raises an error for types it doesn't understand" do
-      lambda{ PitchSet({:not => :compatible}) }.should raise_error
-    end
-
-  end
-
-end

data/spec/mtk/sequencer/abstract_sequencer_spec.rb

@@ -1,159 +0,0 @@
-require 'spec_helper'
-
-describe MTK::Sequencer::AbstractSequencer do
-
-  ABSTRACT_SEQUENCER = Sequencer::AbstractSequencer
-
-  class MockEventBuilder < Helper::EventBuilder
-    attr_accessor :mock_attribute
-  end
-
-  let(:patterns)  { [Pattern.PitchCycle(C4,D4)] }
-  let(:sequencer) { ABSTRACT_SEQUENCER.new patterns }
-  let(:intensity) { Helper::EventBuilder::DEFAULT_INTENSITY }
-  let(:duration)  { Helper::EventBuilder::DEFAULT_DURATION }
-
-  describe "#new" do
-    it "defaults @max_steps to nil" do
-      sequencer.max_steps.should be_nil
-    end
-
-    it "sets @max_steps from the options hash" do
-      sequencer = RHYTHMIC_SEQUENCER.new patterns, :max_steps => 4
-      sequencer.max_steps.should == 4
-    end
-
-    it "defaults @max_time to nil" do
-      sequencer.max_time.should be_nil
-    end
-
-    it "sets @max_time from the options hash" do
-      sequencer = RHYTHMIC_SEQUENCER.new patterns, :max_time => 4
-      sequencer.max_time.should == 4
-    end
-
-    it "defaults @event_builder to MTK::Helper::EventBuilder" do
-      sequencer.event_builder.should be_a MTK::Helper::EventBuilder
-    end
-
-    it "sets @event_buidler from the options hash" do
-      sequencer = RHYTHMIC_SEQUENCER.new patterns, :event_builder => MockEventBuilder
-      sequencer.event_builder.should be_a MockEventBuilder
-    end
-  end
-
-  describe "#event_builder" do
-    it "provides access to the internal EventBuilder" do
-      sequencer = RHYTHMIC_SEQUENCER.new patterns, :event_builder => MockEventBuilder
-      sequencer.event_builder.mock_attribute = :value
-      sequencer.event_builder.mock_attribute.should == :value
-    end
-  end
-
-  describe "#to_timeline" do
-    it "combines pitch, intensity, and duration patterns into notes" do
-      pitches = Pattern.PitchSequence(C4, D4, E4)
-      intensities = Pattern.IntensitySequence(0.3, 0.7, 1.0)
-      durations = Pattern.DurationSequence(1, 2, 3)
-      sequencer = ABSTRACT_SEQUENCER.new [pitches, intensities, durations]
-      # default implementation just increments the time by 1 for each event (more interesting behavior is provided by subclasses)
-      sequencer.to_timeline.should == {
-        0 => [Note(C4,0.3,1)],
-        1 => [Note(D4,0.7,2)],
-        2 => [Note(E4,1.0,3)]
-      }
-    end
-
-    it "combines patterns of different types and lengths" do
-      pitches = Pattern.PitchSequence(C4, D4, E4, F4, G4, A4, B4, C5)
-      intensities = Pattern.IntensityCycle(0.5, 1.0)
-      durations = Pattern.DurationPalindrome(1, 2, 3)
-      sequencer = ABSTRACT_SEQUENCER.new [pitches, intensities, durations]
-      # default implementation just increments the time by 1 for each event (more interesting behavior is provided by subclasses)
-      sequencer.to_timeline.should == {
-        0 => [Note(C4,0.5,1)],
-        1 => [Note(D4,1.0,2)],
-        2 => [Note(E4,0.5,3)],
-        3 => [Note(F4,1.0,2)],
-        4 => [Note(G4,0.5,1)],
-        5 => [Note(A4,1.0,2)],
-        6 => [Note(B4,0.5,3)],
-        7 => [Note(C5,1.0,2)]
-      }
-    end
-
-    it "produces consistent results by reseting the patterns each time" do
-      pitches = Pattern.PitchSequence(C4, D4, E4)
-      intensities = Pattern.IntensityCycle(1)
-      durations = Pattern.DurationCycle(1, 2)
-      sequencer = ABSTRACT_SEQUENCER.new [pitches, intensities, durations]
-      sequencer.to_timeline.should == sequencer.to_timeline
-    end
-  end
-
-  describe "#time" do
-    it "is the current timeline time that the sequencer is generating events for" do
-      # AbstractSequencer just advances by 1 each step
-      sequencer.next # time doesn't advance until the second #next call
-      sequencer.time.should == 0
-      sequencer.next
-      sequencer.time.should == 1
-      sequencer.next
-      sequencer.time.should == 2
-    end
-  end
-
-  describe "#step" do
-    it "is the index for how many of times #next has been called (i.e. count starting from 0)" do
-      sequencer.step.should == -1 # -1 indicates #next has not yet been called
-      sequencer.next
-      sequencer.step.should == 0
-      sequencer.next
-      sequencer.step.should == 1
-      sequencer.next
-      sequencer.step.should == 2
-    end
-  end
-
-  describe "#next" do
-    it "returns a list of notes formed from the patterns in the sequencer"  do
-      sequencer.next.should == [Note(C4,intensity,duration)]
-      sequencer.next.should == [Note(D4,intensity,duration)]
-      sequencer.next.should == [Note(C4,intensity,duration)]
-    end
-  end
-
-  describe "#rewind" do
-    it "resets the sequencer and its patterns" do
-      sequencer.next
-      sequencer.rewind
-      sequencer.step.should == -1
-      sequencer.time.should == 0
-      sequencer.next.should == [Note(C4,intensity,duration)]
-    end
-
-    it "resets pitches properly for patterns that rely on previous pitches" do
-      relative_pitch_pattern = Pattern.PitchSequence(C,P8)
-      sequencer = ABSTRACT_SEQUENCER.new [relative_pitch_pattern]
-      sequencer.next.should == [Note(C4,intensity,duration)]
-      sequencer.next.should == [Note(C5,intensity,duration)]
-      sequencer.rewind
-      sequencer.next.should == [Note(C4,intensity,duration)] # if the internal EventBuilder is not properly reset, the Note would be C5
-    end
-  end
-
-  describe "#max_steps" do
-    it "controls the maximum number of entries in the generated timeline" do
-      sequencer.max_steps = 2
-      sequencer.to_timeline.times.length.should == 2
-    end
-  end
-
-  describe "#max_time" do
-    it "controls the maximum time in the generated timeline" do
-      sequencer.max_time = 4
-      sequencer.to_timeline.times.last.should == 4
-    end
-  end
-
-end