<?php
class Cache {
private array $cache = [];
public function set(string $key, $value): void {
$this->cache[$key] = $value;
}
public function get(string $key) {
return $this->cache[$key] ?? null;
}
public function has(string $key): bool {
return isset($this->cache[$key]);
}
public function clear(): void {
$this->cache = [];
}
}
// Using the Cache class
$cache = new Cache();
$cache->set('user_1', ['name' => 'John Doe', 'email' => 'john@example.com']);
if ($cache->has('user_1')) {
$user = $cache->get('user_1');
echo "User found: " . $user['name'];
} else {
echo "User 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?