SYMBOL INDEX (205 symbols across 69 files)

FILE: 3 Hash Table/HashTable.c
  type Value (line 7) | typedef int Value;
  type Hash (line 8) | typedef unsigned int Hash;
  type Entry (line 12) | typedef struct Entry
  type HashTable (line 22) | typedef struct HashTable{
  function HashTable (line 44) | HashTable *create(unsigned int size){
  function HashTable (line 60) | HashTable *put(HashTable *hashTable,Key key,Value value){
  function Value (line 71) | Value find(HashTable *hashTable,Key key){
  function print (line 76) | void print(HashTable *hashTable){
  function Hash (line 92) | Hash hashCode(char *key){
  function main (line 105) | int main(){

FILE: 3 Hash Table/hash_ref.c
  type Hash (line 11) | typedef unsigned int Hash;
  type Value (line 13) | typedef int Value;
  type Entry (line 14) | typedef struct Entry{
  type HashMap (line 21) | typedef struct HashMap{
  function HashMap (line 40) | HashMap* create(unsigned int size){
  function HashMap (line 52) | HashMap* transfer(HashMap* newHashMap, HashMap* oldHashMap){
  function Hash (line 76) | Hash hashCode(char* key){
  function HashMap (line 83) | HashMap* put(HashMap* hashMap, Key key, Value value){
  function HashMap (line 98) | HashMap* putInHeads(HashMap* hashMap, int index, Hash hash, Key key, Val...
  function HashMap (line 109) | HashMap* putInList(HashMap* hashMap, int index, Hash hash, Key key, Valu...
  function HashMap (line 129) | HashMap* resize(HashMap* hashMap){
  function Value (line 139) | Value get(HashMap* hashMap, Key key){
  function print (line 150) | void print(HashMap* hashMap){
  function main (line 162) | int main(){

FILE: 4 Tree/1-二叉树 /btree/bintree.c
  type BiTNode (line 11) | typedef struct BiTNode{
  type BiTree (line 30) | typedef BiTree ElemType ;
  type Status (line 31) | typedef int Status;
  type SqQueue (line 36) | typedef struct Node{
  type LinkQueue (line 54) | typedef struct QNode{
  type Queue (line 64) | typedef struct{
  function Status (line 86) | Status initQueue(Queue *queue){// 带头结点,没有引用传值，就用指针的指针吧
  function isEmpty (line 103) | bool isEmpty(Queue *q){
  function length (line 109) | int length(Queue *q){
  function Status (line 123) | Status getHead(Queue *q,ElemType *e){
  function Status (line 137) | Status enQueue(Queue *q,ElemType e){
  function Status (line 155) | Status deQueue(Queue *q,ElemType *e){
  function traveser (line 181) | void traveser(Queue *q){
  function BiTree (line 226) | BiTree CreateBiTree(){
  function PreOrderTraverse (line 252) | int PreOrderTraverse(BiTree T){
  function InOrderTraverse (line 263) | int InOrderTraverse(BiTree T){
  function PostOrderTraverse (line 275) | int PostOrderTraverse(BiTree T){
  function LevelOrderTraverse (line 288) | int LevelOrderTraverse(BiTree T){
  function main (line 314) | int main(int argc, char const *argv[])

FILE: 4 Tree/1-二叉树 /btree/public.h
  type ElemType (line 18) | typedef char ElemType ;
  type Status (line 19) | typedef int Status;

FILE: 4 Tree/1-二叉树 /btree/队列.h
  type BiTNode (line 15) | typedef BiTNode ElemType;
  type SqQueue (line 18) | typedef struct Node{
  type LinkQueue (line 36) | typedef struct QNode{
  type Queue (line 46) | typedef struct{
  function Status (line 68) | Status initQueue(Queue *queue){// 带头结点,没有引用传值，就用指针的指针吧
  function isEmpty (line 85) | bool isEmpty(Queue *q){
  function length (line 91) | int length(Queue *q){
  function Status (line 105) | Status getHead(Queue *q,ElemType *e){
  function Status (line 119) | Status enQueue(Queue *q,ElemType e){
  function Status (line 137) | Status deQueue(Queue *q,ElemType *e){
  function traveser (line 163) | void traveser(Queue *q){

FILE: 4 Tree/1-二叉树 /rbtree.c
  type ElemType (line 33) | typedef int ElemType
  type node (line 35) | struct node{

FILE: 4 Tree/2-二叉查找树/BiSearchTree/bisearchtree.c
  function BiSearchTree (line 19) | BiSearchTree *bisearch_tree_new(){
  function BiSearchTree (line 31) | BiSearchTree *bisearch_tree_insert(BiSearchTree *tree,ElemType node){
  function bisearch_tree_search (line 88) | int bisearch_tree_search(BiSearchTree *tree,ElemType node){
  function _delete_node (line 113) | int _delete_node(BiSearchTree *node,BiSearchTree*parent){
  function bisearch_tree_delete (line 168) | int bisearch_tree_delete(BiSearchTree **tree,ElemType node){
  function bisearch_tree_inorder_traversal (line 327) | void bisearch_tree_inorder_traversal(BiSearchTree *tree){

FILE: 4 Tree/2-二叉查找树/BiSearchTree/bisearchtree.h
  type ElemType (line 23) | typedef int ElemType;
  type BiSearchTree (line 24) | typedef struct BiSearchTree{

FILE: 4 Tree/2-二叉查找树/BiSearchTree/main.c
  function main (line 12) | int main(){

FILE: 4 Tree/3-平衡树AVL/AVLTree.c
  type KEY_TYPE (line 14) | typedef int KEY_TYPE;
  type AVLTree (line 15) | typedef struct node{
  function avltree_rr_rotate (line 27) | void avltree_rr_rotate(AVLTree **tree){
  function avltree_ll_rotate (line 36) | void avltree_ll_rotate(AVLTree **tree){
  function avltree_lr_rotate (line 44) | void avltree_lr_rotate(AVLTree **tree){
  function avltree_rl_rotate (line 49) | void avltree_rl_rotate(AVLTree **tree){
  function avltree_left_balance (line 55) | void avltree_left_balance(AVLTree **root)
  function avltree_right_balance (line 89) | void avltree_right_balance(AVLTree **root)
  function AVLTree (line 138) | AVLTree* avltree_insert(AVLTree* root, KEY_TYPE key){
  function AVLTree (line 200) | AVLTree* avltree_delete(AVLTree* root, KEY_TYPE key){
  function avltree_isbalance (line 207) | int avltree_isbalance(AVLTree *root){
  function AVLTree (line 214) | AVLTree* avltree_search(AVLTree *root,KEY_TYPE key){
  function avltree_inorder_traversal (line 240) | void avltree_inorder_traversal(AVLTree* root){
  function main (line 256) | int main(){

FILE: 4 Tree/4-字典树Trie/trie.c
  type Trie (line 16) | typedef struct node
  function Trie (line 25) | Trie *trie_create(Trie **trie){
  function trie_insert (line 47) | int trie_insert(Trie *trie,char *c){
  function trie_query (line 92) | bool trie_query(Trie *trie,char *c){
  function trie_remove (line 130) | void trie_remove(){}
  function main (line 135) | int main(){

FILE: 4 Tree/8-堆/heap.c
  function heap_build (line 5) | void heap_build(int *a,int length){
  function heap_insert (line 12) | void heap_insert(int *a,int v){
  function heap_delete (line 20) | void heap_delete(int *a,int *value){

FILE: 6 Sort/8.c
  function main (line 5) | int main(int argc, char const *argv[])

FILE: 6 Sort/insert_sort.c
  function insert_sort (line 7) | void insert_sort(int *a,int length){
  function select_sort (line 28) | void select_sort(int *a,int length){
  function bubble_sort (line 59) | void bubble_sort(int *a, int length){
  function partion (line 83) | int partion(int *a, int start,int end){
  function quicksort (line 116) | void quicksort(int *a, int left, int right){
  function heap_swop (line 129) | void heap_swop(int *a,int *b){
  function heap_public_adjust (line 139) | void heap_public_adjust(int *a,int parent,int length){
  function heap_build (line 169) | void heap_build(int *a,int length){
  function heap_adjust (line 182) | void heap_adjust(int *a,int length){
  function heap_sort (line 188) | void heap_sort(int *a, int length){
  function merge_array (line 208) | void merge_array(int *a,int size_a,int *b, int size_b){
  function merge_sort (line 240) | void merge_sort(int *a, int length){
  function main (line 262) | int main(){

FILE: 9 Algorithms Job Interview/codes/1 string/char_first_appear_once.c
  function char_first_appear_once (line 3) | char char_first_appear_once(const unsigned char *source){
  function main (line 21) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/1 string/proc.c
  function main (line 30) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/1 string/replce_blank.c
  function main (line 27) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/1 string/revert_by_word.c
  function _reverse (line 3) | void _reverse(char *start,char *end){
  function main (line 49) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/1 string/string.c
  type BOOL (line 4) | typedef int BOOL;
  function revert (line 10) | void revert(const char *source,char *dest){
  function revertByWord (line 35) | void revertByWord(const char *src, char *dest){
  function BOOL (line 104) | BOOL symmetrical(const char *scr,int length){
  function first_appear_only_once (line 123) | char first_appear_only_once(const char *source){
  function max_symmetrical_char_length (line 163) | int max_symmetrical_char_length(const char *scr){
  function continumax (line 174) | int continumax(char *outputstr,char *intputstr){
  function continuousnum (line 181) | int continuousnum(const char *input, char *output){
  function longest_common_subsequence (line 192) | int longest_common_subsequence(const char *s1,const char *s2, char *comm...
  function BOOL (line 246) | BOOL isBrother(const char *first,const char *secd){
  function compress (line 259) | void compress(char *src){
  function filternum (line 299) | void filternum(char *src){
  function delete_character (line 330) | void delete_character(char *src , char target){
  function statistics (line 358) | void statistics(FILE *fd){
  function main (line 372) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/10.c
  function generate (line 5) | void generate(int a,int b,int N ,int * Q){
  function main (line 36) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/12.c
  function reorder (line 5) | void reorder(int *data, int length){
  function isEvenNum (line 34) | int isEvenNum(int n){
  function main (line 40) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/20.c
  function main (line 6) | int main()

FILE: 9 Algorithms Job Interview/codes/21.c
  function main (line 2) | int main()

FILE: 9 Algorithms Job Interview/codes/22.c
  function main (line 2) | int main()

FILE: 9 Algorithms Job Interview/codes/23.c
  function main (line 2) | int main()

FILE: 9 Algorithms Job Interview/codes/24.c
  function main (line 2) | int main()

FILE: 9 Algorithms Job Interview/codes/25.c
  function main (line 4) | int main()

FILE: 9 Algorithms Job Interview/codes/26.c
  function main (line 4) | int main()

FILE: 9 Algorithms Job Interview/codes/27.c
  function main (line 2) | int main()

FILE: 9 Algorithms Job Interview/codes/28.c
  function main (line 3) | int main()

FILE: 9 Algorithms Job Interview/codes/4 numer/Power.c
  function Power (line 3) | double Power(double base, int exponent)
  function main (line 15) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/4 numer/integer_to_bin.c
  function main (line 54) | int main(){

FILE: 9 Algorithms Job Interview/codes/4 numer/isSquare.c
  function isSquare (line 4) | int isSquare(unsigned integer){
  function main (line 29) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/4 numer/one_appear_count_by_binary.c
  function one_appear_count_by_binary (line 3) | int one_appear_count_by_binary(int num){
  function main (line 12) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/4 numer/string_to_integer.c
  function string_to_integer (line 5) | int string_to_integer(char *s,int length){
  function main (line 23) | int main(){

FILE: 9 Algorithms Job Interview/codes/4-1.c
  function main (line 3) | int main(){

FILE: 9 Algorithms Job Interview/codes/5 array/delete_occurence_character.c
  function main (line 17) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/5 array/factorial.c
  function factorial (line 5) | int factorial(int n){
  function main (line 13) | int main(){

FILE: 9 Algorithms Job Interview/codes/5 array/fibonacci.c
  function fibonacci (line 7) | int fibonacci(int n){
  function fibonacci2 (line 20) | int fibonacci2(int n){
  function main (line 45) | int main(){

FILE: 9 Algorithms Job Interview/codes/5 array/longest_continuious_number.c
  function longest_continuious_number (line 3) | int longest_continuious_number(const char *input,char *output){
  function main (line 44) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/5 array/print_continuous_sequence_sum.c
  function print_continuous_sequence_sum (line 6) | void print_continuous_sequence_sum(int n){// n=1,2
  function main (line 40) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/5.c
  function value_in_sequence (line 12) | unsigned long value_in_sequence(unsigned index){
  function main (line 20) | int main(){

FILE: 9 Algorithms Job Interview/codes/6 matrix/print_matrix.c
  function print_matrix_incircle (line 4) | void print_matrix_incircle(int *matrix,int rows,int cols,int start){
  function print_matrix (line 26) | void print_matrix(int *matrix,int rows,int cols){
  function main (line 38) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/7 bianrytree/binary_search.c
  function binary_search_first (line 5) | int binary_search_first(int *a,int length,int key){
  function binary_search_last (line 27) | int binary_search_last(int *a,int length,int key){
  function element_appear_times (line 49) | int element_appear_times(int *a,int length,int key){
  function main (line 58) | int main(){

FILE: 9 Algorithms Job Interview/codes/7 bianrytree/bt1.c
  type BSTree (line 6) | typedef struct BSTreeNode{
  function convertDoubleLinks (line 11) | void convertDoubleLinks(BSTree *root){
  function main (line 17) | int main(int argc, char const *argv[])

FILE: 9 Algorithms Job Interview/codes/7.c
  function main (line 4) | int main(){

FILE: 9 Algorithms Job Interview/codes/8.c
  function main (line 5) | int main(){

FILE: 9 Algorithms Job Interview/codes/c1.c
  function main (line 8) | int main()

FILE: 9 Algorithms Job Interview/codes/c10.c
  function main (line 2) | int main()

FILE: 9 Algorithms Job Interview/codes/c11-2.c
  function foobar1 (line 2) | void foobar1(void)
  function foobar2 (line 7) | void foobar2()
  function main (line 12) | int main()

FILE: 9 Algorithms Job Interview/codes/c11.c
  function foobar1 (line 2) | void foobar1(void)
  function foobar2 (line 7) | void foobar2()
  function main (line 12) | int main()

FILE: 9 Algorithms Job Interview/codes/c12.c
  function main (line 3) | int main()

FILE: 9 Algorithms Job Interview/codes/c13-2.c
  function main (line 4) | int main()

FILE: 9 Algorithms Job Interview/codes/c14.c
  function main (line 2) | int main()

FILE: 9 Algorithms Job Interview/codes/c15.c
  function size (line 4) | void size(int arr[SIZE])
  function main (line 9) | int main()

FILE: 9 Algorithms Job Interview/codes/c16.c
  function Error (line 5) | void Error(char* s)
  function main (line 11) | int main()

FILE: 9 Algorithms Job Interview/codes/c17.c
  function main (line 4) | int main()

FILE: 9 Algorithms Job Interview/codes/c18.c
  function main (line 2) | int main()

FILE: 9 Algorithms Job Interview/codes/c19.c
  function main (line 7) | int main()

FILE: 9 Algorithms Job Interview/codes/c2.c
  function OS_Solaris_print (line 3) | void OS_Solaris_print()
  function OS_Windows_print (line 8) | void OS_Windows_print()
  function OS_HP_UX_print (line 13) | void OS_HP_UX_print()
  function main (line 18) | int main()

FILE: 9 Algorithms Job Interview/codes/c20.c
  function main (line 1) | int main()

FILE: 9 Algorithms Job Interview/codes/c3.c
  function main (line 5) | int main()

FILE: 9 Algorithms Job Interview/codes/c4.c
  function main (line 3) | int main()

FILE: 9 Algorithms Job Interview/codes/c5.c
  function main (line 8) | int main()

FILE: 9 Algorithms Job Interview/codes/c6.c
  function main (line 2) | int main()

FILE: 9 Algorithms Job Interview/codes/c7.c
  function main (line 2) | int main()

FILE: 9 Algorithms Job Interview/codes/c8.c
  function main (line 4) | int main()

FILE: 9 Algorithms Job Interview/codes/c9.c
  function main (line 4) | int main()

FILE: 9 Algorithms Job Interview/codes/most_visit_ip.c
  function hash (line 13) | int hash(unsigned i){
  function main (line 17) | int main(){