Thanks Alex, Just to I get the reasoning right - so for small and medium volume, a list and binary tree would suffice and for larger data volume a DB is recommended. And perhaps combined with DB on a ramdrive, it could very well substitute for anything traditionally thought of as hashtable worthy. Did I get that right?
Regards, Kashyap On Wed, Mar 13, 2019 at 9:48 AM Alexander Burger <a...@software-lab.de> wrote: > Hi Kashyap, > > > I was looking up hashtable in picolisp and ran into this thread - > > https://www.mail-archive.com/picolisp@software-lab.de/msg00140.html > > > > In it, you've mentioned "build some database structure." Is there a > simple > > sample for reference for such a structure? > > The best is perhaps to start with the tutorial (a bit outdated) at > > https://software-lab.de/doc/tut.html#ext > https://software-lab.de/doc/tut.html#ext > > or look at the example applications, eg in app/, or some minimal example > like https://picolisp.com/wiki/?mindbgui > > ☺/ A!ex > > -- > UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe >
