我有几个对象数组,我想循环并按顺序输出.每个数组中都有不同类型的对象,但所有对象都具有唯一的顺序属性.

例如：

$PEople = [{'name':'George','email':'George@test.COM','order':'2'},{'name...];
$sandwiches = [{'type':'bacon','rating':'8/10','order':'1'},{'type...];
$restaurants = ....
$chefs = ...
...

按顺序循环遍历它们的最有效方法是什么？

假设我可以确定最大顺序我认为我可以做类似的事情：

for($i=0; $i< $maximumOrder; $i++)
{
   for($j=0; $j< count($people); $j++)
   {
     if($people[$j]->order == $i)
     {
        //Do the things I want to do
        break;
     }
   }


   for($j=0; $j< count($sandwiches); $j++)
   {
     if($sandwiches[$j]->order == $i)
     {
        //Do the things I want to do
        break;
     }
   }


   for($j=0; $j< count($restaurants); $j++)
   {
   .....


}

但这并不是很好,因为即使在人们中找到具有所需顺序的项目,它仍将继续循环遍历所有其他数组.我可以添加一个布尔变量来显示是否已找到所需的项目(见下文),但我相信有更好的方法可以做到这一点.

for($i=0; $i< $maximumOrder; $i++)
{
   $found = false;

   for($j=0; $j< count($people); $j++)
   {
     if($people[$j]->order == $i)
     {
        //Do the things I want to do
        $found = true;
        break;
     }
   }

   if(!$found == true)
   {
       for($j=0; $j< count($sandwiches); $j++)
       {
         if($sandwiches[$j]->order == $i)
         {
            //Do the things I want to do
            $found = true;
            break;
         }
       }
    }


   if(!$found == true)
   {
       for($j=0; $j< count($restaurants); $j++)
       {
       .....


}

下面是基于@Victory的答案,添加了一个elseif语句,如果它传递了所需的订单号,则停止while循环(假设这些是现在已排序的数组).我相信这应该提高效率(至少对于大阵列),但如果我错了请纠正我？

function orderArrayByOrder($a,$b)
{
    return ($a->order < $b->order) ? -1 : 1;
}

$a1 = usort($people,"orderArrayByOrder");
$a2 = usort($sandwiches,"orderArrayByOrder");
$a3 = usort($restaurants,"orderArrayByOrder");


$c1 = count($a1)
$c2 = count($c2)
$c3 = count($c3)

$i1 = 0
$i2 = 0
$i3 = 0


// ITertor over order
for ($curOrder ... $maxorder) 
{

   while ($i1 < $c1)
   {
      if($a1[$i1]->order == $curOrder)
      {
        //Do what I need to do
        break;
      }
      elseif($a1[$i1]->order > $curOrder)
      {
        //We kNow the order won't exist in this array.
        break; 
      }
      $i1++;
   }

   while ($i2 < $c2) 
   {
      if($a2[$i2]->order == $curOrder)
      {
        //Do what I need to do
        break;
      }
      elseif($a2[$i2]->order > $curOrder)
      {
        break;
      }
      $i1++;
   }

}