[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kdevelop-devel
Subject:    Re: Gideon memory usage
From:       Eray Ozkural <exa () ttnet ! net ! tr>
Date:       2003-02-26 20:59:59
[Download RAW message or body]

On Wednesday 26 February 2003 20:23, Roberto Raggi wrote:
> On Wed, 2003-02-26 at 19:02, Eray Ozkural wrote:
> > > we can also, remove children(),appendChild(),removeChild() from AST,
> > > because now we can use TreeParser to implement Tree Walkers.
> >
> > That won't make it faster or smaller though right?
>
> it will make it smaller, because you remove a QPtrList for each nodes
>

If the space utilization is seen to be unacceptable in the end (which I don't 
think is the case), then maybe there might be an engineering approach to it. 
After computing the complete AST, a transformer class can convert the whole 
tree into a space optimized tree which has only the information that the 
cppsupport clients will require.

This being an abstract idea, I need to know whether you find it feasible or 
useful.

Thanks,

-- 
Eray Ozkural (exa) <erayo@cs.bilkent.edu.tr>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.bilkent.edu.tr/~erayo  Malfunction: http://mp3.com/ariza
GPG public key fingerprint: 360C 852F 88B0 A745 F31B  EA0F 7C07 AE16 874D 539C


_______________________________________________
Kdevelop-devel mailing list
Kdevelop-devel@barney.cs.uni-potsdam.de
http://barney.cs.uni-potsdam.de/mailman/listinfo/kdevelop-devel
[prev in list] [next in list] [prev in thread] [next in thread]