Merge pull request #34 from weihanglo/feat/bloom-filter

Feat/bloom filter

Author: weihanglo

Cargo.lock

@@ -2,7 +2,7 @@
 name = "rust-algorithm-club"
 version = "0.0.1"
 edition = '2018'
-authors = ["Weihang Lo <[email protected]>"]
+authors = ["Weihang Lo <[email protected]>"]
 description = "Learn algorithms and data structures with Rust"
 homepage = "https://rust-algo.club"
 repository = "https://github.com/weihanglo/rust-algorithm-club"

Cargo.toml

@@ -93,6 +93,7 @@ Special-purpose sorts:
 - [🚧 Ordered map](src/collections/ordered_map)
 - [🚧 Multimap](src/collections/multimap)
 - [Set](src/collections/set)
+- [Bloom filter](src/collections/bloom_filter)
 
 ## Learning Resources
 
@@ -120,4 +121,4 @@ This project is released under different licenses based on type of the content.
 - Source code is licensed under [The MIT License (MIT)](LICENSE).
 - Articles and creative works are licensed under [Creative Commons 4.0 (CC BY-NC-SA 4.0)](https://creativecommons.org/licenses/by-nc-sa/4.0/).
 
-Copyright © 2017 - 2018 Weihang Lo
+Copyright © 2017 - 2020 Weihang Lo

README.md

@@ -111,4 +111,4 @@
 - 程式碼與函式庫依據 [The MIT License (MIT)](https://github.com/weihanglo/rust-algorithm-club/blob/master/LICENSE) 授權條款發佈。
 - 文章與相關著作依據 [Creative Commons 4.0 (CC BY-NC-SA 4.0)](https://creativecommons.org/licenses/by-nc-sa/4.0/) 授權條款發佈。
 
-Copyright © 2017 - 2018 Weihang Lo
+Copyright © 2017 - 2020 Weihang Lo

src/README.md

@@ -43,6 +43,7 @@
     - [🚧 有序映射表 Ordered map](collections/ordered_map/README.md)
     - [🚧 多重映射表 Multimap](collections/multimap/README.md)
     - [集合 Set](collections/set/README.md)
+    - [布隆過濾器 Bloom filter](collections/bloom_filter/README.md)
 
 ------
 

src/SUMMARY.md

@@ -66,6 +66,10 @@ _（雜湊表示意圖）_
 
 [set-theory]: https://en.wikipedia.org/wiki/Set_theory
 
+### 布隆過濾器 Bloom Filter
+
+[布隆過濾器](../bloom_filter)是一種類似於集合，但只會回報「絕對不存在」或「可能存在」的機率資料結構，實作上節省空間，常用於在海量資料中確認成員是否存在，並能有一定容錯率的場景。
+
 ## 參考資料
 
 - [Wiki: Associative array](https://en.wikipedia.org/wiki/Associative_array)