typos corrections pre-release

release-packaging/HelpSource/Classes/FluidBufNMF.schelp

@@ -175,7 +175,7 @@ y = Buffer.new(s);
 ~fft_size = 1024;
 ~frame_size = 512;
 ~hop_size = 256;
-~which_component = 1;
+~which_component = 4;
 )
 
 // matrix factorisation, requesting everything - wait for the computation time to appear.

release-packaging/HelpSource/Classes/FluidBufThreadDemo.schelp

@@ -63,6 +63,6 @@ FluidBufThreadDemo.process(s, b, 1000, action:{|x|x.get(0,{|y|y.postln});});
 c = FluidBufThreadDemo.process(s, b, 100000, action: {|x|x.get(0,{|y|y.postln});});
 c.cancel;
 
-// if a simple call to the UGen is used, the progress can be monitored. The usual cmd. will cancel the job by freeing the synth.
+// if a simple call to the UGen is used, the progress can be monitored. The usual cmd-period will cancel the job by freeing the synth.
 {c = FluidBufThreadDemo.kr(b,10000, Done.freeSelf); Poll.kr(Impulse.kr(2),c);}.scope;
 ::

release-packaging/HelpSource/Classes/FluidDataSetQuery.schelp

@@ -177,7 +177,7 @@ code::
 ~dsC.print
 
 // all the sophisticated conditions applicable to 'transform' can be done on the first dataset too. Selected columns of the first source are appended to matching items in the second source.
-~joiner.filter(1,">",2.1)
+~joiner.filter(0,">",2.1)
 ~joiner.and(1,"<", 40)
 ~joiner.addColumn(0)
 ~joiner.transformJoin(~dsA,~dsB,~dsC)

release-packaging/HelpSource/Classes/FluidKDTree.schelp

@@ -92,15 +92,17 @@ fork{
 
 // Explore changing the number of neighbourgs
 ~tree.numNeighbours = 11; // note that this value needs to be sent to the server
-~tree.kNearest(~tmpbuf,{ |a|a.postln;~nearest = a;});
+~tree.kNearest(~tmpbuf,{ |a|a.postln;});
 ~tree.numNeighbours = 0; // 0 will return all items in order of distance
+~tree.kNearest(~tmpbuf,{ |a|a.postln;});
 
 // Limit the search to an acceptable distance in a radius
 // Define a point, and observe typical distance values
 ~p = [ 0.4,0.4];
 (
 ~tmpbuf = Buffer.loadCollection(s, ~p, 1, {
-	~tree.kNearestDist(~tmpbuf,{ |a|a.postln;~nearest = a;});
+	~tree.kNearest(~tmpbuf,{ |a|a.postln;});
+	~tree.kNearestDist(~tmpbuf,{ |a|a.postln;});
 });
 )
 
@@ -109,7 +111,7 @@ fork{
 // FluidKDTree will return only values that are within that radius, up to numNeighbours values
 (
 ~tmpbuf = Buffer.loadCollection(s, ~p, 1, {
-	~tree.kNearest(~tmpbuf,{ |a|a.postln;~nearest = a;});
+	~tree.kNearest(~tmpbuf,{ |a|a.postln;});
 });
 )
 ::