Тёмный

HAMTs From Scratch with Vaibhav Sagar 

NYC Haskell User's Group
Подписаться 1,8 тыс.
Просмотров 828
50% 1

www.meetup.com...
Abstract:
Phil Bagwell's Hash Array Mapped Tries are the backbone of Clojure and Scala's immutable collections libraries and the data structure underpinning our unordered-containers package. In this talk I will attempt to demystify them by writing a toy implementation from scratch! My hope is that this will give everyone present a better understanding of how they work
Bio:
Vaibhav Sagar used to write web apps for a living. He still does, but he used to, too. When he's not doing that, he talks about Nix on Twitter and abuses CPP to make IHaskell support multiple GHC releases.

Опубликовано:

 

1 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 1   
@vbhvsgr
@vbhvsgr 5 лет назад
Correction: `unordered-containers` uses 64-bit hashes. What I meant to say was that it uses 16-bit bitmaps (as of this writing).
Далее
Git Internals With Haskell
37:55
Просмотров 1,6 тыс.
Richard Eisenberg on Dependent Types
48:28
Просмотров 4,2 тыс.
Implementing In-memory Caches in Haskell
1:15:15
Просмотров 1,3 тыс.
Backpack to Work: Towards Backpack in Practice
54:49
Просмотров 1,9 тыс.
SumAll on Java to Haskell
43:56
Просмотров 1,1 тыс.
C++ Hash Table Implementation
17:41
Просмотров 186 тыс.
The State of Haskell in Ethereum
1:04:22
Просмотров 882
I gave 127 interviews. Top 5 Algorithms they asked me.
8:36
Squeal, a Deep Embedding of SQL in Haskell
1:01:57
Просмотров 2 тыс.