OpenEuphoria

RE: Berkeley DB -- anyone care?

• Posted by Andy Serpa <ac at onehorseshy.com> Jan 06, 2003
• 562 views

jordah at btopenworld.com wrote:
> The code in binary.e might seem slower because of the overhead involved 
> in
> call_proc(). The original routine was clearly tested on #euphoria and
> clearly faster producing more compressed objects.
> 

In my test, the code I'm using was faster but did produce slightly 
bigger objects -- I could try it again.  In practice it would make no 
difference as they were very close.  The compress/decompress stuff is no 
bottleneck except when used for key comparison when it is called a huge 
number of times, and even then the difference between one routine & the 
other wouldn't make any difference (2 seconds over 100,000 calls or 
something) -- the time is lost in just calling the routine period, 
peeking the object, etc.

If your code doesn't preserve accuracy the point is moot, because that 
would make it unsuitable for a database anyway...

-- Andy