<?php
class MyIterator implements Iterator {
private $data = [];
private $index = 0;
public function __construct($data) {
$this->data = $data;
}
public function current() {
return $this->data[$this->index];
}
public function key() {
return $this->index;
}
public function next() {
++$this->index;
}
public function rewind() {
$this->index = 0;
}
public function valid() {
return isset($this->data[$this->index]);
}
}
$data = ['first' => 'apple', 'second' => 'banana', 'third' => 'cherry'];
$iterator = new MyIterator($data);
foreach ($iterator as $key => $value) {
echo "$key: $value<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?