diff --git a/src/data_structures/priority_heap.c b/src/data_structures/priority_heap.c
index 593b512..5fdfb5c 100644
--- a/src/data_structures/priority_heap.c
+++ b/src/data_structures/priority_heap.c
@@ -195,7 +195,7 @@ void simple_archiver_priority_heap_iter(SDArchiverPHeap *priority_heap,
   if (priority_heap->size == 0) {
     return;
   }
-  for (uint64_t idx = 0; idx < priority_heap->size; ++idx) {
+  for (uint64_t idx = 0; idx < priority_heap->capacity; ++idx) {
     if (priority_heap->nodes[idx].is_valid) {
       iter_fn(priority_heap->nodes[idx].data);
     }
diff --git a/src/data_structures/test.c b/src/data_structures/test.c
index 5bfa57b..327049d 100644
--- a/src/data_structures/test.c
+++ b/src/data_structures/test.c
@@ -446,12 +446,12 @@ int main(void) {
     simple_archiver_priority_heap_free(&priority_heap);
 
     priority_heap = simple_archiver_priority_heap_init();
-    for (uint32_t idx = 0; idx < 50; ++idx) {
+    for (uint32_t idx = 0; idx < 15; ++idx) {
       uint32_t *data = malloc(sizeof(uint32_t));
       *data = idx;
       simple_archiver_priority_heap_insert(priority_heap, idx, data, NULL);
     }
-    printf("Begin iteration of 50 elements:\n");
+    printf("Begin iteration of 15 elements:\n");
 
     simple_archiver_priority_heap_iter(priority_heap,
                                        test_iter_fn_priority_heap);