Sasha wrote: > On 7/2/06, Norbert Nemec <[EMAIL PROTECTED]> wrote: >> ... >> Does anybody know about the internals of the python "set"? How is >> .keys() implemented? I somehow have really doubts about the efficiency >> of this method. >> > Set implementation (Objects/setobject.c) is a copy and paste job from > dictobject with values removed. As a result it is heavily optimized > for the case of string valued keys - a case that is almost irrelevant > for numpy. > > I think something like the following (untested, 1d only) will probably > be much faster and sorted: > > def unique(x): > s = sort(x) > r = empty_like(s) > r[:-1] = s[1:] > r[-1] = s[0] > return s[r != s]
There are 1d array set operations like this already in numpy (numpy/lib/arraysetops.py - unique1d, ...) r. Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 _______________________________________________ Numpy-discussion mailing list Numpy-discussion@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/numpy-discussion
