Re: beginning with ML

On Nov 5, 2:57 am, "michele.simion...@xxxxxxxxx"
<michele.simion...@xxxxxxxxx> wrote:
...
What's the preferred data structure? An association
list? A hash table?
What if I want to return the result lazily? ...

Michele Simionato

Lists are commonly used, being functional, but hash tables are also
used. I use the RedBlackTree implemenation in the utility library
extensively for the larger lookup data structures required.

SML/NJ implements more than just SML. It includes a very fast
implementation of callcc and also supports lazy computation:

http://www.smlnj.org/

Some of these features may also be in Alice ML, I'm not sure.

Also, there ia an on-line book by Robert Harper (Carenige-Mellon) at
his web site. It is more advanced and theoretical than Paulson's
undergraduate textbook.


.

Relevant Pages

  • Re: How to count value in a ArrayList
    ... were adding was not already stored in the data structure. ... Doing this with a ArrayList is a lot slower than a hash ... But presumably they use a relatively common technique of having a fixed-sized array of bins that grows as the hash table accumulates items. ... Some implementations use bins that are either arrays or linked lists, while others simply use the next available spot in the hash table. ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: How to count value in a ArrayList
    ... into a data structure and wanted to make sure that the value that they were adding was not already stored in the data structure. ... Doing this with a ArrayList is a lot slower than a hash table, as you could hash the double value to find out which linked list the value would be stored in, then just check the few values in the list. ... I thought that hash tables where are array of linked lists ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: How to improve my summarizing code
    ... a list of lists. ... If you don't need the result sorted, then using a hash table you can ... (defun value (row) ... You probably need a more sophisticated data structure for rows, ...
    (comp.lang.lisp)
  • Re: [Full-Disclosure] Show me the Virrii!
    ... the resources necessary to assemble definitive lists of ... audit process execution at just the right time. ... To complete what turned out to be a three-part-series on using hash ... BOOL validatehash(HANDLE hProfile,char *sHash,DWORD hashlen); ...
    (Full-Disclosure)
  • Re: My hash table is in need of peer review
    ... struct hash { ... of the two possible loop exit conditions caused the loop to ... You might want to consider keeping the lists sorted ... same value pointer the caller hands you. ...
    (comp.lang.c)