SYMBOL INDEX (287 symbols across 42 files)

FILE: Code/C-Code/head/head.h
  type element_type (line 8) | typedef char element_type;

FILE: Code/C-Code/head/link_list.h
  type LinkListNode (line 6) | typedef struct LinkListNode {
  function InitLinkListWithHead (line 13) | int InitLinkListWithHead(LinkList list) {
  function InitLinkListWithoutHead (line 27) | int InitLinkListWithoutHead(LinkList list) {
  function LinkList (line 33) | LinkList CreateLinkListWithHead() {
  function LinkList (line 46) | LinkList CreateLinkListWithoutHead() {
  function EmptyLinkListWithHead (line 52) | int EmptyLinkListWithHead(LinkList list) {
  function EmptyLLinkListWithoutHead (line 62) | int EmptyLLinkListWithoutHead(LinkList list) {
  function InsertLinkListWithHead (line 73) | int InsertLinkListWithHead(LinkList list, int index, element_type elem) {
  function InsertLinkListWithoutHead (line 112) | int InsertLinkListWithoutHead(LinkList list, int index, element_type ele...

FILE: Code/C-Code/head/sequence_list.h
  type StaticSequenceList (line 9) | typedef struct {
  type DynamicSequenceList (line 16) | typedef struct {
  function InitStaticSequenceList (line 26) | int InitStaticSequenceList(StaticSequenceList* list) {
  function InitDynamicSequenceList (line 39) | int InitDynamicSequenceList(DynamicSequenceList* list) {
  function PrintfStaticSequenceList (line 63) | int PrintfStaticSequenceList(StaticSequenceList list) {
  function PrintfDynamicSequenceList (line 71) | int PrintfDynamicSequenceList(DynamicSequenceList list) {
  function OtherIncreaseDynamicSequenceList (line 79) | int OtherIncreaseDynamicSequenceList(DynamicSequenceList* list, int len) {
  function ReIncreaseDynamicSequenceList (line 105) | int ReIncreaseDynamicSequenceList(DynamicSequenceList* list, int len) {
  function InsertStaticSequenceList (line 127) | int InsertStaticSequenceList(StaticSequenceList* list, int index, elemen...
  function InsertDynamicSequenceList (line 148) | int InsertDynamicSequenceList(DynamicSequenceList* list, int index, elem...
  function LoopInsertStaticSequenceList (line 171) | int LoopInsertStaticSequenceList(StaticSequenceList* list, element_type*...
  function LoopInsertDynamicSequenceList (line 183) | int LoopInsertDynamicSequenceList(DynamicSequenceList* list, element_typ...
  function DeleteStaticSequenceList (line 195) | int DeleteStaticSequenceList(StaticSequenceList* list, int index, elemen...
  function DeleteDynamicSequenceList (line 209) | int DeleteDynamicSequenceList(DynamicSequenceList* list, int index, elem...
  function MultiDeleteStaticSequenceList (line 223) | int MultiDeleteStaticSequenceList(StaticSequenceList* list, int index, i...
  function MultiDeleteDynamicSequenceList (line 239) | int MultiDeleteDynamicSequenceList(DynamicSequenceList* list, int index,...
  function element_type (line 255) | element_type GetStaticSequenceListElement(StaticSequenceList list, int i...
  function element_type (line 264) | element_type GetDynamicSequenceListElement(DynamicSequenceList list, int...
  function LocateStaticSequenceListElement (line 273) | int LocateStaticSequenceListElement(StaticSequenceList list, element_typ...
  function LocateDynamicSequenceListElement (line 284) | int LocateDynamicSequenceListElement(DynamicSequenceList list, element_t...
  function EmptyStaticSequenceList (line 295) | int EmptyStaticSequenceList(StaticSequenceList list) {
  function EmptyDynamicSequenceList (line 305) | int EmptyDynamicSequenceList(DynamicSequenceList list) {
  function DestroyDynamicSequenceList (line 315) | int DestroyDynamicSequenceList(DynamicSequenceList* list) {

FILE: Code/C-Code/source/main.c
  function main (line 5) | int main()

FILE: Code/C-Code/source/test.c
  function SequenceListTest (line 6) | int SequenceListTest() {
  function LinkListTest (line 33) | int LinkListTest() {

FILE: Code/CPP-Code/head/double_link_list.h
  function class (line 4) | class DoubleLinkListNode {
  function SetNext (line 60) | bool DoubleLinkListNode::SetNext(DoubleLinkListNode *next) {
  function Destory (line 93) | bool DoubleLinkListNode::Destory() {

FILE: Code/CPP-Code/head/dynamic_sequence_list.h
  function class (line 4) | class DynamicSequenceList : public SequenceList {
  function OtherIncrease (line 29) | bool DynamicSequenceList::OtherIncrease(int length) {
  function ReIncrease (line 49) | bool DynamicSequenceList::ReIncrease(int length) {
  function Insert (line 70) | bool DynamicSequenceList::Insert(int index, element_type elem) {

FILE: Code/CPP-Code/head/head.h
  type element_type (line 8) | typedef char element_type;

FILE: Code/CPP-Code/head/link_list.h
  function class (line 10) | class LinkListNode {
  function Destory (line 73) | bool LinkListNode::Destory() {
  function class (line 82) | class LinkList {
  function SetLength (line 155) | bool LinkList::SetLength() {
  function SetLength (line 160) | bool LinkList::SetLength(int length) {
  function SetType (line 169) | bool LinkList::SetType(bool type) {
  function element_type (line 183) | element_type LinkList::GetElem(int index) {
  function Locate (line 196) | int LinkList::Locate(element_type elem) {
  function PriorInsert (line 212) | bool LinkList::PriorInsert(element_type *elem, int start, int length) {
  function NextInsert (line 236) | bool LinkList::NextInsert(element_type *elem, int start, int length) {
  function element_type (line 260) | element_type LinkList::Delete(int index) {
  function Destroy (line 264) | bool LinkList::Destroy() {

FILE: Code/CPP-Code/head/link_list_with_head.h
  function class (line 3) | class LinkListWithHead : public LinkList

FILE: Code/CPP-Code/head/link_list_without_head.h
  function class (line 3) | class LinkListWithoutHead : public LinkList

FILE: Code/CPP-Code/head/link_queue.h
  function class (line 5) | class LinkQueueNode {
  function SetData (line 41) | bool LinkQueueNode::SetData(element_type elem) {
  function SetNext (line 50) | bool LinkQueueNode::SetNext(LinkQueueNode *next) {
  function class (line 60) | class LinkQueue {
  function SetRear (line 110) | bool LinkQueue::SetRear(LinkQueueNode *rear) {
  function SetLength (line 119) | bool LinkQueue::SetLength() {
  function SetLength (line 124) | bool LinkQueue::SetLength(int length) {
  function Enter (line 144) | bool LinkQueue::Enter(element_type elem) {
  function element_type (line 154) | element_type LinkQueue::Depart() {

FILE: Code/CPP-Code/head/link_stack.h
  function class (line 6) | class LinkStackNode {
  function Destroy (line 71) | bool LinkStackNode::Destroy() {

FILE: Code/CPP-Code/head/link_string.h
  function class (line 4) | class LinkStringNode {
  function SetData (line 46) | bool LinkStringNode::SetData() {
  function SetData (line 51) | bool LinkStringNode::SetData(int data_size) {
  function SetData (line 56) | bool LinkStringNode::SetData(char *character) {
  function SetData (line 61) | bool LinkStringNode::SetData(int index, char character) {
  function GetData (line 70) | char LinkStringNode::GetData(int index) {
  function SetNext (line 74) | bool LinkStringNode::SetNext() {
  function SetNext (line 79) | bool LinkStringNode::SetNext(LinkStringNode *next) {
  function class (line 123) | class LinkString {
  function SetRear (line 183) | bool LinkString::SetRear() {
  function SetRear (line 188) | bool LinkString::SetRear(LinkStringNode *rear) {
  function SetDataSize (line 197) | bool LinkString::SetDataSize() {
  function SetDataSize (line 202) | bool LinkString::SetDataSize(int data_size) {
  function SetLength (line 211) | bool LinkString::SetLength() {
  function SetLength (line 216) | bool LinkString::SetLength(int length) {

FILE: Code/CPP-Code/head/sequence_list.h
  function class (line 13) | class SequenceList {
  function LoopInsert (line 169) | bool SequenceList::LoopInsert(element_type *elem, int index, int length) {
  function element_type (line 181) | element_type SequenceList::Delete(int index) {
  function element_type (line 211) | element_type SequenceList::GetElem(int index) const {
  function Locate (line 221) | int SequenceList::Locate(element_type elem) const {

FILE: Code/CPP-Code/head/sequence_queue.h
  function class (line 4) | class SequenceQueue {
  function _max_size (line 11) | int _max_size{}
  function GetFront (line 34) | int GetFront() const;
  function SetData (line 91) | bool SequenceQueue::SetData(int max_size) {
  function SetData (line 96) | bool SequenceQueue::SetData(element_type *elem) {
  function SetData (line 101) | bool SequenceQueue::SetData(int index, element_type elem) {
  function element_type (line 110) | element_type SequenceQueue::GetData(int index) {
  function SetFront (line 114) | bool SequenceQueue::SetFront() {
  function SetFront (line 119) | bool SequenceQueue::SetFront(int front) {
  function SetRear (line 128) | bool SequenceQueue::SetRear() {
  function SetRear (line 133) | bool SequenceQueue::SetRear(int rear) {
  function SetMaxSize (line 142) | bool SequenceQueue::SetMaxSize() {
  function SetMaxSize (line 147) | bool SequenceQueue::SetMaxSize(int max_size) {
  function GetMaxSize (line 178) | bool SequenceQueue::FullCircular() const {
  function EnterCircular (line 192) | bool SequenceQueue::EnterCircular(element_type elem) {
  function element_type (line 202) | element_type SequenceQueue::Depart() {
  function element_type (line 212) | element_type SequenceQueue::DepartCircular() {
  function element_type (line 226) | element_type SequenceQueue::Head() {

FILE: Code/CPP-Code/head/sequence_stack.h
  function class (line 6) | class SequenceStack {

FILE: Code/CPP-Code/head/sequence_string.h
  function class (line 4) | class SequenceString {

FILE: Code/CPP-Code/head/share_stack.h
  function class (line 4) | class ShareStack{
  function _max_size (line 11) | int _max_size{}
  function GetTopLeft (line 34) | int GetTopLeft() const;
  function SetData (line 97) | bool ShareStack::SetData(element_type *data) {
  function SetData (line 102) | bool ShareStack::SetData(int max_size) {
  function SetData (line 107) | bool ShareStack::SetData(int index, element_type elem) {
  function element_type (line 116) | element_type ShareStack::GetData(int index) {
  function SetTopLeft (line 120) | bool ShareStack::SetTopLeft() {
  function SetTopRight (line 125) | bool ShareStack::SetTopRight() {
  function SetTopLeft (line 130) | bool ShareStack::SetTopLeft(int top) {
  function SetTopRight (line 135) | bool ShareStack::SetTopRight(int top) {
  function SetMaxSize (line 148) | bool ShareStack::SetMaxSize() {
  function SetMaxSize (line 153) | bool ShareStack::SetMaxSize(int max_size) {
  function PushLeft (line 196) | bool ShareStack::PushLeft(element_type elem) {
  function PushRight (line 207) | bool ShareStack::PushRight(element_type elem) {
  function element_type (line 217) | element_type ShareStack::PopLeft() {
  function element_type (line 228) | element_type ShareStack::PopRight() {
  function element_type (line 239) | element_type ShareStack::TopLeft() {
  function element_type (line 248) | element_type ShareStack::TopRight() {

FILE: Code/CPP-Code/head/static_link_list.h
  function _next (line 8) | int _next{}
  function element_type (line 13) | element_type GetData() const;
  function SetNext (line 39) | bool StaticLinkListNode::SetNext(int index) {
  function Destroy (line 63) | bool StaticLinkListNode::Destroy() {
  function _length (line 74) | int _length{}
  function _max_size (line 76) | int _max_size{}
  function GetFirst (line 85) | int GetFirst() const;
  function SetLength (line 117) | bool StaticLinkList::SetLength() {
  function SetLength (line 122) | bool StaticLinkList::SetLength(int length) {
  function SetMaxSize (line 131) | bool StaticLinkList::SetMaxSize(int max_size) {

FILE: Code/CPP-Code/head/static_sequence_list.h
  function class (line 4) | class StaticSequenceList : public SequenceList {
  function Insert (line 23) | bool StaticSequenceList::Insert(int index, element_type elem) {

FILE: Code/CPP-Code/source/main.cpp
  function main (line 4) | int main()

FILE: Code/CPP-Code/source/test.cpp
  function SequenceListTest (line 12) | bool SequenceListTest() {
  function LinkListTest (line 28) | bool LinkListTest() {
  function StaticLinkListTest (line 54) | bool StaticLinkListTest(){

FILE: Code/Code/head/double_link_list.h
  type DoubleLinkListNode (line 4) | typedef struct DoubleLinkListNode{
  function DoubleLinkList (line 12) | DoubleLinkList InitDoubleLinkList(){
  function DestroyDoubleLinkList (line 21) | bool DestroyDoubleLinkList(DoubleLinkList &list){

FILE: Code/Code/head/graph.h
  type AdjacentArrayGraph (line 4) | typedef struct {
  type EdgeNode (line 17) | typedef struct EdgeNode{
  type VexNode (line 27) | typedef struct VexNode{
  type AdjacentListGraph (line 35) | typedef struct {

FILE: Code/Code/head/head.h
  type element_type (line 12) | typedef char element_type;
  type weight_type (line 14) | typedef int weight_type;
  type elem_type (line 16) | typedef int elem_type;

FILE: Code/Code/head/link_list.h
  type LinkListNode (line 4) | typedef struct LinkListNode {
  function InitLinkList (line 10) | bool InitLinkList(LinkList &list) {
  function LinkList (line 16) | LinkList InitLinkList() {
  function EmptyLinkList (line 24) | bool EmptyLinkList(LinkList list) {
  function TypeLinkList (line 29) | bool TypeLinkList(LinkList list) {
  function PrintLinkList (line 43) | bool PrintLinkList(LinkList list) {
  function InsertLinkListWithHead (line 60) | bool InsertLinkListWithHead(LinkList &list, int index, element_type elem) {
  function InsertLinkListWithoutHead (line 96) | bool InsertLinkListWithoutHead(LinkList &list, int index, element_type e...
  function NextInsertLinkList (line 140) | bool NextInsertLinkList(LinkList &list, element_type *elem, int start, i...
  function PriorInsertLinkList (line 162) | bool PriorInsertLinkList(LinkList &list, element_type *elem, int start, ...
  function GetLengthLinkList (line 289) | int GetLengthLinkList(LinkList list) {
  function element_type (line 300) | element_type GetLinkListElem(LinkList list, int index) {
  function LocateLinkList (line 313) | int LocateLinkList(LinkList list, element_type elem) {
  function DestroyLinkList (line 325) | bool DestroyLinkList(LinkList &list) {

FILE: Code/Code/head/link_queue.h
  type LinkQueueNode (line 4) | typedef struct LinkQueueNode {
  type LinkQueue (line 12) | typedef struct {
  function InitLinkQueue (line 18) | bool InitLinkQueue(LinkQueue &queue){
  function LinkQueue (line 27) | LinkQueue InitLinkQueue(){
  function EmptyLinkQueue (line 37) | bool EmptyLinkQueue(LinkQueue queue){
  function EnterLinkQueue (line 42) | bool EnterLinkQueue(LinkQueue &queue, element_type elem){
  function element_type (line 55) | element_type DepartLinkQueue(LinkQueue &queue){

FILE: Code/Code/head/link_stack.h
  type LinkStackNode (line 4) | struct LinkStackNode{
  function LinkStack (line 12) | LinkStack InitLinkStack(){
  function InitLinkStack (line 19) | bool InitLinkStack(LinkStack &stack){
  function EmptyLinkStack (line 26) | bool EmptyLinkStack(LinkStack stack){

FILE: Code/Code/head/link_string.h
  type LinkStringNode (line 4) | typedef struct LinkStringNode {
  function InitLinkString (line 11) | bool InitLinkString(LinkString &string) {
  function LinkString (line 17) | LinkString InitLinkString() {

FILE: Code/Code/head/link_tree.h
  function CompareElem (line 6) | int CompareElem(element_type elem1, element_type elem2){
  type BinaryTreeNode (line 11) | typedef struct BinaryTreeNode {
  function PreOrderBinaryTree (line 17) | bool PreOrderBinaryTree(BinaryTree &tree, bool( *function)(BinaryTree &)) {
  function InOrderBinaryTree (line 28) | bool InOrderBinaryTree(BinaryTree &tree, bool(*function)(BinaryTree &)) {
  function PostOrderBinaryTree (line 39) | bool PostOrderBinaryTree(BinaryTree &tree, bool(*function)(BinaryTree &)) {
  function PreOrderNonRecursiveBinaryTree (line 50) | bool PreOrderNonRecursiveBinaryTree(BinaryTree &tree, bool(*function)(Bi...
  function InOrderNonRecursiveBinaryTree (line 84) | bool InOrderNonRecursiveBinaryTree(BinaryTree &tree, bool(*function)(Bin...
  function LevelOrderBinaryTree (line 118) | bool LevelOrderBinaryTree(BinaryTree &tree, bool(*function)(BinaryTree &...
  function BinaryTreeNode (line 147) | BinaryTreeNode *SearchBinarySortTree(BinaryTree tree, element_type elem) {
  function InsertBinarySortTree (line 161) | bool InsertBinarySortTree(BinaryTree &tree, element_type elem) {
  function CreateBinarySortTree (line 185) | bool CreateBinarySortTree(BinaryTree &tree, element_type* elem, int star...

FILE: Code/Code/head/search.h
  type LinearTable (line 4) | typedef struct {
  function SequenceSearch (line 10) | int SequenceSearch(LinearTable table, elem_type key) {
  function BinarySearch (line 19) | int BinarySearch(LinearTable table, elem_type key) {

FILE: Code/Code/head/sequence_list.h
  type StaticSequenceList (line 4) | typedef struct {
  type DynamicSequenceList (line 10) | typedef struct {
  function InitSequenceList (line 16) | bool InitSequenceList(StaticSequenceList &list) {
  function InitSequenceList (line 22) | bool InitSequenceList(StaticSequenceList &list, int max_size) {
  function StaticSequenceList (line 28) | StaticSequenceList InitStaticSequenceList() {
  function StaticSequenceList (line 35) | StaticSequenceList InitStaticSequenceList(int max_size) {
  function InitSequenceList (line 42) | bool InitSequenceList(DynamicSequenceList &list) {
  function InitSequenceList (line 49) | bool InitSequenceList(DynamicSequenceList &list, int max_size) {
  function DynamicSequenceList (line 56) | DynamicSequenceList InitDynamicSequenceList() {
  function DynamicSequenceList (line 64) | DynamicSequenceList InitDynamicSequenceList(int max_size) {
  function IncreaseSequenceList (line 82) | bool IncreaseSequenceList(DynamicSequenceList &list, int length) {
  function InsertSequenceList (line 104) | bool InsertSequenceList(StaticSequenceList &list, int index, element_typ...
  function InsertSequenceList (line 124) | bool InsertSequenceList(DynamicSequenceList &list, int index, element_ty...
  function DestroyDynamicSequenceList (line 215) | int DestroyDynamicSequenceList(DynamicSequenceList &list) {

FILE: Code/Code/head/sequence_queue.h
  type SequenceQueue (line 4) | typedef struct {
  function InitSequenceQueue (line 14) | bool InitSequenceQueue(SequenceQueue &queue) {
  function InitSequenceQueue (line 22) | bool InitSequenceQueue(SequenceQueue &queue, int max_size) {
  function SequenceQueue (line 30) | SequenceQueue InitSequenceQueue() {
  function SequenceQueue (line 39) | SequenceQueue InitSequenceQueue(int max_size) {
  function EmptySequenceQueue (line 49) | bool EmptySequenceQueue(SequenceQueue queue) {
  function FullSequenceQueue (line 54) | bool FullSequenceQueue(SequenceQueue queue) {
  function FullCircularSequenceQueue (line 59) | bool FullCircularSequenceQueue(SequenceQueue queue) {
  function EnterSequenceQueue (line 64) | bool EnterSequenceQueue(SequenceQueue &queue, element_type elem) {
  function EnterCircularSequenceQueue (line 75) | bool EnterCircularSequenceQueue(SequenceQueue &queue, element_type elem) {
  function element_type (line 87) | element_type DepartSequenceQueue(SequenceQueue &queue) {
  function element_type (line 97) | element_type DepartCircularDepartSequence(SequenceQueue &queue) {
  function LengthSequenceQueue (line 109) | int LengthSequenceQueue(SequenceQueue queue) {
  function element_type (line 114) | element_type HeadSequenceQueue(SequenceQueue &queue) {

FILE: Code/Code/head/sequence_stack.h
  type SequenceStack (line 4) | typedef struct SequenceStack {
  function InitSequenceStack (line 14) | bool InitSequenceStack(SequenceStack &stack) {
  function InitSequenceStack (line 21) | bool InitSequenceStack(SequenceStack &stack, int max_size) {
  function SequenceStack (line 28) | SequenceStack InitSequenceStack(){
  function SequenceStack (line 36) | SequenceStack InitSequenceStack(int max_size){
  function EmptySequenceStack (line 45) | bool EmptySequenceStack(SequenceStack stack) {
  function FullSequenceStack (line 50) | bool FullSequenceStack(SequenceStack stack) {
  function LengthSequenceStack (line 55) | int LengthSequenceStack(SequenceStack stack) {
  function PushSequenceStack (line 60) | bool PushSequenceStack(SequenceStack &stack, element_type elem){
  function element_type (line 71) | element_type PopSequenceStack(SequenceStack &stack){
  function element_type (line 81) | element_type TopSequenceStack(SequenceStack stack){

FILE: Code/Code/head/sequence_string.h
  type SequenceString (line 4) | typedef struct {
  function InitSequenceString (line 13) | bool InitSequenceString(SequenceString &string) {
  function InitSequenceString (line 20) | bool InitSequenceString(SequenceString &string, int max_size) {
  function SequenceString (line 27) | SequenceString InitSequenceString() {
  function SequenceString (line 35) | SequenceString InitSequenceString(int max_size) {
  function LocateSimple (line 44) | int LocateSimple(SequenceString string, SequenceString pattern) {
  function LocateKMP (line 101) | int LocateKMP(SequenceString string, SequenceString pattern, const int *...
  function LocateKMP (line 121) | int LocateKMP(SequenceString string, SequenceString pattern) {
  function DestroySequenceString (line 142) | bool DestroySequenceString(SequenceString &string) {

FILE: Code/Code/head/share_stack.h
  type ShareStack (line 3) | typedef struct {
  function InitShareStack (line 13) | bool InitShareStack(ShareStack &stack) {
  function InitShareStack (line 21) | bool InitShareStack(ShareStack &stack, int max_size) {
  function ShareStack (line 29) | ShareStack InitShareStack() {
  function ShareStack (line 38) | ShareStack InitShareStack(int max_size) {
  function EmptyLeftShareStack (line 48) | bool EmptyLeftShareStack(ShareStack stack){
  function EmptyRightShareStack (line 53) | bool EmptyRightShareStack(ShareStack stack){
  function FullShareStack (line 58) | bool FullShareStack(ShareStack stack){
  function LengthLeftShareStack (line 63) | int LengthLeftShareStack(ShareStack stack){
  function LengthRightShareStack (line 68) | int LengthRightShareStack(ShareStack stack){
  function PushLeftShareStack (line 73) | bool PushLeftShareStack(ShareStack &stack, element_type elem){
  function PushRightShareStack (line 83) | bool PushRightShareStack(ShareStack &stack, element_type elem){
  function element_type (line 93) | element_type PopLeftShareStack(ShareStack &stack){
  function element_type (line 104) | element_type PopRightShareStack(ShareStack &stack){
  function element_type (line 115) | element_type TopLeftShareStack(ShareStack stack){
  function element_type (line 124) | element_type TopRightShareStack(ShareStack stack){

FILE: Code/Code/head/sort.h
  function StraightInsertSort (line 4) | bool StraightInsertSort(LinearTable table) {
  function BinaryInsertSort (line 24) | bool BinaryInsertSort(LinearTable table) {
  function ShellSort (line 54) | bool ShellSort(LinearTable table) {
  function BubbleSort (line 70) | bool BubbleSort(LinearTable table) {
  function PartQuickSort (line 88) | int PartQuickSort(LinearTable table, int low, int high) {
  function QuickSort (line 109) | bool QuickSort(LinearTable table, int low, int high) {
  function SimpleSelectSort (line 122) | bool SimpleSelectSort(LinearTable table) {
  function BuildHeap (line 144) | bool BuildHeap(LinearTable table, bool HeadAdjust(LinearTable table, int...
  function HeadMaxAdjust (line 155) | bool HeadMaxAdjust(LinearTable table, int index) {
  function HeapSort (line 180) | bool HeapSort(LinearTable table, bool mode){

FILE: Code/Code/head/thread_tree.h
  type ThreadBinaryTreeNode (line 4) | typedef struct ThreadBinaryTreeNode {
  function InOrderThreadBinaryTree (line 14) | bool InOrderThreadBinaryTree(ThreadBinaryTree &tree, ThreadBinaryTree &p...
  function CreateInOrderThreadBinaryTree (line 39) | bool CreateInOrderThreadBinaryTree(ThreadBinaryTree tree) {
  function ThreadBinaryTreeNode (line 52) | ThreadBinaryTreeNode *FirstInOrderBinaryTreeNode(ThreadBinaryTreeNode *n...
  function ThreadBinaryTreeNode (line 62) | ThreadBinaryTreeNode *NextInOrderBinaryTreeNode(ThreadBinaryTreeNode *no...
  function InOrderThreadBinaryTree (line 73) | bool InOrderThreadBinaryTree(ThreadBinaryTree *tree,bool( *function)(Thr...
  function PreOrderThreadBinaryTree (line 82) | bool PreOrderThreadBinaryTree(ThreadBinaryTree &tree, ThreadBinaryTree &...
  function CreatePreOrderThreadBinaryTree (line 110) | bool CreatePreOrderThreadBinaryTree(ThreadBinaryTree tree) {
  function PostOrderThreadBinaryTree (line 123) | bool PostOrderThreadBinaryTree(ThreadBinaryTree &tree, ThreadBinaryTree ...
  function CreatePostOrderThreadBinaryTree (line 148) | bool CreatePostOrderThreadBinaryTree(ThreadBinaryTree tree) {

FILE: Code/Code/head/tree.h
  type ParentTreeNode (line 5) | typedef struct {
  type ParentTree (line 11) | typedef struct {
  type ChildSiblingTreeNode (line 22) | typedef struct ChildSiblingTreeNode {

FILE: Code/Code/source/main.cpp
  function main (line 3) | int main()

FILE: Code/Code/source/test.cpp
  function SequenceListTest (line 23) | bool SequenceListTest() {
  function LinkListTest (line 41) | bool LinkListTest() {
  function SortTest (line 62) | bool SortTest(){