WaveSwissKnife 0.2.0.20120302 → 0.3.0.20121227

Sign up to get free protection for your applications and to get access to all the features.
data/AUTHORS CHANGED
@@ -2,3 +2,4 @@
2
2
  * 0.0.1.20101110
3
3
  * 0.1.0.20110830
4
4
  * 0.2.0.20120302
5
+ * 0.3.0.20121227
data/ChangeLog CHANGED
@@ -1,5 +1,9 @@
1
1
  = WaveSwissKnife Release History
2
2
 
3
+ == 0.3.0.20121227 (Beta)
4
+
5
+ * Migrated C code to Ruby 1.9.3 API
6
+
3
7
  == 0.2.0.20120302 (Beta)
4
8
 
5
9
  * Shipping gems in platform-independent architecture.
data/ReleaseInfo CHANGED
@@ -2,7 +2,7 @@
2
2
  # This file has been generated by RubyPackager during a delivery.
3
3
  # More info about RubyPackager: http://rubypackager.sourceforge.net
4
4
  {
5
- :version => '0.2.0.20120302',
5
+ :version => '0.3.0.20121227',
6
6
  :tags => [ 'Beta' ],
7
7
  :dev_status => 'Beta'
8
8
  }
@@ -96,7 +96,7 @@ static int arithmutils_fillMap_PiecewiseLinear(
96
96
 
97
97
  // Read points in a sorted list of couples [x,y]
98
98
  VALUE lValSortedPoints = rb_funcall(rb_funcall(rb_hash_aref(iValFunction, ID2SYM(rb_intern("Points"))), rb_intern("to_a"), 0), rb_intern("sort"), 0);
99
- int lNbrPoints = RARRAY(lValSortedPoints)->len;
99
+ int lNbrPoints = RARRAY_LEN(lValSortedPoints);
100
100
  // Read the scale min and max values
101
101
  long long int lMinScale = FIX2INT(rb_hash_aref(iValFunction, ID2SYM(rb_intern("MinValue"))));
102
102
  long long int lMaxScale = FIX2INT(rb_hash_aref(iValFunction, ID2SYM(rb_intern("MaxValue"))));
@@ -212,7 +212,7 @@ static VALUE arithmutils_createMapFromFunctions(
212
212
  VALUE iValFunctions) {
213
213
  // Translate Ruby objects
214
214
  int iNbrBitsPerSample = FIX2INT(iValNbrBitsPerSample);
215
- int lNbrChannels = RARRAY(iValFunctions)->len;
215
+ int lNbrChannels = RARRAY_LEN(iValFunctions);
216
216
 
217
217
  int lIdxChannel;
218
218
  int* lPtrChannelMap;
@@ -285,7 +285,7 @@ static VALUE arithmutils_applyMap(
285
285
 
286
286
  // Get the input buffer
287
287
  char* lPtrRawBuffer = RSTRING_PTR(iValInputBuffer);
288
- int lBufferCharSize = RSTRING(iValInputBuffer)->len;
288
+ int lBufferCharSize = RSTRING_LEN(iValInputBuffer);
289
289
  // Allocate the output buffer
290
290
  char* lPtrOutputBuffer = ALLOC_N(char, lBufferCharSize);
291
291
 
@@ -489,7 +489,7 @@ static VALUE arithmutils_mixBuffers(
489
489
 
490
490
  // Create the list of additional buffers to consider
491
491
  // This list is sorted from the one having the most samples to the one having the least samples
492
- int lNbrBuffers = RARRAY(iValBuffers)->len;
492
+ int lNbrBuffers = RARRAY_LEN(iValBuffers);
493
493
  tBufferInfo lPtrAdditionalBuffers[lNbrBuffers-1];
494
494
  int lIdxBuffer;
495
495
  VALUE lValBufferInfo;
@@ -508,7 +508,7 @@ static VALUE arithmutils_mixBuffers(
508
508
  VALUE lValFirstBufferInfo = rb_ary_entry(iValBuffers, 0);
509
509
  VALUE lValFirstBuffer = rb_ary_entry(lValFirstBufferInfo, 3);
510
510
  char* lPtrFirstBuffer = RSTRING_PTR(lValFirstBuffer);
511
- int lBufferCharSize = RSTRING(lValFirstBuffer)->len;
511
+ int lBufferCharSize = RSTRING_LEN(lValFirstBuffer);
512
512
  tSampleIndex lNbrSamples = FIX2INT(rb_ary_entry(lValFirstBufferInfo, 4));
513
513
 
514
514
  // Allocate the output buffer
@@ -749,7 +749,7 @@ static VALUE arithmutils_compareBuffers(
749
749
  long double iCoeffDiff = NUM2DBL(iValCoeffDiff);
750
750
  char* lPtrBuffer1 = RSTRING_PTR(iValBuffer1);
751
751
  char* lPtrBuffer2 = RSTRING_PTR(iValBuffer2);
752
- int lBufferCharSize = RSTRING(iValBuffer1)->len;
752
+ int lBufferCharSize = RSTRING_LEN(iValBuffer1);
753
753
  int lNbrSampleValues = 0;
754
754
  // Allocate the output buffer
755
755
  char* lPtrOutputBuffer = ALLOC_N(char, lBufferCharSize);
@@ -764,7 +764,7 @@ static VALUE arithmutils_compareBuffers(
764
764
  // Create the internal map
765
765
  // Define the impossible value
766
766
  gImpossibleValue = pow(2, iNbrBitsPerSample-1) + 1;
767
- lNbrSampleValues = RARRAY(ioValMap)->len;
767
+ lNbrSampleValues = RARRAY_LEN(ioValMap);
768
768
  tSampleValue lMap[lNbrSampleValues];
769
769
  VALUE lValMapValue;
770
770
  int lIdxSampleValue;
@@ -540,8 +540,8 @@ static VALUE fftutils_createCFFTProfile(
540
540
  int lNbrBitsPerSample = FIX2INT(rb_ary_entry(iValFFTProfile, 0));
541
541
  tSampleIndex lNbrSamples = FIX2LONG(rb_ary_entry(iValFFTProfile, 1));
542
542
  VALUE lValFFTCoeffs = rb_ary_entry(iValFFTProfile, 2);
543
- lPtrFFTProfile->nbrFreq = RARRAY(lValFFTCoeffs)->len;
544
- lPtrFFTProfile->nbrChannels = RARRAY(rb_ary_entry(lValFFTCoeffs, 0))->len;
543
+ lPtrFFTProfile->nbrFreq = RARRAY_LEN(lValFFTCoeffs);
544
+ lPtrFFTProfile->nbrChannels = RARRAY_LEN(rb_ary_entry(lValFFTCoeffs, 0));
545
545
 
546
546
  // Compute the maximal values
547
547
  mpf_init_set_ui(lPtrFFTProfile->maxFFTValue, 1 << (lNbrBitsPerSample-1));
@@ -91,7 +91,7 @@ static int functionutils_fillCFunction_PiecewiseLinear(
91
91
  // Fill it
92
92
  // Read points in a sorted list of couples [x,y]
93
93
  VALUE lValSortedPoints = rb_funcall(rb_funcall(rb_hash_aref(iValFunction, ID2SYM(rb_intern("Points"))), rb_intern("to_a"), 0), rb_intern("sort"), 0);
94
- lPtrFctData->nbrPoints = RARRAY(lValSortedPoints)->len;
94
+ lPtrFctData->nbrPoints = RARRAY_LEN(lValSortedPoints);
95
95
  lPtrFctData->pointsX = ALLOC_N(tSampleIndex, lPtrFctData->nbrPoints);
96
96
  lPtrFctData->pointsY = ALLOC_N(long double, lPtrFctData->nbrPoints);
97
97
 
@@ -148,7 +148,7 @@ static VALUE volumeutils_applyVolumeFct(
148
148
  Data_Get_Struct(iValCFunction, tFunction, lPtrFct);
149
149
  // Get the input buffer
150
150
  char* lPtrRawBuffer = RSTRING_PTR(iValInputBuffer);
151
- int lBufferCharSize = RSTRING(iValInputBuffer)->len;
151
+ int lBufferCharSize = RSTRING_LEN(iValInputBuffer);
152
152
  // Allocate the output buffer
153
153
  char* lPtrOutputBuffer = ALLOC_N(char, lBufferCharSize);
154
154
 
metadata CHANGED
@@ -1,42 +1,40 @@
1
- --- !ruby/object:Gem::Specification
1
+ --- !ruby/object:Gem::Specification
2
2
  name: WaveSwissKnife
3
- version: !ruby/object:Gem::Version
4
- prerelease: false
5
- segments:
6
- - 0
7
- - 2
8
- - 0
9
- - 20120302
10
- version: 0.2.0.20120302
3
+ version: !ruby/object:Gem::Version
4
+ version: 0.3.0.20121227
5
+ prerelease:
11
6
  platform: ruby
12
- authors:
7
+ authors:
13
8
  - Muriel Salvan
14
9
  autorequire:
15
10
  bindir: bin
16
11
  cert_chain: []
17
-
18
- date: 2012-03-02 00:00:00 +01:00
19
- default_executable:
20
- dependencies:
21
- - !ruby/object:Gem::Dependency
12
+ date: 2012-12-27 00:00:00.000000000 Z
13
+ dependencies:
14
+ - !ruby/object:Gem::Dependency
22
15
  name: rUtilAnts
23
- prerelease: false
24
- requirement: &id001 !ruby/object:Gem::Requirement
16
+ requirement: !ruby/object:Gem::Requirement
25
17
  none: false
26
- requirements:
27
- - - ">="
28
- - !ruby/object:Gem::Version
29
- segments:
30
- - 1
31
- - 0
32
- version: "1.0"
18
+ requirements:
19
+ - - ! '>='
20
+ - !ruby/object:Gem::Version
21
+ version: '1.0'
33
22
  type: :runtime
34
- version_requirements: *id001
35
- description: "WSK is a command-line utility that processes WAV audio PCM files to apply audio filters, analysis tools or signals generation plugins: Test audio hardware bit-perfect fidelity, by providing many ways to compare and analyze WAV files ; Process audio files for mastering engineers (noise gates, mixers...)."
23
+ prerelease: false
24
+ version_requirements: !ruby/object:Gem::Requirement
25
+ none: false
26
+ requirements:
27
+ - - ! '>='
28
+ - !ruby/object:Gem::Version
29
+ version: '1.0'
30
+ description: ! 'WSK is a command-line utility that processes WAV audio PCM files to
31
+ apply audio filters, analysis tools or signals generation plugins: Test audio hardware
32
+ bit-perfect fidelity, by providing many ways to compare and analyze WAV files ;
33
+ Process audio files for mastering engineers (noise gates, mixers...).'
36
34
  email: muriel@x-aeon.com
37
- executables:
35
+ executables:
38
36
  - WSK.rb
39
- extensions:
37
+ extensions:
40
38
  - ext/WSK/AnalyzeUtils/extconf.rb
41
39
  - ext/WSK/ArithmUtils/extconf.rb
42
40
  - ext/WSK/FFTUtils/extconf.rb
@@ -44,8 +42,7 @@ extensions:
44
42
  - ext/WSK/SilentUtils/extconf.rb
45
43
  - ext/WSK/VolumeUtils/extconf.rb
46
44
  extra_rdoc_files: []
47
-
48
- files:
45
+ files:
49
46
  - AUTHORS
50
47
  - bin/WSK.rb
51
48
  - ChangeLog
@@ -118,38 +115,29 @@ files:
118
115
  - LICENSE
119
116
  - README
120
117
  - ReleaseInfo
121
- has_rdoc: true
122
118
  homepage: http://waveswissknife.sourceforge.net/
123
119
  licenses: []
124
-
125
120
  post_install_message:
126
121
  rdoc_options: []
127
-
128
- require_paths:
122
+ require_paths:
129
123
  - lib
130
124
  - ext
131
- required_ruby_version: !ruby/object:Gem::Requirement
125
+ required_ruby_version: !ruby/object:Gem::Requirement
132
126
  none: false
133
- requirements:
134
- - - ">="
135
- - !ruby/object:Gem::Version
136
- segments:
137
- - 0
138
- version: "0"
139
- required_rubygems_version: !ruby/object:Gem::Requirement
127
+ requirements:
128
+ - - ! '>='
129
+ - !ruby/object:Gem::Version
130
+ version: '0'
131
+ required_rubygems_version: !ruby/object:Gem::Requirement
140
132
  none: false
141
- requirements:
142
- - - ">="
143
- - !ruby/object:Gem::Version
144
- segments:
145
- - 0
146
- version: "0"
133
+ requirements:
134
+ - - ! '>='
135
+ - !ruby/object:Gem::Version
136
+ version: '0'
147
137
  requirements: []
148
-
149
138
  rubyforge_project: waveswissknife
150
- rubygems_version: 1.3.7
139
+ rubygems_version: 1.8.24
151
140
  signing_key:
152
141
  specification_version: 3
153
142
  summary: Command-line tool performing various operations on Wave files.
154
143
  test_files: []
155
-