Re: [xsl] Efficient way to check sequence membership

[ht@xxxxxxxxxxxx (Henry S. Thompson)]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Dimitre Novatchev writes:

> One way is to have the strings sorted. Then use binary search -- this
> is O(log(N)).

Maybe that will have an advantage for much bigger sets, but for my
test case it was considerably slower -- 18ms net vs. 9ms net for the
(some $s . . . satisfies) and $w=$stops versions, and 2ms net for the
best (key-based) one.

I'd be very interested if you could compare binSearch with the
key-based version I sent on your large dictionary example. . .

ht
- --
       Henry S. Thompson, School of Informatics, University of Edinburgh
      10 Crichton Street, Edinburgh EH8 9AB, SCOTLAND -- (44) 131 650-4440
                Fax: (44) 131 651-1426, e-mail: ht@xxxxxxxxxxxx
                       URL: http://www.ltg.ed.ac.uk/~ht/
 [mail from me _always_ has a .sig like this -- mail without it is forged
spam]
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.6 (GNU/Linux)

iD8DBQFNbtPMkjnJixAXWBoRAlT4AJ9/c0Thgmzz38+728ZYyGuexwmclACdFiNZ
c5SlTZQDHau9553VUlABs5k=
=aNAZ
-----END PGP SIGNATURE-----