# [2020q3 Homework3 (dict)](https://hackmd.io/@sysprog/2020-dict)
contributed by <`zhu849`>

## bloom.c
### bloom filter 的資料結構

digraph linked_list{
    rankdir = LR;
    node [shape = record];
    subgraph cluster_0 {
        style = "filled";
        color = "black";
        fillcolor = "lightyellow";
		node [style = filled, fillcolor = white, color = black];
        label = "bloom_filter";
        size [shape=plaintext, label="size"];
        bits [shape=plaintext, label="bits:"];
        func [shape=plaintext, label="func"];
        func->sc0
        sc2 [label = "{|||...|||}"]
        sc1:tail->NULL
        bits->sc2
        sc0 [label= "{djb2|<tail>}"];
        sc1 [label= "{jenkins|<tail>}"];
        sc0:tail->sc1
    }
}