Work in progress: 181,232 of 181,233 sites checked so far, more every week · updated 2 Nov 2026Missing a blog? Tell us

Top all-time · #9016

D

David Nadlinger

Personal blog · klickverbot.at/blog · on HN as klickverbotprogramming

David Nadlinger's personal blog at klickverbot.at covers programming. Since 2012, 9 different Hacker News readers have linked it 9 times, most often “Purity in D”. The last post was in 2018, but the archive is still widely read.

Visit the blog
9mentions?
9HN people?
2012–2023first – last linked?
Links on Hacker News per year · peak 3 in 2012

Too few sampled comments (6) to say how often HN recommends it.?

Why HN links it

HN readers link David Nadlinger's blog mainly for his article on purity and immutability in D, which one commenter calls a good article. Other links point to his photo credit, D units documentation and LDC work.

Summarised by Claude from a sample of 6 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.

The author on HN?

klickverbot · 117 karma · member since 2012

Quantum physicist by day, programming geek by night. Please see website for contact info. ——— https://klickverbot.at https://twitter.com/dnadlinger

From their public HN profile, which links to this site.

Most-linked posts?

  1. Purity in D
    4 people · 4 mentions · first linked 2012-05-28

What Hacker News says?

  1. > [...] the algorithms I am aware of for finding shortest paths require mutable vertices that store the scores and pointers (edges) for the best part found so far. No problem. Traditional loops with mutable variables translate straight-forward to tail recursive calls, if you want to write your algorithm like that. Though actually my argument was less about not mutating your functions internal variables---but about i…

    Comment linking /blog/2012/05/purity-in-d/

    on “Goodbye, Object Oriented Programming”
  2. Submitted Purity in D as a story · 10 points

    HN discussion
  3. David Nadlinger, the photographer, is an avid contributor to the D programming language[1]. He works on LDC compiler[2], the LLVM backend for D. [1] http://klickverbot.at/ [2] https://github.com/ldc-developers/ldc

    Comment linking /

    on “Picture of a Single Atom Wins Science Photo Contest”
  4. Submitted Apache Thrift now officially supports D as a story · 2 points

    HN discussion
  5. Have you looked at D yet? It scores 4/5 by your mark, and they're working on the fifth point. Here's the documentation for the proposed units module. I believe it has the same principles as Boost units: http://klickverbot.at/code/units/std_units.html

    Comment linking /code/units/std_units.html

    on “Static checking of units in Servo”
  6. Submitted getaddrinfo() edge case behavior on Windows, Linux and OS X as a story · 1 points

    HN discussion
  7. (For whatever reason HN is nonstandard and includes the trailing >; working link: http://klickverbot.at/blog/2012/05/purity-in-d/ )

    Comment linking /blog/2012/05/purity-in-d/

    on “Function Purity and Immutability in D”
  8. a0 · 2014-10-09Recommends
    There is also a good article about purity in D by David Nadlinger, who is one of the core developers of LDC (LLVM D Compiler): - http://klickverbot.at/blog/2012/05/purity-in-d/

    Comment linking /blog/2012/05/purity-in-d/

    on “Function Purity and Immutability in D”
  9. I thought the D language had a really nice take on this with its notion of “weak” purity, allowing for straightforward allocations and I/O: https://klickverbot.at/blog/2012/05/purity-in-d/ I think the idea is that if a function always gives the same result with the same inputs, it is considered “pure enough.”

    Comment linking /blog/2012/05/purity-in-d/

    on “(Erlang) Why do we need modules at all?”

Search all of HN for klickverbot.at