X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;f=ucw%2Fasort-test.c;h=c35db743d1551cc2e3b577d4053d3ba0ea03eb82;hb=959566090f98dd31eaa67d3d5959b641e5fe902b;hp=f89e0b86c4987f014572ff81e3f9329a5b09c906;hpb=a4fe009d3366b0a3e119713b0ecc7fc0070efdfa;p=libucw.git

diff --git a/ucw/asort-test.c b/ucw/asort-test.c
index f89e0b86..c35db743 100644
--- a/ucw/asort-test.c
+++ b/ucw/asort-test.c
@@ -7,7 +7,8 @@
  *	of the GNU Lesser General Public License.
  */
 
-#include "ucw/lib.h"
+#include <ucw/lib.h>
+#include <ucw/time.h>
 
 #include <stdlib.h>
 #include <stdio.h>
@@ -27,7 +28,7 @@ static struct elt array[N];
 
 static void generate(void)
 {
-  uns i;
+  uint i;
   for (i=0; i<N; i++)
 #if 0
     ASORT_ELT(i) = N-i-1;
@@ -42,7 +43,7 @@ static int errors = 0;
 
 static void check(void)
 {
-  uns i;
+  uint i;
   for (i=0; i<N; i++)
     if (ASORT_ELT(i) != i)
     {
@@ -62,7 +63,7 @@ static int qs_comp(const struct elt *X, const struct elt *Y)
 }
 
 #define ASORT_PREFIX(x) as_##x
-#include "ucw/sorter/array-simple.h"
+#include <ucw/sorter/array-simple.h>
 
 int main(void)
 {