Re: Porting SRFI 69 to PLT
Chongkai Zhu <mrmathematica-/[email protected]> Mon, 31 Oct 2005 14:07:57 -0800 (PST)
| Newsgroups | gmane.lisp.scheme.plt.schematics |
|---|---|
| Message-ID | <[email protected]> |
--- David Van Horn <[email protected]> wrote: > Chongkai Zhu wrote: > > I'm porting SRFI 69 "Basic hash tables" to PLT. Current idea is: > >=20 > > 1 Constructing the 'hash function bashed on PLT's 'equal-hash-code; > > 2 Using PLT's struct directly instead of SRFI-9. >=20 > I'm not sure what your two points are exactly... PLT's implementation o= f > SRFI 9 is in terms of its own structure system, so defining a SRFI 9 > structure is really the same as defining a PLT structure (I believe). Yes, PLT's implementation of SRFI 9 is a macro to convert record into struct. But will converting that manually a bit more efficient? >=20 > SRFI 69 is just a subset of the functionality of PLT's hash tables with > a slightly different interface. Porting it to PLT should just be a > matter of mapping one interface to the other (maybe there are more > subtle issues I'm forgetting about). You shouldn't need to use the > reference implementation at all, or implement any datastructures. >=20 No. Hash table of SRFI 69 can accept a user defined hash function, and a user defined equal? function. Hash table of PLT uses build in hash function, and only support (R5RS's) equal? / eq? . So SRFI 69 is not a subset, but a superset of the functionality of PLT's hash table. > David Chongkai =09 __________________________________=20 Yahoo! FareChase: Search multiple travel sites in one click. http://farechase.yahoo.com ------------------------------------------------------- This SF.Net email is sponsored by the JBoss Inc. Get Certified Today * Register for a JBoss Training Course Free Certification Exam for All Training Attendees Through End of 2005 Visit http://www.jboss.com/services/certification for more information