wouldn’t your addCuePoint throw a mismatch error as your cuePointTime is strictly data typed as a Number?

Now that you mention it, yes, it sure should — but it doesn’t. Isn’t that odd? I imagine it would in AS3, in which strong typing truly is strongly typed.

Also, I’m thinking sorting after adding adding each element isn’t very efficient, because every time you add an element, you are resorting the ENTIRE list.

Heh, yes, that’s definitely true. In this case, I decided — perhaps poorly — to sweep that point under the rug in deference to the main theme, especially as this was a migration piece. Sometimes details can distract the from an article’s flow. Finding that balance can be a challenge.

Your point is well taken, as always, and your code samples are great! Thanks, bro!

Though I am a bit curious… wouldn’t your addCuePoint throw a mismatch error as your cuePointTime is strictly data typed as a Number?

Also, I’m thinking sorting after adding adding each element isn’t very efficient, because every time you add an element, you are resorting the ENTIRE list. So, I would perhaps either have a method that

1. adds all the cue points, and then sorts.
2. adds each cue point in the correct position by adding it before the first element that is greater than or equal to it (finding this element by looping through the array).

As a case study, I have timed the amount of time it takes for these 3 methods to sort (the same) list of 1000 elements, where each element is randomly chosen in the range 0-49.

I find that Method 1 (sorting afterwards) is faster in all cases.

Method 2 (manually finding where element belongs) is USUALLY faster than the original method, for arrays of length greater than 200, but slower for less than that. However, this algorithm could probably be made more efficient.

And for one very exaggerated test of having 1000 cue points, the original method took 14509 ms (!), method 1 took 13 ms, and method 2 took 6324 ms.

Here’s the code that I used:

//Random array
var r = [];
for(var i=0;i<1000;i++){
r[i] = random(50);
}
//For each element, add and sort
var s = getTimer();
var a = [];
for(var i=0;i<r.length;i++){
a[i] = r[i];
a.sort(Array.NUMERIC);
}
trace(getTimer()-s);
//Add all elements, then sort
var s = getTimer();
var b = [];
for(var i=0;i<r.length;i++){
b[i] = r[i];
}
b.sort(Array.NUMERIC);
trace(getTimer()-s);
//For each element, add in correct position
var s = getTimer();
var c = [];
for(var i=0;i<r.length;i++){
var addE = r[i];
for(var j=0;j<c.length;j++){
if(c[j]>=addE){
break;
}
}
c.splice(j,0,addE);
}
trace(getTimer()-s);