Re: Prop. search speedup idea

From: Mike Nordell (tamlin@algonet.se)
Date: Fri Sep 26 2003 - 02:52:54 EDT

Next message: Hubert Figuiere: "Commit (STABLE2): backport 5812"

Previous message: Mike Nordell: "Prop. search speedup idea"
In reply to: Mike Nordell: "Prop. search speedup idea"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

Commenting on myself:

> for (; curr != end; ++curr)
> {
> const char* pszVal = curr->val;
> if (pszVal[0] == szProp[0] && !str(i)cmp(pszVal, szProp)) {

Iff the set was ordered, this linear loop could be replaced by a bsearch. I
believe log(n) is better than n/2 for 27K entries. :-)

/Mike

Next message: Hubert Figuiere: "Commit (STABLE2): backport 5812"
Previous message: Mike Nordell: "Prop. search speedup idea"
In reply to: Mike Nordell: "Prop. search speedup idea"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

This archive was generated by hypermail 2.1.4 : Fri Sep 26 2003 - 03:08:01 EDT