分组算法（具有PHP和Laravel收集支持）

Question

我需要一些人帮我组织一个团体...我在一个Laravel集合中有一些对象，下面是一些json表示形式的示例数据：

[
  {
    "group": "WHITE",
    "name": "John Doe",
    "sequence": 1
  },
  {
    "group": "WHITE",
    "name": "John Doe Jr",
    "sequence": 2
  },
  {
    "group": "BLUE",
    "name": "John Doe Sr",
    "sequence": 3
  },
  {
    "group": "BLUE",
    "name": "John Doe Again",
    "sequence": 4
  },
  {
    "group": "RED",
    "name": "Mr John Doe",
    "sequence": 5
  },
  {
    "group": "RED",
    "name": "Ms Joahnna Doe",
    "sequence": 6
  },
  {
    "group": "BLUE",
    "name": "Dr Johnny Doe",
    "sequence": 7
  },
  {
    "group": "RED",
    "name": "Sir John Doe",
    "sequence": 8
  },
  {
    "group": "RED",
    "name": "Sir John Doe Senior",
    "sequence": 9
  },
  {
    "group": "WHITE",
    "name": "Ms John Doe",
    "sequence": 10
  }
]

我希望能够按组名对这些对象进行分组，但保持序列不变，并且重复出现两次或更多次的键，如下所示：

{
    "WHITE": [
        { "name": "John Doe", "sequence": 1 },
        { "name": "John Doe Jr", "sequence": 2 }
    ],
    "BLUE": [
        { "name": "John Doe Sr", "sequence": 3 },
        { "name": "John Doe Again", "sequence": 4 }
    ],
    "RED": [
        { "name": "Mr John Doe", "sequence": 5 },
        { "name": "Ms Joahnna Doe", "sequence": 6 }
    ],
    "BLUE": [
        { "name": "Dr Johnny Doe", "sequence": 7 }
    ],
    "RED": [
        { "name": "Sir John Doe", "sequence": 8 },
        { "name": "Sir John Doe Senior", "sequence": 9 }
    ],
    "WHITE": [
        { "name": "Ms John Doe",  "sequence": 10 }
    ]
}

我已经找到了一种这样做的方法：我迭代每个对象，在前面那些序列号不是相应的对象中查找OCCurrences，并且我向对象添加一个新的group_name键，当满足前面的条件（即添加我找到的拆分的计数）时更改这个名称。在我的记忆中，推送原始集合中的每个occurrency让我使用一个简单的$collection->groupby('group_name')

php prettyprint-override">foreach ($data as $stop) {
    $previous_stops_in_group = $stops
        ->where('group', $stop->group)

    $stop->group_name = $stop->group;
    $stop->splitted = false;
    if ($previous_stops_in_group->count() >0) {
        $last_sequence_in_group = $previous_stops_in_group->last()->sequence;
        if (($stop->sequence - $last_sequence_in_group) > 1) {
            $splittedroutes++;
            $stop->group_name = $stop->group . $splittedroutes;
            $stop->splitted = true;
        }
    }


    $last_splitted_group = $stops
        ->where('splitted',true)
        ->where('stop_group',$stop->stop_group)
        ->where('direction', $stop->direction)->last();
    if (!empty($last_splitted_group) && isset($last_splitted_group->group_name)) {
        $stop->group_name = $last_splitted_group->group_name;
    }
    $stops->push($stop);
}

不幸的是，我在大约一年前写了这篇烂杰作，现在我不知道是怎么回事，因为这个算法应该应用于数百条记录，但它并不相应地起作用。

我想找到一个更可预测的解决方案，使用一个表达语法，也许是集合的本机方法，也许是partition()和mergeRecursive()的组合？

谁能给我指个方向吗？我真的很挣扎很累...

提前感谢，羞愧我！：）

Answer 1

我不知道是否可以用集合来做得更好，但下面是我的方法：

$items = [
  {
    "group": "WHITE",
    "name": "John Doe",
    "sequence": 1
  },
  // ...
  {
    "group": "WHITE",
    "name": "Ms John Doe",
    "sequence": 10
  }
];

$result = [];
foreach ($items as $item) {
    if (!isset($result[$item['group']])) $result[$item['group']] = [];
    $result[$item['group']][] = [
        'name' => $item['item'],
        'sequence' => $item['sequence'],
    ];
}