-/* $Id: dfa.c,v 1.33 2005-01-15 21:45:42 adam Exp $
+/* $Id: dfa.c,v 1.36 2006-06-13 19:43:42 adam Exp $
Copyright (C) 1995-2005
Index Data ApS
#include <string.h>
#include <ctype.h>
-#include <zebrautl.h>
+#include <idzebra/util.h>
#include "dfap.h"
#include "imalloc.h"
{
long i, j;
int k;
- printf ("%d/%d tree nodes used, %d bytes each\n",
- parse_info->use_Tnode, parse_info->max_Tnode, sizeof (struct Tnode));
+ printf ("%d/%d tree nodes used, %ld bytes each\n",
+ parse_info->use_Tnode, parse_info->max_Tnode, (long) sizeof (struct Tnode));
k = inf_BSetHandle (parse_info->charset, &i, &j);
- printf ("%ld/%ld character sets, %d bytes each\n",
- i/k, j/k, k*sizeof(BSetWord));
+ printf ("%ld/%ld character sets, %ld bytes each\n",
+ i/k, j/k, (long) k*sizeof(BSetWord));
k = inf_DFASetType (parse_info->poset, &i, &j);
printf ("%ld/%ld poset items, %d bytes each\n", i, j, k);
printf ("%d DFA states\n", dfas->no);
ifree (*dfap);
*dfap = NULL;
}
+/*
+ * Local variables:
+ * c-basic-offset: 4
+ * indent-tabs-mode: nil
+ * End:
+ * vim: shiftwidth=4 tabstop=8 expandtab
+ */
+