SYMBOL INDEX (417 symbols across 100 files)

FILE: ebook/code/c/1.1：左旋转字符串.c
  function leftShift1 (line 12) | void leftShift1(char * arr, int n)
  function leftShift2 (line 43) | void leftShift2(char * arr, int len, int n)
  function leftShift3 (line 83) | void leftShift3(char * arr, int len, int n)
  function leftShift4 (line 104) | void leftShift4(char * arr, int len, int n)
  function myinvert (line 126) | void myinvert(char * start, char * end)
  function leftShift5 (line 140) | void leftShift5(char * arr, int len, int n)
  function gcd (line 146) | int gcd(int m, int n)
  function leftShift6 (line 157) | void leftShift6(char * arr, int len, int n)
  function main (line 173) | int main()

FILE: ebook/code/c/1.2：字符串是否包含问题.c
  function partion1 (line 15) | int partion1(char * arr, int start, int end)
  function partion (line 44) | int partion(char * arr, int start, int end)
  function quickSort (line 80) | void quickSort(char * arr, int start, int end)
  function countSort (line 90) | void countSort(char * oldArr, char * newArr)
  function contain1 (line 118) | bool contain1(char * stra, char * strb)
  function contain2 (line 141) | bool contain2(char * stra, char * strb)
  function contain3 (line 178) | bool contain3(char * stra, char * strb)
  function contain4 (line 206) | bool contain4(char * stra, char * strb)
  function contain5 (line 220) | bool contain5(char * stra, char * strb)
  function main (line 250) | int main()

FILE: ebook/code/c/1.3：带通配符的字符串匹配问题.c
  function str_len (line 3) | int str_len(char *a)
  function str_copy (line 16) | void str_copy(char *a, const char *b, int len)
  function canMatch (line 48) | int canMatch(char *input, char *rule)

FILE: ebook/code/c/1.4：字符串转换成整数.c
  function StrToInt (line 1) | int StrToInt(const char* str)

FILE: ebook/code/c/1.7：字符串的全排列.c
  function calcAllPermutation (line 7) | void calcAllPermutation(char* perm, int from, int to)
  function _tmain (line 31) | int _tmain(int argc, _TCHAR* argv[])
  function calcAllPermutation (line 47) | void calcAllPermutation(char* perm, int num)
  function main (line 87) | int main()
  function CalcAllPermutation (line 103) | bool CalcAllPermutation(char* perm, int num){
  function main (line 128) | int main()
  function perm (line 142) | void perm(char *str, int size, int resPos)

FILE: ebook/code/c/10.1.3：教你一步一步用c语言实现sift算法、下.c
  function CvMat (line 2) | CvMat * halfSizeImage(CvMat * im)
  function CvMat (line 18) | CvMat * doubleSizeImage(CvMat * im)
  function CvMat (line 36) | CvMat * doubleSizeImage2(CvMat * im)
  function getPixelBI (line 77) | float getPixelBI(CvMat * im, float col, float row)
  function normalizeMat (line 120) | void normalizeMat(CvMat* mat)
  function normalizeVec (line 134) | void normalizeVec(float* vec, int dim)
  function GetVecNorm (line 145) | float GetVecNorm( float* vec, int dim )
  function CvMat (line 179) | CvMat* GaussianKernel2D(float sigma)
  function ConvolveLocWidth (line 210) | float ConvolveLocWidth(float* kernel, int dim, CvMat * src, int x, int y)
  function Convolve1DWidth (line 233) | void Convolve1DWidth(float* kern, int dim, CvMat * src, CvMat * dst)
  function ConvolveLocHeight (line 249) | float ConvolveLocHeight(float* kernel, int dim, CvMat * src, int x, int y)
  function Convolve1DHeight (line 271) | void Convolve1DHeight(float* kern, int dim, CvMat * src, CvMat * dst)
  function BlurImage (line 286) | int BlurImage(CvMat * src, CvMat * dst, float sigma)
  function CvMat (line 304) | CvMat *ScaleInitImage(CvMat * im)
  function ImageOctaves (line 345) | ImageOctaves* BuildGaussianOctaves(CvMat * image)
  function DetectKeypoint (line 445) | int DetectKeypoint(int numoctaves, ImageOctaves *GaussianPyr)
  function DisplayKeypointLocation (line 579) | void DisplayKeypointLocation(IplImage* image, ImageOctaves *GaussianPyr)
  function ComputeGrad_DirecandMag (line 599) | void ComputeGrad_DirecandMag(int numoctaves, ImageOctaves *GaussianPyr)
  function AssignTheMainOrientation (line 646) | void AssignTheMainOrientation(int numoctaves, ImageOctaves *GaussianPyr,...
  function FindClosestRotationBin (line 798) | int FindClosestRotationBin (int binCount, float angle)
  function AverageWeakBins (line 811) | void AverageWeakBins (double* hist, int binCount)
  function InterpolateOrientation (line 840) | bool InterpolateOrientation (double left, double middle,double right, do...
  function DisplayOrientation (line 858) | void DisplayOrientation (IplImage* image, ImageOctaves *GaussianPyr)
  function ExtractFeatureDescriptors (line 891) | void ExtractFeatureDescriptors(int numoctaves, ImageOctaves *GaussianPyr)
  function CvMat (line 1039) | CvMat* MosaicHorizen( CvMat* im1, CvMat* im2 )
  function CvMat (line 1058) | CvMat* MosaicVertical( CvMat* im1, CvMat* im2 )
  function main (line 1079) | int main( void )

FILE: ebook/code/c/2.1：寻找最小的 k 个数.c
  function q_select (line 6) | void q_select( input_type a[], int k, int left, int right )

FILE: ebook/code/c/2.2：求给定区间的第K小元素.c
  type node (line 9) | struct node{
  function main (line 18) | int main()
  type node (line 50) | struct node{
  function main (line 59) | int main()

FILE: ebook/code/c/2.3：求解500万以内的亲和数.c
  function main (line 17) | int main()

FILE: ebook/code/c/2.4：寻找和为定值的两个数.c
  function twoSum (line 6) | void twoSum(int data[], unsigned int length, int sum)
  function main (line 37) | int main(){

FILE: ebook/code/c/2.5：寻找和为定值的多个数.c
  function SumOfkNumber (line 9) | void SumOfkNumber(int sum, int n)
  function main (line 31) | int main()
  function SumOfkNumber (line 56) | void SumOfkNumber(int t, int k, int r, int& M, bool& flag, bool* X)
  function search (line 86) | void search(int& N, int& M)
  function main (line 106) | int main()

FILE: ebook/code/c/2.6：求连续子数组的最大和.c
  function maxSubArray (line 2) | int maxSubArray(int* A, int n)
  function maxSubArray (line 28) | int maxSubArray(int* a, int n)
  function main (line 44) | int main()
  function maxSubArray (line 58) | int maxSubArray(int* a, int n)
  function main (line 75) | int main()

FILE: ebook/code/c/2.7：奇偶排序.c
  function isOddNumber (line 8) | bool isOddNumber(int data)
  function swap (line 14) | void swap(int* x, int* y)
  function oddEvenSort (line 22) | void oddEvenSort(int *pData, unsigned int length)
  function main (line 50) | int main(int argc, _TCHAR* argv[])
  function isOddNumber (line 74) | bool isOddNumber(int data)
  function swap (line 80) | void swap(int* x, int* y)
  function oddEvenSort2 (line 88) | void oddEvenSort2(int data[], int lo, int hi)
  function main (line 103) | int main(int argc, _TCHAR* argv[])

FILE: ebook/code/c/2.8：矩阵相乘之Strassen算法.c
  function Mul (line 3) | void Mul(int** matrixA, int** matrixB, int** matrixC)

FILE: ebook/code/c/3.1：二分查找实现.c
  function binary_search (line 9) | int binary_search(int array[], int n, int value)

FILE: ebook/code/c/3.2：杨氏矩阵查找.c
  function YoungMatrix (line 8) | bool YoungMatrix(int array[][COL], int searchkey){
  function main (line 23) | int main(){

FILE: ebook/code/c/4.1：木块砌墙.c
  function namespace (line 8) | namespace HeapBlock
  function cal (line 163) | void cal(int a[6][32][32],int n,int col,int laststate,int nowstate)
  function mul (line 182) | inline int mul(ll x, ll y)
  function multiply (line 187) | void multiply(int n,int a[][32],int b[][32])
  function calculate (line 205) | int calculate(int n,int k)

FILE: ebook/code/c/4.2：格子取数问题.c
  function dfs (line 23) | void dfs( int index)
  function _tmain (line 91) | int _tmain(int argc, _TCHAR* argv[])
  function isValid (line 106) | bool isValid(int step, int x1, int x2, int n) //判断状态是否合法
  function getValue (line 112) | int getValue(int step, int x1, int x2, int n)  //处理越界 不存在的位置 给负无穷的值
  function getAnswer (line 118) | int getAnswer(int a[N][N], int n)
  function isValid (line 170) | bool isValid(int step, int x1, int x2, int n) //判断状态是否合法
  function getValue (line 176) | int getValue(int step, int x1, int x2, int n)  //处理越界 不存在的位置 给负无穷的值
  function getAnswer (line 182) | int getAnswer(int a[N][N], int n)

FILE: ebook/code/c/4.3：出现次数超过一半的数字.c
  function FindOneNumber (line 9) | int FindOneNumber(int* a, int length)
  function main (line 28) | int main()

FILE: ebook/code/c/4.3：完美洗牌算法.c
  function pefect_shuffle1 (line 4) | void pefect_shuffle1(int *a, int n)
  function perfect_shuffle2 (line 20) | void perfect_shuffle2(int *a, int n)
  function cycle_leader (line 57) | void cycle_leader(int *a, int from, int mod)
  function reverse (line 73) | void reverse(int *a, int from, int to)
  function right_rotate (line 85) | void right_rotate(int *a, int num, int n)
  function perfect_shuffle3 (line 96) | void perfect_shuffle3(int *a, int n)
  function shuffle (line 132) | void shuffle(int *a, int n)

FILE: ebook/code/c/4.4：最近公共祖先LCA问题.LCAProblem.c
  function Node (line 31) | Node* FindLowestCommonAncestorBst(Node* root, Node* u, Node* v)
  function Node (line 93) | Node* FindLcaBstRecursively(Node* root, Node* u, Node* v)

FILE: ebook/code/c/4.5：打印螺旋矩阵.SpiralMatrix.c
  function PrintSpiralMatrix (line 23) | void PrintSpiralMatrix(int n)
  function main (line 96) | int main(void)

FILE: ebook/code/c/5.1：最长公共子序列（LCS）问题.c
  function public (line 3) | public class LCS{

FILE: ebook/code/c/5.2：最大连续乘积子串.c
  function maxProductSubstring (line 7) | double maxProductSubstring(double *a, int length)
  function _tmain (line 25) | int _tmain(int argc, _TCHAR* argv[])
  function maxProductSubstring (line 39) | double maxProductSubstring(double *a, int length)
  function _tmain (line 55) | int _tmain(int argc, _TCHAR* argv[])

FILE: ebook/code/c/5.3：字符串编辑距离.c
  function editDistance (line 20) | int editDistance(char *pSource, char *pTarget)
  function main (line 51) | int main()

FILE: ebook/code/c/5.4：交替字符串.c
  function isInterleave (line 1) | bool isInterleave(string s1, string s2, string s3)

FILE: ebook/code/c/6.11：最小操作数.c
  function class (line 4) | class Solution
  function class (line 118) | class Solution

FILE: ebook/code/c/6.4：回文判断.c
  function IsPalindrome (line 6) | bool IsPalindrome(const char *s, int n)
  function IsPalindrome2 (line 24) | bool IsPalindrome2(const char *s, int n)
  function LongestPalindrome (line 41) | int LongestPalindrome(const char *s, int n)

FILE: ebook/code/c/6.6：跳台阶问题.c
  function Fibonacci_Solution1 (line 2) | long long Fibonacci_Solution1(unsigned int n)

FILE: ebook/code/c/6.8：第一个只出现一次的字符.c
  function find_first_unique_char (line 8) | char find_first_unique_char(char *str)
  function main (line 32) | int main()
  function FirstNotRepeatChar (line 43) | char FirstNotRepeatChar(char* pString)

FILE: ebook/code/c/6.9：Trie树.c
  type TrieNode (line 12) | typedef struct TrieNode{
  function initTrieNode (line 18) | void initTrieNode(TrieNode* p, char c)
  function incTrieNode (line 26) | void incTrieNode(TrieNode* p)
  function compTrieNode (line 31) | int compTrieNode(TrieNode* p, char c)
  function Char2Index (line 41) | int Char2Index(char c)
  function TrieNode (line 46) | TrieNode* getNextChar(TrieNode* t, char c)
  function setNextChar (line 51) | void setNextChar(TrieNode* t, char c, TrieNode* new)
  function updateWord (line 59) | void updateWord(TrieNode* t, char* word)
  function getWord (line 86) | int getWord(TrieNode* t, char* word)
  function dispTrieNodeI (line 104) | void dispTrieNodeI(TrieNode* t, int level)
  function dispTrieNode (line 118) | void dispTrieNode(TrieNode* t)
  function main (line 124) | int main()

FILE: ebook/code/c/7.1：搜索引擎热门查询统计.c
  type node_no_space (line 20) | struct node_no_space
  type node_has_space (line 21) | struct node_has_space
  type node_no_space (line 24) | struct node_no_space
  type node_has_space (line 31) | struct node_has_space
  function hash_function (line 39) | int hash_function(char const *p)
  function append_word (line 52) | void append_word(char const *str)
  function write_to_file (line 77) | void write_to_file()
  function sift_down (line 93) | void sift_down(node_has_space heap[], int i, int len)
  function build_min_heap (line 122) | void build_min_heap(node_has_space heap[], int len)
  function handle_symbol (line 133) | void handle_symbol(char *str, int n)
  function main (line 154) | int main()

FILE: ebook/code/c/7.3：倒排索引关键词不重复Hash编码.c
  function prepareCryptTable (line 3) | void prepareCryptTable()
  function HashString (line 26) | unsigned long HashString(const char *lpszkeyName, unsigned long dwHashTy...
  function GetHashTablePos (line 44) | int GetHashTablePos( har *lpszString, SOMESTRUCTURE *lpTable )
  function GetHashTablePos (line 62) | int GetHashTablePos( char *lpszString, MPQHASHTABLE *lpTable, int nTable...
  function prepareCryptTable (line 96) | void prepareCryptTable()
  function HashString (line 115) | unsigned long HashString(const char *lpszkeyName, unsigned long dwHashTy...
  function insert_string (line 143) | int insert_string(const char *string_in)
  function bigIndex_hash (line 204) | void bigIndex_hash(const char *docpath, const char *hashpath)
  function main (line 273) | int main()
  function bigIndex_hashcode (line 287) | void bigIndex_hashcode(const char *in_file_path, const char *out_file_path)

FILE: ebook/code/c/7.4：倒排索引关键词 Hash 不重复编码实践.c
  function prepareCryptTable (line 8) | void prepareCryptTable()
  function HashString (line 32) | unsigned long HashString( char *lpszFileName, unsigned long dwHashType )
  function main (line 52) | int main( int argc, char **argv )

FILE: ebook/code/cpp/1.1：左旋转字符串.cpp
  function leftShiftOne (line 6) | void leftShiftOne(string &str)
  function rotate_1 (line 18) | void rotate_1(string &str, int m)
  function rotate_2 (line 27) | void rotate_2(string &str, int m)
  function rotate_3 (line 65) | void rotate_3(string &str, int m)
  function rotate_4 (line 108) | void rotate_4(string &str, int m)
  function rotate_5 (line 152) | void rotate_5(string &str, int n, int m, int head, int tail, bool flag)
  function gcd (line 206) | int gcd (int m, int n)
  function rotate_6 (line 218) | void rotate_6(string &str, int m)
  function rotate_7 (line 240) | void rotate_7(char *begin, char *mid, char *end)
  function main (line 287) | int main () {

FILE: ebook/code/cpp/2.1：寻找最小的 k 个数.cpp
  function GetParent (line 6) | int GetParent(int* pArray, int* pLast)
  function GetLeft (line 15) | int GetLeft(int* pArray, int* pLast)
  function GetRight (line 24) | int GetRight(int* pArray, int* pLast)
  function Swap (line 33) | void Swap(int* pa, int* pb)
  function MaxHeapify (line 41) | void MaxHeapify(int* pArray, const int nLength, const int nI)
  function BuildMaxHeap (line 80) | int BuildMaxHeap(int* pArray, int* pLast)
  function FindMinimumK (line 99) | int FindMinimumK(int* pArray, int nLength, int k)
  function main (line 119) | int main()

FILE: ebook/code/cpp/4.2：完美洗牌算法.cpp
  function cycle_leader (line 9) | void cycle_leader(vector<int> &a,int from, int mod) {
  function perfect_shuffle (line 14) | void perfect_shuffle(vector<int> &a,int n){
  function main (line 40) | int main(){

FILE: ebook/code/cpp/7.4：倒排索引关键词 Hash 不重复编码实践.cpp
  function prepareCryptTable (line 8) | void prepareCryptTable()
  function HashString (line 32) | unsigned long HashString( char *lpszFileName, unsigned long dwHashType )
  function main (line 52) | int main( int argc, char **argv )

FILE: ebook/code/cpp/9.2：海量数据处理之Bit-map详解.cpp
  function BitMapSortDemo (line 15) | void BitMapSortDemo()
  function _tmain (line 52) | int _tmain(int argc, _TCHAR* argv[])

FILE: ebook/code/cpp/chapter04.cpp
  function main (line 17) | int main()

FILE: ebook/code/cpp/chapter06.cpp
  function createCounter (line 6) | void createCounter(vector<int>& counter, int n)
  function main (line 45) | int main ()

FILE: ebook/code/go/1.1-左旋转字符串.go
  function left_shift_one (line 13) | func left_shift_one(s []byte, n int) {
  function left_shift_m (line 26) | func left_shift_m(s []byte, n int, m int) {
  function reverse (line 36) | func reverse(s []byte, from int, to int) {
  function leftshift (line 46) | func leftshift(s []byte, n int, m int) {
  function main (line 53) | func main() {

FILE: ebook/code/go/1.2-字符串是否包含问题.go
  function compare1 (line 14) | func compare1(a string, b string) bool {
  function compare2 (line 32) | func compare2(a string, b string) bool {
  function sortString (line 52) | func sortString(w string) string {
  function compare3 (line 59) | func compare3(a string, b string) bool {
  function compare4 (line 81) | func compare4(a string, b string) bool {
  function compare5 (line 109) | func compare5(a string, b string) bool {
  function compare6 (line 114) | func compare6(a string, b string) bool {
  function main (line 133) | func main() {

FILE: ebook/code/go/1.5-回文判断.go
  function isPalindrome (line 11) | func isPalindrome(s string) bool {
  function isPalindrome2 (line 31) | func isPalindrome2(s string) bool {
  function main (line 52) | func main() {

FILE: ebook/code/go/2.1-寻找最小的k个数.go
  function quicksort (line 11) | func quicksort(seq []int) []int {
  function max (line 36) | func max(seq []int) int {
  function bInsert (line 56) | func bInsert(seq []int, k int) []int {
  function sort1 (line 78) | func sort1(seq []int, k int) []int {
  function sort2 (line 87) | func sort2(seq []int, k int) []int {
  function sort3 (line 108) | func sort3(seq []int, k int) []int {
  function main (line 127) | func main() {

FILE: ebook/code/go/2.2-求数组中给定下标区间内的第K小元素.go
  type Node (line 12) | type Node struct
  type SortNodeByData (line 17) | type SortNodeByData
    method Len (line 19) | func (a SortNodeByData) Len() int {
    method Swap (line 22) | func (a SortNodeByData) Swap(i, j int) {
    method Less (line 25) | func (a SortNodeByData) Less(i, j int) bool {
  function find1 (line 30) | func find1(arr []int, a int, b int, flag int) int {
  function main (line 53) | func main() {

FILE: ebook/code/go/3.2-杨氏矩阵查找.go
  function find2 (line 12) | func find2(arr [][]int, s int) bool {
  function main (line 38) | func main() {

FILE: ebook/code/go/3.3：出现次数超过一半的数字.go
  function findNumberAppearEqualHalf (line 9) | func findNumberAppearEqualHalf(data []int) int {
  function findNumberAppearMoreThanHalf (line 28) | func findNumberAppearMoreThanHalf(data []int) int {
  function main (line 48) | func main() {

FILE: ebook/code/java/chapter1/1.1：左旋转字符串.java
  class RotateString (line 13) | public class RotateString {
    method leftRotateString (line 29) | public static char[] leftRotateString(char[] str, int n) {
    method rotate (line 44) | private static char[] rotate(char[] str, int start, int end) {
    method rotateLinkList (line 69) | public static ListNode rotateLinkList(ListNode head, int n) {
    method rotateList (line 88) | private static ListNode rotateList(ListNode start, ListNode end) {
    method rightRotateString (line 113) | public static char[] rightRotateString(char[] str, int n) {
    method rotateSentence (line 132) | public static char[] rotateSentence(char[] sentence) {

FILE: ebook/code/java/chapter1/1.2：字符串包含.java
  class StringContain (line 10) | public class StringContain {
    method hashCheck (line 33) | public static boolean hashCheck(char[] s1, char[] s2) {

FILE: ebook/code/java/chapter1/Chapter1.java
  class Chapter1 (line 1) | class Chapter1 {
    method leftShiftV1 (line 4) | public void leftShiftV1 (char[] s, int m) {
    method leftShiftOne (line 11) | private void leftShiftOne (char[] s) {
    method leftShiftV2 (line 24) | public void leftShiftV2(char[] s, int m) {
    method reverse (line 32) | private void reverse (char[] s, int from, int to) {
    method main (line 42) | public static void main (String[] args) {

FILE: ebook/code/java/chapter1/Palindrome.java
  class Palindrome (line 5) | public class Palindrome
    method isPalindromeV1 (line 8) | public static boolean isPalindromeV1(String str)
    method isPalindromeV2 (line 31) | public static boolean isPalindromeV2(String str)

FILE: ebook/code/java/chapter2/Chapter2.java
  class Chapter2 (line 1) | class Chapter2 {
    method main (line 2) | public static void main (String[] args) {

FILE: ebook/code/java/chapter2/CountAndCompare.java
  class CountAndCompare (line 1) | class CountAndCompare implements ICompare {
    method compare (line 2) | @Override
    method countSort (line 21) | private String countSort(String str) {

FILE: ebook/code/java/chapter2/HashTableCompare.java
  class HashTableCompare (line 1) | class HashTableCompare implements ICompare {
    method compare (line 2) | @Override

FILE: ebook/code/java/chapter2/ICompare.java
  type ICompare (line 1) | interface ICompare {
    method compare (line 2) | public boolean compare(String longStr, String shortStr);

FILE: ebook/code/java/chapter2/PrimeCompare.java
  class PrimeCompare (line 3) | class PrimeCompare implements ICompare {
    method compare (line 5) | @Override

FILE: ebook/code/java/chapter2/SortAndCompare.java
  class SortAndCompare (line 3) | class SortAndCompare implements ICompare {
    method compare (line 4) | @Override

FILE: ebook/code/java/chapter2/TopK.java
  class TopK (line 9) | public class TopK
    method topKV1 (line 12) | public static List<Integer> topKV1(List<Integer> list, int k)
    method topKV2 (line 26) | public static List<Integer> topKV2(List<Integer> list, int k)
    method quickSort (line 54) | public static void quickSort(List<Integer> arr, int low, int high) {

FILE: ebook/code/java/chapter3/Chapter3.java
  class Chapter3 (line 3) | public class Chapter3 {
    method main (line 5) | public static void main(String[] args) {

FILE: ebook/code/java/chapter3/HeapSolution.java
  class HeapSolution (line 1) | class HeapSolution implements IFindMinK {
    method findMinK (line 3) | @Override

FILE: ebook/code/java/chapter3/IFindMinK.java
  type IFindMinK (line 1) | interface IFindMinK {
    method findMinK (line 2) | public int[] findMinK(int[] data, int k);

FILE: ebook/code/java/chapter3/MaxHeap.java
  class MaxHeap (line 7) | public class MaxHeap {
    method MaxHeap (line 12) | public MaxHeap(int capacity) {
    method getAll (line 18) | public int[] getAll() {
    method insert (line 22) | public void insert(int m) {
    method maxHeapify (line 32) | private void maxHeapify(int n) {
    method swap (line 53) | private void swap(int i, int j) {

FILE: ebook/code/java/chapter4/Chapter4.java
  class Chapter4 (line 4) | public class Chapter4 {
    method findSum_1 (line 7) | public Pair findSum_1(int[] data, int sum) {
    method findSum_2 (line 20) | public Pair findSum_2(int[] data, int sum) {
    method binarySearch (line 36) | public int binarySearch(int[] data, int target) {
    method findSum_3 (line 53) | public Pair findSum_3(int[] data, int sum) {
    method findSum_4 (line 77) | public Pair findSum_4(int[] data, int sum) {
    method findSum_5 (line 104) | public Pair findSum_5(int[] data, int sum) {
    method main (line 122) | public static void main(String[] argv) {
  class Pair (line 154) | class Pair {
    method Pair (line 158) | public Pair(int num1, int num2) {
    method getNum1 (line 163) | public int getNum1() {
    method setNum1 (line 167) | public void setNum1(int num1) {
    method getNum2 (line 171) | public int getNum2() {
    method setNum2 (line 175) | public void setNum2(int num2) {
    method toString (line 179) | public String toString() {

FILE: ebook/code/java/chapter6/Chapter6.java
  class Chapter6 (line 1) | public class Chapter6 {
    method findAmicableNumber_1 (line 4) | public void findAmicableNumber_1() {
    method main (line 26) | public static void main(String[] argv) {

FILE: ebook/code/js/1.1：左旋转字符串/1.1：左旋转字符串.js
  function leftShift1 (line 14) | function leftShift1(s, m) {
  function shiftHeadToEnd (line 32) | function shiftHeadToEnd(arr, length) {
  function leftShift2 (line 50) | function leftShift2(s, m) {
  function reverse (line 74) | function reverse(arr, start, end) {

FILE: ebook/code/js/1.2：字符串是否包含问题/1.2：字符串是否包含问题.js
  function compare1 (line 14) | function compare1(a, b) {
  function compare2 (line 37) | function compare2(a, b) {
  function compare3 (line 61) | function compare3(a, b) {
  function compare4 (line 87) | function compare4(a, b) {
  function compare5 (line 116) | function compare5(a, b) {
  function compare6 (line 148) | function compare6(a, b) {

FILE: ebook/code/js/2.4：寻找和为定值的两个数/2.4：寻找和为定值的两个数.js
  function solution1 (line 14) | function solution1(arr, number) {
  function solution2 (line 34) | function solution2(arr, number) {
  function binarySearch (line 51) | function binarySearch(arr, key, low, high) {
  function solution3 (line 77) | function solution3(arr, number) {
  function solution4 (line 115) | function solution4(arr, number) {
  function solution5 (line 139) | function solution5(arr, number) {

FILE: ebook/code/php/chapter1.php
  function LeftShiftOne (line 3) | function LeftShiftOne($string){
  function LeftShiftString (line 9) | function LeftShiftString($string,$m){
  function reverse (line 21) | function reverse($string){
  function LeftRotateString (line 26) | function LeftRotateString($string,$m){
  function LeftShiftTest (line 37) | function LeftShiftTest($str){
  function LeftRotateTest (line 48) | function LeftRotateTest($str){

FILE: ebook/code/php/chapter2.php
  function compare_1 (line 6) | function compare_1($a,$b){
  function compare_2 (line 27) | function compare_2($a,$b){
  function compare_3 (line 50) | function compare_3($a,$b){
  function compare_4 (line 80) | function compare_4($a,$b){
  function compare_5 (line 108) | function compare_5($a,$b) {
  function compare_6 (line 138) | function compare_6($a,$b) {
  function test (line 162) | function test($a,$b){

FILE: ebook/code/php/chapter3.php
  class Wildcard (line 2) | class Wildcard{
    method str_join (line 7) | private static function str_join($a,$b,$lenb){
    method canMatch (line 25) | private static function canMatch($input,$rule){
    method my_find (line 57) | public static function my_find($input,$rule){
  function test (line 88) | function test($input,$rule){

FILE: ebook/code/python/1.1：字符的移动.py
  function left_shift_one (line 20) | def left_shift_one(s, i, j):
  function simple_shift (line 40) | def simple_shift(s, m):
  function left_shift (line 58) | def left_shift(s, m):
  function invert (line 75) | def invert(s, start, end):
  function invert_solution (line 90) | def invert_solution(s, m):

FILE: ebook/code/python/1.2：字符串是否包含问题.py
  function compare_1 (line 2) | def compare_1(long_string, short_string):
  function compare_2 (line 26) | def compare_2(long_string, short_string):
  function string_contain3 (line 49) | def string_contain3(long_str, short_str):
  function string_contain4 (line 70) | def string_contain4(long_str, short_str):
  function compare_5 (line 108) | def compare_5(long_string, short_string):
  function compare_6 (line 132) | def compare_6(long_string, short_string):
  function compare_7 (line 160) | def compare_7(long_string, short_string):

FILE: ebook/code/python/1.5：回文判断.py
  function is_palindrome1 (line 9) | def is_palindrome1(s):
  function is_palindrome2 (line 26) | def is_palindrome2(s):

FILE: ebook/code/python/1.6：最长回文子串.py
  function fastLongestPalindromes (line 14) | def fastLongestPalindromes(seq):
  function naiveLongestPalindromes (line 95) | def naiveLongestPalindromes(seq):
  function pre_process (line 131) | def pre_process(seq):
  function manacher (line 137) | def manacher(seq):

FILE: ebook/code/python/2.1：寻找最小的k个数.py
  function ksmallest1 (line 11) | def ksmallest1(lst, k):
  function ksmallest2 (line 24) | def ksmallest2(lst, k):
  function ksmallest3 (line 44) | def ksmallest3(lst, k):

FILE: ebook/code/python/2.1：寻找最小的k个数_2.py
  class topk (line 4) | class topk():
    method __init__ (line 6) | def __init__(self, k):
    method push (line 10) | def push(self, val):
    method result (line 17) | def result(self):

FILE: ebook/code/python/2.3：求解500万以内的亲和数.py
  function prime_list (line 4) | def prime_list(n):
  function sum_divisors (line 16) | def sum_divisors(n, primelst):
  function get_sum_div (line 33) | def get_sum_div(n, primelst):

FILE: ebook/code/python/2.4：寻找和为定值的两个数.py
  function find_sum (line 4) | def find_sum(array, key):
  function main (line 19) | def main():

FILE: ebook/code/python/2.6：求连续子数组的最大和.py
  function max_sum (line 8) | def max_sum(ls):
  function test (line 27) | def test():

FILE: ebook/code/python/3.1：二分查找实现.py
  function binary_search (line 1) | def binary_search(lst, n):

FILE: ebook/code/python/3.2：杨氏矩阵查找.py
  function young_matrix_1 (line 2) | def young_matrix_1(matrix, key):
  function young_matrix (line 27) | def young_matrix(matrix, key):

FILE: ebook/code/python/3.3：出现次数超过一半的数字.py
  function more_than_half_number (line 4) | def more_than_half_number(array):

FILE: ebook/code/python/6.6：跳台阶.py
  function fib (line 1) | def fib(n):
  function fib2 (line 13) | def fib2(n):

FILE: ebook/code/python/6.8：第一个只出现一次等问题.py
  function find_first_unique_char (line 1) | def find_first_unique_char(string):

FILE: ebook/code/python/6.9：Trie树.py
  function newTrie (line 5) | def newTrie():
  function updateWord (line 8) | def updateWord(t, word):
  function getWord (line 27) | def getWord(t, word):

FILE: ebook/code/python/chapter04.py
  function strstr (line 1) | def strstr(haystack, needle):
  function test_strstr (line 7) | def test_strstr():
  function find_no_repeat_char (line 13) | def find_no_repeat_char(string):
  function test_find_no_repeat_char (line 23) | def test_find_no_repeat_char():

FILE: ebook/code/python/rcdtype.py
  function recordtype (line 8) | def recordtype(typename, field_names, verbose=False, **default_kwds):

FILE: ebook/code/ruby/chapter01.rb
  function swap (line 4) | def swap(s, i, j)
  function left_shift_one (line 8) | def left_shift_one(s, i, j)
  function simple_shift (line 14) | def simple_shift(s, m)
  function left_shift (line 20) | def left_shift(s, m)
  function invert (line 25) | def invert(s, from, to)
  function invert_solution (line 30) | def invert_solution(s, m)

FILE: ebook/code/ruby/chapter02.rb
  function compare_1 (line 4) | def compare_1(long_string, short_string)
  function compare_2 (line 11) | def compare_2(long_string, short_string)
  function count_sort (line 23) | def count_sort(src)
  function compare_3 (line 38) | def compare_3(long_string, short_string)
  function compare_4 (line 56) | def compare_4(long_string, short_string)
  function compare_5 (line 77) | def compare_5(long_string, short_string)
  function compare_6 (line 90) | def compare_6(long_string, short_string)
  function compare_ruby (line 101) | def compare_ruby(long_string, short_string)

FILE: ebook/code/ruby/chapter03.rb
  function top_minimum (line 4) | def top_minimum(list, k)

FILE: ebook/code/ruby/chapter0301.searchTrend.rb
  function create_hash (line 5) | def create_hash(input)
  function trend (line 17) | def trend(array, k, v, top = 10, desc = true)
  function search_trend (line 34) | def search_trend(input, top = 10, desc = true)

FILE: ebook/code/ruby/chapter0302.quickSort.rb
  function quick_sort_01 (line 4) | def quick_sort_01(list)
  function quick_sort_02 (line 12) | def quick_sort_02(a)
  function quick_sort_performance (line 16) | def quick_sort_performance(size)

FILE: ebook/code/ruby/chapter04.rb
  class String (line 4) | class String
    method o_index (line 7) | def o_index(sub)
    method o_first_count_letter (line 25) | def o_first_count_letter(count = 1)
  class Array (line 35) | class Array
    method copy_to (line 37) | def copy_to(dest)
    method copy (line 44) | def copy(src, dest)

FILE: ebook/code/ruby/chapter05.findSum.rb
  class Array (line 5) | class Array
    method find_01 (line 6) | def find_01(sum)
    method find_02 (line 16) | def find_02(sum)
    method find_03 (line 23) | def find_03(sum)
    method find_with_sum (line 31) | def find_with_sum(sum, min = 1, max = nil)
  function find_sum_with_two (line 46) | def find_sum_with_two(array, sum)
  function minimum_differential (line 59) | def minimum_differential(a, b)

FILE: ebook/code/ruby/chapter06.amicableNumber.rb
  function amicable_number (line 4) | def amicable_number max

FILE: ebook/code/ruby/chapter07.findMaxSum.rb
  function max_sum (line 4) | def max_sum(arr)
  function max_sum_dp (line 17) | def max_sum_dp(arr)

FILE: ebook/code/ruby/chapter16.permutation.rb
  function permutation_recursive (line 3) | def permutation_recursive(ar)

FILE: ebook/code/ruby/chapter17.rb
  function fibonacci_solution (line 4) | def fibonacci_solution n

FILE: ebook/code/ruby/chapter18.rb
  function odd_even (line 4) | def odd_even(arr)
  function reorder_odd_even (line 8) | def reorder_odd_even(arr)