File: HACKING.md

package info (click to toggle)
libr3 1.3.4-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, buster, stretch
  • size: 1,084 kB
  • ctags: 1,086
  • sloc: ansic: 13,117; cpp: 175; makefile: 112; sh: 64; ruby: 52
file content (22 lines) | stat: -rw-r--r-- 1,010 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
Related Articles
=====================

Judy Array
------------

- A 10-MINUTE DESCRIPTION OF HOW JUDY ARRAYS WORK AND WHY THEY ARE SO FAST <http://judy.sourceforge.net/doc/10minutes.htm>
- Hashtables vs Judy Arrays, Round 1 <http://rusty.ozlabs.org/?p=153>
- This Hash Table Is Faster Than a Judy Array <http://preshing.com/20130107/this-hash-table-is-faster-than-a-judy-array/>
- A Performance Comparison of Judy to Hash Tables <http://www.nothings.org/computer/judy/>
- Faster (sometimes) Associative Arrays with Node.js <http://legitimatesounding.com/blog/Faster_sometimes_Associative_Arrays_with_Node_js.html>

Jemalloc
------------
https://github.com/jemalloc/jemalloc/wiki/Getting-Started


Prefix Tree / Radix Tree
-------------------------
- Radix Tree: <http://en.wikipedia.org/wiki/Radix_tree>
- Radix Tree in Linux Kernel: <http://blog.csdn.net/walkland/article/details/4006121>
- Radix Tree in Linux Kernel (source code): <https://github.com/torvalds/linux/blob/master/include/linux/radix-tree.h>