Live data from Hacker News

Viewing profile — clarkd99

clarkd99

HN member
Joined
Sun, Jul 12, 2015, 2:36 AM UTC
HN karma
1
Public activity
10 items

About clarkd99

No profile information was provided.

Recent public activity

  1. comment
    Comment #13197791

    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…

  2. comment
    Comment #13196408

    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…

  3. comment
    Comment #13195963

    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-pro…

  4. comment
    Comment #13195826

    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 w…

  5. comment
    Comment #13194612

    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 ove…

  6. comment
    Comment #13194448

    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…

  7. comment
    Comment #13193943

    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 read…

  8. comment
    Comment #13193877

    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 …

  9. comment
    Comment #11757448

    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 d…

  10. comment
    Comment #11757117

    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 no…