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

[Ruslan Zasukhin]

on 5/21/03 6:17 PM, Charles Yeomans at yeomans at desuetude.com wrote:

> 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.

But on C++ level.
This is not big problem, because the main time will be on search itself --
even by index time of search is thousands times greater of switch time.

-- 
Best regards,
Ruslan Zasukhin      [ I feel the need...the need for speed ]
-------------------------------------------------------------
e-mail: ruslan at paradigmasoft.com
web: http://www.paradigmasoft.com

To subscribe to the Valentina mail list go to:
http://lists.macserve.net/mailman/listinfo/valentina
-------------------------------------------------------------