From fc81b147a77cdf9cfb8fac9e7c6a93ffcdc5dc05 Mon Sep 17 00:00:00 2001 From: dcoudert Date: Fri, 13 Dec 2024 13:59:54 +0100 Subject: [PATCH] #39046: typos --- src/sage/data_structures/pairing_heap.pyx | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/sage/data_structures/pairing_heap.pyx b/src/sage/data_structures/pairing_heap.pyx index 8d92e714483..ec08be43652 100644 --- a/src/sage/data_structures/pairing_heap.pyx +++ b/src/sage/data_structures/pairing_heap.pyx @@ -1188,7 +1188,7 @@ def _test_PairingHeap_of_n_integers(n=100): # Test decrease key operations. We first push items in the heap with an # excess of k in the value. Then we decrease the keys in a random order by - # random values until returning to the origianl values. We finally check the + # random values until returning to the original values. We finally check the # validity of the resulting ordering. cdef int k = 10 cdef list dec = [k] * n @@ -1294,7 +1294,7 @@ def _test_PairingHeap_of_n_hashables(n=100): # Test decrease key operations. We first push items in the heap with an # excess of k in the value. Then we decrease the keys in a random order by - # random values until returning to the origianl values. We finally check the + # random values until returning to the original values. We finally check the # validity of the resulting ordering. cdef int k = 10 cdef dict dec = {item: k for item in items}