✳flâneur — a map of the web's best reading
2020 年秋季 進階電腦系統理論與實作課程作業 —— dict - HackMD
hackmd.io · 3,412 words · saved by 1 readers
檢驗學員對 bitwise 操作和記憶體管理的認知
2020 年秋季 進階電腦系統理論與實作課程作業 —— dict - HackMD --- title: 2020 年秋季 進階電腦系統理論與實作課程作業 —— dict description: 檢驗學員對 bitwise 操作和記憶體管理的認知 --- # I04: dict > 主講人: [jserv](http://wiki.csie.ncku.edu.tw/User/jserv) / 課程討論區: [2020 年系統軟體課程](https://www.facebook.com/groups/system.software2020/) :mega: 返回「[進階電腦系統理論與實作](http://wiki.csie.ncku.edu.tw/sysprog/schedule)」課程進度表 ## :memo: 預期目標 * 學習 [ternary search tree](https://en.wikipedia.org/wiki/Ternary_search_tree) 作為 [auto-complete](https://en.wikipedia.org/wiki/Autocomplete) 和 prefix search 的實作機制 * 學習 [Bloom filter](https://en.wikipedia.org/wiki/Bloom_filter) 和 [ter
Explore this link on the map →related reading
- Bloom Filters - Much, much more than a space efficient hashmap! | Ben E. C. Boyterboyter.org
- abseil / Performance Hintsabseil.io
- Bloom filter | Docsredis.io
- Ternary search tree - Wikipediaen.wikipedia.org
- Trie - Wikipediaen.wikipedia.org
- [LeetCode] 增強自我能力檢視表 - Angel@Software Engineer - Mediumangelswengineer.medium.com
- Static search trees: 40x faster than binary search · CuriousCodingcuriouscoding.nl
- Bloom Filterssamwho.dev
- Bloom filters debunked: Dispelling 30 Years of bad math with Coq!kirancodes.me
- GitHub - josephg/diamond-types: The world's fastest CRDT. WIP. · GitHubgithub.com
- How Cursor Indexes Codebases Fast - by Engineer's Codexread.engineerscodex.com
- Build Your Own Databasenan.fyi