RE: [boost] Desired libraries - n-ary trees, hashing and arbitrary-precision ints

From: Reid Sweatman (drunkardswalk_at_[hidden])
Date: 2004-04-15 20:22:58

> -----Original Message-----
> From: boost-bounces_at_[hidden] 
> [mailto:boost-bounces_at_[hidden]] On Behalf Of Dave
> Sent: Thursday, April 15, 2004 1:16 PM
> To: boost_at_[hidden]
> Subject: [boost] Desired libraries - n-ary trees,hashing and 
> arbitrary-precision ints
> 
> 
> Hello all,
> 
> I just want to mention three libraries I have a need for 
> which, I believe,
> are not currently in Boost.  My purpose is to see if they are under
> development and what alternatives I have in the meantime.
> 
> 1.
> A dictionary implemented in terms of a user-supplied hashing policy
> 
> 2.
> A generic n-ary tree library parameterized by a vertex's user-defined
> satellite data; to be used in a generic state space search 
> library I am
> writing and in storing a parse tree for an expression 
> interpreter.  Perhaps
> BGL could be used here?????  Not sure of its appropriateness...
> 
> 3.
> The frequently-requested arbitrary precision integer library

Rushed for time, but I'll toss out my vote in favor of all three, especially
since the reason I'm rushed for time is that I'm busy writing some
arbitrary-precision math routines (sadly, not in C++, but I'd think hard
about putting it into a custom DLL if this were available).

Reid