--- parser3/src/include/pa_stack.h	2003/04/02 08:11:31	1.17.2.6.2.4
+++ parser3/src/include/pa_stack.h	2003/10/02 07:26:46	1.20
@@ -8,7 +8,7 @@
 #ifndef PA_STACK_H
 #define PA_STACK_H
 
-static const char* IDENT_STACK_H="$Date: 2003/04/02 08:11:31 $";
+static const char* IDENT_STACK_H="$Date: 2003/10/02 07:26:46 $";
 
 #include "pa_config_includes.h"
 #include "pa_array.h"
@@ -21,7 +21,7 @@ public:
 
 	void push(T item) {
 		if(ftop<count()) // cell is already allocated?
-			/*unchecked_*/put(ftop, item); // use it
+			put(ftop, item); // use it
 		else
 			*this+=item; // append it
 		ftop++;
@@ -31,17 +31,21 @@ public:
 		return get(--ftop);
 	}
 
-	size_t top_index() { return ftop-1; }
-	void top_index(size_t top_index) { ftop=top_index+1; }
-	T top_value() { return get(top_index()); }
+	bool is_empty() { return ftop==0; }
+	size_t top_index() { return ftop; }
+	void set_top_index(size_t atop) { ftop=atop; }
+	T top_value() { 
+		assert(!is_empty());
+		return get(ftop-1); 
+	}
 
 	/// call this prior to collecting garbage [in unused part of stack there may be pointers(unused)]
 	void wipe_unused() {
-		if(!is_full())
-			memset(&felements[fused], 0, (fallocated-fused)*sizeof(T));
+		if(size_t above_top_size=fused-ftop)
+			memset(&felements[ftop], 0, above_top_size*sizeof(T));
 	}
 
-private:
+protected:
 
 	// deepest used index+1
 	size_t ftop;