Work around Java's ``code too large'' problem for parser tables.

[bison.git] / src / uniqstr.h

diff --git a/src/uniqstr.h b/src/uniqstr.h
index 3eb152d30e096a2a00f9a5b54989a284fcc3015d..c986df07f23003d7a17ef71b0e90cc8db87536d8 100644 (file)
--- a/src/uniqstr.h
+++ b/src/uniqstr.h
@@ -1,6 +1,6 @@
 /* Keeping a unique copy of strings.
 
-   Copyright (C) 2002, 2003 Free Software Foundation, Inc.
+   Copyright (C) 2002, 2003, 2008 Free Software Foundation, Inc.
 
    This file is part of Bison, the GNU Compiler Compiler.
 
@@ -32,6 +32,10 @@ uniqstr uniqstr_new (char const *str);
 /* Two uniqstr values have the same value iff they are the same.  */
 #define UNIQSTR_EQ(USTR1, USTR2) ((USTR1) == (USTR2))
 
+/* Compare two uniqstr a la strlen: negative for <, nul for =, and
+   positive for >.  */
+#define UNIQSTR_CMP(USTR1, USTR2) ((USTR1) - (USTR2))
+
 /*--------------------------------------.
 | Initializing, destroying, debugging.  |
 `--------------------------------------*/