slow speed of K3 / Q

Hello,I made a small programm on K, which searches if ip in ranges of other ips.Here is the source code: http://dl.dropbox.com/u/34917039/ip.k , hereare test files, but they could be generated via programm (commentedlines): ~5MB http://dl.dropbox.com/u/34917039/ipsr.zipI just check the speed of find “f” function, which is quite simple:f:{x

To: personal-kdbplus@googlegroups.com
X-Mailer: Apple Mail (2.1251.1)

One shall avoid each-ing in all its different forms as much as possible

> f:{x
\t f’ips
1425

g:{x \t g ips
231

Which I assume faster than J

(f’ips)~g ips
1

Note that q’s bin is rank-sensitive, so no need for separate _bin and =
_binl


Cheers,
Attila

Attila,
Thank you for this advice. Now they are at the same speed. ~0.120sec.
But I received faster solution for J ‘G=3D: 2 | (,(~.}.m) ,.~ (}.m) {./.
l) I. ]’ , which works in ~0.02sec, unfortunately I cannot understand
it right now to rewrite into K.

Regards,