X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Flibpspp%2Farray.c;h=b1b4ee524562e4335b275ddbbb0072b1e4312667;hb=3da49359c52cb783db907cc197847bbd5e721c97;hp=e4d269373e8310dd5763fcaca4c638161e2f340a;hpb=43b1296aafe7582e7dbe6c2b6a8b478d7d9b0fcf;p=pspp

diff --git a/src/libpspp/array.c b/src/libpspp/array.c
index e4d269373e..b1b4ee5245 100644
--- a/src/libpspp/array.c
+++ b/src/libpspp/array.c
@@ -1,5 +1,5 @@
 /* PSPP - a program for statistical analysis.
-   Copyright (C) 1997-9, 2000 Free Software Foundation, Inc.
+   Copyright (C) 1997-9, 2000, 2010 Free Software Foundation, Inc.
 
    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
@@ -88,11 +88,9 @@
 #include <limits.h>
 #include <stdlib.h>
 #include <string.h>
-#include "alloc.h"
 #include <libpspp/assertion.h>
 
-#include "message.h"
-
+#include "xalloc.h"
 #include "minmax.h"
 
 /* Finds an element in ARRAY, which contains COUNT elements of
@@ -372,7 +370,7 @@ 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)
@@ -640,7 +638,7 @@ typedef struct
 
 void
 sort (void *array, size_t count, size_t size,
-	    algo_compare_func *compare, const void *aux)
+      algo_compare_func *compare, const void *aux)
 {
   char *const first = array;
   const size_t max_thresh = MAX_THRESH * size;