replace the number_of_slice at the right place, and uses now the sexy wait approach

release-packaging/Examples/nb_of_slices.scd

@@ -1,65 +0,0 @@
-(
-b = Buffer.read(s,File.realpath(FluidBufNoveltySlice.class.filenameSymbol).dirname.withTrailingSlash ++ "../AudioFiles/Nicol-LoopE-M.wav");
-c = Buffer.new(s);
-)
-
-(
-// with basic params
-Routine{
-	var startTime, target, tolerance, startThresh, prevThresh, curThresh, curVal, prevVal, iters, maxIters, dVal, dThresh;
-	var cond = Condition.new;
-
-	startTime = Main.elapsedTime;
-	prevThresh = 0.1; //initial threshold (between 0.00001 and 0.99999
-	target = 10; //number of slices desired
-	tolerance = 0; // the acceptable error in the number of slices yield
-	maxIters = 100; //max number of iterations acceptable
-
-	//makes a first iteration
-	FluidBufNoveltySlice.process(s,b, indices: c, threshold:prevThresh, action:{|x|prevVal = x.numFrames;\there.postln;cond.unhang;});
-	\here.postln;
-	cond.hang;
-	//makes a second iteration
-	if ( (prevVal <  target), {
-		curThresh = (prevThresh * 0.5).max(0.000001);
-	}, {
-		curThresh = (prevThresh * 2).min(0.999999);
-	});
-	FluidBufNoveltySlice.process(s,b, indices: c, threshold:curThresh,action:{|x|curVal = x.numFrames;cond.unhang;});
-	cond.hang;
-
-	//makes further iterations until the result is achieved, or the maximum of acceptable iterations is reached
-	iters = 2;
-	while ( {
-		(iters < maxIters) && ((curVal - target).abs > tolerance)
-	}, {
-		iters = iters + 1;
-		dVal = curVal - prevVal;
-		dThresh = curThresh - prevThresh;
-
-		prevThresh = curThresh;
-		prevVal = curVal;
-
-		if ( (dVal == 0), {
-			//if we have not change results between the last 2 passes, make the variation of threshold bigger
-			curThresh = (dThresh + curThresh).min(0.999999).max(0.000001);
-		},{
-			//if we have
-			curThresh = (((dThresh / dVal) * (target - curVal)) + curThresh).min(0.999999).max(0.000001);
-		});
-		FluidBufNoveltySlice.process(s,b, indices: c, threshold:curThresh,action:{|x|curVal = x.numFrames;cond.unhang;});
-		cond.hang;
-	}
-	);
-	//depending on the outcome, gives the right info back
-
-	if ( iters >= maxIters, {
-		// failed
-		"Failed to find a suitable threshold in % seconds.\n".postf((Main.elapsedTime - startTime).round(0.01));
-	}, {
-		// succeeded
-		"Found % as a suitable threshold for % slices in % seconds and % iterations.\n".postf(curThresh, curVal, (Main.elapsedTime - startTime).round(0.01), iters);
-	}
-	);
-}.play
-)

release-packaging/Examples/segmenting/nb_of_slices.scd

@@ -7,6 +7,7 @@ c = Buffer.new(s);
 // with basic params
 Routine{
 	var startTime, target, tolerance, startThresh, prevThresh, curThresh, curVal, prevVal, iters, maxIters, dVal, dThresh;
+
 	startTime = Main.elapsedTime;
 	prevThresh = 0.1; //initial threshold (between 0.00001 and 0.99999
 	target = 10; //number of slices desired
@@ -14,14 +15,17 @@ Routine{
 	maxIters = 100; //max number of iterations acceptable
 
 	//makes a first iteration
-	FluidBufNoveltySlice.process(s,b, indices: c, threshold:prevThresh,action:{|x|prevVal = x.numFrames});
+	FluidBufNoveltySlice.process(s,b, indices: c, threshold:prevThresh).wait;
+	prevVal = c.numFrames;
+
 	//makes a second iteration
 	if ( (prevVal <  target), {
 		curThresh = (prevThresh * 0.5).max(0.000001);
 	}, {
 		curThresh = (prevThresh * 2).min(0.999999);
 	});
-	FluidBufNoveltySlice.process(s,b, indices: c, threshold:curThresh,action:{|x|curVal = x.numFrames});
+	FluidBufNoveltySlice.process(s,b, indices: c, threshold:curThresh).wait;
+	curVal = c.numFrames;
 
 	//makes further iterations until the result is achieved, or the maximum of acceptable iterations is reached
 	iters = 2;
@@ -42,7 +46,8 @@ Routine{
 			//if we have
 			curThresh = (((dThresh / dVal) * (target - curVal)) + curThresh).min(0.999999).max(0.000001);
 		});
-		FluidBufNoveltySlice.process(s,b, indices: c, threshold:curThresh,action:{|x|curVal = x.numFrames});
+		FluidBufNoveltySlice.process(s,b, indices: c, threshold:curThresh).wait;
+		curVal = c.numFrames;
 	}
 	);
 	//depending on the outcome, gives the right info back