forked from xtaci/algorithms
/
Makefile
267 lines (200 loc) · 7.36 KB
/
Makefile
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
.PHONY: all clean
CC=clang
CPP=clang++
AR=ar
RANLIB=ranlib
CFLAGS= -g -Wall -Wno-unused-function
C11FLAGS= -g -Wall -Wno-unused-function -std=c++11
SRCDIR = ./src
INCLUDEDIR = -I./include -I.
DEPS =
LIBS = -lm
PROGRAMS = m_based_demo \
integer_demo \
insertion_sort_demo \
shell_sort_demo \
radix_sort_demo \
shuffle_demo \
quick_sort_demo \
merge_sort_demo \
random_select_demo \
hash_multi_demo \
hash_table_demo \
double_linked_list_demo \
stack_demo \
queue_demo \
universal_hash_demo \
perfect_hash_demo \
binary_search_tree_demo \
rbtree_demo \
heap_demo \
interval_tree_demo \
dos_tree_demo \
skiplist_demo \
lcs_demo \
prim_mst_demo \
directed_graph_demo \
undirected_graph_demo \
dijkstra_demo \
bellman_ford_demo \
graph_search_demo \
edmonds_karp_demo \
astar_demo \
hash_string_demo \
bitset_demo \
bloom_filter_demo \
sha1_demo \
huffman_demo \
word_seg_demo \
md5_demo \
trie_demo \
simhash_demo \
imath_demo \
random_demo \
k-means_demo \
kmp_demo \
LRU_cache_demo \
base64_demo \
max_subarray_demo \
disjoint-set_demo \
relabel_to_front_demo \
btree_demo \
sort_demo \
fib-heap_demo \
scc_demo \
sort_demo \
bubble_sort_demo \
selection_sort_demo \
8queue_demo \
palindrome_demo \
suffix_tree_demo \
avl_demo
all: $(PROGRAMS)
m_based_demo: $(SRCDIR)/m_based_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
integer_demo: $(SRCDIR)/integer_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
insertion_sort_demo: $(SRCDIR)/insertion_sort_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
shell_sort_demo: $(SRCDIR)/shell_sort_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
radix_sort_demo: $(SRCDIR)/radix_sort_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
shuffle_demo: $(SRCDIR)/shuffle_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
quick_sort_demo: $(SRCDIR)/quick_sort_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
merge_sort_demo: $(SRCDIR)/merge_sort_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
random_select_demo: $(SRCDIR)/random_select_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
hash_multi_demo: $(SRCDIR)/hash_multi_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
hash_table_demo: $(SRCDIR)/hash_table_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
double_linked_list_demo: $(SRCDIR)/double_linked_list_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
stack_demo: $(SRCDIR)/stack_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
queue_demo: $(SRCDIR)/queue_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
priority_queue_demo: $(SRCDIR)/priority_queue_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
prime_demo: $(SRCDIR)/prime_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
universal_hash_demo: $(SRCDIR)/universal_hash_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
perfect_hash_demo: $(SRCDIR)/perfect_hash_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
binary_search_tree_demo: $(SRCDIR)/binary_search_tree_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
rbtree_demo: $(SRCDIR)/rbtree_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
heap_demo: $(SRCDIR)/heap_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
interval_tree_demo: $(SRCDIR)/interval_tree_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
dos_tree_demo: $(SRCDIR)/dos_tree_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
skiplist_demo: $(SRCDIR)/skiplist_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
lcs_demo: $(SRCDIR)/lcs_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
prim_mst_demo: $(SRCDIR)/prim_mst_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
directed_graph_demo: $(SRCDIR)/directed_graph_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
undirected_graph_demo: $(SRCDIR)/undirected_graph_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
dijkstra_demo: $(SRCDIR)/dijkstra_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
bellman_ford_demo: $(SRCDIR)/bellman_ford_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
graph_search_demo: $(SRCDIR)/graph_search_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
edmonds_karp_demo: $(SRCDIR)/edmonds_karp_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
astar_demo: $(SRCDIR)/astar_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
hash_string_demo: $(SRCDIR)/hash_string_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
bitset_demo: $(SRCDIR)/bitset_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
bloom_filter_demo: $(SRCDIR)/bloom_filter_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
sha1_demo: $(SRCDIR)/sha1_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
huffman_demo: $(SRCDIR)/huffman_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
word_seg_demo: $(SRCDIR)/word_seg_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
md5_demo: $(SRCDIR)/md5_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
trie_demo: $(SRCDIR)/trie_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
simhash_demo: $(SRCDIR)/simhash_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
imath_demo: $(SRCDIR)/imath_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
random_demo: $(SRCDIR)/random_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
k-means_demo: $(SRCDIR)/k-means_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
kmp_demo : $(SRCDIR)/kmp_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
kruskal_mst_demo: $(SRCDIR)/kruskal_mst_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
LRU_cache_demo: $(SRCDIR)/LRU_cache_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
base64_demo: $(SRCDIR)/base64_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
max_subarray_demo: $(SRCDIR)/max_subarray_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
disjoint-set_demo: $(SRCDIR)/disjoint-set_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
relabel_to_front_demo: $(SRCDIR)/relabel_to_front_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
btree_demo: $(SRCDIR)/btree_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
sort_demo: $(SRCDIR)/sort_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
fib-heap_demo: $(SRCDIR)/fib-heap_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
scc_demo: $(SRCDIR)/scc_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
bubble_sort_demo: $(SRCDIR)/bubble_sort_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
selection_sort_demo: $(SRCDIR)/selection_sort_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
8queue_demo: $(SRCDIR)/8queue_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
palindrome_demo: $(SRCDIR)/palindrome_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
suffix_tree_demo: $(SRCDIR)/suffix_tree_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
avl_demo: $(SRCDIR)/avl_demo.cpp
$(CPP) $(CFLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
suffix_array_demo: $(SRCDIR)/suffix_array_demo.cpp
$(CPP) $(C11FLAGS) -o $@ $^ $(INCLUDEDIR) $(LIBS)
clean:
rm -rf $(PROGRAMS) *.dSYM