--- parser3/src/include/pa_stack.h	2003/01/27 16:19:11	1.17.2.1
+++ parser3/src/include/pa_stack.h	2004/02/11 15:33:14	1.22
@@ -1,14 +1,14 @@
 /** @file
 	Parser: stack class decl.
 
-	Copyright (c) 2001, 2003 ArtLebedev Group (http://www.artlebedev.com)
+	Copyright (c) 2001-2004 ArtLebedev Group (http://www.artlebedev.com)
 	Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)
 */
 
 #ifndef PA_STACK_H
 #define PA_STACK_H
 
-static const char* IDENT_STACK_H="$Date: 2003/01/27 16:19:11 $";
+static const char * const IDENT_STACK_H="$Date: 2004/02/11 15:33:14 $";
 
 #include "pa_config_includes.h"
 #include "pa_array.h"
@@ -20,25 +20,35 @@ public:
 	Stack(): ftop(0) {}
 
 	void push(T item) {
-		if(ftop<size()) // cell is already allocated?
+		if(ftop<count()) // cell is already allocated?
 			put(ftop, item); // use it
 		else
 			*this+=item; // append it
 		ftop++;
 	}
+
 	T pop() {
 		return get(--ftop);
 	}
 
-	int top_index() { return ftop-1; }
-	void top_index(int 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); 
+	}
 
-private:
+	/// call this prior to collecting garbage [in unused part of stack there may be pointers(unused)]
+	void wipe_unused() {
+		if(size_t above_top_size=fused-ftop)
+			memset(&felements[ftop], 0, above_top_size*sizeof(T));
+	}
 
-	// deepest used index
-	int ftop;
+protected:
 
+	// deepest used index+1
+	size_t ftop;
 };
 
 #endif