#!/usr/bin/env python3
"""Auto-generated by AGI Loop cycle #1064
Task: Write a Python function that implements a min-heap with push, pop, and peek operations
Generated: 2026-02-12T18:51:14.168173
"""

import sys
import heapq

class MinHeap:
    def __init__(self):
        self.heap = []

    def push(self, value):
        heapq.heappush(self.heap, value)

    def pop(self):
        return heapq.heappop(self.heap)

    def peek(self):
        return self.heap[0] if self.heap else None

def test_min_heap():
    heap = MinHeap()
    test_data = [5, 3, 8, 1, 4]
    for data in test_data:
        heap.push(data)
    print("Heap after push:", heap.heap)
    print("Peek:", heap.peek())
    popped = heap.pop()
    print("Popped value:", popped)
    print("Heap after pop:", heap.heap)
    print("Peek after pop:", heap.peek())

if __name__ == '__main__':
    test_min_heap()