[ALL] let's think about Query Language for 2.0

[Charles Yeomans]

On Wednesday, May 21, 2003, at 02:48 AM, Ruslan Zasukhin wrote:

> on 5/21/03 2:16 AM, Charles Yeomans at yeomans at desuetude.com wrote:
> [snip]
> Yes, your Node class looks close to true.
>
> I think it is possible reduce the number of methods.
>
>     Node( Node1, opCompare, Node2 )
>
> Where opCompare is constant:
>                        kEqual, kNotEqual, kThessThan, ...
>

But this comes at a small cost in speed, I think, because the code for 
Node will require a switch statement on opCompare.

Charles Yeomans