Chris Emerson

Sure, thanks! I think it must just walk hash buckets in order, but I haven't actually looked myself yet!

Mostly for fun, and because I thought it'd be easier than understanding other hash maps well enough to modify, I've written a very naive hash map which has the required...

Some comments: 1 and 3: Oops, that's a late-night bug. It's meant to bail out of the `find()` when it finds `Empty`, but not `Tombstone` (which could indicate something in...

I've had a bit more time to play... This time I've gone for adding a `next_after(key)` to a fork of [hashbrown](https://github.com/jugglerchris/hashbrown/tree/hash_next), which is slated to become the stdlib HashMap. I've...

On a related note, how do you feel about including some of the stdlib implemented in Lua? `pairs` is a one-liner that way. :-)

Hi - glad it's been useful! Is there a reason you're giving it such a large width? The table output was originally designed to display in a fixed width terminal,...

A mode which converts to text but doesn't try to lay out in a fixed-width column does sound like a reasonable feature which I hadn't previously considered - thanks for...

Hi, As you've noticed the text output is currently inspired by markdown rather than trying to be actually valid markdown. However I do like the idea of a full markdown...

I think that's a reasonable summary of how it works. Some more notes: * The size estimate is needed for laying out tables - i.e. deciding how wide each of...

I had a thought. Perhaps a useful extension point would be the point where a sub-builder is merged into the parent. For example, after a `` block is processed a...