Testing code that utilizes both heap and stack memory is essential for understanding memory management in programming. Heap memory is used for dynamic memory allocation, while stack memory is used for static memory allocation. Here is an example demonstrating the difference between the two.
<?php
function stackExample() {
$a = 10; // stack allocation
$b = 20; // stack allocation
return $a + $b;
}
function heapExample() {
$arr = array(); // dynamic allocation (heap)
for ($i = 0; $i < 5; $i++) {
$arr[$i] = $i * 10;
}
return $arr;
}
// Testing stack memory usage
echo "Stack sum: " . stackExample() . "<br>";
// Testing heap memory usage
echo "Heap array: ";
print_r(heapExample());
?>
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?