<?php
class Person {
public $name;
public $age;
public function __construct($name, $age) {
$this->name = $name;
$this->age = $age;
}
}
// Create an array of Person objects
$people = [
new Person("Alice", 30),
new Person("Bob", 25),
new Person("Charlie", 35)
];
// Function to search for a person by name
function searchPersonByName($people, $searchName) {
foreach ($people as $person) {
if ($person->name === $searchName) {
return $person;
}
}
return null; // Return null if not found
}
// Example usage
$searchResult = searchPersonByName($people, "Bob");
if ($searchResult) {
echo "Found: " . $searchResult->name . ", Age: " . $searchResult->age;
} else {
echo "Person not found.";
}
?>
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?