-
Notifications
You must be signed in to change notification settings - Fork 0
/
.tags
145 lines (145 loc) · 10.3 KB
/
.tags
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
!_TAG_FILE_FORMAT 2 /extended format; --format=1 will not append ;" to lines/
!_TAG_FILE_SORTED 1 /0=unsorted, 1=sorted, 2=foldcase/
!_TAG_PROGRAM_AUTHOR Darren Hiebert /dhiebert@users.sourceforge.net/
!_TAG_PROGRAM_NAME Exuberant Ctags //
!_TAG_PROGRAM_URL http://ctags.sourceforge.net /official site/
!_TAG_PROGRAM_VERSION 5.8 //
ASSERT dec/lib/debug.h /^#define ASSERT(/;" d
ASSERT enc/lib/debug.h /^#define ASSERT(/;" d
ENC dec/main.h /^} ENC;$/;" t typeref:struct:enc
ENC enc/main.h /^} ENC;$/;" t typeref:struct:enc
MAX_SIZE dec/main.c /^#define MAX_SIZE /;" d file:
NODE dec/main.h /^} NODE;$/;" t typeref:struct:node
NODE enc/main.h /^} NODE;$/;" t typeref:struct:node
NULL dec/lib/list.h /^#define NULL /;" d
NULL enc/lib/list.h /^#define NULL /;" d
OBJECTS dec/Makefile /^OBJECTS = main.o list.o$/;" m
OBJECTS enc/Makefile /^OBJECTS = main.o list.o$/;" m
__LIB_DEBUG_H dec/lib/debug.h /^#define __LIB_DEBUG_H$/;" d
__LIB_DEBUG_H enc/lib/debug.h /^#define __LIB_DEBUG_H$/;" d
__LIB_LIST_H dec/lib/list.h /^#define __LIB_LIST_H$/;" d
__LIB_LIST_H enc/lib/list.h /^#define __LIB_LIST_H$/;" d
__MAIN_H dec/main.h /^#define __MAIN_H$/;" d
__MAIN_H enc/main.h /^#define __MAIN_H$/;" d
calBits dec/main.c /^unsigned int calBits(unsigned n){$/;" f
calBits enc/foo.c /^int calBits(unsigned n){$/;" f
calBits enc/main.c /^unsigned int calBits(unsigned n){$/;" f
children_list dec/main.h /^ struct list children_list;$/;" m struct:node typeref:struct:node::list
children_list enc/main.h /^ struct list children_list;$/;" m struct:node typeref:struct:node::list
elem dec/main.h /^ struct list_elem elem;$/;" m struct:node typeref:struct:node::list_elem
elem enc/main.h /^ struct list_elem elem;$/;" m struct:node typeref:struct:node::list_elem
enc dec/main.h /^typedef struct enc{$/;" s
enc enc/main.h /^typedef struct enc{$/;" s
find_end_of_run dec/lib/list.c /^find_end_of_run (struct list_elem *a, struct list_elem *b,$/;" f file:
find_end_of_run enc/lib/list.c /^find_end_of_run (struct list_elem *a, struct list_elem *b,$/;" f file:
getBits dec/main.c /^uint8_t getBits(uint8_t buffer, int start, int end, bool dir){$/;" f
getBits enc/main.c /^uint8_t getBits(uint8_t buffer, int start, int end, bool dir){$/;" f
getInfo dec/main.c /^void getInfo(int* num, char* letter, char* str){$/;" f
head dec/lib/list.h /^ struct list_elem head; \/* List head. *\/$/;" m struct:list typeref:struct:list::list_elem
head enc/lib/list.h /^ struct list_elem head; \/* List head. *\/$/;" m struct:list typeref:struct:list::list_elem
inplace_merge dec/lib/list.c /^inplace_merge (struct list_elem *a0, struct list_elem *a1b0,$/;" f file:
inplace_merge enc/lib/list.c /^inplace_merge (struct list_elem *a0, struct list_elem *a1b0,$/;" f file:
insertNode dec/main.c /^ENC* insertNode(char letter, NODE* root){$/;" f
insertNode enc/main.c /^ENC* insertNode(char letter, NODE* root){$/;" f
is_head dec/lib/list.c /^is_head (struct list_elem *elem)$/;" f file:
is_head enc/lib/list.c /^is_head (struct list_elem *elem)$/;" f file:
is_interior dec/lib/list.c /^is_interior (struct list_elem *elem)$/;" f file:
is_interior enc/lib/list.c /^is_interior (struct list_elem *elem)$/;" f file:
is_sorted dec/lib/list.c /^is_sorted (struct list_elem *a, struct list_elem *b,$/;" f file:
is_sorted enc/lib/list.c /^is_sorted (struct list_elem *a, struct list_elem *b,$/;" f file:
is_tail dec/lib/list.c /^is_tail (struct list_elem *elem)$/;" f file:
is_tail enc/lib/list.c /^is_tail (struct list_elem *elem)$/;" f file:
letter dec/main.h /^ char letter;$/;" m struct:enc
letter dec/main.h /^ char letter;$/;" m struct:node
letter enc/main.h /^ char letter;$/;" m struct:enc
letter enc/main.h /^ char letter;$/;" m struct:node
list dec/lib/list.h /^struct list $/;" s
list enc/lib/list.h /^struct list $/;" s
list_back dec/lib/list.c /^list_back (struct list *list)$/;" f
list_back enc/lib/list.c /^list_back (struct list *list)$/;" f
list_begin dec/lib/list.c /^list_begin (struct list *list)$/;" f
list_begin enc/lib/list.c /^list_begin (struct list *list)$/;" f
list_elem dec/lib/list.h /^struct list_elem $/;" s
list_elem enc/lib/list.h /^struct list_elem $/;" s
list_empty dec/lib/list.c /^list_empty (struct list *list)$/;" f
list_empty enc/lib/list.c /^list_empty (struct list *list)$/;" f
list_end dec/lib/list.c /^list_end (struct list *list)$/;" f
list_end enc/lib/list.c /^list_end (struct list *list)$/;" f
list_entry dec/lib/list.h /^#define list_entry(/;" d
list_entry enc/lib/list.h /^#define list_entry(/;" d
list_front dec/lib/list.c /^list_front (struct list *list)$/;" f
list_front enc/lib/list.c /^list_front (struct list *list)$/;" f
list_head dec/lib/list.c /^list_head (struct list *list) $/;" f
list_head enc/lib/list.c /^list_head (struct list *list) $/;" f
list_init dec/lib/list.c /^list_init (struct list *list)$/;" f
list_init enc/lib/list.c /^list_init (struct list *list)$/;" f
list_insert dec/lib/list.c /^list_insert (struct list_elem *before, struct list_elem *elem)$/;" f
list_insert enc/lib/list.c /^list_insert (struct list_elem *before, struct list_elem *elem)$/;" f
list_insert_ordered dec/lib/list.c /^list_insert_ordered (struct list *list, struct list_elem *elem,$/;" f
list_insert_ordered enc/lib/list.c /^list_insert_ordered (struct list *list, struct list_elem *elem,$/;" f
list_less_func dec/lib/list.h /^typedef bool list_less_func (const struct list_elem *a,$/;" t
list_less_func enc/lib/list.h /^typedef bool list_less_func (const struct list_elem *a,$/;" t
list_max dec/lib/list.c /^list_max (struct list *list, list_less_func *less, void *aux)$/;" f
list_max enc/lib/list.c /^list_max (struct list *list, list_less_func *less, void *aux)$/;" f
list_min dec/lib/list.c /^list_min (struct list *list, list_less_func *less, void *aux)$/;" f
list_min enc/lib/list.c /^list_min (struct list *list, list_less_func *less, void *aux)$/;" f
list_next dec/lib/list.c /^list_next (struct list_elem *elem)$/;" f
list_next enc/lib/list.c /^list_next (struct list_elem *elem)$/;" f
list_pop_back dec/lib/list.c /^list_pop_back (struct list *list)$/;" f
list_pop_back enc/lib/list.c /^list_pop_back (struct list *list)$/;" f
list_pop_front dec/lib/list.c /^list_pop_front (struct list *list)$/;" f
list_pop_front enc/lib/list.c /^list_pop_front (struct list *list)$/;" f
list_prev dec/lib/list.c /^list_prev (struct list_elem *elem)$/;" f
list_prev enc/lib/list.c /^list_prev (struct list_elem *elem)$/;" f
list_push_back dec/lib/list.c /^list_push_back (struct list *list, struct list_elem *elem)$/;" f
list_push_back enc/lib/list.c /^list_push_back (struct list *list, struct list_elem *elem)$/;" f
list_push_front dec/lib/list.c /^list_push_front (struct list *list, struct list_elem *elem)$/;" f
list_push_front enc/lib/list.c /^list_push_front (struct list *list, struct list_elem *elem)$/;" f
list_rbegin dec/lib/list.c /^list_rbegin (struct list *list) $/;" f
list_rbegin enc/lib/list.c /^list_rbegin (struct list *list) $/;" f
list_remove dec/lib/list.c /^list_remove (struct list_elem *elem)$/;" f
list_remove enc/lib/list.c /^list_remove (struct list_elem *elem)$/;" f
list_rend dec/lib/list.c /^list_rend (struct list *list) $/;" f
list_rend enc/lib/list.c /^list_rend (struct list *list) $/;" f
list_reverse dec/lib/list.c /^list_reverse (struct list *list)$/;" f
list_reverse enc/lib/list.c /^list_reverse (struct list *list)$/;" f
list_size dec/lib/list.c /^list_size (struct list *list)$/;" f
list_size enc/lib/list.c /^list_size (struct list *list)$/;" f
list_sort dec/lib/list.c /^list_sort (struct list *list, list_less_func *less, void *aux)$/;" f
list_sort enc/lib/list.c /^list_sort (struct list *list, list_less_func *less, void *aux)$/;" f
list_splice dec/lib/list.c /^list_splice (struct list_elem *before,$/;" f
list_splice enc/lib/list.c /^list_splice (struct list_elem *before,$/;" f
list_tail dec/lib/list.c /^list_tail (struct list *list) $/;" f
list_tail enc/lib/list.c /^list_tail (struct list *list) $/;" f
list_unique dec/lib/list.c /^list_unique (struct list *list, struct list *duplicates,$/;" f
list_unique enc/lib/list.c /^list_unique (struct list *list, struct list *duplicates,$/;" f
lookup dec/main.c /^NODE* lookup(int num){$/;" f
main dec/main.c /^int main(int argc, char const *argv[])$/;" f
main enc/foo.c /^int main(int argc, char const *argv[])$/;" f
main enc/hello.c /^int main(int argc, char const *argv[])$/;" f
main enc/main.c /^int main(int argc, char const *argv[])$/;" f
makeNode dec/main.c /^NODE* makeNode(char letter, NODE* parent){$/;" f
makeNode enc/main.c /^NODE* makeNode(char letter, NODE* parent){$/;" f
next dec/lib/list.h /^ struct list_elem *next; \/* Next list element. *\/$/;" m struct:list_elem typeref:struct:list_elem::list_elem
next enc/lib/list.h /^ struct list_elem *next; \/* Next list element. *\/$/;" m struct:list_elem typeref:struct:list_elem::list_elem
node dec/main.h /^typedef struct node{$/;" s
node enc/main.h /^typedef struct node{$/;" s
node_list dec/main.c /^struct list node_list;$/;" v typeref:struct:list
node_list enc/main.c /^struct list node_list;$/;" v typeref:struct:list
num dec/main.h /^ int num;$/;" m struct:node
num enc/main.h /^ unsigned int num;$/;" m struct:node
num_elem dec/main.h /^ struct list_elem num_elem;$/;" m struct:node typeref:struct:node::list_elem
offsetof_list dec/lib/list.h /^#define offsetof_list(/;" d
offsetof_list enc/lib/list.h /^#define offsetof_list(/;" d
parent dec/main.h /^ struct node *parent;$/;" m struct:node typeref:struct:node::node
parent enc/main.h /^ struct node *parent;$/;" m struct:node typeref:struct:node::node
parent_num dec/main.h /^ int parent_num;$/;" m struct:enc
parent_num enc/main.h /^ unsigned int parent_num;$/;" m struct:enc
prev dec/lib/list.h /^ struct list_elem *prev; \/* Previous list element. *\/$/;" m struct:list_elem typeref:struct:list_elem::list_elem
prev enc/lib/list.h /^ struct list_elem *prev; \/* Previous list element. *\/$/;" m struct:list_elem typeref:struct:list_elem::list_elem
saveEncStream enc/main.c /^void saveEncStream(FILE* of, uint32_t num, uint8_t letter){$/;" f
showNum dec/main.c /^void showNum(NODE* node){$/;" f
swap dec/lib/list.c /^swap (struct list_elem **a, struct list_elem **b) $/;" f file:
swap enc/lib/list.c /^swap (struct list_elem **a, struct list_elem **b) $/;" f file:
tail dec/lib/list.h /^ struct list_elem tail; \/* List tail. *\/$/;" m struct:list typeref:struct:list::list_elem
tail enc/lib/list.h /^ struct list_elem tail; \/* List tail. *\/$/;" m struct:list typeref:struct:list::list_elem