I am trying to figure out an efficient way to remove objects that are duplicates from an array and looking for the most efficient answer. I looked around the internet everything seems to be using primitive data... or not scalable for large arrays. This is my current implementation which is can be improved and want to try to avoid labels.

 Test.prototype.unique = function (arr, artist, title, cb) {

        console.log(arr.length);

        var n, y, x, i, r;

        r = [];      

        o: for (i = 0, n = arr.length; i < n; i++) {



          for (x = 0, y = r.length; x < y; x++) {



                if (r[x].artist == arr[i].artist && r[x].title == arr[i].title) {

                    continue o;

                }

            }

            r.push(arr[i]);

        }



        cb(r);

    };

and the array looks something like this:

[{title: sky, artist: jon}, {title: rain, artist: Paul}, ....]

Order does not matter, but if sorting makes it more efficient then I am up for the challenge...

and for people who do not know o is a label and it is just saying jump back to the loop instead of pushing to the new array.

Pure javascript please no libs.

ANSWERS SO FAR:

The Performance Test for the answers below:
http://jsperf.com/remove-duplicates-for-loops