blob: d6eb3d7cb8aa7d05aa6c2b0f7cbef11f6b573f44 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
包含一些資料結構
===== BinaryIndexTree.h
極度簡化的 *SegmentTree* 已無區間更新的操作.
.Classes
* `meow::BinaryIndexTree<Value>`
===== DisjointSet.h
用來維護一堆互斥集的資訊.
.Classes
* `meow::DisjointSet`
===== HashTable.h
就是傳說中的HashTable
.Classes
* `meow::HashTableList<Data, HashFunc>`
===== KD_Tree.h
查詢第k近鄰居用的
.Classes
* `meow::KD_Tree<Vector>`
===== MergeableHeap.h
可合併Heap
.Classes
* `meow::MergeableHeap<Element>`
===== SegmentTree.h
線段樹
.Classes
* `meow::SegmentTree<Value>`
===== SplayTree.h
伸展樹, 比一般平衡樹稍強的東東
* `meow::SplayTree<Key, Value>`
* `meow::SplayTree_Range<Key, Value>`
===== VP_Tree.h
查詢第k近鄰居用的
.Classes
* `meow::VP_Tree<Vector>`
|
