In PHP 8+, sorting objects can be done quite easily using various built-in functions. One of the most common methods is to use the `usort()` function combined with a custom comparison function. With PHP 8’s improvements, you can leverage arrow functions for a more concise syntax.
Sorting Objects, PHP 8, usort, Arrow Functions, Object Comparison
This guide demonstrates how to efficiently sort objects in PHP 8 using advanced features such as arrow functions for cleaner and more readable code.
<?php
class Person {
public string $name;
public int $age;
public function __construct(string $name, int $age) {
$this->name = $name;
$this->age = $age;
}
}
$people = [
new Person("Alice", 30),
new Person("Bob", 25),
new Person("Charlie", 35),
];
// Sort by age using usort and an arrow function
usort($people, fn($a, $b) => $a->age <=> $b->age);
foreach ($people as $person) {
echo $person->name . " (" . $person->age . " years old)<br>";
}
?>
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?