Re: stack before

> I sugest faestack to be a part of faeutils section as well.

In what way is this better than <faeutil/list.h>?  It has (de-facto) 
standard methods push_back and pop_back; the memory is contiguous, 
allocation page is 1/4 of the list size (but not less than 4).  It comes 
with optional thread safety, so it's "fast enough", too.

Oh, and it's a C++ template class, so it is dynamically typed.  Same 
time it's universal and no new code needs to be written if I store 
structures larger than "four byte integers".

The only thing it lacks that I can think of is a separate allocator 
class to minimize the number of inlined allocation functions.  But this 
issue has the lowest priority so far.

> the stack's fast enough. it uses binary powers,

binary whats?

> and automatically corrects it's size.

what?

> p.s. for some true style lovers ;) it's not right to do so: __CONSTANT
> ;) but CONSTANT__ is a quite good choice ;)

That depends.  Never seen a "CONSTANT__", so I quite got used to the 
"__CONSTANT" style.



-------------------------------------------------------
This SF.Net email is sponsored by: SourceForge.net Broadband
Sign-up now for SourceForge Broadband and get the fastest
6.0/768 connection for only $19.95/mo for the first 3 months!
http://ads.osdn.com/?ad_id=2562&alloc_id=6184&op=click
-------------------------------------------------------
Discussions in this list are held in two languages: English and Russian.
When replying, please use the language that the sender of the original
message is guaranteed to understand, or use English.