Date: Thu, 27 Dec 2007 18:37:16 -0600 From: Brooks Davis <brooks@freebsd.org> To: Garrett Cooper <youshi10@u.washington.edu> Cc: hackers@freebsd.org Subject: Re: BSD license compatible hash algorithm? Message-ID: <20071228003716.GB48997@lor.one-eyed-alien.net> In-Reply-To: <5950EE0C-383D-4D6B-9991-A0DEABD2ADE4@u.washington.edu> References: <5950EE0C-383D-4D6B-9991-A0DEABD2ADE4@u.washington.edu>
next in thread | previous in thread | raw e-mail | index | archive | help
[-- Attachment #1 --] On Thu, Dec 27, 2007 at 04:30:40PM -0800, Garrett Cooper wrote: > Hi all, > Just wondering if anyone knew of a good BSD license compatible key-based > hash placement / retrieval algorithm that was available anywhere. > I'm looking for a reliable way to lookup objects to see if a given action > would be performed in my revised pkg_install(1), to thus efficiently > pre-plan out the installation dependencies and fully utilize > multiprocessing capabilities of contemporary machines / eliminate duplicate > dependency install requirements. > I know I can use tree structures or hash(3), but I want to avoid trees > (inefficient with large data sets of course) and I was looking for a > non-BDB based solution (for right now, with this given structure as I don't > want to write everything to disk). Later on it might be a good idea to > cache the results using BDB on disk, but for now I was just wondering if > there were any non-BDB based hashing solutions that anyone knew of. We imported hash(9) from Open/NetBSD recently. It may do what you want. -- Brooks [-- Attachment #2 --] -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (FreeBSD) iD8DBQFHdEU8XY6L6fI4GtQRAilmAJ9mbjJgZmJpLGk17hc3/DmAZWg6PQCeObve ygN5Lg80WUDSPFuIeg9j0yM= =nvmQ -----END PGP SIGNATURE-----
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20071228003716.GB48997>