SYMBOL INDEX (159 symbols across 49 files)

FILE: Algorithm/BSTSearch.h
  function Status (line 16) | Status SearchBST(BiTree T, KeyType key, BiTree f, BiTree &p){

FILE: Algorithm/BinarySearch.h
  function BinarySearch (line 5) | int BinarySearch(vector<int> v, int value , int low, int high) {
  function BinarySearch2 (line 26) | int BinarySearch2(vector<int> v, int value, int low, int high)

FILE: Algorithm/BubbleSort.h
  function BubbleSort (line 14) | void BubbleSort(vector<int>& v) {
  function BubbleSort_orderly (line 32) | void BubbleSort_orderly(vector<int>& v) {

FILE: Algorithm/BucketSort.cpp
  type ListNode (line 23) | struct ListNode{
    method ListNode (line 24) | explicit ListNode(int i=0):mData(i),mNext(NULL){}
  function ListNode (line 29) | ListNode* insert(ListNode* head,int val){
    method ListNode (line 24) | explicit ListNode(int i=0):mData(i),mNext(NULL){}
  function ListNode (line 46) | ListNode* Merge(ListNode *head1,ListNode *head2){
    method ListNode (line 24) | explicit ListNode(int i=0):mData(i),mNext(NULL){}
  function BucketSort (line 65) | void BucketSort(int n,int arr[]){

FILE: Algorithm/CountSort.cpp
  function CountSort (line 27) | void CountSort(vector<int>& vecRaw, vector<int>& vecObj)
  function main (line 50) | int main()

FILE: Algorithm/FibonacciSearch.cpp
  function Fibonacci (line 11) | void Fibonacci(int * F)
  function FibonacciSearch (line 20) | int FibonacciSearch(int *a, int n, int key)  //a为要查找的数组,n为要查找的数组长度,key为要...
  function main (line 64) | int main()

FILE: Algorithm/HeapSort.cpp
  function max_heapify (line 7) | void max_heapify(int arr[], int start, int end) {
  function heap_sort (line 24) | void heap_sort(int arr[], int len) {
  function main (line 35) | int main() {

FILE: Algorithm/InsertSort.h
  function InsertSort (line 16) | void InsertSort(vector<int>& v)

FILE: Algorithm/InsertionSearch.h
  function InsertionSearch (line 2) | int InsertionSearch(int a[], int value, int low, int high)

FILE: Algorithm/QuickSort.h
  function QuickSort (line 15) | void QuickSort(vector<int>& v, int low, int high) {
  type Range (line 75) | struct Range {

FILE: Algorithm/RadixSort.h
  function maxbit (line 3) | int maxbit(int data[], int n) //辅助函数，求数据的最大位数
  function radixsort (line 33) | void radixsort(int data[], int n) //基数排序

FILE: Algorithm/SelectionSort.h
  function SelectionSort (line 13) | void SelectionSort(vector<int>& v) {

FILE: Algorithm/SequentialSearch.h
  function SequentialSearch (line 2) | int SequentialSearch(vector<int>& v, int k) {
  function BetterSequentialSearch (line 13) | int BetterSequentialSearch(vector<int>& v, int k) {

FILE: DataStructure/BinaryTree.cpp
  type BiTNode (line 20) | struct BiTNode
    type BiTNode (line 23) | struct BiTNode
  function InitBiTree (line 27) | void InitBiTree(BiTree &T)
  function BiTree (line 33) | BiTree MakeBiTree(TElemType e, BiTree L, BiTree R)
  function Status (line 45) | Status visit(TElemType e)
  function Leaves (line 52) | int Leaves(BiTree T)
  function depTraverse (line 67) | int depTraverse(BiTree T)
  function levTraverse (line 77) | void levTraverse(BiTree T, Status(*visit)(TElemType e), int lev)
  function InOrderTraverse (line 88) | void InOrderTraverse(BiTree T, Status(*visit)(TElemType e), int &num)
  function Status (line 100) | Status BiTreeEmpty(BiTree T)
  function Status (line 107) | Status BreakBiTree(BiTree &T, BiTree &L, BiTree &R)
  function Status (line 118) | Status ReplaceLeft(BiTree &T, BiTree &LT)
  function Status (line 129) | Status ReplaceRight(BiTree &T, BiTree &RT)
  function UnionBiTree (line 140) | void UnionBiTree(BiTree &Ttemp)
  function main (line 149) | int main()

FILE: DataStructure/HashTable.cpp
  function Status (line 32) | Status InitHashTable(HashTable &H, int size) {
  function Hash (line 48) | int Hash(KeyType key, int m) {
  function collision (line 53) | void collision(int &p, int m) {
  function Status (line 58) | Status SearchHash(HashTable H, KeyType key, int &p, int &c) {
  function printHash (line 71) | void printHash(HashTable H)
  function Status (line 88) | Status recreateHash(HashTable &H) {
  function Status (line 106) | Status InsertHash(HashTable &H, KeyType key) {
  function Status (line 122) | Status DeleteHash(HashTable &H, KeyType key) {
  function main (line 133) | int main()

FILE: DataStructure/LinkList.cpp
  type LNode (line 27) | struct LNode {
    type LNode (line 29) | struct LNode
  function Status (line 33) | Status create(LinkList &L, ElemType *data, int n) {
  function Status (line 53) | Status EnQueue_LQ(LinkList &L, ElemType &e) {
  function Status (line 74) | Status DeQueue_LQ(LinkList &L, ElemType &e) {
  function Status (line 85) | Status visit(ElemType e) {
  function ListTraverse_L (line 91) | void ListTraverse_L(LinkList L, Status(*visit)(ElemType e))
  function main (line 99) | int main() {

FILE: DataStructure/LinkList_with_head.cpp
  type LNode (line 27) | struct LNode {
    type LNode (line 29) | struct LNode
  function Status (line 33) | Status create(LinkList &L, ElemType *data, int n) {
  function Status (line 57) | Status EnQueue_LQ(LinkList &L, ElemType &e) {
  function Status (line 87) | Status DeQueue_LQ(LinkList &L, ElemType &e) {
  function Status (line 98) | Status visit(ElemType e) {
  function ListTraverse_L (line 104) | void ListTraverse_L(LinkList L, Status(*visit)(ElemType e))
  function main (line 112) | int main() {

FILE: DataStructure/RedBlackTree.cpp
  class bst (line 7) | class bst {
    type Node (line 10) | struct Node {
      method Node (line 15) | Node() : value(0), color(RED), leftTree(NULL), rightTree(NULL), pare...
      method Node (line 17) | Node* grandparent() {
      method Node (line 24) | Node* uncle() {
      method Node (line 34) | Node* sibling() {
    method rotate_right (line 42) | void rotate_right(Node *p) {
    method rotate_left (line 67) | void rotate_left(Node *p) {
    method inorder (line 95) | void inorder(Node *p) {
    method string (line 108) | string outputColor(bool color) {
    method Node (line 112) | Node* getSmallestChild(Node *p) {
      method Node (line 15) | Node() : value(0), color(RED), leftTree(NULL), rightTree(NULL), pare...
      method Node (line 17) | Node* grandparent() {
      method Node (line 24) | Node* uncle() {
      method Node (line 34) | Node* sibling() {
    method delete_child (line 118) | bool delete_child(Node *p, int data) {
    method delete_one_child (line 147) | void delete_one_child(Node *p) {
    method delete_case (line 182) | void delete_case(Node *p) {
    method insert (line 233) | void insert(Node *p, int data) {
    method insert_case (line 260) | void insert_case(Node *p) {
    method DeleteTree (line 299) | void DeleteTree(Node *p) {
    method bst (line 309) | bst() {
    method inorder (line 321) | void inorder() {
    method insert (line 328) | void insert(int x) {
    method delete_value (line 340) | bool delete_value(int data) {
  function main (line 347) | int main()

FILE: DataStructure/SqList.cpp
  function Status (line 36) | Status InitList_Sq(SqList &L, int size, int inc) {
  function Status (line 46) | Status DestroyList_Sq(SqList &L) {
  function Status (line 53) | Status ClearList_Sq(SqList &L) {
  function Status (line 59) | Status ListEmpty_Sq(SqList L) {
  function ListLength_Sq (line 65) | int ListLength_Sq(SqList L) {
  function Status (line 70) | Status GetElem_Sq(SqList L, int i, ElemType &e) {
  function Search_Sq (line 77) | int Search_Sq(SqList L, ElemType e) {
  function Status (line 85) | Status visit(ElemType e) {
  function Status (line 91) | Status ListTraverse_Sq(SqList L, Status(*visit)(ElemType e)) {
  function Status (line 100) | Status PutElem_Sq(SqList &L, int i, ElemType e) {
  function Status (line 108) | Status Append_Sq(SqList &L, ElemType e) {
  function Status (line 116) | Status DeleteLast_Sq(SqList &L, ElemType &e) {
  function main (line 123) | int main() {

FILE: DataStructure/SqStack.cpp
  function Status (line 36) | Status InitStack_Sq(SqSrack &S, int size, int inc) {
  function Status (line 46) | Status DestroyStack_Sq(SqSrack &S) {
  function Status (line 53) | Status StackEmpty_Sq(SqSrack S) {
  function ClearStack_Sq (line 59) | void ClearStack_Sq(SqSrack &S) {
  function Status (line 66) | Status Push_Sq(SqSrack &S, ElemType e) {
  function Status (line 79) | Status GetTop_Sq(SqSrack S, ElemType &e) {
  function Status (line 86) | Status Pop_Sq(SqSrack &S, ElemType &e) {
  function main (line 93) | int main() {

FILE: DesignPattern/AbstractFactoryPattern/Factory.cpp
  function Factory (line 8) | Factory* Factory::CreateFactory(FACTORY_TYPE factory)

FILE: DesignPattern/AbstractFactoryPattern/Factory.h
  function class (line 11) | class Factory {

FILE: DesignPattern/AbstractFactoryPattern/FactoryMain.cpp
  function FactoryMain (line 11) | void FactoryMain()

FILE: DesignPattern/AbstractFactoryPattern/concrete_factory.h
  function class (line 12) | class BenzFactory : public Factory
  function class (line 26) | class BmwFactory : public Factory
  function class (line 39) | class AudiFactory : public Factory

FILE: DesignPattern/AbstractFactoryPattern/concrete_product.h
  function class (line 12) | class BenzCar : public ICar
  function class (line 22) | class BmwCar : public ICar
  function class (line 32) | class AudiCar : public ICar
  function class (line 43) | class BenzBike : public IBike
  function class (line 53) | class BmwBike : public IBike
  function class (line 63) | class AudiBike : public IBike

FILE: DesignPattern/AbstractFactoryPattern/product.h
  function class (line 12) | class ICar
  function class (line 19) | class IBike

FILE: DesignPattern/AdapterPattern/AdapterMain.h
  function AdapterMain (line 10) | void AdapterMain()

FILE: DesignPattern/AdapterPattern/adaptee.h
  function class (line 11) | class OwnCharger

FILE: DesignPattern/AdapterPattern/adapter.h
  function class (line 16) | class PowerAdapter : public IRussiaSocket

FILE: DesignPattern/AdapterPattern/target.h
  function class (line 9) | class IRussiaSocket

FILE: DesignPattern/BridgePattern/BridgeMain.cpp
  function BridgeMain (line 7) | void BridgeMain()

FILE: DesignPattern/BridgePattern/abstraction.h
  function class (line 11) | class ISwitch

FILE: DesignPattern/BridgePattern/concrete_implementor.h
  function class (line 12) | class Light : public IElectricalEquipment
  function class (line 28) | class Fan : public IElectricalEquipment

FILE: DesignPattern/BridgePattern/implementor.h
  function class (line 9) | class IElectricalEquipment

FILE: DesignPattern/BridgePattern/refined_abstraction.h
  function class (line 12) | class PullChainSwitch : public ISwitch
  function class (line 33) | class TwoPositionSwitch : public ISwitch

FILE: DesignPattern/ObserverPattern/ObserverMain.cpp
  function ObserverMain (line 7) | void ObserverMain()

FILE: DesignPattern/ObserverPattern/concrete_observer.h
  function class (line 12) | class ConcreteObserver : public IObserver
  function Update (line 16) | void Update(float price)

FILE: DesignPattern/ObserverPattern/concrete_subject.h
  function class (line 14) | class  ConcreteSubject : public ISubject

FILE: DesignPattern/ObserverPattern/observer.h
  function class (line 9) | class IObserver

FILE: DesignPattern/ObserverPattern/subject.h
  function class (line 10) | class ISubject

FILE: DesignPattern/SingletonPattern/Singleton.h
  function class (line 9) | class Singleton {

FILE: DesignPattern/SingletonPattern/SingletonMain.h
  function SingletonMain (line 10) | void SingletonMain()

FILE: DesignPattern/main.cpp
  function main (line 12) | int main() {

FILE: Problems/ChessboardCoverageProblem/ChessboardCoverage.cpp
  function main (line 13) | int main() {
  function ChessBoard (line 93) | void ChessBoard(int num_BoardTopLeftRow, int num_BoardTopLeftColumn, int...

FILE: Problems/KnapsackProblem/pack.cpp
  function max (line 8) | int max(int a, int b) {
  function packIterative (line 13) | int packIterative(int n, int W, int *w, int *v) {
  function packRecursive (line 34) | int packRecursive(int n, int W, int *w, int *v) {
  function printT (line 50) | void printT(int n, int W)
  function main (line 69) | int main() {

FILE: Problems/NeumannNeighborProblem/Formula/Neumann2_3_12.cpp
  function Neumann2_3_12 (line 4) | int Neumann2_3_12(int n) {
  function main (line 10) | int main() {

FILE: Problems/NeumannNeighborProblem/Recursive/Neumann2_4_12.cpp
  function Neumann2_4_12 (line 4) | int Neumann2_4_12(int n) {
  function main (line 13) | int main() {

FILE: Problems/RoundRobinProblem/MatchTable.cpp
  function main (line 9) | int main()
  function MatchTable (line 68) | void MatchTable(int k, int n, int **table)

FILE: Problems/TubingProblem/Tubing.cpp
  function quick_sort (line 8) | void quick_sort(int low, int high)
  function main (line 38) | int main()