(_AT_TEST_GLR_CXXTYPES): Do not include <assert.h>.

[bison.git] / lib / lbitset.h

diff --git a/lib/lbitset.h b/lib/lbitset.h
index 9af651f117fb5275b4f4497944e9d9678b8ae670..70b922ab5dd9b01b34a14624f7776da619891060 100644 (file)
--- a/lib/lbitset.h
+++ b/lib/lbitset.h
@@ -17,45 +17,13 @@ along with this program; if not, write to the Free Software
 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  */
 
 #ifndef _LBITSET_H
-#define _LBITSET_H
+#define _LBITSET_H 
 
-#include "bitset-int.h"
-
-/* Number of words to use for each element.  The larger the value the
-   greater the size of the cache and the shorter the time to find a given bit
-   but the more memory wasted for sparse bitsets and the longer the time
-   to search for set bits.  */
-#ifndef LBITSET_ELT_WORDS
-#define LBITSET_ELT_WORDS 2
-#endif
-
-typedef bitset_word lbitset_word;
-#define LBITSET_WORD_BITS BITSET_WORD_BITS
-
-/* Number of bits stored in each element.  */
-#define LBITSET_ELT_BITS \
-  ((unsigned) (LBITSET_ELT_WORDS * LBITSET_WORD_BITS))
-
-/* Lbitset element.   We use an array of bits for each element.
-   These are linked together in a doubly-linked list.  */
-typedef struct lbitset_elt_struct
-{
-  struct lbitset_elt_struct *next; /* Next element.  */
-  struct lbitset_elt_struct *prev; /* Previous element.  */
-  bitset_windex index;         /* bitno / BITSET_WORD_BITS.  */
-  bitset_word words[LBITSET_ELT_WORDS]; /* Bits that are set.  */
-} lbitset_elt;
-
-
-/* Head of lbitset linked list.  */
-typedef struct lbitset_struct
-{
-  lbitset_elt *head;           /* First element in linked list.  */
-  lbitset_elt *tail;           /* Last element in linked list.  */
-} *lbitset;
+#include "bitset.h"
 
+extern size_t lbitset_bytes PARAMS ((bitset_bindex));
 
-extern int lbitset_bytes PARAMS ((bitset_bindex));
+extern bitset lbitset_init PARAMS ((bitset, bitset_bindex));
 
 extern void lbitset_release_memory PARAMS ((void));