started integrating the non-controversial parts of Gary Pennington
* HTMLtree.c catalog.c debugXML.c entities.c nanoftp.c
parser.c valid.c xmlmemory.c xpath.c xpointer.c: started
integrating the non-controversial parts of Gary Pennington
multithread patches
* catalog.c: corrected a small bug introduced
Daniel
diff --git a/valid.c b/valid.c
index 723ada4..c27c3c2 100644
--- a/valid.c
+++ b/valid.c
@@ -70,7 +70,7 @@
} \
/*
- * I will use a home made algorithm less complex and easier to
+ * I use a home made algorithm less complex and easier to
* debug/maintin than a generic NFA -> DFA state based algo. The
* only restriction is on the deepness of the tree limited by the
* size of the occurs bitfield
@@ -81,7 +81,7 @@
#define ROLLBACK_OR 0
#define ROLLBACK_PARENT 1
-struct _xmlValidState {
+typedef struct _xmlValidState {
xmlElementContentPtr cont; /* pointer to the content model subtree */
xmlNodePtr node; /* pointer to the current node in the list */
long occurs;/* bitfield for multiple occurences */