--xgyAXRrhYN0wYx8y
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
Content-Transfer-Encoding: quoted-printable
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=
=20
> hash placement / retrieval algorithm that was available anywhere.
> I'm looking for a reliable way to lookup objects to see if a given actio=
n=20
> would be performed in my revised pkg_install(1), to thus efficiently=20
> pre-plan out the installation dependencies and fully utilize=20
> multiprocessing capabilities of contemporary machines / eliminate duplica=
te=20
> dependency install requirements.
> I know I can use tree structures or hash(3), but I want to avoid trees=
=20
> (inefficient with large data sets of course) and I was looking for a=20
> non-BDB based solution (for right now, with this given structure as I don=
't=20
> want to write everything to disk). Later on it might be a good idea to=20
> cache the results using BDB on disk, but for now I was just wondering if=
=20
> 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
--xgyAXRrhYN0wYx8y
Content-Type: application/pgp-signature
Content-Disposition: inline
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (FreeBSD)
iD8DBQFHdEU8XY6L6fI4GtQRAilmAJ9mbjJgZmJpLGk17hc3/DmAZWg6PQCeObve
ygN5Lg80WUDSPFuIeg9j0yM=
=nvmQ
-----END PGP SIGNATURE-----
--xgyAXRrhYN0wYx8y--