clarkd99

5 ms·

1.
by clarkd99 10y ago
Max is the internal name I use for my system. The actual name will be decided when I publish the program. At the top of my description of SLIST, I acknowledge that I may not be the first to define a simple structure like that but I can say
2.
by clarkd99 10y ago
I never said that Lisp macros were anything like assembly macros. I was referring to a macro assembly language as a list of opcodes (function calls) and macros. I am quite a fan of Lisp macros which are much more flexible as you can create
3.
by clarkd99 10y ago
After I wrote that statement I started thinking that C programs can be formatted so that they don't read very well also. In C, an 'if' is always an 'if' (unless you use the pre-processor to screw it up) but in Lisp
4.
by clarkd99 10y ago
David Clark is like John Smith and no, I am not any famous person but I have been around the micro computer world for a very long time (1975). My website is www.rccconsulting.com where you will find an essay on the data structure I mentione
5.
by clarkd99 10y ago
I can 'efficiently modify the lists you started with' with a dynamic multi-type array and I have cache locality and random access. I have a single data structure with an 8 byte overhead, 2 byte overhead per node that can be used a
6.
by clarkd99 10y ago
I was only talking about the 'list of function calls' aspect of assembler and Lisp, not the type system. I agree that Lisp has a type system and assembler doesn't. Forth is another language that also has very simple syntax th
7.
by clarkd99 10y ago
My current project is over 90,000 lines of C and I have programmed in C since the 1970's (as well as many other languages). I have never used a ternary operator and I think it reads quite poorly. I just use a few lines of easily read c
8.
by clarkd99 10y ago
This great idea of Lisp (the simple syntax of function calls in round brackets) isn't much different than a good macro assembler even back in the 1960's. The only major difference was that more than 1 function could be defined in
9.
by clarkd99 10y ago
A circular buffer can contain a number of nodes and get bigger when it runs out of space by making a larger buffer and copying the old data or clustering as I described above. It doesn't have a "fixed capacity". My circular q
10.
by clarkd99 10y ago
I have made a circular queue where data can be pushed or popped on either end of a vector of structs. Adding an entry can be done on the end or the head without moving any other nodes. All that is required is to have an index for the head a