MCPcopy Create free account

hub / github.com/Charmve/CppMaster / functions

Functions168 in github.com/Charmve/CppMaster

↓ 28 callersMethodsibling
算法库/DataStructure/RedBlackTree.cpp:34
↓ 10 callersMethodgrandparent
算法库/DataStructure/RedBlackTree.cpp:17
↓ 6 callersMethodName
算法库/DesignPattern/AbstractFactoryPattern/concrete_product.h:25
↓ 6 callersMethodinsert
算法库/DataStructure/RedBlackTree.cpp:233
↓ 4 callersFunctioninsert
算法库/Algorithm/BucketSort.cpp:29
↓ 3 callersMethodCreateBike
算法库/DesignPattern/AbstractFactoryPattern/concrete_factory.h:33
↓ 3 callersMethodCreateCar
算法库/DesignPattern/AbstractFactoryPattern/concrete_factory.h:29
↓ 3 callersFunctionInsertHash
插入哈希表
算法库/DataStructure/HashTable.cpp:106
↓ 3 callersFunctionListTraverse_L
遍历单链表
算法库/DataStructure/LinkList.cpp:91
↓ 3 callersFunctionListTraverse_L
遍历单链表
算法库/DataStructure/LinkList_with_head.cpp:104
↓ 3 callersFunctionMakeBiTree
构建二叉树
算法库/DataStructure/BinaryTree.cpp:33
↓ 3 callersFunctionSearchHash
在哈希表中查询
算法库/DataStructure/HashTable.cpp:58
↓ 3 callersFunctionprintHash
打印哈希表
算法库/DataStructure/HashTable.cpp:71
↓ 2 callersMethodAttach
算法库/DesignPattern/ObserverPattern/concrete_subject.h:22
↓ 2 callersFunctionInitHashTable
初始哈希表
算法库/DataStructure/HashTable.cpp:32
↓ 2 callersFunctionListTraverse_Sq
遍历顺序表L,依次对每个元素调用函数visit()
算法库/DataStructure/SqList.cpp:91
↓ 2 callersMethodNotify
Notify all observers
算法库/DesignPattern/ObserverPattern/concrete_subject.h:31
↓ 2 callersMethodOff
Turn off the equipment with a zipper switch
算法库/DesignPattern/BridgePattern/refined_abstraction.h:25
↓ 2 callersMethodOn
Turn on the equipment with a zipper switch
算法库/DesignPattern/BridgePattern/refined_abstraction.h:18
↓ 2 callersMethodPowerOff
Turn off the fan
算法库/DesignPattern/BridgePattern/concrete_implementor.h:37
↓ 2 callersMethodPowerOn
Turn on the fan
算法库/DesignPattern/BridgePattern/concrete_implementor.h:32
↓ 2 callersMethodSetPrice
算法库/DesignPattern/ObserverPattern/concrete_subject.h:18
↓ 2 callersFunctionUnionBiTree
合并二叉树
算法库/DataStructure/BinaryTree.cpp:140
↓ 2 callersMethodinorder
算法库/DataStructure/RedBlackTree.cpp:95
↓ 2 callersFunctionmax
返回两个值的最大值
算法库/Problems/KnapsackProblem/pack.cpp:8
↓ 2 callersFunctionmax_heapify
算法库/Algorithm/HeapSort.cpp:7
↓ 2 callersMethoduncle
算法库/DataStructure/RedBlackTree.cpp:24
↓ 2 callersFunctionvisit
访问结点
算法库/DataStructure/BinaryTree.cpp:45
↓ 1 callersFunctionAdapterMain
算法库/DesignPattern/AdapterPattern/AdapterMain.h:10
↓ 1 callersFunctionAppend_Sq
在顺序表L表尾添加元素e
算法库/DataStructure/SqList.cpp:108
↓ 1 callersFunctionBiTreeEmpty
二叉树判空
算法库/DataStructure/BinaryTree.cpp:100
↓ 1 callersMethodCharge
算法库/DesignPattern/AdapterPattern/adapter.h:24
↓ 1 callersMethodChargeWithFeetFlat
算法库/DesignPattern/AdapterPattern/adaptee.h:14
↓ 1 callersFunctionChessBoard
棋盘覆盖函数
算法库/Problems/ChessboardCoverageProblem/ChessboardCoverage.cpp:93
↓ 1 callersFunctionClearStack_Sq
清空栈S
算法库/DataStructure/SqStack.cpp:59
↓ 1 callersFunctionCountSort
计数排序
算法库/Algorithm/CountSort.cpp:27
↓ 1 callersFunctionDeQueue_LQ
从链表头节点出链表到e
算法库/DataStructure/LinkList.cpp:74
↓ 1 callersFunctionDeQueue_LQ
从链表头节点出链表到e
算法库/DataStructure/LinkList_with_head.cpp:87
↓ 1 callersFunctionDeleteHash
删除哈希表
算法库/DataStructure/HashTable.cpp:122
↓ 1 callersFunctionDeleteLast_Sq
删除顺序表L的表尾元素,并用参数e返回其值
算法库/DataStructure/SqList.cpp:116
↓ 1 callersFunctionDestroyList_Sq
销毁顺序表L
算法库/DataStructure/SqList.cpp:46
↓ 1 callersMethodDetach
算法库/DesignPattern/ObserverPattern/concrete_subject.h:26
↓ 1 callersMethodDoSomething
算法库/DesignPattern/SingletonPattern/Singleton.cpp:8
↓ 1 callersFunctionEnQueue_LQ
e从链表末尾入链表
算法库/DataStructure/LinkList.cpp:53
↓ 1 callersFunctionEnQueue_LQ
e从链表末尾入链表
算法库/DataStructure/LinkList_with_head.cpp:57
↓ 1 callersFunctionFactoryMain
算法库/DesignPattern/AbstractFactoryPattern/FactoryMain.cpp:11
↓ 1 callersFunctionFibonacci
构造一个斐波那契数组*/
算法库/Algorithm/FibonacciSearch.cpp:11
↓ 1 callersFunctionFibonacciSearch
定义斐波那契查找法*/
算法库/Algorithm/FibonacciSearch.cpp:20
↓ 1 callersFunctionGetTop_Sq
取栈S的栈顶元素,并用e返回
算法库/DataStructure/SqStack.cpp:79
↓ 1 callersFunctionHash
哈希函数:除留余数法
算法库/DataStructure/HashTable.cpp:48
↓ 1 callersFunctionInOrderTraverse
num是个全局变量
算法库/DataStructure/BinaryTree.cpp:88
↓ 1 callersFunctionInitBiTree
初始化一个空树
算法库/DataStructure/BinaryTree.cpp:27
↓ 1 callersFunctionInitList_Sq
初始化顺序表L
算法库/DataStructure/SqList.cpp:36
↓ 1 callersFunctionInitStack_Sq
初始化顺序栈
算法库/DataStructure/SqStack.cpp:36
↓ 1 callersFunctionLeaves
对二叉树T求叶子结点数目
算法库/DataStructure/BinaryTree.cpp:52
↓ 1 callersFunctionListEmpty_Sq
若顺序表L为空表,则返回TRUE,否则FALSE
算法库/DataStructure/SqList.cpp:59
↓ 1 callersFunctionMatchTable
进行循环赛日程安排,生成日程表
算法库/Problems/RoundRobinProblem/MatchTable.cpp:68
↓ 1 callersFunctionMerge
算法库/Algorithm/BucketSort.cpp:46
↓ 1 callersFunctionNeumann2_3_12
通项法
算法库/Problems/NeumannNeighborProblem/Formula/Neumann2_3_12.cpp:4
↓ 1 callersFunctionNeumann2_4_12
递归法
算法库/Problems/NeumannNeighborProblem/Recursive/Neumann2_4_12.cpp:4
↓ 1 callersFunctionObserverMain
算法库/DesignPattern/ObserverPattern/ObserverMain.cpp:7
↓ 1 callersFunctionPop_Sq
栈S的栈顶元素出栈,并用e返回
算法库/DataStructure/SqStack.cpp:86
↓ 1 callersFunctionPush_Sq
元素e压入栈S
算法库/DataStructure/SqStack.cpp:66
↓ 1 callersFunctionReplaceLeft
替换左子树
算法库/DataStructure/BinaryTree.cpp:118
↓ 1 callersFunctionReplaceRight
替换右子树
算法库/DataStructure/BinaryTree.cpp:129
↓ 1 callersFunctionSingletonMain
算法库/DesignPattern/SingletonPattern/SingletonMain.h:10
↓ 1 callersFunctionStackEmpty_Sq
判断S是否空,若空则返回TRUE,否则返回FALSE
算法库/DataStructure/SqStack.cpp:53
↓ 1 callersMethodUpdate
算法库/DesignPattern/ObserverPattern/concrete_observer.h:16
↓ 1 callersFunctioncollision
处理哈希冲突:线性探测
算法库/DataStructure/HashTable.cpp:53
↓ 1 callersFunctioncreate
创建包含n个元素的链表L,元素值存储在data数组中
算法库/DataStructure/LinkList.cpp:33
↓ 1 callersFunctioncreate
创建包含n个元素的链表L,元素值存储在data数组中
算法库/DataStructure/LinkList_with_head.cpp:33
↓ 1 callersMethoddelete_value
算法库/DataStructure/RedBlackTree.cpp:340
↓ 1 callersFunctiondepTraverse
层次遍历:dep是个全局变量,高度
算法库/DataStructure/BinaryTree.cpp:67
↓ 1 callersFunctionheap_sort
算法库/Algorithm/HeapSort.cpp:24
↓ 1 callersFunctionlevTraverse
高度遍历:lev是局部变量,层次
算法库/DataStructure/BinaryTree.cpp:77
↓ 1 callersFunctionmaxbit
算法库/Algorithm/RadixSort.h:3
↓ 1 callersFunctionmerge_sort_recursive
算法库/Algorithm/MergeSort.h:41
↓ 1 callersFunctionpackIterative
迭代法,能显示背包问题的表格
算法库/Problems/KnapsackProblem/pack.cpp:13
↓ 1 callersFunctionpackRecursive
递归法,不支持显示背包问题的表格
算法库/Problems/KnapsackProblem/pack.cpp:34
↓ 1 callersFunctionprintT
打印背包问题的表格
算法库/Problems/KnapsackProblem/pack.cpp:50
↓ 1 callersFunctionquick_sort
快速排序
算法库/Problems/TubingProblem/Tubing.cpp:8
↓ 1 callersFunctionquick_sort_recursive
算法库/Algorithm/QuickSort.h:48
↓ 1 callersFunctionrecreateHash
重建哈希表
算法库/DataStructure/HashTable.cpp:88
↓ 1 callersFunctionvisit
遍历调用
算法库/DataStructure/LinkList.cpp:85
↓ 1 callersFunctionvisit
遍历调用
算法库/DataStructure/SqList.cpp:85
↓ 1 callersFunctionvisit
遍历调用
算法库/DataStructure/LinkList_with_head.cpp:98
↓ 1 callersMethod~bst
算法库/DataStructure/RedBlackTree.cpp:315
FunctionBetterSequentialSearch
算法库/Algorithm/SequentialSearch.h:13
FunctionBinarySearch
算法库/Algorithm/BinarySearch.h:5
FunctionBinarySearch2
递归
算法库/Algorithm/BinarySearch.h:26
FunctionBreakBiTree
打断二叉树:置空二叉树的左右子树
算法库/DataStructure/BinaryTree.cpp:107
FunctionBridgeMain
算法库/DesignPattern/BridgePattern/BridgeMain.cpp:7
FunctionBubbleSort
冒泡排序
算法库/Algorithm/BubbleSort.h:14
FunctionBubbleSort_orderly
冒泡排序(改进版)
算法库/Algorithm/BubbleSort.h:32
FunctionBucketSort
算法库/Algorithm/BucketSort.cpp:65
FunctionClearList_Sq
将顺序表L清空
算法库/DataStructure/SqList.cpp:53
MethodConcreteObserver
算法库/DesignPattern/ObserverPattern/concrete_observer.h:15
MethodConcreteSubject
算法库/DesignPattern/ObserverPattern/concrete_subject.h:17
MethodCreateBike
算法库/DesignPattern/AbstractFactoryPattern/concrete_factory.h:19
MethodCreateBike
算法库/DesignPattern/AbstractFactoryPattern/concrete_factory.h:46
next →1–100 of 168, ranked by callers