HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
danshapero
cl-hamt
Common Lisp2020–2020
danshapero / cl-hamt

cl-hamt

Dictionary and set data structures using hash array-mapped tries (HAMT)

3Distinct people
3Mentions
0Explicit recommenders
34GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Dictionary and set data structures using hash array-mapped tries (HAMT)

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 5:04:57 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by week3 dated mentions

Observed mentions: 2020-02-14 15:00:15 UTC to 2020-06-05 09:31:49 UTC. Weeks start Monday, UTC.

012020-02-10 00:00:00 UTC to 2020-02-17 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsFeb 102020-02-17 00:00:00 UTC to 2020-02-24 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-02-24 00:00:00 UTC to 2020-03-02 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2020-03-02 00:00:00 UTC to 2020-03-09 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-03-09 00:00:00 UTC to 2020-03-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-03-16 00:00:00 UTC to 2020-03-23 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-03-23 00:00:00 UTC to 2020-03-30 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-03-30 00:00:00 UTC to 2020-04-06 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-04-06 00:00:00 UTC to 2020-04-13 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsApr 62020-04-13 00:00:00 UTC to 2020-04-20 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-04-20 00:00:00 UTC to 2020-04-27 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-04-27 00:00:00 UTC to 2020-05-04 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-05-04 00:00:00 UTC to 2020-05-11 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-05-11 00:00:00 UTC to 2020-05-18 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-05-18 00:00:00 UTC to 2020-05-25 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-05-25 00:00:00 UTC to 2020-06-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-06-01 00:00:00 UTC to 2020-06-08 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsJun 1

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Feb 102020-02-10 00:00:00 UTC2020-02-17 00:00:00 UTC101
Feb 172020-02-17 00:00:00 UTC2020-02-24 00:00:00 UTC000
Feb 242020-02-24 00:00:00 UTC2020-03-02 00:00:00 UTC101
Mar 22020-03-02 00:00:00 UTC2020-03-09 00:00:00 UTC000
Mar 92020-03-09 00:00:00 UTC2020-03-16 00:00:00 UTC000
Mar 162020-03-16 00:00:00 UTC2020-03-23 00:00:00 UTC000
Mar 232020-03-23 00:00:00 UTC2020-03-30 00:00:00 UTC000
Mar 302020-03-30 00:00:00 UTC2020-04-06 00:00:00 UTC000
Apr 62020-04-06 00:00:00 UTC2020-04-13 00:00:00 UTC000
Apr 132020-04-13 00:00:00 UTC2020-04-20 00:00:00 UTC000
Apr 202020-04-20 00:00:00 UTC2020-04-27 00:00:00 UTC000
Apr 272020-04-27 00:00:00 UTC2020-05-04 00:00:00 UTC000
May 42020-05-04 00:00:00 UTC2020-05-11 00:00:00 UTC000
May 112020-05-11 00:00:00 UTC2020-05-18 00:00:00 UTC000
May 182020-05-18 00:00:00 UTC2020-05-25 00:00:00 UTC000
May 252020-05-25 00:00:00 UTC2020-06-01 00:00:00 UTC000
Jun 12020-06-01 00:00:00 UTC2020-06-08 00:00:00 UTC101

What Hacker News says

3 sources
I agree with GP about refraining from "best practices" type advice -- at most leave it as "I prefer doing it this way". (Example: There was no mention of qlot for a form of version pinning, which would be considered a "best" or at least "standard" practice in other ecosystems, but while I use it I'm not going to insist other Lispers I don't work with do so too. They can keep doing things how they like. Common Lisp is not for the strongly opinionated.) Apart from that though I do think it's useful to have the occasional new posts showcasing rebuttals to a few "myths" that won't die, so I appreciated your post. Some gifs of editor interactivity (like in https://malisper.me/debugging-lisp-part-1-recompilation/) would make it better. Though ironically (one myth has been "it has no libraries") perhaps some people might be turned off by the men
Read the rest
tion of so many libraries ("ok such-and-such is there after all but I have to type a quickload, why can't it come without any work?" -- programmers are often lazy in the worst ways). Before using every utility library under the sun and then some, I'd encourage people to get to know the base language... It's typically quite sufficient for many tasks. But hey, libraries are cool too. Two other persistent data structure libs that came up in a thread the other day (though fset seems to be the most popular): https://github.com/danshapero/cl-hamt/ and https://github.com/ndantam/sycamore
In Modern, functional Common Lisp: myths and best practices

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.