From: Larry Evans (cppljevans_at_[hidden])
Date: 2004-02-28 10:38:26
On 02/28/2004 09:05 AM, Larry Evans wrote:
> On 02/28/2004 08:24 AM, Larry Evans wrote:
> > On 02/28/2004 08:08 AM, Larry Evans wrote:
> Ok, maybe just one more thing: tree<B> has additional virtual
OK, YAT (Yet Another Thing), the tree<B> virtual functions
must be able to treat their children in the tree as tree<B>
instances also. For example, the tree_nilable_seq::calc_nilable
is defined in terms of the my_nilable's of it's children. However,
in order to access it's children, it has to go through it's "superclass"
regexp_tree_seq; hence, there's got to be a pointer to the superclass,
and in order to attach the extra information for a particular pass,
there's got to be a pointer from the superclass to subclass. Therefore,
I don't see a way to avoid the extra memory.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk