通过对象的id在javascript数组中查找并移动对象

Question

我有2个对象数组。每个对象都有一个Id属性。现在，如果我有第三个只有Ids的数组，那么根据这些Ids并将它们移动到数组2，从array1中查找对象的更好更快的方法是什么。

非常感谢回答..

示例代码：

Person = function(id, fn, ln) { 
    this.id = id, 
    this.firstName = fn, 
    this.lastName = ln 
} 

array1 = new Array(); 
// add 500 new Person objects to this array 

array2 = new Array(); 
// add some other new Person objects to this array 

function moveArrayItems(ids) { 
    // ids is an array of ids e.g. [1,2,3,4,5,6,...] 
    // Now I want to find all the person objects from array1 whose ids 
    // match with the ids array passed into this method. Then move them to array2. 
    // What is the best way to achive this? 
} 

Answer 1

如果你真的有每个阵列中500+的对象，你可能会更好过使用散列存储的对象，通过ID键：

var people = { 
       1: {id:1, name:"George Washington"}, 
       2: {id:2, name:"John Adams"}, 
       3: {id:3, name:"Thomas Jefferson"}, // ... 
      } 

var people2 = {} 

现在是微不足道的（和很多

function moveArrayItems(ids) { 
    var i,id; 
    for (i=0; i<ids.length; i++){ 
     id = ids[i]; 
     if (people1[id]) { 
      people2[id] = people1[id]; 
      delete people1[id]; 
     } 
    } 
} 

Answer 2

只是一些未经检验的快速伪代码。这给出了一个O（n^2）算法，因此它可能不是最好的。

function moveArrayItems(ids) { 
    // ids is an array of ids e.g. [1,2,3,4,5,6,...] 
    //Now I want to find all the person objects from array1 whose ids match with the ids array passed into this method. Then move them to array2. 
    //What is the best way to achive this? 
    for(i = 0;i < ids.length;i++){ 
     var found = false; 
     var j = 0; 
     while(!found && j < array1.length){ 
      if(array1[j].id = ids[i]){ 
      array2.push(array1[j]); 
      found = true; 
      }    
      j++; 
     } 
    } 
} 

Answer 3

首先一点功能通过John Resig

// Array Remove - By John Resig (MIT Licensed) 
Array.prototype.remove = function(from, to) { 
    var rest = this.slice((to || from) + 1 || this.length); 
    this.length = from < 0 ? this.length + from : from; 
    return this.push.apply(this, rest); 
}; 

：更快）围绕由ID移动的东西

然后，合并文森特的解决方案

function moveArrayItems(ids) 
{ 
    // ids is an array of ids e.g. [1,2,3,4,5,6,...] 
    // Now I want to find all the person objects from array1 
    // whose ids match with the ids array passed into 
    // this method. Then move them to array2. 
    // What is the best way to achive this? 

    for(i = 0; i < ids.length; i++) 
    {  
    var found = false; 
    var j = 0; 
    while(!found && j < array1.length) 
    { 
     if(array1[j].id = ids[i]) 
     { 
     array2.push(array1[j]); 
     array1.remove(i); 
     found = true; 
     }     
     j++; 
    } 
    } 
} 

Answer 4

好问题。这实际上让我回去参考基础知识。关于JS阵列的关键是它的稀疏。您可以创建一个数组并为任何索引分配值（例如：10和23）。基于这一事实

array1 = new Array(); 

array1[person1.id] = person1; 
array1[person2.id] = person2; 
.... goes till N 

function moveArrayItems(ids) { 
    for(index in ids) { 
     array2.push(array1[ids[index]]); 
     delete array1[ids[index]]; 
    } 
} 

注：我假设Person.id是整数并且小于2^32 - 1.参见JS文件，当ID是大于或浮点数。 JS Array实现不是连续的块，所以不要认为为索引12345分配值需要12345个连续的内存块。