[EMAIL PROTECTED] (Bill Gribble) writes:

> The basic data structure in Scheme (and all LISP-like languages... in
> fact LISP is an acronym for LIst PRocessing) is the singly-linked
> list.  The backbone of the list is a chain of cells ("cons cells")
> that have a pointer to the cell data and a "next" pointer to the
> remainder of the list.  

And anyone who's familiar with glib, LISP lists are somewhat similar
to GSLists.  GLists are actually doubly linked...

-- 
Rob Browning <[EMAIL PROTECTED]> PGP=E80E0D04F521A094 532B97F5D64E3930

_______________________________________________
gnucash-devel mailing list
[EMAIL PROTECTED]
http://www.gnumatic.com/cgi-bin/mailman/listinfo/gnucash-devel

Reply via email to