[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <20120127221456.GA9454@openwall.com>
Date: Sat, 28 Jan 2012 02:14:56 +0400
From: Solar Designer <solar@...nwall.com>
To: john-dev@...ts.openwall.com
Subject: Re: unique using more than 2 GB RAM
On Fri, Jan 27, 2012 at 03:30:07PM -0600, jfoug wrote:
> Unique in Jtr will almost always be slower than sort | uniq type of work.
> It is much harder to search/unique on very large worksets, than sort and a
> brain dead search (simple compare)
No, I think it's the other way around. The "sort" step is not cheap.
In my experience so far, JtR's "unique" is usually faster than "sort -u".
What I mentioned was the first major exception I encountered - and it is
for very different memory settings (2 GB vs. 14 GB).
Alexander
Powered by blists - more mailing lists
Confused about mailing lists and their use?
Read about mailing lists on Wikipedia
and check out these
guidelines on proper formatting of your messages.
