X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Flibpspp%2Farray.h;h=dc17fbd7ef56fdd3f8b1a44c532fb9c964c28c90;hb=80595f6de2ea8f0b64756d76c7ac3c89a1abbbb8;hp=a867adea5a91301dd8185dfc394d717a654863bc;hpb=d08af71f38b751323cc9506631bf9ce71070a4ae;p=pspp

diff --git a/src/libpspp/array.h b/src/libpspp/array.h
index a867adea5a..dc17fbd7ef 100644
--- a/src/libpspp/array.h
+++ b/src/libpspp/array.h
@@ -118,7 +118,7 @@ void insert_range (void *array, size_t count, size_t size,
 /* Makes room for a new element at IDX in ARRAY, which initially
    consists of COUNT elements of SIZE bytes each, by shifting
    elements IDX...COUNT (exclusive) to the right by one
-   positions. */
+   position. */
 void insert_element (void *array, size_t count, size_t size,
                      size_t idx);
 
@@ -223,8 +223,8 @@ void sort_heap (void *array, size_t count, size_t size,
                 algo_compare_func *compare, const void *aux);
 
 /* ARRAY contains COUNT elements of SIZE bytes each.  This
-   function tests whether ARRAY is a heap and returns true if so, 
-   false otherwise.  Uses COMPARE to compare elements, passing 
+   function tests whether ARRAY is a heap and returns true if so,
+   false otherwise.  Uses COMPARE to compare elements, passing
    AUX as auxiliary data. */
 bool is_heap (const void *array, size_t count, size_t size,
              algo_compare_func *compare, const void *aux);