-Original Message-
From: Branko ibej [mailto:[EMAIL PROTECTED]
Sent: Wednesday, October 10, 2001 10:10 PM
To: Mladen Turk
Cc: APR Dev List; Apache Dev
Subject: Re: [PATCH] apr_hash.c -- Make table ordered
Mladen Turk wrote:
Hi,
Here is the patch that makes the apr_hash table
On Thu, Oct 11, 2001 at 07:58:04AM +0200, Mladen Turk wrote:
The question is where the hash table is used and for what purpose, not for
the sake of the theory itself.
How many entries are in the table itself? It is not used to store couple of
thousand records, not even couple of hundreds.
:
-Original Message-
From: Branko Cibej [mailto:[EMAIL PROTECTED]
Sent: Wednesday, October 10, 2001 10:10 PM
To: Mladen Turk
Cc: APR Dev List; Apache Dev
Subject: Re: [PATCH] apr_hash.c -- Make table ordered
Mladen Turk wrote:
Hi,
Here is the patch that makes the apr_hash
-Original Message-
From: Justin Erenkrantz [mailto:[EMAIL PROTECTED]
Sent: 10. listopad 2001 23:10
To: Mladen Turk
Cc: APR Dev List
Subject: Re: [PATCH] apr_hash.c -- Make table ordered
On Thu, Oct 11, 2001 at 07:58:04AM +0200, Mladen Turk wrote:
The question is where the hash
-Original Message-
From: Greg Stein [mailto:[EMAIL PROTECTED]
Sent: 10. listopad 2001 23:47
To: Mladen Turk
Cc: [EMAIL PROTECTED]; APR Dev List
Subject: Re: [PATCH] apr_hash.c -- Make table ordered
I'm with Branko here...
-1
Hash tables are unordered entities. Pure
Hi,
This is the apr_hash on steroids :)
It enables to do 'worker' things like:
static int lwr_worker( const void **key, apr_ssize_t klen, void **val)
{
if (!key)
return -1;
*val = strlwr(*val);
return 0;
}
...
apr_hlist_walk(list, lwr_worker);
or sorting:
Mladen Turk wrote:
OK!
I'll propose the two things:
1. apr_btree to be able to do the range-based searches
Sounds useful. (I'd suggest implementing red-black trees, not AVL.)
2. apr_shash to be able to sort the hash table.
Do you mean actually sort elements in the table by some key, or just
On Thu, 11 Oct 2001, Branko [ISO-8859-2] Èibej wrote:
Mladen Turk wrote:
OK!
I'll propose the two things:
1. apr_btree to be able to do the range-based searches
Sounds useful. (I'd suggest implementing red-black trees, not AVL.)
why? avl is, too my knowledge, a faster algorithm for
Mladen Turk wrote:
Hi,
Here is the patch that makes the apr_hash table ordered in the way that the
apr_hash_first/apr_hash_next returns the values in order they were stored in
the table using apr_hash_set.
The patch could be IMO very usefull to solve the httpd release showstopper
Set...Filter
apr_hash.c has a very obscure bug in it, though I'm very surprised nobody
has been bitten by it before. It is possible, when expanding the table,
to use an old pointer and overwrite the hash entry value upon return from
find_entry. Anyway, this small patch fixes it. I have a testhash.c for
10 matches
Mail list logo
