Simulating array_unique in JavaScript
Wednesday, August 8th, 2007 at 2:09 pmOne of the beautiful things of PHP is its wealth of array methods. JavaScript in comparison seems ridiculously inadequate and you find yourself having to write own methods or patch the existing ones. One method I especially cherish is array_unique() which returns a new array that has all the duplicates filtered out. This is easy to write in JavaScript, all you need to do is:
- create a new object
- loop through the array and use the array values as new properties of the object (that way the property simply gets re-set and not added as a new one to the object when it comes up again)
- loop through the properties of the object and add each value to the results array
Technically this should do it:
function array_unique(ar){
var sorter = {};
for(var i=0,j=ar.length;iNow array_unique([1,2,3,1,1]) returns “[1,2,3]” which is what we want. However, there is a snag. What if the array contains elements that are almost the same but a different type? When you run array_unique([1,2,3,”1”,1]) you still only get “[1,2,3]” as the returned array and what you’d really need is “[1,2,3,’1’]”. The solution to this is to store both the value and the type in the property and push the values to the results array:
function array_unique(ar){
var sorter = {};
for(var i=0,j=ar.length;iThe next thing I can think of is to ensure that the array is really an array. We can test this by checking if it has a length property and is not a string.
function array_unique(ar){
if(ar.length && typeof ar!=='string'){
var sorter = {};
for(var i=0,j=ar.length;iHowever, two loops can be slow, and for…in is a very slow construct. Therefore we can avoid the second loop by using an output array:
function array_unique(ar){
if(ar.length && typeof ar!=='string'){
var sorter = {};
var out = [];
for(var i=0,j=ar.length;iAnything I have forgotten?
[tags]PHP,JavaScript,array_unique,sorting,cleaning,hashtable[/tags]