Hi Konstantin,
On Wednesday, December 17, 2003, 5:14:02 PM, you wrote:
KK Rebol: 18 seconds
KK h: make hash! []
KK start: now/time
KK n: 10
KK for i 1 n 1 [
KK append h i
KK ]
KK print [Elapsed time for n records (now/time - start)]
h: make hash! 12
== make hash! []
start:
Thank you very much to all who helps me to improve
Rebol API to DyBASE.
I am sorry that somebody treat my concerns about hash tables
in Rebol as criticism of this language.
I already understand that make hash! 10 is much more efficient
than make hash! [] and loop N is faster than for 1 N 1.
Hi Konstantin,
KK I am sorry that somebody treat my concerns about hash tables
KK in Rebol as criticism of this language.
Not to worry. We've been through many of these discussions before
ourselves. I'll second what Gabriele said.
-- Gregg
--
To unsubscribe from this
On Thu, 18 Dec 2003 14:37:03 +0300
Konstantin Knizhnik [EMAIL PROTECTED] wrote:
That is why I need to profile the execution of the
program.
Hi Konstantin,
This is great work that you're doing. We shouldn't look a
gift horse in the mouth!
Unfortunately I had no profiler, because I have no
Hi Joel,
I think, that:
1) Konstantin tries to use an Associative Array. I doubt, that the
suggested implementation is the best one.
INSERTs into a fresh hash (created each time with MAKE HASH! []):
Appears to be increasing faster than quadratically!
# eltsseconds ratio quad
Hmm looks interesting.
I have downloaded it and looked quickly but
I must go to bed...
Anton.
Hello all,
First version of Rebol API to my object-oriented database DyBASE is
ready. It can be downloaded from my site:
http://www.garret.ru/~knizhnik/dybase.html
DyBASE is embedded object
Hi,
I just had a quick look at
http://www.garret.ru/~knizhnik/dybase/doc/dybase.html#comparison . Is Rebol
really so slow or it is because the ported code isn't optimized to the
language yet?
regards
Cyphre
- Original Message -
From: Konstantin Knizhnik [EMAIL PROTECTED]
To: [EMAIL
Anton Rolls wrote:
Hmm looks interesting.
I have downloaded it and looked quickly but
I must go to bed...
you don't have to - just dring more coffee :-)
-pekr-
Anton.
--
To unsubscribe from this list, just send an email to
[EMAIL PROTECTED] with unsubscribe as the subject.
Hello Cyphre,
Wednesday, December 17, 2003, 6:40:03 PM, you wrote:
C Hi,
C I just had a quick look at
C http://www.garret.ru/~knizhnik/dybase/doc/dybase.html#comparison . Is Rebol
C really so slow or it is because the ported code isn't optimized to the
C language yet?
Rebol has awful
Hello Cyphre,
Wednesday, December 17, 2003, 6:40:03 PM, you wrote:
C Hi,
C I just had a quick look at
C http://www.garret.ru/~knizhnik/dybase/doc/dybase.html#comparison . Is Rebol
C really so slow or it is because the ported code isn't optimized to the
C language yet?
Compare the following
Hi Konstantin,
First, thanks for completing the REBOL interface to DyBase!
Now, if all the source to it is available, any good folks here who
want to take a crack at improving can do so, right? Hopefully, we can
give you some helpful feedback, in return for all your work.
Thanks again!
--
Hello Konstantin,
Wednesday, December 17, 2003, 7:14:02 PM, you wrote:
KK Hello Cyphre,
KK Wednesday, December 17, 2003, 6:40:03 PM, you wrote:
C Hi,
C I just had a quick look at
C http://www.garret.ru/~knizhnik/dybase/doc/dybase.html#comparison . Is Rebol
C really so slow or it is because
Hello Gregg,
Wednesday, December 17, 2003, 7:26:41 PM, you wrote:
GI Hi Konstantin,
GI First, thanks for completing the REBOL interface to DyBase!
GI Now, if all the source to it is available, any good folks here who
GI want to take a crack at improving can do so, right? Hopefully, we can
GI
Compare the following results:
Rebol: 18 seconds
h: make hash! 10
start: now/time/precise
for i 1 10 1 [ insert tail h i ]
now/time/precise - start
== 0:00:00.25
That's 250 msec. Your version runs in about 350 msec.
Since I can't imagine you're running a machine 50 times slower
* Konstantin Knizhnik [EMAIL PROTECTED] [031217 07:26]:
Rebol has awful implementation of hash tables.
First of all, it is very inconvenient that there are normal set/get
operations. You have to use something like this:
h: find/tail hash key
either h [change h key value] [append
#Bonjour Konstantin,
Wednesday, December 17, 2003, 5:30:08 PM, you wrote:
Hello Konstantin,
Wednesday, December 17, 2003, 7:14:02 PM, you wrote:
KK Hello Cyphre,
KK Wednesday, December 17, 2003, 6:40:03 PM, you wrote:
C Hi,
C I just had a quick look at
C
Hi Konstantin,
KK Compare the following results:
KK Rebol: 18 seconds
I get ~.86-.93 seconds on my P900/W2K/View-1.2.10 here for your first
test.
What do you get for this one? (I get ~.50-.56 sec for this one using
hash! and ~.36-.37 using list! -- ~.56-.58 and ~.48-.50 without
preallocating
Hi, Konstantin,
Maybe even worse?
Konstantin Knizhnik wrote:
And as far as Rebol hash is also series, appending element to it
cause a lot of reallocations, so complexity of insert operation
seems to be linear (instead of constant). And if we use insert
hash instead of append hash (not
Hello Christian,
Wednesday, December 17, 2003, 7:48:54 PM, you wrote:
Compare the following results:
Rebol: 18 seconds
CL h: make hash! 10
CL start: now/time/precise
CL for i 1 10 1 [ insert tail h i ]
CL now/time/precise - start
CL == 0:00:00.25
O, shame on me - I have to guess
Hi Konstantin,
KK I only want to notice, that I want to use universal database format
KK for all languages. So I will not include in DyBASE features which are
KK not present in other languages. Certainly anyone can create its own
KK version of DyBASE based on my implementation and I have nothing
Re: Rebol API to DyBASE
Just to say that Introduction on your web page doesn't mention Rebol at this time
(first paragraph).
http://www.garret.ru/~knizhnik/dybase/doc/dybase.html#introduction
I'm prety sure you have just forgoten to add it.
If time let me test your work, I will be happy to do
Hi Konstantin,
I should mention that list! values operate a little differently than
hash!/block! values, should you decide to try it out.
With a list!:
INSERT modifies list to just after the point of insertion.
REMOVE-ing the element currently referenced in a list sets
the list to
Hello Tim,
Wednesday, December 17, 2003, 8:01:14 PM, you wrote:
TJ * Konstantin Knizhnik [EMAIL PROTECTED] [031217 07:26]:
Rebol has awful implementation of hash tables.
First of all, it is very inconvenient that there are normal set/get
operations. You have to use something like this:
On Wed, 17 Dec 2003 14:15:57 +0300, Konstantin Knizhnik
[EMAIL PROTECTED] wrote:
First version of Rebol API to my object-oriented database DyBASE is
ready. It can be downloaded from my site:
http://www.garret.ru/~knizhnik/dybase.html
Hi, even I'm in close private contact with you about
* Konstantin Knizhnik [EMAIL PROTECTED] [031217 10:40]:
Hello Tim,
Wednesday, December 17, 2003, 8:01:14 PM, you wrote:
operations. You have to use something like this:
h: find/tail hash key
either h [change h key value] [append append hash key value]
instead of
25 matches
Mail list logo
