├── data_structure ├── binary_tree │ └── c++ │ │ ├── readme.txt~ │ │ ├── BinaryTree │ │ └── readme.txt │ │ └── binary_tree_stack │ │ ├── Makefile │ │ └── main.cpp ├── avl │ ├── src_avl_tree │ │ └── from_oldproject │ ├── sufficient_avl │ │ ├── AUTHORS │ │ ├── trivial.tree │ │ ├── rootins2.tree │ │ ├── pbstsucc.tree │ │ ├── traversal.tree │ │ ├── vine.tree │ │ ├── preins.tree │ │ ├── postins.tree │ │ ├── tbstbal1.tree │ │ ├── tbstbal2.tree │ │ ├── TODO │ │ ├── notavlex.tree │ │ ├── tbstparent.tree │ │ ├── up.png │ │ ├── bal1.pdf │ │ ├── bal1.png │ │ ├── bal2.pdf │ │ ├── bal2.png │ │ ├── next.png │ │ ├── prev.png │ │ ├── rbex.pdf │ │ ├── rbex.png │ │ ├── toc.png │ │ ├── vine.pdf │ │ ├── vine.png │ │ ├── 100-114.pdf │ │ ├── 100-114.png │ │ ├── altdef.pdf │ │ ├── altdef.png │ │ ├── avldel1.pdf │ │ ├── avldel1.png │ │ ├── avldel2.pdf │ │ ├── avldel2.png │ │ ├── avldel3.pdf │ │ ├── avldel3.png │ │ ├── avldelre2.tree │ │ ├── avlex.pdf │ │ ├── avlex.png │ │ ├── avlex2.pdf │ │ ├── avlex2.png │ │ ├── avlex3.pdf │ │ ├── avlex3.png │ │ ├── avlex4.pdf │ │ ├── avlex4.png │ │ ├── avlexer.pdf │ │ ├── avlexer.png │ │ ├── avlins1.pdf │ │ ├── avlins1.png │ │ ├── avlins2.pdf │ │ ├── avlins2.png │ │ ├── avlins3.pdf │ │ ├── avlins3.png │ │ ├── avlins4.pdf │ │ ├── avlins4.png │ │ ├── bstdel.pdf │ │ ├── bstdel.png │ │ ├── bstdel2.pdf │ │ ├── bstdel2.png │ │ ├── bstdel3.pdf │ │ ├── bstdel3.png │ │ ├── bstdel4.pdf │ │ ├── bstdel4.png │ │ ├── bstjoin.pdf │ │ ├── bstjoin.png │ │ ├── bstrot1.pdf │ │ ├── bstrot1.png │ │ ├── bstrot2.pdf │ │ ├── bstrot2.png │ │ ├── cover.pdf │ │ ├── destroy.pdf │ │ ├── destroy.png │ │ ├── index.png │ │ ├── padding.png │ │ ├── postins.pdf │ │ ├── postins.png │ │ ├── prbdr1.pdf │ │ ├── prbdr1.png │ │ ├── prbdr3.pdf │ │ ├── prbdr3.png │ │ ├── prbins1.pdf │ │ ├── prbins1.png │ │ ├── prbins2.pdf │ │ ├── prbins2.png │ │ ├── prbins3.pdf │ │ ├── prbins3.png │ │ ├── preins.pdf │ │ ├── preins.png │ │ ├── rbctrex.pdf │ │ ├── rbctrex.png │ │ ├── rbdel1.pdf │ │ ├── rbdel1.png │ │ ├── rbdel2.pdf │ │ ├── rbdel2.png │ │ ├── rbdel3.pdf │ │ ├── rbdel3.png │ │ ├── rbdel4.pdf │ │ ├── rbdel4.png │ │ ├── rbdeln1.pdf │ │ ├── rbdeln1.png │ │ ├── rbdeln2.pdf │ │ ├── rbdeln2.png │ │ ├── rbdeln3.pdf │ │ ├── rbdeln3.png │ │ ├── rbib1.pdf │ │ ├── rbib1.png │ │ ├── rbib2.pdf │ │ ├── rbib2.png │ │ ├── rbib3.pdf │ │ ├── rbib3.png │ │ ├── rbins1.pdf │ │ ├── rbins1.png │ │ ├── rbins2.pdf │ │ ├── rbins2.png │ │ ├── rbins3.pdf │ │ ├── rbins3.png │ │ ├── rootins.pdf │ │ ├── rootins.png │ │ ├── rotdel.pdf │ │ ├── rotdel.png │ │ ├── rotdel2.pdf │ │ ├── rotdel2.png │ │ ├── rotdel3.pdf │ │ ├── rotdel3.png │ │ ├── rtbst1.pdf │ │ ├── rtbst1.png │ │ ├── rtbstdel.tree │ │ ├── rtbstins.tree │ │ ├── rtrbins.pdf │ │ ├── rtrbins.png │ │ ├── skipfwd.png │ │ ├── tavldel.pdf │ │ ├── tavldel.png │ │ ├── tavlrot.pdf │ │ ├── tavlrot.png │ │ ├── tbst1.pdf │ │ ├── tbst1.png │ │ ├── tbstcmp.pdf │ │ ├── tbstcmp.png │ │ ├── tbstins.pdf │ │ ├── tbstins.png │ │ ├── trbdel.pdf │ │ ├── trbdel.png │ │ ├── trbdel2.pdf │ │ ├── trbdel2.png │ │ ├── trbins.pdf │ │ ├── trbins.png │ │ ├── trbins2.pdf │ │ ├── trbins2.png │ │ ├── trivial.pdf │ │ ├── trivial.png │ │ ├── avlbalex.pdf │ │ ├── avlbalex.png │ │ ├── avlcase1.pdf │ │ ├── avlcase1.png │ │ ├── avlcase2.pdf │ │ ├── avlcase2.png │ │ ├── avlcase21.pdf │ │ ├── avlcase21.png │ │ ├── avlcase22.pdf │ │ ├── avlcase22.png │ │ ├── avlcase23.pdf │ │ ├── avlcase23.png │ │ ├── avldelre1.pdf │ │ ├── avldelre1.png │ │ ├── avldelre1.tree │ │ ├── avldelre2.pdf │ │ ├── avldelre2.png │ │ ├── avldelre3.pdf │ │ ├── avldelre3.png │ │ ├── avlexera.pdf │ │ ├── avlexera.png │ │ ├── balance5.pdf │ │ ├── balance5.png │ │ ├── balance9.pdf │ │ ├── balance9.png │ │ ├── bstjoin2.pdf │ │ ├── bstjoin2.png │ │ ├── bstjoin3.pdf │ │ ├── bstjoin3.png │ │ ├── bstjoin4.pdf │ │ ├── bstjoin4.png │ │ ├── bstjoin5.pdf │ │ ├── bstjoin5.png │ │ ├── compress.pdf │ │ ├── compress.png │ │ ├── notavlex.pdf │ │ ├── notavlex.png │ │ ├── patholog1.pdf │ │ ├── patholog1.png │ │ ├── patholog2.pdf │ │ ├── patholog2.png │ │ ├── pbstdel1.pdf │ │ ├── pbstdel1.png │ │ ├── pbstdel2.pdf │ │ ├── pbstdel2.png │ │ ├── pbstsucc.pdf │ │ ├── pbstsucc.png │ │ ├── ranksize.pdf │ │ ├── ranksize.png │ │ ├── rbunique.pdf │ │ ├── rbunique.png │ │ ├── rootins2.pdf │ │ ├── rootins2.png │ │ ├── rotation.pdf │ │ ├── rotation.png │ │ ├── rtavldel1.pdf │ │ ├── rtavldel1.png │ │ ├── rtavldel2.pdf │ │ ├── rtavldel2.png │ │ ├── rtavlins1.pdf │ │ ├── rtavlins1.png │ │ ├── rtavlins2.pdf │ │ ├── rtavlins2.png │ │ ├── rtavlins3.pdf │ │ ├── rtavlins3.png │ │ ├── rtavlins4.pdf │ │ ├── rtavlins4.png │ │ ├── rtavlrot.pdf │ │ ├── rtavlrot.png │ │ ├── rtbstdel.pdf │ │ ├── rtbstdel.png │ │ ├── rtbstdel2.pdf │ │ ├── rtbstdel2.png │ │ ├── rtbstdel2.tree │ │ ├── rtbstins.pdf │ │ ├── rtbstins.png │ │ ├── rtbstins2.pdf │ │ ├── rtbstins2.png │ │ ├── rtbstprev.pdf │ │ ├── rtbstprev.png │ │ ├── rtrbdel1.pdf │ │ ├── rtrbdel1.png │ │ ├── rtrbdel2.pdf │ │ ├── rtrbdel2.png │ │ ├── rtrbdel3.pdf │ │ ├── rtrbdel3.png │ │ ├── rtrbdel4.pdf │ │ ├── rtrbdel4.png │ │ ├── rtrbins2.pdf │ │ ├── rtrbins2.png │ │ ├── rtrbins3.pdf │ │ ├── rtrbins3.png │ │ ├── rtrbins4.pdf │ │ ├── rtrbins4.png │ │ ├── skipback.png │ │ ├── tavldel2.pdf │ │ ├── tavldel2.png │ │ ├── tavldel3.pdf │ │ ├── tavldel3.png │ │ ├── tavlins1.pdf │ │ ├── tavlins1.png │ │ ├── tavlins2.pdf │ │ ├── tavlins2.png │ │ ├── tavlrot2.pdf │ │ ├── tavlrot2.png │ │ ├── tbstbal1.pdf │ │ ├── tbstbal1.png │ │ ├── tbstbal2.pdf │ │ ├── tbstbal2.png │ │ ├── tbstbal3.pdf │ │ ├── tbstbal3.png │ │ ├── tbstcopy.pdf │ │ ├── tbstcopy.png │ │ ├── tbstcopy2.pdf │ │ ├── tbstcopy2.png │ │ ├── tbstdel1.pdf │ │ ├── tbstdel1.png │ │ ├── tbstdel2.pdf │ │ ├── tbstdel2.png │ │ ├── tbstdel2.tree │ │ ├── tbstdel3.pdf │ │ ├── tbstdel3.png │ │ ├── tbstdel4.pdf │ │ ├── tbstdel4.png │ │ ├── tbstdel5.pdf │ │ ├── tbstdel5.png │ │ ├── tbstdel6.pdf │ │ ├── tbstdel6.png │ │ ├── trav-circ.pdf │ │ ├── trav-circ.png │ │ ├── trav-line.pdf │ │ ├── trav-line.png │ │ ├── traversal.pdf │ │ ├── traversal.png │ │ ├── tree2vine.pdf │ │ ├── tree2vine.png │ │ ├── vine2tree.pdf │ │ ├── vine2tree.png │ │ ├── 4dfcb735496a.zip │ │ ├── avldelre3.tree │ │ ├── avlmuchbal.pdf │ │ ├── avlmuchbal.png │ │ ├── avlmuchbal2.pdf │ │ ├── avlmuchbal2.png │ │ ├── pbstdel1.tree │ │ ├── rbdelcase2.pdf │ │ ├── rbdelcase2.png │ │ ├── rbdelcase3.pdf │ │ ├── rbdelcase3.png │ │ ├── rbdeln2.tree │ │ ├── rbdeln3.tree │ │ ├── tbstdel1triv.pdf │ │ ├── tbstdel1triv.png │ │ ├── tbstdel4-2.pdf │ │ ├── tbstdel4-2.png │ │ ├── tbstparent.pdf │ │ ├── tbstparent.png │ │ ├── vine2tree2.pdf │ │ ├── vine2tree2.png │ │ ├── vine2tree3.pdf │ │ ├── vine2tree3.png │ │ ├── bstdel.tree │ │ ├── rtavlrot.tree │ │ ├── bstjoin2.tree │ │ ├── destroy.tree │ │ ├── tavlrot.tree │ │ ├── avlins3.tree │ │ ├── patholog1.tree │ │ ├── rotation.tree │ │ ├── bstjoin4.tree │ │ ├── compress.tree │ │ ├── rbdeln1.tree │ │ ├── tbstcmp.tree │ │ ├── avlex2.tree │ │ ├── bstjoin.tree │ │ ├── bstjoin5.tree │ │ ├── rbdelcase2.tree │ │ ├── avlex.tree │ │ ├── avlex4.tree │ │ ├── tree2vine.tree │ │ ├── tavldel.tree │ │ ├── avlbalex.tree │ │ ├── bal2.tree │ │ ├── bstjoin3.tree │ │ ├── tavldel2.tree │ │ ├── tbstdel1triv.tree │ │ ├── avlins2.tree │ │ ├── avlexer.tree │ │ ├── avlcase21.tree │ │ ├── prbins2.tree │ │ ├── bstrot1.tree │ │ ├── bstrot2.tree │ │ ├── prbins3.tree │ │ ├── balance5.tree │ │ ├── rtavldel1.tree │ │ ├── rtavlins2.tree │ │ ├── rtbstins2.tree │ │ ├── tavlins1.tree │ │ ├── trav-line.txt │ │ ├── altdef.tree │ │ ├── avlins4.tree │ │ ├── rtavlins3.tree │ │ ├── rtavlins4.tree │ │ ├── tavlins2.tree │ │ ├── tbstbal3.tree │ │ ├── rbins2.tree │ │ ├── rtavldel2.tree │ │ ├── rtavlins1.tree │ │ ├── rtrbins.tree │ │ ├── rtrbins2.tree │ │ ├── 100-114.tree │ │ ├── avlexera.tree │ │ ├── rbctrex.tree │ │ ├── rbdel2.tree │ │ ├── rbib2.tree │ │ ├── rbins3.tree │ │ ├── rotdel2.tree │ │ ├── rtrbins3.tree │ │ ├── rtrbins4.tree │ │ ├── tavldel3.tree │ │ ├── trbins.tree │ │ ├── rbib3.tree │ │ ├── trbins2.tree │ │ ├── tbstdel6.tree │ │ ├── rbunique.tree │ │ ├── rtbst1.tree │ │ ├── tbstdel5.tree │ │ ├── avlcase1.tree │ │ ├── avldel2.tree │ │ ├── avldel3.tree │ │ ├── ranksize.tree │ │ ├── avlins1.tree │ │ ├── bal1.tree │ │ ├── prbins1.tree │ │ ├── tbst1.tree │ │ ├── rotdel.tree │ │ ├── bstdel2.tree │ │ ├── bstdel3.tree │ │ ├── bstdel4.tree │ │ ├── pbstdel2.tree │ │ ├── avlex3.tree │ │ ├── prbdr1.tree │ │ ├── prbdr3.tree │ │ ├── rbdel3.tree │ │ ├── rtbstprev.tree │ │ ├── trbdel.tree │ │ ├── patholog2.tree │ │ ├── rtrbdel1.tree │ │ ├── rtrbdel2.tree │ │ ├── rbdel4.tree │ │ ├── rotdel3.tree │ │ ├── rbib1.tree │ │ ├── rtrbdel3.tree │ │ ├── rtrbdel4.tree │ │ ├── tavlrot2.tree │ │ ├── tbstdel1.tree │ │ ├── tbstdel4-2.tree │ │ ├── rbdel1.tree │ │ ├── rbdelcase3.tree │ │ ├── rbex.tree │ │ ├── rbins1.tree │ │ ├── trbdel2.tree │ │ ├── tbstcopy.tree │ │ ├── avlcase2.tree │ │ ├── avldel1.tree │ │ ├── tbstdel3.tree │ │ ├── balance9.tree │ │ ├── tbstcopy2.tree │ │ ├── tbstdel4.tree │ │ ├── vine2tree.tree │ │ ├── tbstins.tree │ │ ├── avlcase22.tree │ │ ├── avlcase23.tree │ │ ├── vine2tree3.tree │ │ ├── rootins.tree │ │ ├── avlmuchbal2.tree │ │ ├── vine2tree2.tree │ │ ├── avlmuchbal.tree │ │ ├── examples.w │ │ ├── ROADMAP │ │ ├── THANKS │ │ ├── cover.eps │ │ └── test.h │ ├── neatAVL │ │ ├── readme.txt │ │ └── Comparable.h │ ├── sort_search │ │ ├── readme.txt │ │ └── Comparable.h │ └── avltree │ │ ├── Makefile │ │ ├── main.cpp │ │ └── AvlNode.h ├── hash_table │ ├── 1 │ │ ├── readme.txt │ │ └── Makefile │ ├── 2 │ │ ├── readme.txt~ │ │ ├── readme.txt │ │ └── Makefile │ ├── sparsehash-1.3 │ │ ├── NEWS │ │ ├── packages │ │ │ ├── deb │ │ │ │ ├── compat │ │ │ │ ├── sparsehash.dirs │ │ │ │ ├── sparsehash.install │ │ │ │ ├── README │ │ │ │ ├── docs │ │ │ │ └── control │ │ │ └── rpm │ │ │ │ └── rpm.spec │ │ ├── AUTHORS │ │ ├── experimental │ │ │ ├── Makefile │ │ │ ├── README │ │ │ └── example.c │ │ ├── src │ │ │ ├── config.h.include │ │ │ └── windows │ │ │ │ └── google │ │ │ │ └── sparsehash │ │ │ │ └── sparseconfig.h │ │ ├── m4 │ │ │ ├── namespaces.m4 │ │ │ ├── stl_namespace.m4 │ │ │ └── stl_hash_fun.m4 │ │ ├── TODO │ │ ├── README.windows │ │ └── COPYING │ ├── sparsehash-2.0.2 │ │ ├── packages │ │ │ └── deb │ │ │ │ ├── compat │ │ │ │ ├── .svn │ │ │ │ ├── text-base │ │ │ │ │ ├── compat.svn-base │ │ │ │ │ ├── sparsehash.dirs.svn-base │ │ │ │ │ ├── sparsehash.install.svn-base │ │ │ │ │ ├── README.svn-base │ │ │ │ │ ├── docs.svn-base │ │ │ │ │ └── control.svn-base │ │ │ │ ├── prop-base │ │ │ │ │ └── rules.svn-base │ │ │ │ └── all-wcprops │ │ │ │ ├── sparsehash.dirs │ │ │ │ ├── sparsehash.install │ │ │ │ ├── README │ │ │ │ ├── docs │ │ │ │ └── control │ │ ├── AUTHORS │ │ ├── src │ │ │ ├── windows │ │ │ │ ├── google │ │ │ │ │ ├── .svn │ │ │ │ │ │ ├── all-wcprops │ │ │ │ │ │ └── entries │ │ │ │ │ └── sparsehash │ │ │ │ │ │ ├── .svn │ │ │ │ │ │ ├── all-wcprops │ │ │ │ │ │ ├── entries │ │ │ │ │ │ └── text-base │ │ │ │ │ │ │ └── sparseconfig.h.svn-base │ │ │ │ │ │ └── sparseconfig.h │ │ │ │ ├── sparsehash │ │ │ │ │ ├── .svn │ │ │ │ │ │ ├── all-wcprops │ │ │ │ │ │ └── entries │ │ │ │ │ └── internal │ │ │ │ │ │ ├── .svn │ │ │ │ │ │ ├── all-wcprops │ │ │ │ │ │ └── entries │ │ │ │ │ │ └── sparseconfig.h │ │ │ │ └── .svn │ │ │ │ │ ├── all-wcprops │ │ │ │ │ └── entries │ │ │ └── config.h.include │ │ ├── experimental │ │ │ ├── Makefile │ │ │ ├── .svn │ │ │ │ ├── text-base │ │ │ │ │ ├── Makefile.svn-base │ │ │ │ │ ├── README.svn-base │ │ │ │ │ └── example.c.svn-base │ │ │ │ └── all-wcprops │ │ │ ├── README │ │ │ └── example.c │ │ ├── m4 │ │ │ ├── namespaces.m4 │ │ │ └── stl_hash_fun.m4 │ │ ├── TODO │ │ ├── README_windows.txt │ │ └── COPYING │ └── 实验五 │ │ ├── OS.ppt │ │ ├── 11111.doc │ │ ├── osfile.exe │ │ ├── hashtable │ │ ├── Makefile │ │ ├── hashtable │ │ └── hashtable.o │ │ └── 111110305.doc ├── counting_sort │ ├── in.txt │ ├── readme.txt~ │ ├── readme.txt │ ├── Makefile │ └── counting_sort.c ├── heap_sort │ ├── in.txt │ ├── readme.txt │ ├── Makefile │ └── heap_sort.c ├── skip_list │ ├── c │ │ ├── 1 │ │ │ ├── readme.txt │ │ │ └── Makefile │ │ └── 2 │ │ │ ├── readme.txt │ │ │ └── Makefile │ └── c++ │ │ └── 1 │ │ ├── readme.txt │ │ └── Makefile ├── all_sort │ └── Makefile ├── string │ ├── KMp │ │ └── Makefile │ └── str │ │ ├── Makefile │ │ └── str.c ├── clist │ ├── Makefile │ └── clist.h ├── 左旋转字符串 │ ├── 1 │ │ ├── Makefile │ │ └── invert_str.c │ ├── 2 │ │ ├── Makefile │ │ └── invert_str.cpp │ └── 3 │ │ └── Makefile ├── b-tree │ └── c │ │ └── 1 │ │ ├── Makefile │ │ ├── main.c │ │ └── domainUpdate.h ├── bubble_sort │ └── python │ │ ├── bubble.py │ │ └── bubble_sort.py ├── file_merge_sort │ ├── generate_data.py │ ├── logging.conf │ └── README.txt └── quick_sort │ └── quick_sort.py └── README.md /data_structure/binary_tree/c++/readme.txt~: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /data_structure/avl/src_avl_tree/from_oldproject: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/NEWS: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /data_structure/counting_sort/in.txt: -------------------------------------------------------------------------------- 1 | 6 34 5 5 65 89 47 2 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/packages/deb/compat: -------------------------------------------------------------------------------- 1 | 4 2 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/compat: -------------------------------------------------------------------------------- 1 | 4 2 | -------------------------------------------------------------------------------- /data_structure/heap_sort/in.txt: -------------------------------------------------------------------------------- 1 | 12 78 63 54 54 66 78 15 87 23 2 | -------------------------------------------------------------------------------- /data_structure/skip_list/c/2/readme.txt: -------------------------------------------------------------------------------- 1 | 1.非常节省内存和空间 2 | 3 | 4 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | data_structure 2 | ============== 3 | 4 | 关于各种数据结构和算法的一些收录 5 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/AUTHORS: -------------------------------------------------------------------------------- 1 | Ben Pfaff 2 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trivial.tree: -------------------------------------------------------------------------------- 1 | 1( 2 | 2, 3 | 3) 4 | -------------------------------------------------------------------------------- /data_structure/skip_list/c++/1/readme.txt: -------------------------------------------------------------------------------- 1 | 1.很好的随机数产生算法 2 | 2.实现了数据的持久化 3 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rootins2.tree: -------------------------------------------------------------------------------- 1 | 4( 2 | 3( 3 | 2( 4 | 1))) 5 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/AUTHORS: -------------------------------------------------------------------------------- 1 | opensource@google.com 2 | 3 | -------------------------------------------------------------------------------- /data_structure/skip_list/c/1/readme.txt: -------------------------------------------------------------------------------- 1 | 1.较为浪费空间 2 | 2.方便测试和计算 3 | 3.代码简介易懂 4 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/pbstsucc.tree: -------------------------------------------------------------------------------- 1 | *q( 2 | p( 3 | ^a, 4 | ^b), 5 | ^c) 6 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/traversal.tree: -------------------------------------------------------------------------------- 1 | 4( 2 | 2( 3 | 1, 4 | 3), 5 | 5) 6 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine.tree: -------------------------------------------------------------------------------- 1 | 4( 2 | 3( 3 | 2( 4 | 1( 5 | 0)))) 6 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/.svn/text-base/compat.svn-base: -------------------------------------------------------------------------------- 1 | 4 2 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/preins.tree: -------------------------------------------------------------------------------- 1 | 5( 2 | 3( 3 | 2, 4 | 4), 5 | 8( 6 | 6)) 7 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/AUTHORS: -------------------------------------------------------------------------------- 1 | google-sparsehash@googlegroups.com 2 | 3 | -------------------------------------------------------------------------------- /data_structure/counting_sort/readme.txt~: -------------------------------------------------------------------------------- 1 | 1.相比桶排序其更稳定，其时间复杂度始终为o(n+k),而桶排序最好时间复杂度为o(n),最差为o(n**2) 2 | -------------------------------------------------------------------------------- /data_structure/avl/neatAVL/readme.txt: -------------------------------------------------------------------------------- 1 | g++ -o test test.cpp AvlTreeNode.cpp AvlTreeNode.h Comparable.h 2 | -------------------------------------------------------------------------------- /data_structure/binary_tree/c++/BinaryTree/readme.txt: -------------------------------------------------------------------------------- 1 | 自己写的二叉树模板类，使用时只用包含头文件即可 2 | BinaryTree tree; 3 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/packages/deb/sparsehash.dirs: -------------------------------------------------------------------------------- 1 | usr/include 2 | usr/include/google 3 | -------------------------------------------------------------------------------- /data_structure/heap_sort/readme.txt: -------------------------------------------------------------------------------- 1 | 1.堆排序对记录数较少的文件并不值得提倡，但对n较大的文件还是很有效的。 2 | 2.堆排序在最坏情况下，其时间复杂度为o(nlogn) 3 | -------------------------------------------------------------------------------- /data_structure/all_sort/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc main 3 | main:main.o 4 | g++ -o $@ $^ 5 | ..c.o: 6 | g++ -c $< 7 | -------------------------------------------------------------------------------- /data_structure/avl/sort_search/readme.txt: -------------------------------------------------------------------------------- 1 | g++ -o main main.cpp AvlTreeNode.cpp AvlTreeNode.h Comparable.h 2 | -------------------------------------------------------------------------------- /data_structure/hash_table/2/readme.txt~: -------------------------------------------------------------------------------- 1 | 1.较好的实现了字符串和存储数字key的转化，hash函数比较不错 2 | 2.接口定义的相当的好 3 | 3.实现了增删改查和遍历的接口 4 | -------------------------------------------------------------------------------- /data_structure/string/KMp/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc KMP 3 | KMP:KMP.o 4 | gcc -o $@ $^ 5 | ..c.o: 6 | gcc -c $< 7 | -------------------------------------------------------------------------------- /data_structure/string/str/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc str 3 | str:str.o 4 | gcc -o $@ $^ 5 | ..c.o: 6 | gcc -c $< 7 | -------------------------------------------------------------------------------- /data_structure/avl/avltree/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #g++ main 3 | main:main.o 4 | g++ -o $@ $^ 5 | ..c.o: 6 | g++ -c $< 7 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/postins.tree: -------------------------------------------------------------------------------- 1 | 5( 2 | 3( 3 | 2, 4 | 4), 5 | 8( 6 | 6( 7 | , 8 | 7))) 9 | -------------------------------------------------------------------------------- /data_structure/clist/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc clist 3 | clist:clist.o main.o 4 | gcc -o $@ $^ 5 | ..c.o: 6 | gcc -c $< 7 | -------------------------------------------------------------------------------- /data_structure/counting_sort/readme.txt: -------------------------------------------------------------------------------- 1 | 1.相比桶排序其更稳定，其时间复杂度始终为o(n+k),而桶排序最好时间复杂度为o(n),最差为o(n**2) 2 | 2.计数排序更浪费空间 3 | -------------------------------------------------------------------------------- /data_structure/hash_table/1/readme.txt: -------------------------------------------------------------------------------- 1 | 1.sample example 2 | 2.哈希函数的构造方法为：除留余数法 3 | 3.没有实现key的生成策路 4 | 4.冲突处理方法为：线性探测再散列 5 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstbal1.tree: -------------------------------------------------------------------------------- 1 | 3=3( 2 | 1=1/;p_( 3 | >>, 4 | 2\_;q( 5 | >1, 6 | >3)), 7 | >>) 8 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstbal2.tree: -------------------------------------------------------------------------------- 1 | 3=3( 2 | !2=2/;q( 3 | 1/;p_( 4 | >>, 5 | >2), 6 | >3), 7 | >>) 8 | -------------------------------------------------------------------------------- /data_structure/hash_table/2/readme.txt: -------------------------------------------------------------------------------- 1 | 1.较好的实现了字符串和存储数字key的转化，hash函数比较不错 2 | 2.接口定义的相当的好 3 | 3.实现了增删改查和遍历的接口 4 | 4.注释详细，阅读简单 5 | -------------------------------------------------------------------------------- /data_structure/heap_sort/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc heap_sort 3 | heap_sort:heap_sort.o 4 | gcc -o $@ $^ 5 | ..c.o: 6 | gcc -c $< 7 | -------------------------------------------------------------------------------- /data_structure/hash_table/1/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc hashtable 3 | hashtable:hashtable.o 4 | gcc -o $@ $^ 5 | ..c.o: 6 | gcc -c $< 7 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/packages/deb/sparsehash.install: -------------------------------------------------------------------------------- 1 | usr/include/google/* 2 | debian/tmp/usr/include/google/* 3 | -------------------------------------------------------------------------------- /data_structure/hash_table/实验五/OS.ppt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/hash_table/实验五/OS.ppt -------------------------------------------------------------------------------- /data_structure/skip_list/c++/1/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc skip_list 3 | skip_list:skip_list.o 4 | g++ -o $@ $^ 5 | ..c.o: 6 | g++ -c $< 7 | -------------------------------------------------------------------------------- /data_structure/skip_list/c/1/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc skip_list 3 | skip_list:skip_list.o 4 | gcc -o $@ $^ 5 | ..c.o: 6 | gcc -c $< 7 | -------------------------------------------------------------------------------- /data_structure/skip_list/c/2/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc skip_list 3 | skip_list:skip_list.o 4 | gcc -o $@ $^ 5 | ..c.o: 6 | gcc -c $< 7 | -------------------------------------------------------------------------------- /data_structure/左旋转字符串/1/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc invert_str 3 | invert_str:invert_str.o 4 | gcc -o $@ $^ 5 | ..c.o: 6 | gcc -c $< 7 | -------------------------------------------------------------------------------- /data_structure/左旋转字符串/2/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc invert_str 3 | invert_str:invert_str.o 4 | g++ -o $@ $^ 5 | ..c.o: 6 | g++ -c $< 7 | -------------------------------------------------------------------------------- /data_structure/左旋转字符串/3/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc invert_str 3 | invert_str:invert_str.o 4 | g++ -o $@ $^ 5 | ..c.o: 6 | g++ -c $< 7 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/TODO: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/TODO -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/notavlex.tree: -------------------------------------------------------------------------------- 1 | 3( 2 | 2( 3 | 1)) 4 | 5 | || 6 | 7 | 4( 8 | 2( 9 | 1, 10 | 3)) 11 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstparent.tree: -------------------------------------------------------------------------------- 1 | q=q( 2 | ^a, 3 | p( 4 | ^...( 5 | s( 6 | >q, 7 | ^c)), 8 | ^b)) 9 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/up.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/up.png -------------------------------------------------------------------------------- /data_structure/binary_tree/c++/binary_tree_stack/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc main 3 | main:main.o 4 | g++ -o $@ $^ 5 | ..c.o: 6 | g++ -c $< 7 | -------------------------------------------------------------------------------- /data_structure/hash_table/2/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc hash_table 3 | hash_table:hash_table.o 4 | gcc -o $@ $^ 5 | ..c.o: 6 | gcc -c $< 7 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/.svn/prop-base/rules.svn-base: -------------------------------------------------------------------------------- 1 | K 14 2 | svn:executable 3 | V 1 4 | * 5 | END 6 | -------------------------------------------------------------------------------- /data_structure/hash_table/实验五/11111.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/hash_table/实验五/11111.doc -------------------------------------------------------------------------------- /data_structure/hash_table/实验五/osfile.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/hash_table/实验五/osfile.exe -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bal1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bal1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bal1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bal1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bal2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bal2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bal2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bal2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/next.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/next.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prev.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/prev.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbex.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbex.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbex.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbex.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/toc.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/toc.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/vine.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/vine.png -------------------------------------------------------------------------------- /data_structure/counting_sort/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc counting_sort 3 | counting_sort:counting_sort.o 4 | gcc -o $@ $^ 5 | ..c.o: 6 | gcc -c $< 7 | -------------------------------------------------------------------------------- /data_structure/hash_table/实验五/hashtable/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc hashtable 3 | hashtable:hashtable.o 4 | gcc -o $@ $^ 5 | ..c.o: 6 | gcc -c $< 7 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/100-114.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/100-114.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/100-114.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/100-114.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/altdef.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/altdef.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/altdef.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/altdef.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldel1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldel1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldel1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldel1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldel2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldel2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldel2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldel2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldel3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldel3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldel3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldel3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldelre2.tree: -------------------------------------------------------------------------------- 1 | *\y|%0( 2 | ^a&h, 3 | ^b&h) 4 | 5 | => 6 | 7 | *\y|%+( 8 | ^a'&h-1, 9 | ^b&_h_) 10 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlex.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlex.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlex2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlex2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlex3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlex3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex4.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlex4.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlex4.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlexer.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlexer.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlexer.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlexer.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlins1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlins1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlins2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlins2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlins3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlins3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins4.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlins4.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlins4.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstdel.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstdel.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstdel2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstdel2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstdel3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstdel3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel4.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstdel4.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstdel4.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstjoin.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstjoin.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstrot1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstrot1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstrot1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstrot1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstrot2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstrot2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstrot2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstrot2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/cover.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/cover.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/destroy.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/destroy.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/destroy.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/destroy.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/index.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/index.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/padding.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/padding.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/postins.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/postins.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/postins.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/postins.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbdr1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/prbdr1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbdr1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/prbdr1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbdr3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/prbdr3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbdr3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/prbdr3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbins1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/prbins1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbins1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/prbins1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbins2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/prbins2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbins2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/prbins2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbins3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/prbins3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbins3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/prbins3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/preins.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/preins.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/preins.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/preins.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbctrex.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbctrex.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbctrex.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbctrex.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdel1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdel1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdel2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdel2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdel3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdel3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel4.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdel4.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdel4.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdeln1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdeln1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdeln1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdeln1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdeln2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdeln2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdeln2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdeln2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdeln3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdeln3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdeln3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdeln3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbib1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbib1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbib1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbib1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbib2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbib2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbib2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbib2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbib3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbib3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbib3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbib3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbins1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbins1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbins1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbins1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbins2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbins2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbins2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbins2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbins3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbins3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbins3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbins3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rootins.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rootins.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rootins.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rootins.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotdel.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rotdel.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotdel.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rotdel.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotdel2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rotdel2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotdel2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rotdel2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotdel3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rotdel3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotdel3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rotdel3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbst1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbst1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbst1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbst1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstdel.tree: -------------------------------------------------------------------------------- 1 | *p( 2 | , 3 | x( 4 | ^a, 5 | ^b)) 6 | 7 | => 8 | 9 | *x( 10 | ^a, 11 | ^b) 12 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstins.tree: -------------------------------------------------------------------------------- 1 | *p( 2 | , 3 | ^a) 4 | 5 | => 6 | 7 | *p=p( 8 | n( 9 | , 10 | >p), 11 | ^a) 12 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbins.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbins.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/skipfwd.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/skipfwd.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavldel.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavldel.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavldel.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavldel.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlrot.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavlrot.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlrot.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavlrot.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbst1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbst1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbst1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbst1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstcmp.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstcmp.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstcmp.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstcmp.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstins.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstins.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstins.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstins.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbdel.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trbdel.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbdel.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trbdel.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbdel2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trbdel2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbdel2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trbdel2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbins.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trbins.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbins.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trbins.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbins2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trbins2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbins2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trbins2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trivial.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trivial.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trivial.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trivial.png -------------------------------------------------------------------------------- /data_structure/hash_table/实验五/111110305.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/hash_table/实验五/111110305.doc -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlbalex.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlbalex.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlbalex.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlbalex.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlcase1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlcase1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlcase2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlcase2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase21.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlcase21.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase21.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlcase21.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase22.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlcase22.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase22.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlcase22.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase23.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlcase23.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase23.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlcase23.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldelre1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldelre1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldelre1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldelre1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldelre1.tree: -------------------------------------------------------------------------------- 1 | *\y|%-( 2 | ^a&_h_, 3 | ^b&h-1) 4 | 5 | => 6 | 7 | *\y|%0( 8 | ^a'&h-1, 9 | ^b&h-1) 10 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldelre2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldelre2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldelre2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldelre2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldelre3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldelre3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldelre3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avldelre3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlexera.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlexera.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlexera.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlexera.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/balance5.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/balance5.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/balance5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/balance5.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/balance9.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/balance9.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/balance9.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/balance9.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstjoin2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstjoin2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstjoin3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstjoin3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin4.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstjoin4.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstjoin4.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin5.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstjoin5.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/bstjoin5.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/compress.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/compress.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/compress.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/compress.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/notavlex.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/notavlex.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/notavlex.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/notavlex.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/patholog1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/patholog1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/patholog1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/patholog1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/patholog2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/patholog2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/patholog2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/patholog2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/pbstdel1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/pbstdel1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/pbstdel1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/pbstdel1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/pbstdel2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/pbstdel2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/pbstdel2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/pbstdel2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/pbstsucc.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/pbstsucc.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/pbstsucc.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/pbstsucc.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/ranksize.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/ranksize.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/ranksize.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/ranksize.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbunique.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbunique.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbunique.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbunique.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rootins2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rootins2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rootins2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rootins2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotation.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rotation.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotation.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rotation.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavldel1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavldel1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavldel1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavldel1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavldel2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavldel2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavldel2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavldel2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavlins1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavlins1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavlins2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavlins2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavlins3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavlins3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins4.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavlins4.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavlins4.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlrot.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavlrot.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlrot.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtavlrot.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstdel.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbstdel.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstdel.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbstdel.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstdel2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbstdel2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstdel2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbstdel2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstdel2.tree: -------------------------------------------------------------------------------- 1 | *p=p( 2 | r( 3 | ^a, 4 | >p), 5 | ^b) 6 | 7 | => 8 | 9 | *r( 10 | ^a, 11 | ^b) 12 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstins.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbstins.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstins.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbstins.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstins2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbstins2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstins2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbstins2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstprev.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbstprev.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstprev.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtbstprev.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbdel1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbdel1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbdel2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbdel2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbdel3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbdel3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel4.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbdel4.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbdel4.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbins2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbins2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbins3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbins3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins4.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbins4.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rtrbins4.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/skipback.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/skipback.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavldel2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavldel2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavldel2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavldel2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavldel3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavldel3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavldel3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavldel3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlins1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavlins1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlins1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavlins1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlins2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavlins2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlins2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavlins2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlrot2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavlrot2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlrot2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tavlrot2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstbal1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstbal1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstbal1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstbal1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstbal2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstbal2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstbal2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstbal2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstbal3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstbal3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstbal3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstbal3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstcopy.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstcopy.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstcopy.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstcopy.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstcopy2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstcopy2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstcopy2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstcopy2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel1.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel1.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel2.tree: -------------------------------------------------------------------------------- 1 | *q=q( 2 | >>, 3 | p( 4 | >q, 5 | >>)) 6 | 7 | => 8 | 9 | *q( 10 | >>, 11 | >>) 12 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel4.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel4.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel4.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel5.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel5.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel5.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel6.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel6.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel6.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trav-circ.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trav-circ.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trav-circ.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trav-circ.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trav-line.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trav-line.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trav-line.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/trav-line.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/traversal.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/traversal.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/traversal.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/traversal.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tree2vine.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tree2vine.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tree2vine.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tree2vine.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine2tree.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/vine2tree.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine2tree.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/vine2tree.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/4dfcb735496a.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/4dfcb735496a.zip -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldelre3.tree: -------------------------------------------------------------------------------- 1 | *\y|%+( 2 | ^a&h-1, 3 | ^b&_h_) 4 | 5 | => 6 | 7 | *\y|%"++"( 8 | ^a'&h-2, 9 | ^b&_h_) 10 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlmuchbal.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlmuchbal.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlmuchbal.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlmuchbal.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlmuchbal2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlmuchbal2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlmuchbal2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/avlmuchbal2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/pbstdel1.tree: -------------------------------------------------------------------------------- 1 | *p( 2 | ^a, 3 | r( 4 | , 5 | ^b)) 6 | 7 | => 8 | 9 | $t 10 | *r( 11 | ^a, 12 | ^b) 13 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdelcase2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdelcase2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdelcase2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdelcase2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdelcase3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdelcase3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdelcase3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/rbdelcase3.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdeln2.tree: -------------------------------------------------------------------------------- 1 | *4%b( 2 | 1%b( 3 | 0%b, 4 | 2%b), 5 | 8%b( 6 | 6%r( 7 | 5%r, 8 | 7%b), 9 | 9%b)) 10 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdeln3.tree: -------------------------------------------------------------------------------- 1 | *4%r( 2 | 1%b( 3 | 0%b, 4 | 2%b), 5 | 8%b( 6 | 6%r( 7 | 5%r, 8 | 7%b), 9 | 9%b)) 10 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel1triv.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel1triv.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel1triv.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel1triv.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel4-2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel4-2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel4-2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstdel4-2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstparent.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstparent.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstparent.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/tbstparent.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine2tree2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/vine2tree2.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine2tree2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/vine2tree2.png -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine2tree3.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/vine2tree3.pdf -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine2tree3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/avl/sufficient_avl/vine2tree3.png -------------------------------------------------------------------------------- /data_structure/hash_table/实验五/hashtable/hashtable: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/hash_table/实验五/hashtable/hashtable -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel.tree: -------------------------------------------------------------------------------- 1 | 5( 2 | 2( 3 | 1, 4 | 3( 5 | , 6 | 4)), 7 | 9( 8 | 8( 9 | 6( 10 | , 11 | 7)))) 12 | -------------------------------------------------------------------------------- /data_structure/b-tree/c/1/Makefile: -------------------------------------------------------------------------------- 1 | 2 | #gcc venusDB 3 | venusDB:dbDomain.o domainUpdate.o main.o -lpthread 4 | gcc -o $@ $^ 5 | ../c.o: 6 | gcc -o $@ $< 7 | -------------------------------------------------------------------------------- /data_structure/hash_table/实验五/hashtable/hashtable.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gnemoug/data_structure/HEAD/data_structure/hash_table/实验五/hashtable/hashtable.o -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlrot.tree: -------------------------------------------------------------------------------- 1 | *Y=Y( 2 | X( 3 | , 4 | >Y), 5 | >>) 6 | 7 | <> 8 | 9 | *X( 10 | , 11 | Y( 12 | , 13 | >>)) 14 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin2.tree: -------------------------------------------------------------------------------- 1 | 3( 2 | 0( 3 | , 4 | 1( 5 | , 6 | 2)), 7 | 5) 8 | 9 | || 10 | 11 | $t 12 | 8( 13 | 6, 14 | 9) 15 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/destroy.tree: -------------------------------------------------------------------------------- 1 | |p( 2 | q( 3 | ^a, 4 | ^b), 5 | ^c) 6 | 7 | => 8 | 9 | |q( 10 | ^a, 11 | p( 12 | ^b, 13 | ^c)) 14 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlrot.tree: -------------------------------------------------------------------------------- 1 | Y=Y( 2 | X( 3 | >>, 4 | >Y), 5 | >>) 6 | 7 | <> 8 | 9 | X=X( 10 | >>, 11 | Y( 12 | >X, 13 | >>)) 14 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/sparsehash.dirs: -------------------------------------------------------------------------------- 1 | usr/include 2 | usr/include/google 3 | usr/include/sparsehash 4 | usr/lib 5 | usr/lib/pkgconfig 6 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins3.tree: -------------------------------------------------------------------------------- 1 | %-( 2 | %0) 3 | 4 | => 5 | 6 | %"--"( 7 | %-( 8 | /n|%0)) 9 | 10 | => 11 | 12 | %0( 13 | /n|%0, 14 | %0) 15 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/patholog1.tree: -------------------------------------------------------------------------------- 1 | 4( 2 | 3( 3 | 2( 4 | 1))) 5 | 6 | || 7 | 8 | 1( 9 | , 10 | 2( 11 | , 12 | 3( 13 | , 14 | 4))) 15 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotation.tree: -------------------------------------------------------------------------------- 1 | *|Y( 2 | X( 3 | ^a, 4 | ^b), 5 | ^c) 6 | 7 | <> 8 | 9 | *|X( 10 | ^a, 11 | Y( 12 | ^b, 13 | ^c)) 14 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin4.tree: -------------------------------------------------------------------------------- 1 | 7( 2 | 4( 3 | 1( 4 | ,2), 5 | 6), 6 | 9) 7 | 8 | || 9 | 10 | $t 11 | 7( 12 | 3( 13 | 0, 14 | 5), 15 | 8) 16 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/compress.tree: -------------------------------------------------------------------------------- 1 | *R%r( 2 | B%b( 3 | ^a, 4 | ^b), 5 | ^c) 6 | 7 | => 8 | 9 | *B%b( 10 | ^a, 11 | R%r( 12 | ^b, 13 | ^c)) 14 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdeln1.tree: -------------------------------------------------------------------------------- 1 | *3%r( 2 | 1%b( 3 | 0%b, 4 | 2%b), 5 | 8%b( 6 | 6%r( 7 | 4%b( 8 | , 9 | 5%r), 10 | 7%b), 11 | 9%b)) 12 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstcmp.tree: -------------------------------------------------------------------------------- 1 | *R=R%r( 2 | B%b( 3 | ^a, 4 | >R), 5 | ^c) 6 | 7 | => 8 | 9 | *B=B%b( 10 | ^a, 11 | R%r( 12 | >B, 13 | ^c)) 14 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/google/.svn/all-wcprops: -------------------------------------------------------------------------------- 1 | K 25 2 | svn:wc:ra_dav:version-url 3 | V 41 4 | /svn/!svn/ver/66/trunk/src/windows/google 5 | END 6 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex2.tree: -------------------------------------------------------------------------------- 1 | 6 2 | 3 | => 4 | 5 | 6( 6 | 5) 7 | 8 | => 9 | 10 | 6( 11 | 5( 12 | 4)) 13 | 14 | => 15 | 16 | 5( 17 | 4, 18 | 6) 19 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin.tree: -------------------------------------------------------------------------------- 1 | 4/;a( 2 | 1( 3 | , 4 | 2), 5 | 6( 6 | , 7 | 9)) 8 | 9 | || 10 | 11 | 7\;b( 12 | 3( 13 | 0, 14 | 5), 15 | 8) 16 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin5.tree: -------------------------------------------------------------------------------- 1 | 7( 2 | 3( 3 | 0( 4 | , 5 | 1( 6 | , 7 | 2)), 8 | 5( 9 | 4, 10 | 6)), 11 | 8( 12 | , 13 | 9)) 14 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdelcase2.tree: -------------------------------------------------------------------------------- 1 | *p%r( 2 | ^a, 3 | r%b( 4 | , 5 | ^x)) 6 | 7 | => 8 | 9 | *r%r( 10 | ^a, 11 | ^x) 12 | 13 | || 14 | 15 | p%b 16 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/sparsehash/.svn/all-wcprops: -------------------------------------------------------------------------------- 1 | K 25 2 | svn:wc:ra_dav:version-url 3 | V 46 4 | /svn/!svn/ver/106/trunk/src/windows/sparsehash 5 | END 6 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex.tree: -------------------------------------------------------------------------------- 1 | 2( 2 | 1, 3 | 3) 4 | 5 | || 6 | 7 | 3( 8 | 2( 9 | 1), 10 | 4) 11 | 12 | || 13 | 14 | 4( 15 | 2( 16 | 1, 17 | 3), 18 | 5) 19 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/.svn/text-base/sparsehash.dirs.svn-base: -------------------------------------------------------------------------------- 1 | usr/include 2 | usr/include/google 3 | usr/include/sparsehash 4 | usr/lib 5 | usr/lib/pkgconfig 6 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex4.tree: -------------------------------------------------------------------------------- 1 | 5( 2 | 3( 3 | 1( 4 | , 5 | 2), 6 | 4), 7 | 6) 8 | 9 | => 10 | 11 | 3( 12 | 1( 13 | , 14 | 2), 15 | 5( 16 | 4, 17 | 6)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tree2vine.tree: -------------------------------------------------------------------------------- 1 | *q( 2 | p( 3 | ^a, 4 | r( 5 | ^b, 6 | ^c))) 7 | 8 | => 9 | 10 | *q( 11 | r( 12 | p( 13 | ^a, 14 | ^b), 15 | ^c)) 16 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavldel.tree: -------------------------------------------------------------------------------- 1 | *\s|%"++"( 2 | ^a&h-1, 3 | \r|%0( 4 | ^b&h, 5 | ^c&h)) 6 | 7 | => 8 | 9 | */r|%-( 10 | /s|%+( 11 | ^a&h-1, 12 | ^b&h), 13 | ^c&h) 14 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlbalex.tree: -------------------------------------------------------------------------------- 1 | %0( 2 | %0, 3 | %0) 4 | 5 | || 6 | 7 | %-( 8 | %-( 9 | %0), 10 | %0) 11 | 12 | || 13 | 14 | %-( 15 | %0( 16 | %0, 17 | %0), 18 | %0) 19 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bal2.tree: -------------------------------------------------------------------------------- 1 | 7( 2 | 3( 3 | 1( 4 | 0, 5 | 2), 6 | 5( 7 | 4, 8 | 6)), 9 | 11( 10 | 9( 11 | 8, 12 | 10), 13 | 13( 14 | 12, 15 | 14))) 16 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstjoin3.tree: -------------------------------------------------------------------------------- 1 | 4( 2 | 3( 3 | 0( 4 | , 5 | 1( 6 | , 7 | 2)), 8 | 5), 9 | 8( 10 | 6( 11 | , 12 | 7), 13 | 9)) 14 | 15 | || 16 | 17 | ** 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavldel2.tree: -------------------------------------------------------------------------------- 1 | *\s|%"++"( 2 | ^a&h-1, 3 | \r|%+( 4 | ^b&h-1, 5 | ^c&h)) 6 | 7 | => 8 | 9 | */s|%0( 10 | /r|%0( 11 | ^a&h-1, 12 | ^b&h-1), 13 | ^c&h) 14 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel1triv.tree: -------------------------------------------------------------------------------- 1 | *q=q( 2 | p=p( 3 | x( 4 | >>, 5 | >p), 6 | >q), 7 | >>) 8 | 9 | => 10 | 11 | *q=q( 12 | x( 13 | >>, 14 | >q), 15 | >>) 16 | 17 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins2.tree: -------------------------------------------------------------------------------- 1 | %0( 2 | %+( 3 | , 4 | %0), 5 | %+( 6 | , 7 | %0)) 8 | 9 | => 10 | 11 | %0( 12 | %+( 13 | , 14 | %0), 15 | /p|%0( 16 | /n|%0, 17 | %0)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlexer.tree: -------------------------------------------------------------------------------- 1 | %0( 2 | %+( 3 | , 4 | %0), 5 | %-( 6 | %0)) 7 | 8 | || 9 | 10 | %+( 11 | %0, 12 | %0( 13 | %0, 14 | %0)) 15 | 16 | || 17 | 18 | %-( 19 | %0) 20 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase21.tree: -------------------------------------------------------------------------------- 1 | */y|%"--"( 2 | /x|%+( 3 | , 4 | \w|%0)) 5 | 6 | => 7 | 8 | *\y|%"--"( 9 | \w|%-( 10 | \x|%0)) 11 | 12 | => 13 | 14 | *\w|%0( 15 | /x|%0, 16 | \y|%0) 17 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbins2.tree: -------------------------------------------------------------------------------- 1 | *g%b( 2 | f%r( 3 | q%r( 4 | ^a, 5 | ^b), 6 | ^c), 7 | ^d) 8 | 9 | => 10 | 11 | *f%b( 12 | q%r( 13 | ^a, 14 | ^b), 15 | g%r( 16 | ^c, 17 | ^d)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstrot1.tree: -------------------------------------------------------------------------------- 1 | 4( 2 | 2( 3 | 1, 4 | 3), 5 | 5) 6 | 7 | || 8 | 9 | 4( 10 | 2( 11 | 1)) 12 | 13 | || 14 | 15 | 4( 16 | 2( 17 | 1, 18 | 3), 19 | 6( 20 | 5, 21 | 7)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstrot2.tree: -------------------------------------------------------------------------------- 1 | 2( 2 | 1, 3 | 4( 4 | 3, 5 | 5)) 6 | 7 | || 8 | 9 | 2( 10 | 1, 11 | 4) 12 | 13 | || 14 | 15 | 2( 16 | 1, 17 | 4( 18 | 3, 19 | 6( 20 | 5, 21 | 7))) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbins3.tree: -------------------------------------------------------------------------------- 1 | *g%b( 2 | f%r( 3 | ^a, 4 | q%r( 5 | ^b, 6 | ^c)), 7 | ^d) 8 | 9 | => 10 | 11 | *g%b( 12 | q%r( 13 | f%r( 14 | ^a, 15 | ^b), 16 | ^c), 17 | ^d) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/balance5.tree: -------------------------------------------------------------------------------- 1 | 5( 2 | 4( 3 | 3( 4 | 2( 5 | 1)))) 6 | 7 | => 8 | 9 | 4( 10 | 2( 11 | 1, 12 | 3), 13 | 5) 14 | 15 | => 16 | 17 | 2( 18 | 1, 19 | 4( 20 | 3, 21 | 5)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavldel1.tree: -------------------------------------------------------------------------------- 1 | */y|%"++"( 2 | , 3 | \x|%+( 4 | , 5 | \_c|%0( 6 | , 7 | >>))) 8 | 9 | => 10 | 11 | */x=x|%0( 12 | /y|%0( 13 | , 14 | >x), 15 | \_c|%0( 16 | , 17 | >>)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins2.tree: -------------------------------------------------------------------------------- 1 | *\y|%"++"( 2 | , 3 | \x|%+( 4 | , 5 | \_n|%0( 6 | , 7 | >>))) 8 | 9 | => 10 | 11 | *\x=x|%0( 12 | /y|%0( 13 | , 14 | >x), 15 | \_n|%0( 16 | , 17 | >>)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstins2.tree: -------------------------------------------------------------------------------- 1 | *s=s( 2 | ^...( 3 | , 4 | p( 5 | ^a, 6 | >s))) 7 | 8 | => 9 | 10 | *s=s( 11 | ^...( 12 | , 13 | p( 14 | ^a, 15 | n( 16 | , 17 | >s)))) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlins1.tree: -------------------------------------------------------------------------------- 1 | */y|%"--"( 2 | /x|%+( 3 | ^a, 4 | \w( 5 | ^b, 6 | ^c)), 7 | ^d) 8 | 9 | => 10 | 11 | *\w|%0( 12 | /x( 13 | ^a, 14 | ^b), 15 | \y( 16 | ^c, 17 | ^d)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trav-line.txt: -------------------------------------------------------------------------------- 1 | .-> 1 <-> 2 <-> 3 <-> 4 <-> 5 <-> 6 <-> 7 <-> 8 <-. 2 | | | 3 | `---------------------> NULL <--------------------' 4 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/altdef.tree: -------------------------------------------------------------------------------- 1 | 4( 2 | 2( 3 | 1, 4 | 3), 5 | 5) 6 | 7 | || 8 | 9 | 4( 10 | 2( 11 | 1( 12 | @s_, 13 | @s_), 14 | 3( 15 | @s_, 16 | @s_)), 17 | 5( 18 | @s_, 19 | @s_)) 20 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins4.tree: -------------------------------------------------------------------------------- 1 | %-( 2 | %-( 3 | %0), 4 | %0) 5 | 6 | => 7 | 8 | %-( 9 | %"--"( 10 | %-( 11 | /n|%0)), 12 | %0) 13 | 14 | => 15 | 16 | %-( 17 | %0( 18 | /n|%0, 19 | %0), 20 | %0) 21 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins3.tree: -------------------------------------------------------------------------------- 1 | */y=y|%"--"( 2 | /x|%+( 3 | , 4 | \_w|%0( 5 | , 6 | >y)), 7 | >>) 8 | 9 | => 10 | 11 | *\w=w|%0( 12 | /x|%0( 13 | , 14 | >w), 15 | \_y|%0( 16 | , 17 | >>)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins4.tree: -------------------------------------------------------------------------------- 1 | *\y|%"++"( 2 | , 3 | \_x=x|%-( 4 | /w|%0( 5 | , 6 | >x), 7 | >>)) 8 | 9 | => 10 | 11 | *\w=w|%0( 12 | /y|%0( 13 | , 14 | >w), 15 | \_x|%0( 16 | , 17 | >>)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlins2.tree: -------------------------------------------------------------------------------- 1 | */y=y|%"--"( 2 | \x=x|%+( 3 | >>, 4 | \_w( 5 | >x, 6 | >y)), 7 | >>) 8 | 9 | => 10 | 11 | *\w%0=w( 12 | /x_( 13 | >>, 14 | >w), 15 | \_y( 16 | >w, 17 | >>)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstbal3.tree: -------------------------------------------------------------------------------- 1 | 3=3/;q( 2 | !2=2/;p( 3 | 1( 4 | >>, 5 | >2), 6 | >3), 7 | >>) 8 | 9 | => 10 | 11 | 3=3/;q( 12 | 2=2/;p( 13 | 1( 14 | >>, 15 | >2), 16 | >3), 17 | >>) 18 | 19 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbins2.tree: -------------------------------------------------------------------------------- 1 | */pa[k-2]|;x%b( 2 | /pa[k-1]|;y%r( 3 | q%r( 4 | ^a, 5 | ^b), 6 | ^c), 7 | ^d) 8 | 9 | => 10 | 11 | *y%b( 12 | q%r( 13 | ^a, 14 | ^b), 15 | x%r( 16 | ^c, 17 | ^d)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavldel2.tree: -------------------------------------------------------------------------------- 1 | */y=y|%"--"( 2 | /x=x|%-( 3 | /a|%0( 4 | , 5 | >x), 6 | >y), 7 | >>) 8 | 9 | => 10 | 11 | */x=x|%0( 12 | /a|%0( 13 | , 14 | >x), 15 | \_y|%0( 16 | , 17 | >>)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtavlins1.tree: -------------------------------------------------------------------------------- 1 | */y=y|%"--"( 2 | /x=x|%-( 3 | /n|%0( 4 | , 5 | >x), 6 | >y), 7 | >>) 8 | 9 | => 10 | 11 | *\x=x|%0( 12 | /n|%0( 13 | , 14 | >x), 15 | \_y|%0( 16 | , 17 | >>)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins.tree: -------------------------------------------------------------------------------- 1 | */pa[k-2]|;x=x%b( 2 | /pa[k-1]|;y%r( 3 | q%r( 4 | ^a, 5 | ^b), 6 | >x), 7 | ^d) 8 | 9 | => 10 | 11 | *y%b( 12 | q%r( 13 | ^a, 14 | ^b), 15 | x%r( 16 | , 17 | ^d)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins2.tree: -------------------------------------------------------------------------------- 1 | *\pa[k-2]%b( 2 | ^a, 3 | \pa[k-1]|;y%r( 4 | , 5 | q%r( 6 | ^c, 7 | ^d))) 8 | 9 | => 10 | 11 | *y=y%b( 12 | x%r( 13 | ^a, 14 | >y), 15 | q%r( 16 | ^c, 17 | ^d)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/100-114.tree: -------------------------------------------------------------------------------- 1 | 107( 2 | 103( 3 | 101( 4 | 100, 5 | 102), 6 | 105( 7 | 104, 8 | 106)), 9 | 111( 10 | 109( 11 | 108, 12 | 110), 13 | 113( 14 | 112, 15 | 114))) 16 | 17 | 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlexera.tree: -------------------------------------------------------------------------------- 1 | %0( 2 | %0( 3 | %0, 4 | %0), 5 | %-( 6 | %0)) 7 | 8 | || 9 | 10 | %0( 11 | %-( 12 | %0), 13 | %0( 14 | %0, 15 | %0)) 16 | 17 | || 18 | 19 | %"--"( 20 | %-( 21 | %0)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbctrex.tree: -------------------------------------------------------------------------------- 1 | 4%r( 2 | 2%r( 3 | 1%b, 4 | 3%b), 5 | 5%b) 6 | 7 | || 8 | 9 | 4%r( 10 | 2%b( 11 | 1%r, 12 | 3%b), 13 | 5%b( 14 | , 15 | 6%r)) 16 | 17 | || 18 | 19 | 1%b( 20 | , 21 | 2%b) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel2.tree: -------------------------------------------------------------------------------- 1 | *|B/;pa[k - 1]%g( 2 | |A/;x%b( 3 | ^a, 4 | ^b), 5 | |C\;w%b( 6 | ^c, 7 | ^d)) 8 | 9 | => 10 | 11 | *|B/;x%g( 12 | |A%b( 13 | ^a, 14 | ^b), 15 | |C%r( 16 | ^c, 17 | ^d)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbib2.tree: -------------------------------------------------------------------------------- 1 | */pa[k - 2]|;x%b( 2 | /pa[k - 1]|;y%r( 3 | q%b( 4 | ^a, 5 | ^b), 6 | ^c), 7 | ^d) 8 | 9 | => 10 | 11 | *y%b( 12 | q%r( 13 | ^a, 14 | ^b), 15 | x%r( 16 | ^c, 17 | ^d)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbins3.tree: -------------------------------------------------------------------------------- 1 | */pa[k-2]_%b( 2 | /pa[k-1]|;x%r( 3 | ^a, 4 | \q|;y%r( 5 | ^b, 6 | ^c)), 7 | ^d) 8 | 9 | => 10 | 11 | *%b( 12 | y%r( 13 | x%r( 14 | ^a, 15 | ^b), 16 | ^c), 17 | ^d) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotdel2.tree: -------------------------------------------------------------------------------- 1 | 9( 2 | 7( 3 | 6/;r, 4 | 8)) 5 | 6 | => 7 | 8 | 9( 9 | 6/;r( 10 | , 11 | 7( 12 | , 13 | 8))) 14 | 15 | => 16 | 17 | 6/;r( 18 | , 19 | 9( 20 | 7( 21 | , 22 | 8))) 23 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins3.tree: -------------------------------------------------------------------------------- 1 | */pa[k-2]%b( 2 | /pa[k-1]|;x%r( 3 | ^a, 4 | \y|;q%r( 5 | , 6 | ^c)), 7 | ^d) 8 | 9 | => 10 | 11 | *%b( 12 | y=y%r( 13 | x%r( 14 | ^a, 15 | >y), 16 | ^c), 17 | ^d) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbins4.tree: -------------------------------------------------------------------------------- 1 | *\pa[k-2]%b( 2 | ^a, 3 | \pa[k-1]|;x=x%r( 4 | q/;y%r( 5 | ^b, 6 | >x), 7 | ^d)) 8 | 9 | => 10 | 11 | *%b( 12 | ^a, 13 | y%r( 14 | ^b, 15 | x%r( 16 | , 17 | ^d))) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavldel3.tree: -------------------------------------------------------------------------------- 1 | *\s=s|%"++"( 2 | >>, 3 | \r=r|%+( 4 | >s, 5 | \_c|%0( 6 | >r, 7 | >>))) 8 | 9 | => 10 | 11 | *\r=r|%0( 12 | /s_|%0( 13 | >>, 14 | >r), 15 | \_c|%0( 16 | >r, 17 | >>)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbins.tree: -------------------------------------------------------------------------------- 1 | */pa[k-2]|;x=x%b( 2 | /pa[k-1]|;y%r( 3 | q%r( 4 | ^a, 5 | ^b), 6 | >x), 7 | ^d) 8 | 9 | => 10 | 11 | *y=y%b( 12 | q%r( 13 | ^a, 14 | ^b), 15 | x%r( 16 | >y, 17 | ^d)) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbib3.tree: -------------------------------------------------------------------------------- 1 | */pa[k - 2]_%b( 2 | /pa[k - 1]|;x%r( 3 | ^a, 4 | q%b( 5 | ^b, 6 | ^c)), 7 | ^d) 8 | 9 | => 10 | 11 | */pa[k - 2]%b( 12 | q%b( 13 | x%r( 14 | ^a, 15 | ^b), 16 | ^c), 17 | ^d) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbins2.tree: -------------------------------------------------------------------------------- 1 | */pa[k-2]_%b( 2 | /pa[k-1]|;x=x%r( 3 | ^a, 4 | \w|;y%r( 5 | >x, 6 | ^c)), 7 | ^d) 8 | 9 | => 10 | 11 | *%b( 12 | y=y%r( 13 | x%r( 14 | ^a, 15 | >y), 16 | ^c), 17 | ^d) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel6.tree: -------------------------------------------------------------------------------- 1 | 6=6( 2 | 3=3( 3 | 0=0( 4 | >>, 5 | 2=2( 6 | 1( 7 | >0, 8 | >2), 9 | >3)), 10 | 5=5( 11 | 4=4( 12 | >3, 13 | >5), 14 | >6)), 15 | 7( 16 | >6, 17 | >>)) 18 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/sparsehash.install: -------------------------------------------------------------------------------- 1 | usr/include/google/* 2 | usr/include/sparsehash/* 3 | usr/lib/pkgconfig/* 4 | debian/tmp/usr/include/google/* 5 | debian/tmp/usr/include/sparsehash/* 6 | debian/tmp/usr/lib/pkgconfig/* 7 | -------------------------------------------------------------------------------- /data_structure/avl/neatAVL/Comparable.h: -------------------------------------------------------------------------------- 1 | #if !defined(_COMPARABLE_H_) 2 | #define _COMPARABLE_H_ 3 | 4 | class Comparable 5 | { 6 | public : 7 | virtual int CompareTo(const Comparable* pComparable) const = 0; 8 | }; 9 | 10 | #endif 11 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbunique.tree: -------------------------------------------------------------------------------- 1 | %b( 2 | _%b, 3 | _%b) 4 | 5 | <> 6 | 7 | %b( 8 | _%r, 9 | _%r) 10 | 11 | %b( 12 | %b( 13 | _%r, 14 | _%r), 15 | _%b) 16 | 17 | <> 18 | 19 | %b( 20 | %r( 21 | _%b, 22 | _%b), 23 | _%b) 24 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbst1.tree: -------------------------------------------------------------------------------- 1 | 3=3( 2 | 2=2( 3 | 1( 4 | , 5 | >2), 6 | >3), 7 | 6=6( 8 | 4=4( 9 | , 10 | 5( 11 | , 12 | >6)), 13 | 8=8( 14 | 7( 15 | , 16 | >8), 17 | 9( 18 | , 19 | >>)))) 20 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel5.tree: -------------------------------------------------------------------------------- 1 | 7=7( 2 | 3=3( 3 | 2=2( 4 | 0=0( 5 | >>, 6 | 1( 7 | >0, 8 | >2)), 9 | >3), 10 | 4=4( 11 | >3, 12 | 5=5( 13 | >4, 14 | 6( 15 | >5, 16 | >7)))), 17 | >>) 18 | -------------------------------------------------------------------------------- /data_structure/bubble_sort/python/bubble.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python 2 | 3 | a = [1,5,2,8,12,3,89,4,12,0] 4 | 5 | for i in xrange(10): 6 | for j in xrange(9 - i): 7 | if a[j] > a[j+1]: 8 | a[j], a[j+1] = a[j+1], a[j] 9 | print a 10 | -------------------------------------------------------------------------------- /data_structure/file_merge_sort/generate_data.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python 2 | #-*- coding:utf-8 -*- 3 | 4 | from random import randint,random 5 | 6 | with open('data.txt','w') as f: 7 | for i in xrange(1000): 8 | f.write("%s\n"%(randint(1,99999)*random())) 9 | -------------------------------------------------------------------------------- /data_structure/avl/sort_search/Comparable.h: -------------------------------------------------------------------------------- 1 | #if !defined(_COMPARABLE_H_) 2 | #define _COMPARABLE_H_ 3 | 4 | class Comparable 5 | { 6 | public : 7 | virtual int CompareTo(const Comparable* pComparable) const = 0; 8 | }; 9 | 10 | #endif 11 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase1.tree: -------------------------------------------------------------------------------- 1 | */y|%-( 2 | /x|%0( 3 | ^a, 4 | ^b), 5 | ^c) 6 | 7 | => 8 | 9 | */y|%"--"( 10 | /x|%-( 11 | ^a', 12 | ^b), 13 | ^c) 14 | 15 | => 16 | 17 | *\x|%0( 18 | ^a', 19 | \y|%0( 20 | ^b, 21 | ^c)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldel2.tree: -------------------------------------------------------------------------------- 1 | *\y|%+( 2 | ^a, 3 | \x|%+( 4 | ^b, 5 | ^c)) 6 | 7 | => 8 | 9 | *\y|%"++"( 10 | ^a', 11 | \x|%+( 12 | ^b, 13 | ^c)) 14 | 15 | => 16 | 17 | */x|%0( 18 | /y|%0( 19 | ^a', 20 | ^b), 21 | ^c) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldel3.tree: -------------------------------------------------------------------------------- 1 | *\y|%+( 2 | ^a, 3 | \x|%0( 4 | ^b, 5 | ^c)) 6 | 7 | => 8 | 9 | *\y|%"++"( 10 | ^a', 11 | \x|%0( 12 | ^b, 13 | ^c)) 14 | 15 | => 16 | 17 | */x|%-( 18 | /y|%+( 19 | ^a', 20 | ^b), 21 | ^c) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/ranksize.tree: -------------------------------------------------------------------------------- 1 | 6.16( 2 | 4.5( 3 | 2.3( 4 | 1.1, 5 | 1.1), 6 | 1.1), 7 | 5.11( 8 | 2.4( 9 | 1.1, 10 | 2.2( 11 | 1.1)), 12 | 3.6( 13 | 2.2( 14 | 1.1), 15 | 2.3( 16 | 1.1, 17 | 1.1)))) 18 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlins1.tree: -------------------------------------------------------------------------------- 1 | %0( 2 | %0, 3 | %0) 4 | 5 | => 6 | 7 | %0( 8 | %0( 9 | /n|%0), 10 | %0) 11 | 12 | => 13 | 14 | %0( 15 | /p|%-( 16 | /n|%0), 17 | %0) 18 | 19 | => 20 | 21 | /p|%-( 22 | %-( 23 | /n|%0), 24 | %0) 25 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bal1.tree: -------------------------------------------------------------------------------- 1 | 0( 2 | , 3 | 5( 4 | 3( 5 | 1( 6 | , 7 | 2), 8 | 4), 9 | 12( 10 | 7( 11 | 6, 12 | 11( 13 | 8( 14 | , 15 | 10( 16 | 9)))), 17 | 13( 18 | , 19 | 14)))) 20 | 21 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbins1.tree: -------------------------------------------------------------------------------- 1 | *g%b( 2 | f%r( 3 | q%r( 4 | ^a, 5 | ^b), 6 | ^c), 7 | y%r( 8 | ^d, 9 | ^e)) 10 | 11 | => 12 | 13 | *g%r( 14 | f%b( 15 | q%r( 16 | ^a, 17 | ^b), 18 | ^c), 19 | y%b( 20 | ^d, 21 | ^e)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbst1.tree: -------------------------------------------------------------------------------- 1 | 3=3( 2 | 2=2( 3 | 1( 4 | >>, 5 | >2), 6 | >3), 7 | 6=6( 8 | 4=4( 9 | >3, 10 | 5( 11 | >4, 12 | >6)), 13 | 8=8( 14 | 7( 15 | >6, 16 | >8), 17 | 9( 18 | >8, 19 | >>)))) 20 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotdel.tree: -------------------------------------------------------------------------------- 1 | 2( 2 | 1, 3 | 5( 4 | 3( 5 | , 6 | 4), 7 | 9( 8 | 7( 9 | 6, 10 | 8)))) 11 | 12 | => 13 | 14 | 2( 15 | 1, 16 | ^!_( 17 | !3( 18 | , 19 | 4), 20 | !9( 21 | 7( 22 | 6, 23 | 8)))) 24 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel2.tree: -------------------------------------------------------------------------------- 1 | 5( 2 | 2( 3 | 1, 4 | 3( 5 | , 6 | 4)), 7 | 9( 8 | 8/;p( 9 | 6( 10 | , 11 | 7)))) 12 | 13 | => 14 | 15 | 5( 16 | 2( 17 | 1, 18 | 3( 19 | , 20 | 4)), 21 | 9( 22 | 6( 23 | , 24 | 7))) 25 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel3.tree: -------------------------------------------------------------------------------- 1 | 5( 2 | 2/;p( 3 | 1, 4 | 3\;r( 5 | , 6 | 4)), 7 | 9( 8 | 8( 9 | 6( 10 | , 11 | 7)))) 12 | 13 | => 14 | 15 | 5( 16 | 3\;r( 17 | 1, 18 | 4), 19 | 9( 20 | 8( 21 | 6( 22 | , 23 | 7)))) 24 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/bstdel4.tree: -------------------------------------------------------------------------------- 1 | 5/;p( 2 | 2( 3 | 1, 4 | 3( 5 | , 6 | 4)), 7 | 9( 8 | 8( 9 | 6\;s( 10 | , 11 | 7)))) 12 | 13 | => 14 | 15 | 6/;s( 16 | 2( 17 | 1, 18 | 3( 19 | , 20 | 4)), 21 | 9( 22 | 8( 23 | 7))) 24 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/pbstdel2.tree: -------------------------------------------------------------------------------- 1 | *p( 2 | ^a, 3 | x( 4 | ^...( 5 | r( 6 | s( 7 | , 8 | ^b), 9 | ^c)), 10 | ^d)) 11 | 12 | => 13 | 14 | $t 15 | *s( 16 | ^a, 17 | x( 18 | ^...( 19 | r( 20 | ^b, 21 | ^c)), 22 | ^d)) 23 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/.svn/text-base/sparsehash.install.svn-base: -------------------------------------------------------------------------------- 1 | usr/include/google/* 2 | usr/include/sparsehash/* 3 | usr/lib/pkgconfig/* 4 | debian/tmp/usr/include/google/* 5 | debian/tmp/usr/include/sparsehash/* 6 | debian/tmp/usr/lib/pkgconfig/* 7 | -------------------------------------------------------------------------------- /data_structure/quick_sort/quick_sort.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python 2 | #-*-coding:utf8-*- 3 | 4 | def qsort(L): 5 | if len(L) <=1 : return L 6 | return qsort([lt for lt in L[1:] if lt < L[0]]) + L[0:1] + qsort([ge for ge in L[1:] if ge >= L[0]]) 7 | 8 | print qsort([5,4,3,222,12,-11]) 9 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlex3.tree: -------------------------------------------------------------------------------- 1 | 5( 2 | 4( 3 | 1), 4 | 6) 5 | 6 | => 7 | 8 | 5( 9 | 4( 10 | 1( 11 | , 12 | 3)), 13 | 6) 14 | 15 | => 16 | 17 | 5( 18 | 4( 19 | 3( 20 | 1)), 21 | 6) 22 | 23 | => 24 | 25 | 5( 26 | 3( 27 | 1, 28 | 4), 29 | 6) 30 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbdr1.tree: -------------------------------------------------------------------------------- 1 | *|A/;f%b( 2 | ^x, 3 | |C\;w%r( 4 | B%b( 5 | ^a, 6 | ^b), 7 | D%b( 8 | ^c, 9 | ^d))) 10 | 11 | => 12 | 13 | *|C\;g%b( 14 | |A/;f%r( 15 | ^x, 16 | |B\;w%b( 17 | ^a, 18 | ^b)), 19 | D%b( 20 | ^c, 21 | ^d)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/prbdr3.tree: -------------------------------------------------------------------------------- 1 | *B/;f%g( 2 | A/;x%b( 3 | ^a, 4 | ^b), 5 | D\;w%b( 6 | C%r( 7 | ^c, 8 | ^d), 9 | ^e)) 10 | 11 | => 12 | 13 | *B/;f%g( 14 | A/;x%b( 15 | ^a, 16 | ^b), 17 | C\;w%b( 18 | ^c, 19 | D%r( 20 | ^d, 21 | ^e))) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel3.tree: -------------------------------------------------------------------------------- 1 | *B/;pa[x - 1]%g( 2 | A/;x%b( 3 | ^a, 4 | ^b), 5 | C\;w%b( 6 | ^c, 7 | D%r( 8 | ^d, 9 | ^e))) 10 | 11 | => 12 | 13 | *C%g( 14 | B%b( 15 | A%b( 16 | ^a, 17 | ^b), 18 | ^c), 19 | D%b( 20 | ^d, 21 | ^e)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtbstprev.tree: -------------------------------------------------------------------------------- 1 | 3=3( 2 | 1=1( 3 | 0( 4 | , 5 | >1), 6 | 2( 7 | , 8 | >3)), 9 | 9=9( 10 | 5=5( 11 | 4( 12 | , 13 | >5), 14 | 7=7( 15 | 6( 16 | , 17 | >7), 18 | 8( 19 | , 20 | >9))), 21 | >>)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbdel.tree: -------------------------------------------------------------------------------- 1 | */pa[x - 1]|;B=B%g( 2 | /x|;A%b( 3 | ^a, 4 | ^b), 5 | \w|;C%b( 6 | >B, 7 | D%r( 8 | ^d, 9 | ^e))) 10 | 11 | => 12 | 13 | *C=C%g( 14 | B%b( 15 | A%b( 16 | ^a, 17 | ^b), 18 | >C), 19 | D%b( 20 | ^d, 21 | ^e)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/patholog2.tree: -------------------------------------------------------------------------------- 1 | 5( 2 | 4( 3 | 3( 4 | 2( 5 | 1)))) 6 | 7 | || 8 | 9 | 1( 10 | , 11 | 5( 12 | 2( 13 | , 14 | 4( 15 | 3)))) 16 | 17 | || 18 | 19 | 1( 20 | , 21 | 2( 22 | , 23 | 3( 24 | , 25 | 4( 26 | , 27 | 5)))) 28 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel1.tree: -------------------------------------------------------------------------------- 1 | */pa[k-1]|;B%g( 2 | /x|;A%b( 3 | ^a, 4 | ^b), 5 | \w|;C%b( 6 | , 7 | D%r( 8 | ^d, 9 | ^e))) 10 | 11 | => 12 | 13 | */w|;C%g=C( 14 | B%b( 15 | /x|;A%b( 16 | ^a, 17 | ^b), 18 | >C), 19 | D%b( 20 | ^d, 21 | ^e)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel2.tree: -------------------------------------------------------------------------------- 1 | */pa[k-1]|;C%g=C( 2 | /w|;B%b( 3 | A%r( 4 | ^a, 5 | ^b), 6 | >C), 7 | \x|;D%b( 8 | ^d, 9 | ^e)) 10 | 11 | => 12 | 13 | *\w|;B%g( 14 | A%b( 15 | ^a, 16 | ^b), 17 | C%b( 18 | , 19 | \x|;D%b( 20 | ^d, 21 | ^e))) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel4.tree: -------------------------------------------------------------------------------- 1 | *B/;pa[k - 1]%g( 2 | A/;x%b( 3 | ^a, 4 | ^b), 5 | D\;w%b( 6 | C%r( 7 | ^c, 8 | ^d), 9 | ^e)) 10 | 11 | => 12 | 13 | *B/;pa[k - 1]%g( 14 | A/;x%b( 15 | ^a, 16 | ^b), 17 | C\;w%b( 18 | ^c, 19 | D%r( 20 | ^d, 21 | ^e))) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rotdel3.tree: -------------------------------------------------------------------------------- 1 | 2( 2 | 1, 3 | !^_( 4 | !3( 5 | , 6 | 4), 7 | !6\;r( 8 | , 9 | 9( 10 | 7( 11 | , 12 | 8))))) 13 | 14 | => 15 | 16 | 2( 17 | 1, 18 | 6\;r( 19 | 3( 20 | , 21 | 4), 22 | 9( 23 | 7( 24 | , 25 | 8)))) 26 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/experimental/Makefile: -------------------------------------------------------------------------------- 1 | example: example.o libchash.o 2 | $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $^ 3 | 4 | .SUFFIXES: .c .o .h 5 | .c.o: 6 | $(CC) -c $(CPPFLAGS) $(CFLAGS) -o $@ $< 7 | 8 | example.o: example.c libchash.h 9 | libchash.o: libchash.c libchash.h 10 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/experimental/Makefile: -------------------------------------------------------------------------------- 1 | example: example.o libchash.o 2 | $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $^ 3 | 4 | .SUFFIXES: .c .o .h 5 | .c.o: 6 | $(CC) -c $(CPPFLAGS) $(CFLAGS) -o $@ $< 7 | 8 | example.o: example.c libchash.h 9 | libchash.o: libchash.c libchash.h 10 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbib1.tree: -------------------------------------------------------------------------------- 1 | */pa[k - 2]%b( 2 | /pa[k - 1]%r( 3 | q%b( 4 | ^a, 5 | ^b), 6 | ^c), 7 | y%r( 8 | ^d, 9 | ^e)) 10 | 11 | => 12 | 13 | */pa[k - 2]%b( 14 | /pa[k - 1]%b( 15 | q%r( 16 | ^a, 17 | ^b), 18 | ^c), 19 | y%b( 20 | ^d, 21 | ^e)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel3.tree: -------------------------------------------------------------------------------- 1 | */pa[k-1]|;B%g( 2 | /x|;A%b( 3 | ^a, 4 | ^b), 5 | \w|;D%b=D( 6 | C%r( 7 | ^c, 8 | >D), 9 | ^e)) 10 | 11 | => 12 | 13 | */pa[k-1]|;B%g( 14 | /x|;A%b( 15 | ^a, 16 | ^b), 17 | \w|;C%b( 18 | ^c, 19 | D%r( 20 | , 21 | ^e))) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rtrbdel4.tree: -------------------------------------------------------------------------------- 1 | */pa[k-1]|;C%g( 2 | /w|;A%b( 3 | ^a, 4 | B%r( 5 | , 6 | ^c)), 7 | \x|;D%b( 8 | ^d, 9 | ^e)) 10 | 11 | => 12 | 13 | */pa[k-1]|;C%g( 14 | /w|;B%b=B( 15 | A%r( 16 | ^a, 17 | >B), 18 | ^c), 19 | \x|;D%b( 20 | ^d, 21 | ^e)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tavlrot2.tree: -------------------------------------------------------------------------------- 1 | Y=Y( 2 | X=X( 3 | A( 4 | >>, 5 | >X), 6 | B( 7 | >X, 8 | >Y)), 9 | C( 10 | >Y, 11 | >>)) 12 | 13 | <> 14 | 15 | X=X( 16 | A( 17 | >>, 18 | >X), 19 | Y=Y( 20 | B( 21 | >X, 22 | >Y), 23 | C( 24 | >Y, 25 | >>))) 26 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel1.tree: -------------------------------------------------------------------------------- 1 | *q=q( 2 | p=p( 3 | s( 4 | ^r, 5 | u( 6 | ^t, 7 | x( 8 | ^v, 9 | >p) 10 | ) 11 | ), 12 | >q), 13 | >>) 14 | 15 | => 16 | 17 | *q=q( 18 | s( 19 | ^r, 20 | u( 21 | ^t, 22 | x( 23 | ^v, 24 | >q))), 25 | >>) 26 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel4-2.tree: -------------------------------------------------------------------------------- 1 | 2\;p=2( 2 | 0( 3 | >>, 4 | >2), 5 | 5=5( 6 | 4/;r=4( 7 | 3\_;s( 8 | >2, 9 | >4), 10 | >5), 11 | >>)) 12 | 13 | => 14 | 15 | 3\;s=3( 16 | 0( 17 | >>, 18 | >3), 19 | 5=5( 20 | 4\_;r=4( 21 | >3, 22 | >5), 23 | >>)) 24 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdel1.tree: -------------------------------------------------------------------------------- 1 | *|A/;pa[k - 1]%b( 2 | ^x, 3 | |C\;w%r( 4 | B%b( 5 | ^a, 6 | ^b), 7 | D%b( 8 | ^c, 9 | ^d))) 10 | 11 | => 12 | 13 | *|C\;pa[k - 2]%b( 14 | |A/;pa[k - 1]%r( 15 | ^x, 16 | |B\;w%b( 17 | ^a, 18 | ^b)), 19 | D%b( 20 | ^c, 21 | ^d)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbdelcase3.tree: -------------------------------------------------------------------------------- 1 | *p%b( 2 | ^a, 3 | %r( 4 | ^...( 5 | r%r( 6 | s%b( 7 | , 8 | ^x) 9 | ,^b)), 10 | ^c)) 11 | 12 | => 13 | 14 | *s%b( 15 | ^a, 16 | %r( 17 | ^...( 18 | r%r( 19 | ^x, 20 | ^b)), 21 | ^c)) 22 | 23 | || 24 | 25 | p%r 26 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbex.tree: -------------------------------------------------------------------------------- 1 | 4%b( 2 | 1%r( 3 | 0%b, 4 | 3%b( 5 | 2%r)), 6 | 5%b) 7 | 8 | || 9 | 10 | 4%b( 11 | 3%b( 12 | 1%r, 13 | 2%r), 14 | 6%b( 15 | 5%r, 16 | 7%r)) 17 | 18 | || 19 | 20 | 1%b( 21 | 0%b, 22 | 6%r( 23 | 4%b( 24 | 3%r, 25 | 5%r), 26 | 7%b)) 27 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rbins1.tree: -------------------------------------------------------------------------------- 1 | *|/pa[k - 2]%b( 2 | |/pa[k - 1]%r( 3 | |q%r( 4 | ^a, 5 | ^b), 6 | ^c), 7 | |y%r( 8 | ^d, 9 | ^e)) 10 | 11 | => 12 | 13 | *|/pa[k - 2]%r( 14 | |/pa[k - 1]%b( 15 | |q%r( 16 | ^a, 17 | ^b), 18 | ^c), 19 | |y%b( 20 | ^d, 21 | ^e)) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/trbdel2.tree: -------------------------------------------------------------------------------- 1 | */pa[k - 1]|;B%g( 2 | /x|;A%b( 3 | ^a, 4 | ^b), 5 | \w|;D=D%b( 6 | C%r( 7 | ^c, 8 | >D), 9 | ^e)) 10 | 11 | => 12 | 13 | */pa[k - 1]|;B%g( 14 | /x|;A%b( 15 | ^a, 16 | ^b), 17 | \w|;C=C%b( 18 | ^c, 19 | D%r( 20 | >C, 21 | ^e))) 22 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstcopy.tree: -------------------------------------------------------------------------------- 1 | 4=4( 2 | 2=2( 3 | 1(,>2), 4 | 3(,>4)), 5 | 6=6( 6 | 5(,>6), 7 | 7(,>>))) 8 | 9 | || 10 | 11 | 5=5( 12 | 2=2( 13 | 1=1( 14 | 0=0(,>1), 15 | >2), 16 | 4=4( 17 | 3(,>4), 18 | >5)), 19 | 8=8( 20 | 6( 21 | , 22 | 7(,>8)), 23 | 9(,>>))) 24 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/experimental/.svn/text-base/Makefile.svn-base: -------------------------------------------------------------------------------- 1 | example: example.o libchash.o 2 | $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $^ 3 | 4 | .SUFFIXES: .c .o .h 5 | .c.o: 6 | $(CC) -c $(CPPFLAGS) $(CFLAGS) -o $@ $< 7 | 8 | example.o: example.c libchash.h 9 | libchash.o: libchash.c libchash.h 10 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase2.tree: -------------------------------------------------------------------------------- 1 | */y|%"--"( 2 | /x|%+( 3 | ^a, 4 | \w( 5 | ^b, 6 | ^c)), 7 | ^d) 8 | 9 | => 10 | 11 | *\y|%"--"( 12 | \w( 13 | \x( 14 | ^a, 15 | ^b), 16 | ^c), 17 | ^d) 18 | 19 | => 20 | 21 | *\w|%0( 22 | /x( 23 | ^a, 24 | ^b), 25 | \y( 26 | ^c, 27 | ^d)) 28 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avldel1.tree: -------------------------------------------------------------------------------- 1 | *\y|%"++"( 2 | ^a, 3 | \x|%-( 4 | /w( 5 | ^b, 6 | ^c), 7 | ^d)) 8 | 9 | => 10 | 11 | */y|%"++"( 12 | ^a, 13 | /w( 14 | ^b, 15 | /x( 16 | ^c, 17 | ^d))) 18 | 19 | => 20 | 21 | *\w|%0( 22 | \y( 23 | ^a, 24 | ^b), 25 | \x( 26 | ^c, 27 | ^d)) 28 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel3.tree: -------------------------------------------------------------------------------- 1 | 2\;p=2( 2 | 1( 3 | >>, 4 | >2), 5 | 3\;r=3( 6 | >2, 7 | 5=5( 8 | 4( 9 | >3, 10 | >5), 11 | 6( 12 | >5, 13 | >>)))) 14 | 15 | => 16 | 17 | 3\;r=3( 18 | 1( 19 | >>, 20 | >3), 21 | 5=5( 22 | 4( 23 | >3, 24 | >5), 25 | 6( 26 | >5, 27 | >>))) 28 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/balance9.tree: -------------------------------------------------------------------------------- 1 | 8%r( 2 | 6%b( 3 | 5%r( 4 | ^...( 5 | 1%r)), 6 | 7), 7 | 9) 8 | 9 | => 10 | 11 | 6%r( 12 | 4%b( 13 | 2%r( 14 | 1, 15 | 3), 16 | 5), 17 | 8( 18 | 7, 19 | 9)) 20 | 21 | => 22 | 23 | 4%r( 24 | 2( 25 | 1, 26 | 3), 27 | 6( 28 | 5, 29 | 8( 30 | 7, 31 | 9))) 32 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/google/sparsehash/.svn/all-wcprops: -------------------------------------------------------------------------------- 1 | K 25 2 | svn:wc:ra_dav:version-url 3 | V 52 4 | /svn/!svn/ver/66/trunk/src/windows/google/sparsehash 5 | END 6 | sparseconfig.h 7 | K 25 8 | svn:wc:ra_dav:version-url 9 | V 67 10 | /svn/!svn/ver/66/trunk/src/windows/google/sparsehash/sparseconfig.h 11 | END 12 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstcopy2.tree: -------------------------------------------------------------------------------- 1 | \rq="rq"( 2 | 2=2( 3 | 1( 4 | >>, 5 | >2), 6 | 4=4( 7 | 3( 8 | >2, 9 | >4), 10 | 5( 11 | >4, 12 | >"rq")))) 13 | 14 | => 15 | 16 | \rq( 17 | 2=2( 18 | 1( 19 | >>, 20 | >2), 21 | 4=4( 22 | 3( 23 | >2, 24 | >4), 25 | 5( 26 | >4, 27 | >>)))) 28 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstdel4.tree: -------------------------------------------------------------------------------- 1 | 1\;p=1( 2 | 0( 3 | >>, 4 | >1), 5 | 5=5( 6 | 4/;r=4( 7 | 2\;s=2( 8 | >1, 9 | 3( 10 | >2, 11 | >4)), 12 | >5), 13 | >>)) 14 | 15 | => 16 | 17 | 2\;s=2( 18 | 0( 19 | >>, 20 | >2), 21 | 5=5( 22 | 4/;r=4( 23 | 3( 24 | >2, 25 | >4), 26 | >5), 27 | >>)) 28 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine2tree.tree: -------------------------------------------------------------------------------- 1 | 15%r( 2 | 14%b( 3 | 13%r( 4 | ^...( 5 | 2%b( 6 | 1%r))))) 7 | 8 | => 9 | 10 | 14%b( 11 | 12%b( 12 | 10%b( 13 | 8%b( 14 | 6%b( 15 | 4%b( 16 | 2%b( 17 | 1%r, 18 | 3%r), 19 | 5%r), 20 | 7%r), 21 | 9%r), 22 | 11%r), 23 | 13%r), 24 | 15%r) 25 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/sparsehash/internal/.svn/all-wcprops: -------------------------------------------------------------------------------- 1 | K 25 2 | svn:wc:ra_dav:version-url 3 | V 55 4 | /svn/!svn/ver/106/trunk/src/windows/sparsehash/internal 5 | END 6 | sparseconfig.h 7 | K 25 8 | svn:wc:ra_dav:version-url 9 | V 70 10 | /svn/!svn/ver/106/trunk/src/windows/sparsehash/internal/sparseconfig.h 11 | END 12 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/tbstins.tree: -------------------------------------------------------------------------------- 1 | 6=6( 2 | 4=4( 3 | |2/;p=2( 4 | 1=1( 5 | >>, 6 | >2), 7 | >4), 8 | 5=5( 9 | >4, 10 | >6)), 11 | >>) 12 | 13 | => 14 | 15 | 6=6( 16 | 4=4( 17 | |2/;p=2( 18 | 1=1( 19 | >>, 20 | >2), 21 | |3\_;n=3( 22 | >2, 23 | >4)), 24 | 5=5( 25 | >4, 26 | >6)), 27 | >>) 28 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase22.tree: -------------------------------------------------------------------------------- 1 | */y|%"--"( 2 | /x|%+( 3 | ^a&h, 4 | \w|%-( 5 | ^b&h, 6 | ^c&h-1)), 7 | ^d&h) 8 | 9 | => 10 | 11 | *\y|%"--"( 12 | \w|%"--"( 13 | \x|%0( 14 | ^a&h, 15 | ^b&h), 16 | ^c&h-1), 17 | ^d&h) 18 | 19 | => 20 | 21 | *\w|%0( 22 | /x|%0( 23 | ^a&h, 24 | ^b&h), 25 | \y|%+( 26 | ^c&h-1, 27 | ^d&h)) 28 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlcase23.tree: -------------------------------------------------------------------------------- 1 | */y|%"--"( 2 | /x|%+( 3 | ^a&h, 4 | \w|%+( 5 | ^b&h-1, 6 | ^c&h)), 7 | ^d&h) 8 | 9 | => 10 | 11 | *\y|%"--"( 12 | \w|%-( 13 | \x|%-( 14 | ^a&h, 15 | ^b&h-1), 16 | ^c&h), 17 | ^d&h) 18 | 19 | => 20 | 21 | *\w|%0( 22 | /x|%-( 23 | ^a&h, 24 | ^b&h-1), 25 | \y|%0( 26 | ^c&h, 27 | ^d&h)) 28 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/packages/deb/README: -------------------------------------------------------------------------------- 1 | The list of files here isn't complete. For a step-by-step guide on 2 | how to set this package up correctly, check out 3 | http://www.debian.org/doc/maint-guide/ 4 | 5 | Most of the files that are in this directory are boilerplate. 6 | However, you may need to change the list of binary-arch dependencies 7 | in 'rules'. 8 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/packages/deb/docs: -------------------------------------------------------------------------------- 1 | AUTHORS 2 | COPYING 3 | ChangeLog 4 | INSTALL 5 | NEWS 6 | README 7 | TODO 8 | doc/dense_hash_map.html 9 | doc/dense_hash_set.html 10 | doc/sparse_hash_map.html 11 | doc/sparse_hash_set.html 12 | doc/sparsetable.html 13 | doc/implementation.html 14 | doc/performance.html 15 | doc/index.html 16 | doc/designstyle.css 17 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/README: -------------------------------------------------------------------------------- 1 | The list of files here isn't complete. For a step-by-step guide on 2 | how to set this package up correctly, check out 3 | http://www.debian.org/doc/maint-guide/ 4 | 5 | Most of the files that are in this directory are boilerplate. 6 | However, you may need to change the list of binary-arch dependencies 7 | in 'rules'. 8 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/docs: -------------------------------------------------------------------------------- 1 | AUTHORS 2 | COPYING 3 | ChangeLog 4 | INSTALL 5 | NEWS 6 | README 7 | TODO 8 | doc/dense_hash_map.html 9 | doc/dense_hash_set.html 10 | doc/sparse_hash_map.html 11 | doc/sparse_hash_set.html 12 | doc/sparsetable.html 13 | doc/implementation.html 14 | doc/performance.html 15 | doc/index.html 16 | doc/designstyle.css 17 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/.svn/text-base/README.svn-base: -------------------------------------------------------------------------------- 1 | The list of files here isn't complete. For a step-by-step guide on 2 | how to set this package up correctly, check out 3 | http://www.debian.org/doc/maint-guide/ 4 | 5 | Most of the files that are in this directory are boilerplate. 6 | However, you may need to change the list of binary-arch dependencies 7 | in 'rules'. 8 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/.svn/text-base/docs.svn-base: -------------------------------------------------------------------------------- 1 | AUTHORS 2 | COPYING 3 | ChangeLog 4 | INSTALL 5 | NEWS 6 | README 7 | TODO 8 | doc/dense_hash_map.html 9 | doc/dense_hash_set.html 10 | doc/sparse_hash_map.html 11 | doc/sparse_hash_set.html 12 | doc/sparsetable.html 13 | doc/implementation.html 14 | doc/performance.html 15 | doc/index.html 16 | doc/designstyle.css 17 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine2tree3.tree: -------------------------------------------------------------------------------- 1 | 12%r( 2 | 8%b( 3 | 4%r( 4 | 2( 5 | 1, 6 | 3), 7 | 6( 8 | 5, 9 | 7)), 10 | 10( 11 | 9, 12 | 11)), 13 | 14( 14 | 13, 15 | 15)) 16 | 17 | => 18 | 19 | 8%b( 20 | 4%r( 21 | 2( 22 | 1, 23 | 3), 24 | 6( 25 | 5, 26 | 7)), 27 | 12%r( 28 | 10( 29 | 9, 30 | 11), 31 | 14( 32 | 13, 33 | 15))) 34 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/rootins.tree: -------------------------------------------------------------------------------- 1 | $t 2 | 1( 3 | , 4 | 5( 5 | 3( 6 | 2, 7 | 4), 8 | 6)) 9 | 10 | => 11 | 12 | $t 13 | 1( 14 | , 15 | 5( 16 | 4( 17 | 3( 18 | 2)), 19 | 6)) 20 | 21 | => 22 | 23 | $t 24 | 1( 25 | , 26 | 4( 27 | 3( 28 | 2), 29 | 5( 30 | , 31 | 6))) 32 | 33 | => 34 | 35 | $t 36 | 4( 37 | 1( 38 | , 39 | 3( 40 | 2)), 41 | 5( 42 | , 43 | 6)) 44 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlmuchbal2.tree: -------------------------------------------------------------------------------- 1 | 12( 2 | 7( 3 | 4( 4 | 2( 5 | 1( 6 | 0), 7 | 3), 8 | 6( 9 | 5)), 10 | 10( 11 | 9( 12 | 8), 13 | 11)), 14 | 20( 15 | 17( 16 | 15( 17 | 14( 18 | 13), 19 | 16), 20 | 19( 21 | 18)), 22 | 25( 23 | 23( 24 | 22( 25 | 21), 26 | 24), 27 | 28( 28 | 27( 29 | 26), 30 | 30( 31 | 29))))) 32 | -------------------------------------------------------------------------------- /data_structure/bubble_sort/python/bubble_sort.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python 2 | #-*-coding:utf8-*- 3 | 4 | def bubble_sort(num_list): 5 | num = len(num_list) 6 | result_list = [] 7 | for i in range(0,num): 8 | temp = reduce(lambda x,y:max(x,y),num_list) 9 | result_list.insert(0,temp) 10 | num_list.remove(temp) 11 | return result_list 12 | 13 | num_list = [1,5,8,2] 14 | print bubble_sort(num_list) 15 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/vine2tree2.tree: -------------------------------------------------------------------------------- 1 | 14%r( 2 | 12%b( 3 | 10%r( 4 | 8%b( 5 | 6%r( 6 | 4%b( 7 | 2%r( 8 | 1, 9 | 3), 10 | 5), 11 | 7), 12 | 9), 13 | 11), 14 | 13), 15 | 15) 16 | 17 | => 18 | 19 | 12%b( 20 | 8%b( 21 | 4%b( 22 | 2%r( 23 | 1, 24 | 3), 25 | 6%r( 26 | 5, 27 | 7)), 28 | 10%r( 29 | 9, 30 | 11)), 31 | 14%r( 32 | 13, 33 | 15)) 34 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/google/.svn/entries: -------------------------------------------------------------------------------- 1 | 10 2 | 3 | dir 4 | 113 5 | https://sparsehash.googlecode.com/svn/trunk/src/windows/google 6 | https://sparsehash.googlecode.com/svn 7 | 8 | 9 | 10 | 2011-06-24T05:00:21.294954Z 11 | 66 12 | csilvers 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 21bedea4-f223-4c8b-73d6-85019ffb75a9 28 | 29 | sparsehash 30 | dir 31 | 32 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/sparsehash/.svn/entries: -------------------------------------------------------------------------------- 1 | 10 2 | 3 | dir 4 | 113 5 | https://sparsehash.googlecode.com/svn/trunk/src/windows/sparsehash 6 | https://sparsehash.googlecode.com/svn 7 | 8 | 9 | 10 | 2012-01-31T23:50:02.386177Z 11 | 106 12 | csilvers 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 21bedea4-f223-4c8b-73d6-85019ffb75a9 28 | 29 | internal 30 | dir 31 | 32 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/avlmuchbal.tree: -------------------------------------------------------------------------------- 1 | 20( 2 | 12( 3 | 7( 4 | 4( 5 | 2( 6 | 1( 7 | 0), 8 | 3), 9 | 6( 10 | 5)), 11 | 10( 12 | 9( 13 | 8), 14 | 11)), 15 | 17( 16 | 15( 17 | 14( 18 | 13), 19 | 16), 20 | 19( 21 | 18))), 22 | 28( 23 | 25( 24 | 23( 25 | 22( 26 | 21), 27 | 24), 28 | 27( 29 | 26)), 30 | 31( 31 | 30( 32 | 29), 33 | 32))) 34 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/.svn/all-wcprops: -------------------------------------------------------------------------------- 1 | K 25 2 | svn:wc:ra_dav:version-url 3 | V 35 4 | /svn/!svn/ver/106/trunk/src/windows 5 | END 6 | port.cc 7 | K 25 8 | svn:wc:ra_dav:version-url 9 | V 43 10 | /svn/!svn/ver/106/trunk/src/windows/port.cc 11 | END 12 | port.h 13 | K 25 14 | svn:wc:ra_dav:version-url 15 | V 42 16 | /svn/!svn/ver/106/trunk/src/windows/port.h 17 | END 18 | config.h 19 | K 25 20 | svn:wc:ra_dav:version-url 21 | V 44 22 | /svn/!svn/ver/106/trunk/src/windows/config.h 23 | END 24 | -------------------------------------------------------------------------------- /data_structure/avl/avltree/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include "AvlTree.h" 4 | //#include "BTree.h" 5 | //#include "BSTree.h" 6 | using namespace std; 7 | int main(){ 8 | AvlTree l; 9 | for(int i = 1 ; i <= 15 ; i++){ 10 | l.Insert(i); 11 | } 12 | l.PrintTree(); 13 | while(true){ 14 | int toDelete; 15 | cout<<"请输入要删除节点的值:"<>toDelete; 17 | l.Delete(toDelete); 18 | cout<<"删除后的树为:"< 2 | #include 3 | #include "dbDomain.h" 4 | 5 | int main() 6 | { 7 | struct timeval now_time; 8 | struct timeval after_time; 9 | unsigned char flags = 3; 10 | result_t res; 11 | char *info = NULL; 12 | char name_buf[256]; 13 | 14 | unsigned int ip; 15 | unsigned int rip; 16 | 17 | InitializeSearchTree(); 18 | printf("Input the URL:"); 19 | 20 | scanf("%s", name_buf); 21 | 22 | res = SearchDomainName(name_buf, &flags, &info); 23 | printf("Resalt: %d\n", res); 24 | printf("Resalt: %d\n",flags ); 25 | printf("Resalt: %s\n",info ); 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/google/sparsehash/.svn/entries: -------------------------------------------------------------------------------- 1 | 10 2 | 3 | dir 4 | 113 5 | https://sparsehash.googlecode.com/svn/trunk/src/windows/google/sparsehash 6 | https://sparsehash.googlecode.com/svn 7 | 8 | 9 | 10 | 2011-06-24T05:00:21.294954Z 11 | 66 12 | csilvers 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 21bedea4-f223-4c8b-73d6-85019ffb75a9 28 | 29 | sparseconfig.h 30 | file 31 | 32 | 33 | 34 | 35 | 2012-02-22T20:49:42.415760Z 36 | 67cc0408754e0a62822995e4b4227bb9 37 | 2011-06-24T05:00:21.294954Z 38 | 66 39 | csilvers 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 1445 62 | 63 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/sparsehash/internal/.svn/entries: -------------------------------------------------------------------------------- 1 | 10 2 | 3 | dir 4 | 113 5 | https://sparsehash.googlecode.com/svn/trunk/src/windows/sparsehash/internal 6 | https://sparsehash.googlecode.com/svn 7 | 8 | 9 | 10 | 2012-01-31T23:50:02.386177Z 11 | 106 12 | csilvers 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 21bedea4-f223-4c8b-73d6-85019ffb75a9 28 | 29 | sparseconfig.h 30 | file 31 | 32 | 33 | 34 | 35 | 2012-02-22T20:49:42.407760Z 36 | 67cc0408754e0a62822995e4b4227bb9 37 | 2012-01-31T23:50:02.386177Z 38 | 106 39 | csilvers 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 1445 62 | 63 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/packages/deb/control: -------------------------------------------------------------------------------- 1 | Source: sparsehash 2 | Section: libdevel 3 | Priority: optional 4 | Maintainer: Google Inc. 5 | Build-Depends: debhelper (>= 4.0.0) 6 | Standards-Version: 3.6.1 7 | 8 | Package: sparsehash 9 | Section: libs 10 | Architecture: any 11 | Description: hash_map and hash_set classes with minimal space overhead 12 | This package contains several hash-map implementations, similar 13 | in API to SGI's hash_map class, but with different performance 14 | characteristics. sparse_hash_map uses very little space overhead: 1-2 15 | bits per entry. dense_hash_map is typically faster than the default 16 | SGI STL implementation. This package also includes hash-set analogues 17 | of these classes. 18 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/experimental/.svn/all-wcprops: -------------------------------------------------------------------------------- 1 | K 25 2 | svn:wc:ra_dav:version-url 3 | V 36 4 | /svn/!svn/ver/106/trunk/experimental 5 | END 6 | libchash.h 7 | K 25 8 | svn:wc:ra_dav:version-url 9 | V 47 10 | /svn/!svn/ver/106/trunk/experimental/libchash.h 11 | END 12 | example.c 13 | K 25 14 | svn:wc:ra_dav:version-url 15 | V 46 16 | /svn/!svn/ver/106/trunk/experimental/example.c 17 | END 18 | README 19 | K 25 20 | svn:wc:ra_dav:version-url 21 | V 41 22 | /svn/!svn/ver/8/trunk/experimental/README 23 | END 24 | Makefile 25 | K 25 26 | svn:wc:ra_dav:version-url 27 | V 43 28 | /svn/!svn/ver/8/trunk/experimental/Makefile 29 | END 30 | libchash.c 31 | K 25 32 | svn:wc:ra_dav:version-url 33 | V 47 34 | /svn/!svn/ver/106/trunk/experimental/libchash.c 35 | END 36 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/config.h.include: -------------------------------------------------------------------------------- 1 | /*** 2 | *** These are #defines that autoheader puts in config.h.in that we 3 | *** want to show up in sparseconfig.h, the minimal config.h file 4 | *** #included by all our .h files. The reason we don't take 5 | *** everything that autoheader emits is that we have to include a 6 | *** config.h in installed header files, and we want to minimize the 7 | *** number of #defines we make so as to not pollute the namespace. 8 | ***/ 9 | GOOGLE_NAMESPACE 10 | HASH_NAMESPACE 11 | HASH_FUN_H 12 | SPARSEHASH_HASH 13 | HAVE_UINT16_T 14 | HAVE_U_INT16_T 15 | HAVE___UINT16 16 | HAVE_LONG_LONG 17 | HAVE_SYS_TYPES_H 18 | HAVE_STDINT_H 19 | HAVE_INTTYPES_H 20 | HAVE_MEMCPY 21 | _END_GOOGLE_NAMESPACE_ 22 | _START_GOOGLE_NAMESPACE_ 23 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/experimental/README: -------------------------------------------------------------------------------- 1 | This is a C version of sparsehash (and also, maybe, densehash) that I 2 | wrote way back when, and served as the inspiration for the C++ 3 | version. The API for the C version is much uglier than the C++, 4 | because of the lack of template support. I believe the class works, 5 | but I'm not convinced it's really flexible or easy enough to use. 6 | 7 | It would be nice to rework this C class to follow the C++ API as 8 | closely as possible (eg have a set_deleted_key() instead of using a 9 | #define like this code does now). I believe the code compiles and 10 | runs, if anybody is interested in using it now, but it's subject to 11 | major change in the future, as people work on it. 12 | 13 | Craig Silverstein 14 | 20 March 2005 15 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/experimental/README: -------------------------------------------------------------------------------- 1 | This is a C version of sparsehash (and also, maybe, densehash) that I 2 | wrote way back when, and served as the inspiration for the C++ 3 | version. The API for the C version is much uglier than the C++, 4 | because of the lack of template support. I believe the class works, 5 | but I'm not convinced it's really flexible or easy enough to use. 6 | 7 | It would be nice to rework this C class to follow the C++ API as 8 | closely as possible (eg have a set_deleted_key() instead of using a 9 | #define like this code does now). I believe the code compiles and 10 | runs, if anybody is interested in using it now, but it's subject to 11 | major change in the future, as people work on it. 12 | 13 | Craig Silverstein 14 | 20 March 2005 15 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/src/config.h.include: -------------------------------------------------------------------------------- 1 | /*** 2 | *** These are #defines that autoheader puts in config.h.in that we 3 | *** want to show up in sparseconfig.h, the minimal config.h file 4 | *** #included by all our .h files. The reason we don't take 5 | *** everything that autoheader emits is that we have to include a 6 | *** config.h in installed header files, and we want to minimize the 7 | *** number of #defines we make so as to not pollute the namespace. 8 | ***/ 9 | GOOGLE_NAMESPACE 10 | HASH_NAMESPACE 11 | HASH_FUN_H 12 | SPARSEHASH_HASH 13 | HAVE_UINT16_T 14 | HAVE_U_INT16_T 15 | HAVE___UINT16 16 | HAVE_LONG_LONG 17 | HAVE_SYS_TYPES_H 18 | HAVE_STDINT_H 19 | HAVE_INTTYPES_H 20 | HAVE_MEMCPY 21 | STL_NAMESPACE 22 | _END_GOOGLE_NAMESPACE_ 23 | _START_GOOGLE_NAMESPACE_ 24 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/control: -------------------------------------------------------------------------------- 1 | Source: sparsehash 2 | Section: libdevel 3 | Priority: optional 4 | Maintainer: Google Inc. and others 5 | Build-Depends: debhelper (>= 4.0.0) 6 | Standards-Version: 3.6.1 7 | 8 | Package: sparsehash 9 | Section: libs 10 | Architecture: any 11 | Description: hash_map and hash_set classes with minimal space overhead 12 | This package contains several hash-map implementations, similar 13 | in API to SGI's hash_map class, but with different performance 14 | characteristics. sparse_hash_map uses very little space overhead: 1-2 15 | bits per entry. dense_hash_map is typically faster than the default 16 | SGI STL implementation. This package also includes hash-set analogues 17 | of these classes. 18 | -------------------------------------------------------------------------------- /data_structure/file_merge_sort/logging.conf: -------------------------------------------------------------------------------- 1 | [loggers] 2 | keys=root,MergeSort 3 | 4 | [handlers] 5 | keys=consoleHandler,fileHandler 6 | 7 | [formatters] 8 | keys=simpleFormatter 9 | 10 | [logger_root] 11 | level=DEBUG 12 | handlers=consoleHandler 13 | 14 | [logger_MergeSort] 15 | level=DEBUG 16 | handlers=consoleHandler,fileHandler 17 | propagate=0 18 | qualname=MergeSort 19 | 20 | [handler_consoleHandler] 21 | class=StreamHandler 22 | level=DEBUG 23 | formatter=simpleFormatter 24 | args=(sys.stderr,) 25 | 26 | [handler_fileHandler] 27 | class=FileHandler 28 | level=INFO 29 | formatter=simpleFormatter 30 | args=('MergeSort.log', 'a+') 31 | 32 | [formatter_simpleFormatter] 33 | format=%(asctime)s - %(name)s - %(levelname)s - %(message)s 34 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/experimental/.svn/text-base/README.svn-base: -------------------------------------------------------------------------------- 1 | This is a C version of sparsehash (and also, maybe, densehash) that I 2 | wrote way back when, and served as the inspiration for the C++ 3 | version. The API for the C version is much uglier than the C++, 4 | because of the lack of template support. I believe the class works, 5 | but I'm not convinced it's really flexible or easy enough to use. 6 | 7 | It would be nice to rework this C class to follow the C++ API as 8 | closely as possible (eg have a set_deleted_key() instead of using a 9 | #define like this code does now). I believe the code compiles and 10 | runs, if anybody is interested in using it now, but it's subject to 11 | major change in the future, as people work on it. 12 | 13 | Craig Silverstein 14 | 20 March 2005 15 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/.svn/text-base/control.svn-base: -------------------------------------------------------------------------------- 1 | Source: sparsehash 2 | Section: libdevel 3 | Priority: optional 4 | Maintainer: Google Inc. and others 5 | Build-Depends: debhelper (>= 4.0.0) 6 | Standards-Version: 3.6.1 7 | 8 | Package: sparsehash 9 | Section: libs 10 | Architecture: any 11 | Description: hash_map and hash_set classes with minimal space overhead 12 | This package contains several hash-map implementations, similar 13 | in API to SGI's hash_map class, but with different performance 14 | characteristics. sparse_hash_map uses very little space overhead: 1-2 15 | bits per entry. dense_hash_map is typically faster than the default 16 | SGI STL implementation. This package also includes hash-set analogues 17 | of these classes. 18 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/m4/namespaces.m4: -------------------------------------------------------------------------------- 1 | # Checks whether the compiler implements namespaces 2 | AC_DEFUN([AC_CXX_NAMESPACES], 3 | [AC_CACHE_CHECK(whether the compiler implements namespaces, 4 | ac_cv_cxx_namespaces, 5 | [AC_LANG_SAVE 6 | AC_LANG_CPLUSPLUS 7 | AC_TRY_COMPILE([namespace Outer { 8 | namespace Inner { int i = 0; }}], 9 | [using namespace Outer::Inner; return i;], 10 | ac_cv_cxx_namespaces=yes, 11 | ac_cv_cxx_namespaces=no) 12 | AC_LANG_RESTORE]) 13 | if test "$ac_cv_cxx_namespaces" = yes; then 14 | AC_DEFINE(HAVE_NAMESPACES, 1, [define if the compiler implements namespaces]) 15 | fi]) 16 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/m4/namespaces.m4: -------------------------------------------------------------------------------- 1 | # Checks whether the compiler implements namespaces 2 | AC_DEFUN([AC_CXX_NAMESPACES], 3 | [AC_CACHE_CHECK(whether the compiler implements namespaces, 4 | ac_cv_cxx_namespaces, 5 | [AC_LANG_SAVE 6 | AC_LANG_CPLUSPLUS 7 | AC_TRY_COMPILE([namespace Outer { 8 | namespace Inner { int i = 0; }}], 9 | [using namespace Outer::Inner; return i;], 10 | ac_cv_cxx_namespaces=yes, 11 | ac_cv_cxx_namespaces=no) 12 | AC_LANG_RESTORE]) 13 | if test "$ac_cv_cxx_namespaces" = yes; then 14 | AC_DEFINE(HAVE_NAMESPACES, 1, [define if the compiler implements namespaces]) 15 | fi]) 16 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/examples.w: -------------------------------------------------------------------------------- 1 | @c GNU libavl - library for manipulation of binary trees. 2 | @c Copyright (C) 1998, 1999, 2000, 2001, 2002, 2004 Free Software 3 | @c Foundation, Inc. 4 | @c Permission is granted to copy, distribute and/or modify this document 5 | @c under the terms of the GNU Free Documentation License, Version 1.2 6 | @c or any later version published by the Free Software Foundation; 7 | @c with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. 8 | @c A copy of the license is included in the section entitled "GNU 9 | @c Free Documentation License". 10 | 11 | @ = 12 | for (i = 0; i < hash->m; i++) 13 | hash->entry[i] = NULL; 14 | @ 15 | 16 | @ = 17 | hash->m = 13; 18 | @ 19 | @ 20 | 21 | @ += 22 | hash->n = 0; 23 | @ 24 | -------------------------------------------------------------------------------- /data_structure/avl/avltree/AvlNode.h: -------------------------------------------------------------------------------- 1 | #ifndef AVLNODE_H 2 | #define AVLNODE_H 3 | #include 4 | using namespace std; 5 | 6 | template class AvlTree; //声明AvlTree类 7 | 8 | template 9 | class AvlNode{ 10 | public: 11 | friend class AvlTree;//友元类 12 | 13 | //构造函数 14 | AvlNode():left(NULL),right(NULL),balance(0){}; 15 | AvlNode(const T& e,AvlNode *lt = NULL,AvlNode *rt = NULL):data(e),left(lt),right(rt),balance(0){}; 16 | 17 | int getBalance() const{return balance;} 18 | AvlNode* getLeft() const{return left;} 19 | AvlNode* getRight() const{return right;} 20 | T getData() const{return data;} 21 | private: 22 | T data; //节点的值 23 | AvlNode *left; //左孩子 24 | AvlNode *right; //有孩子 25 | int balance; //平衡因子,右子树的高度减去左子树的高度 26 | }; 27 | #endif //AVLNODE_H 28 | -------------------------------------------------------------------------------- /data_structure/左旋转字符串/1/invert_str.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | char *invert(char *start, char *end) 5 | { 6 | char tmp, *ptmp = start; 7 | while (start != NULL && end != NULL && start < end) 8 | { 9 | tmp = *start; 10 | *start = *end; 11 | *end = tmp; 12 | start ++; 13 | end --; 14 | } 15 | 16 | return ptmp; 17 | } 18 | 19 | char *left(char *s, int pos) //pos为要旋转的字符个数，或长度，下面主函数测试中，pos=3。 20 | { 21 | int len = strlen(s); 22 | invert(s, s + (pos - 1)); //如上，X->X^T，即 abc->cba 23 | invert(s + pos, s + (len - 1)); //如上，Y->Y^T，即 def->fed 24 | invert(s, s + (len - 1)); //如上，整个翻转，(X^TY^T)^T=YX，即 cbafed->defabc。 25 | return s; 26 | } 27 | 28 | int main() 29 | { 30 | char s[] = "abcdefghij"; 31 | puts(left(s, 3)); 32 | return 0; 33 | } 34 | -------------------------------------------------------------------------------- /data_structure/b-tree/c/1/domainUpdate.h: -------------------------------------------------------------------------------- 1 | #ifndef DOMAINUPDATE_H_INCLUDED 2 | #define DOMAINUPDATE_H_INCLUDED 3 | 4 | #include 5 | #include "dbUtility.h" 6 | 7 | extern pthread_t update_thread; 8 | 9 | result_t InitShm(void); 10 | /* 11 | * Usage: initial Share memory, attach to share memory. 12 | * @param void --- null 13 | * @return result_t 14 | ---- R_SUCCESS: initial success; 15 | ---- R_FAILED: initial failed 16 | */ 17 | result_t DetShm(void); 18 | /* 19 | * Usage: detach from share memory 20 | * @param void --- null 21 | * @return result_t 22 | ---- R_SUCCESS: operate success; 23 | ---- R_FAILED: operate failed 24 | */ 25 | 26 | void* UpdateCreate(void *arg); 27 | /* 28 | * Usage: process update of url (used for thread) 29 | * @param void *arg --- nothing 30 | * @return void* --- nothing 31 | */ 32 | 33 | #endif // DOMAINUPDATE_H_INCLUDED 34 | -------------------------------------------------------------------------------- /data_structure/counting_sort/counting_sort.c: -------------------------------------------------------------------------------- 1 | #include 2 | #define max 100 //数组最大长度 3 | #define maxnum 200//定义最大的元素的值为200 4 | 5 | int result[max],num[max],count[maxnum+1],lenth;//结果数组,要排序的数组,临时数组,要排序的数组大小 6 | 7 | void COUNTING_SORT() 8 | { 9 | int i; 10 | for(i=0;i<=maxnum;i++) 11 | count[i]=0; 12 | for(i=1;i<=lenth;i++) //记录每一个元素小于本身的个数 13 | count[num[i]]=count[num[i]]+1; 14 | for(i=1;i<=maxnum;i++) 15 | count[i]=count[i]+count[i-1]; 16 | 17 | for(i=lenth;i>=1;i--) 18 | { 19 | result[count[num[i]]]=num[i]; 20 | count[num[i]]=count[num[i]]-1; 21 | } 22 | } 23 | 24 | int main() 25 | { 26 | int i; 27 | freopen("in.txt","r",stdin); //重定向读文件 28 | scanf("%d",&lenth); 29 | for(i=1;i<=lenth;i++) 30 | { 31 | scanf("%d",&num[i]); 32 | } 33 | COUNTING_SORT(); 34 | for(i=1;i<=lenth;i++) 35 | printf(" %d",result[i]); 36 | 37 | return 0; 38 | } 39 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/m4/stl_namespace.m4: -------------------------------------------------------------------------------- 1 | # We check what namespace stl code like vector expects to be executed in 2 | 3 | AC_DEFUN([AC_CXX_STL_NAMESPACE], 4 | [AC_CACHE_CHECK( 5 | what namespace STL code is in, 6 | ac_cv_cxx_stl_namespace, 7 | [AC_REQUIRE([AC_CXX_NAMESPACES]) 8 | AC_LANG_SAVE 9 | AC_LANG_CPLUSPLUS 10 | AC_TRY_COMPILE([#include ], 11 | [vector t; return 0;], 12 | ac_cv_cxx_stl_namespace=none) 13 | AC_TRY_COMPILE([#include ], 14 | [std::vector t; return 0;], 15 | ac_cv_cxx_stl_namespace=std) 16 | AC_LANG_RESTORE]) 17 | if test "$ac_cv_cxx_stl_namespace" = none; then 18 | AC_DEFINE(STL_NAMESPACE,, 19 | [the namespace where STL code like vector<> is defined]) 20 | fi 21 | if test "$ac_cv_cxx_stl_namespace" = std; then 22 | AC_DEFINE(STL_NAMESPACE,std, 23 | [the namespace where STL code like vector<> is defined]) 24 | fi 25 | ]) 26 | -------------------------------------------------------------------------------- /data_structure/clist/clist.h: -------------------------------------------------------------------------------- 1 | #ifndef CLIST_H 2 | #define CLIST_H 3 | 4 | #include 5 | 6 | typedef struct CListElmt_{ 7 | 8 | void *data; 9 | 10 | struct CListElmt_ *next; 11 | 12 | } CListElmt; 13 | 14 | 15 | typedef struct CList_{ 16 | int size; 17 | int (*cmp)(const void *, const void *); 18 | void (*destroy)(void *); 19 | CListElmt *head; 20 | }CList; 21 | 22 | void clist_init( 23 | CList *list, 24 | void (*destroy)(void *)); 25 | 26 | int clist_ins_next( 27 | CList *list, 28 | CListElmt *iter, 29 | const void *data); 30 | 31 | int clist_rem_next( 32 | CList *list, 33 | CListElmt * iter, 34 | void **data); 35 | 36 | void clist_dealloc(CList *list); 37 | 38 | 39 | #define clist_size(list) ((list)->size) 40 | #define clist_head(list) ((list)->head) 41 | #define clist_data(iter) ((iter)->data) 42 | #define clist_next(iter) ((iter)->next) 43 | 44 | #endif 45 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/TODO: -------------------------------------------------------------------------------- 1 | 1) TODO: I/O implementation in densehashtable.h 2 | 3 | 2) TODO: document SPARSEHASH_STAT_UPDATE macro, and also macros that 4 | tweak performance. Perhaps add support to these to the API? 5 | 6 | 3) TODO: support exceptions? 7 | 8 | 4) BUG: sparsetable's operator[] doesn't work well with printf: you 9 | need to explicitly cast the result to value_type to print it. (It 10 | works fine with streams.) 11 | 12 | 5) TODO: consider rewriting dense_hash_map to use a 'groups' scheme, 13 | like sparsetable, but without the sparse-allocation within a 14 | group. This makes resizing have better memory-use properties. The 15 | downside is that probes across groups might take longer since 16 | groups are not contiguous in memory. Making groups the same size 17 | as a cache-line, and ensuring they're loaded on cache-line 18 | boundaries, might help. Needs careful testing to make sure it 19 | doesn't hurt performance. 20 | 21 | 6) TODO: Get the C-only version of sparsehash in experimental/ ready 22 | for prime-time. 23 | 24 | 7) TODO: use cmake (www.cmake.org) to make it easy to isntall this on 25 | a windows system. 26 | 27 | --- 28 | 28 February 2007 29 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/TODO: -------------------------------------------------------------------------------- 1 | 1) TODO: I/O implementation in densehashtable.h 2 | 3 | 2) TODO: document SPARSEHASH_STAT_UPDATE macro, and also macros that 4 | tweak performance. Perhaps add support to these to the API? 5 | 6 | 3) TODO: support exceptions? 7 | 8 | 4) BUG: sparsetable's operator[] doesn't work well with printf: you 9 | need to explicitly cast the result to value_type to print it. (It 10 | works fine with streams.) 11 | 12 | 5) TODO: consider rewriting dense_hash_map to use a 'groups' scheme, 13 | like sparsetable, but without the sparse-allocation within a 14 | group. This makes resizing have better memory-use properties. The 15 | downside is that probes across groups might take longer since 16 | groups are not contiguous in memory. Making groups the same size 17 | as a cache-line, and ensuring they're loaded on cache-line 18 | boundaries, might help. Needs careful testing to make sure it 19 | doesn't hurt performance. 20 | 21 | 6) TODO: Get the C-only version of sparsehash in experimental/ ready 22 | for prime-time. 23 | 24 | 7) TODO: use cmake (www.cmake.org) to make it easy to isntall this on 25 | a windows system. 26 | 27 | --- 28 | 28 February 2007 29 | -------------------------------------------------------------------------------- /data_structure/file_merge_sort/README.txt: -------------------------------------------------------------------------------- 1 | 1.问题思考过程： 2 | （1）.当你在电话中问我这个问题时，我首先想到的是位图，因为它和我在读《编程珠玑》时一个问题很想似（1.海量数据2.内存受限），并且当时我想到若是存在数据大小限制可以采用桶排序，所以我当时，向你问了一下它的其他信息； 3 | 但是因为数据是double，而且没说不重复，所以位图pass掉了，同理桶排序不合适； 4 | 所以当时只是记得应该批量处理。。。。。。 5 | （2）.对于基于磁盘的归并排序： 6 | 归并排序思路：首先，对未排序文件（eg:data.txt）进行一次遍历，批量将数据读出，在内存中排序后，写到缓存文件(eg:datax.txt(x = 1,2,3....))中,此时每次读取数据的大小取决的内存大小，得到排序好的很多小文件；然后利用多路归并排序，同时读取所有小文件，依次取每个文件中的一个数放到一个数组中，则第一次取出的为所有文件中最小的，然后将这些最小的集合中的最小数据写到目标文件(result.txt)中，同时在相应的文件中取出一个数据补充到数组中，以此类推可以将数据排序。（当然此过程可以优化：利用败者树、置换-选择排序、最佳归并树，但是由于我马上要考试和课程设计，就没实现） 7 | 8 | 2.时间复杂度分析: 9 | 总共消耗的时间 = 内部排序（产生初始归并段）所需时间 + 外存信息读取时间 + 内部归并所需时间 10 | 内部排序所需时间取决于所采用的排序算法，时间复杂度不确定（在程序中我采用的是基于DSU的自带的sort方法（用c实现的归并）） 11 | 外存信息读取时间为：为进行两趟读/写时间（其实若是不采用一次性归并完成，其归并趟数会变化） 12 | 内部归并所需时间：若以两个值之间的比较为单位值，时间复杂度为o(nlogn)(n为总的数据数) 13 | 其中外存信息读取时间占主要因素 14 | 15 | 3.关于代码 16 | 请先运行:python generate_data.py,然后运行:python merge_sort.py 17 | 18 | generate_data.py 用于产生1000个随机浮点数 19 | merge_sort.py 用于利用磁盘归并排序进行排序 20 | 在其中假设内存最多能放下100个python浮点数对象，因为python中一切皆为对象，则每个浮点数实际占用内存不确定，而且python是弱数据类型语言，我只是想表达归并排序的意思 21 | 22 | 4.mongodb的使用,我当时用mongodb很简单,就是利用python的pymongo模块，因为bson数据格式和dict很相似，能将dict直接存进去，就将python对象存进去了或将自定义对象利用pickle存进去的，当时用了两个collections，没用GridFS存大文件,Master-slave等高级特性也没设置过 23 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/packages/deb/.svn/all-wcprops: -------------------------------------------------------------------------------- 1 | K 25 2 | svn:wc:ra_dav:version-url 3 | V 36 4 | /svn/!svn/ver/113/trunk/packages/deb 5 | END 6 | control 7 | K 25 8 | svn:wc:ra_dav:version-url 9 | V 44 10 | /svn/!svn/ver/106/trunk/packages/deb/control 11 | END 12 | sparsehash.dirs 13 | K 25 14 | svn:wc:ra_dav:version-url 15 | V 52 16 | /svn/!svn/ver/106/trunk/packages/deb/sparsehash.dirs 17 | END 18 | compat 19 | K 25 20 | svn:wc:ra_dav:version-url 21 | V 41 22 | /svn/!svn/ver/6/trunk/packages/deb/compat 23 | END 24 | sparsehash.install 25 | K 25 26 | svn:wc:ra_dav:version-url 27 | V 55 28 | /svn/!svn/ver/106/trunk/packages/deb/sparsehash.install 29 | END 30 | changelog 31 | K 25 32 | svn:wc:ra_dav:version-url 33 | V 46 34 | /svn/!svn/ver/109/trunk/packages/deb/changelog 35 | END 36 | docs 37 | K 25 38 | svn:wc:ra_dav:version-url 39 | V 40 40 | /svn/!svn/ver/19/trunk/packages/deb/docs 41 | END 42 | copyright 43 | K 25 44 | svn:wc:ra_dav:version-url 45 | V 46 46 | /svn/!svn/ver/113/trunk/packages/deb/copyright 47 | END 48 | rules 49 | K 25 50 | svn:wc:ra_dav:version-url 51 | V 40 52 | /svn/!svn/ver/6/trunk/packages/deb/rules 53 | END 54 | README 55 | K 25 56 | svn:wc:ra_dav:version-url 57 | V 41 58 | /svn/!svn/ver/6/trunk/packages/deb/README 59 | END 60 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/README.windows: -------------------------------------------------------------------------------- 1 | This project has been ported to Windows. A working solution file 2 | exists in this directory: 3 | google-sparsehash.sln 4 | 5 | You can load this solution file into either VC++ 7.1 (Visual Studio 6 | 2003) or VC++ 8.0 (Visual Studio 2005) -- in the latter case, it will 7 | automatically convert the files to the latest format for you. 8 | 9 | When you build the solution, it will create a number of 10 | unittests,which you can run by hand (or, more easily, under the Visual 11 | Studio debugger) to make sure everything is working properly on your 12 | system. The binaries will end up in a directory called "debug" or 13 | "release" in the top-level directory (next to the .sln file). 14 | 15 | Note that these systems are set to build in Debug mode by default. 16 | You may want to change them to Release mode. 17 | 18 | I have little experience with Windows programming, so there may be 19 | better ways to set this up than I've done! If you run across any 20 | problems, please post to the google-sparsehash Google Group, or report 21 | them on the google-sparsehash Google Code site: 22 | http://groups.google.com/group/google-sparsehash 23 | http://code.google.com/p/google-sparsehash/issues/list 24 | 25 | -- craig 26 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/ROADMAP: -------------------------------------------------------------------------------- 1 | The following features are planned for future versions of GNU libavl. 2 | Please keep in mind these plans are subject to change. There is no 3 | predictable timeline for any of this, because libavl is developed as 4 | time becomes available. Your feedback, including suggestions for 5 | prioritization or additional features, is welcomed at 6 | . 7 | 8 | For more information on some of the items listed below, look in the 9 | TODO and OUTLINE files. 10 | 11 | libavl 2.1 12 | ---------- 13 | 14 | * User's guide and reference manual. 15 | 16 | * Proper indexes. 17 | 18 | * Additional "abridged" edition that omits threaded, right-threaded, 19 | and parent pointer chapters. 20 | 21 | libavl 2.2 22 | ---------- 23 | 24 | * New chapters on optimization of binary tree routines and an example 25 | of an optimized binary tree-based structure. 26 | 27 | * New appendix on choosing a data structure. 28 | 29 | libavl 2.3 30 | ---------- 31 | 32 | * Positional trees with split. 33 | 34 | * Lazy split aside for plain BSTs. 35 | 36 | libavl 2.4 37 | ---------- 38 | 39 | * Skip lists. 40 | 41 | libavl 2.5 42 | ---------- 43 | 44 | * Hybrid hash/binary tree data structure. 45 | 46 | Local variables: 47 | mode: text 48 | End: 49 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/README_windows.txt: -------------------------------------------------------------------------------- 1 | This project has been ported to Windows. A working solution file 2 | exists in this directory: 3 | sparsehash.sln 4 | 5 | You can load this solution file into either VC++ 7.1 (Visual Studio 6 | 2003) or VC++ 8.0 (Visual Studio 2005) -- in the latter case, it will 7 | automatically convert the files to the latest format for you. 8 | 9 | When you build the solution, it will create a number of 10 | unittests,which you can run by hand (or, more easily, under the Visual 11 | Studio debugger) to make sure everything is working properly on your 12 | system. The binaries will end up in a directory called "debug" or 13 | "release" in the top-level directory (next to the .sln file). 14 | 15 | Note that these systems are set to build in Debug mode by default. 16 | You may want to change them to Release mode. 17 | 18 | I have little experience with Windows programming, so there may be 19 | better ways to set this up than I've done! If you run across any 20 | problems, please post to the google-sparsehash Google Group, or report 21 | them on the sparsehash Google Code site: 22 | http://groups.google.com/group/google-sparsehash 23 | http://code.google.com/p/sparsehash/issues/list 24 | 25 | -- craig 26 | -------------------------------------------------------------------------------- /data_structure/heap_sort/heap_sort.c: -------------------------------------------------------------------------------- 1 | #include 2 | #define max 10 3 | 4 | int num[max+1],m,n,lenth; 5 | int used[max+1]; 6 | 7 | void Exchange(int *a,int *b)//交换数组元素 8 | { 9 | int temp=*a; 10 | *a=*b; 11 | *b=temp; 12 | } 13 | 14 | void Max_HEAPIFY(int *a,int i)//保持堆性 15 | { 16 | int l=i*2,r=i*2+1,large; 17 | if(l<=lenth&&a[l]>a[i]) 18 | large=l; 19 | else 20 | large=i; 21 | if(r<=lenth&&a[large]=1;i--) 36 | { 37 | Max_HEAPIFY(a,i); 38 | } 39 | } 40 | 41 | void HEAPSORT(int *a)//堆排序 42 | { 43 | int i; 44 | BUILD_MAX_HEAP(a); 45 | for(i=max;i>=2;i--) 46 | { 47 | Exchange(&a[1],&a[lenth]); //将最大元素放到结尾 48 | lenth=lenth-1; 49 | Max_HEAPIFY(a,1); 50 | } 51 | } 52 | 53 | int main() 54 | { 55 | int i,j; 56 | freopen("in.txt","r",stdin);//用数组长为10的做了下测试,重定向为了方便进行测试，可以像输入一样处理文件内容 57 | for(i=1;i<=max;i++) 58 | { 59 | scanf("%d",&num[i]); 60 | } 61 | 62 | lenth=max; 63 | HEAPSORT(num); 64 | for(i=1;i<=max;i++) 65 | printf("%d ",num[i]); 66 | 67 | return 0; 68 | } 69 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/.svn/entries: -------------------------------------------------------------------------------- 1 | 10 2 | 3 | dir 4 | 113 5 | https://sparsehash.googlecode.com/svn/trunk/src/windows 6 | https://sparsehash.googlecode.com/svn 7 | 8 | 9 | 10 | 2012-01-31T23:50:02.386177Z 11 | 106 12 | csilvers 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 21bedea4-f223-4c8b-73d6-85019ffb75a9 28 | 29 | sparsehash 30 | dir 31 | 32 | port.cc 33 | file 34 | 35 | 36 | 37 | 38 | 2012-02-22T20:49:42.415760Z 39 | 151c78cf52673740bfb58bcc65e4d5ba 40 | 2012-01-31T23:50:02.386177Z 41 | 106 42 | csilvers 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 2661 65 | 66 | port.h 67 | file 68 | 69 | 70 | 71 | 72 | 2012-02-22T20:49:42.415760Z 73 | a4606eabefc5a8058fff503ea36c9d55 74 | 2012-01-31T23:50:02.386177Z 75 | 106 76 | csilvers 77 | 78 | 79 | 80 | 81 | 82 | 83 | 84 | 85 | 86 | 87 | 88 | 89 | 90 | 91 | 92 | 93 | 94 | 95 | 96 | 97 | 98 | 2948 99 | 100 | config.h 101 | file 102 | 103 | 104 | 105 | 106 | 2012-02-22T20:49:42.415760Z 107 | 956a5f41260940e9fa6666ffd256906e 108 | 2012-01-31T23:50:02.386177Z 109 | 106 110 | csilvers 111 | 112 | 113 | 114 | 115 | 116 | 117 | 118 | 119 | 120 | 121 | 122 | 123 | 124 | 125 | 126 | 127 | 128 | 129 | 130 | 131 | 132 | 4291 133 | 134 | google 135 | dir 136 | 137 | -------------------------------------------------------------------------------- /data_structure/左旋转字符串/2/invert_str.cpp: -------------------------------------------------------------------------------- 1 | //copyright@July、颜沙 2 | //最终代码，July，updated again，2011.04.17。 3 | #include 4 | #include 5 | 6 | using namespace std; 7 | 8 | void rotate(string &str, int m) 9 | { 10 | 11 | if (str.length() == 0 || m <= 0) 12 | return; 13 | 14 | int n = str.length(); 15 | 16 | if (m % n <= 0) 17 | return; 18 | 19 | int p1 = 0, p2 = m; 20 | int k = (n - m) - n % m; 21 | 22 | // 交换p1，p2指向的元素，然后移动p1，p2 23 | while (k --) 24 | { 25 | swap(str[p1], str[p2]);//c++有现成的swap函数 26 | p1++; 27 | p2++; 28 | } 29 | 30 | // 重点，都在下述几行。 31 | // 处理尾部，r为尾部左移次数 32 | int r = n - p2; 33 | while (r--) 34 | { 35 | int i = p2; 36 | while (i > p1) 37 | { 38 | swap(str[i], str[i-1]); 39 | i--; 40 | } 41 | p2++; 42 | p1++; 43 | } 44 | //比如一个例子，abcdefghijk 45 | // p1 p2 46 | //当执行到这里时，defghi a b c j k 47 | //p2+m出界 了， 48 | //r=n-p2=2，所以以下过程，要执行循环俩次。 49 | 50 | //第一次：j 步步前移，abcjk->abjck->ajbck->jabck 51 | //然后，p1++，p2++，p1指a，p2指k。 52 | // p1 p2 53 | //第二次：defghi j a b c k 54 | //同理，此后，k步步前移，abck->abkc->akbc->kabc。 55 | } 56 | 57 | int main() 58 | { 59 | string ch="abcdefghijk"; 60 | rotate(ch,3); 61 | cout< 18 | #define SPARSEHASH_HASH HASH_NAMESPACE::hash_compare 19 | #undef HAVE_UINT16_T 20 | #undef HAVE_U_INT16_T 21 | #define HAVE___UINT16 1 22 | #define HAVE_LONG_LONG 1 23 | #define HAVE_SYS_TYPES_H 1 24 | #undef HAVE_STDINT_H 25 | #undef HAVE_INTTYPES_H 26 | #define HAVE_MEMCPY 1 27 | #define STL_NAMESPACE std 28 | #define _END_GOOGLE_NAMESPACE_ } 29 | #define _START_GOOGLE_NAMESPACE_ namespace google { 30 | 31 | 32 | // --------------------------------------------------------------------- 33 | // Extra stuff not found in config.h.include 34 | 35 | #define WIN32_LEAN_AND_MEAN /* We always want minimal includes */ 36 | #include /* TODO(csilvers): do in every .h file instead? */ 37 | 38 | #endif /* SPARSEHASH_WINDOWS_SPARSECONFIG_H_ */ 39 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/COPYING: -------------------------------------------------------------------------------- 1 | Copyright (c) 2005, Google Inc. 2 | All rights reserved. 3 | 4 | Redistribution and use in source and binary forms, with or without 5 | modification, are permitted provided that the following conditions are 6 | met: 7 | 8 | * Redistributions of source code must retain the above copyright 9 | notice, this list of conditions and the following disclaimer. 10 | * Redistributions in binary form must reproduce the above 11 | copyright notice, this list of conditions and the following disclaimer 12 | in the documentation and/or other materials provided with the 13 | distribution. 14 | * Neither the name of Google Inc. nor the names of its 15 | contributors may be used to endorse or promote products derived from 16 | this software without specific prior written permission. 17 | 18 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 19 | "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 20 | LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 21 | A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 22 | OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 23 | SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 24 | LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 25 | DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 26 | THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 27 | (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 28 | OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 29 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/experimental/example.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include "libchash.h" 5 | 6 | static void TestInsert() { 7 | struct HashTable* ht; 8 | HTItem* bck; 9 | 10 | ht = AllocateHashTable(1, 0); /* value is 1 byte, 0: don't copy keys */ 11 | 12 | HashInsert(ht, PTR_KEY(ht, "January"), 31); /* 0: don't overwrite old val */ 13 | bck = HashInsert(ht, PTR_KEY(ht, "February"), 28); 14 | bck = HashInsert(ht, PTR_KEY(ht, "March"), 31); 15 | 16 | bck = HashFind(ht, PTR_KEY(ht, "February")); 17 | assert(bck); 18 | assert(bck->data == 28); 19 | 20 | FreeHashTable(ht); 21 | } 22 | 23 | static void TestFindOrInsert() { 24 | struct HashTable* ht; 25 | int i; 26 | int iterations = 1000000; 27 | int range = 30; /* random number between 1 and 30 */ 28 | 29 | ht = AllocateHashTable(4, 0); /* value is 4 bytes, 0: don't copy keys */ 30 | 31 | /* We'll test how good rand() is as a random number generator */ 32 | for (i = 0; i < iterations; ++i) { 33 | int key = rand() % range; 34 | HTItem* bck = HashFindOrInsert(ht, key, 0); /* initialize to 0 */ 35 | bck->data++; /* found one more of them */ 36 | } 37 | 38 | for (i = 0; i < range; ++i) { 39 | HTItem* bck = HashFind(ht, i); 40 | if (bck) { 41 | printf("%3d: %d\n", bck->key, bck->data); 42 | } else { 43 | printf("%3d: 0\n", i); 44 | } 45 | } 46 | 47 | FreeHashTable(ht); 48 | } 49 | 50 | int main(int argc, char** argv) { 51 | TestInsert(); 52 | TestFindOrInsert(); 53 | return 0; 54 | } 55 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/cover.eps: -------------------------------------------------------------------------------- 1 | %!PS-Adobe-3.0 EPSF-3.0 2 | %%BoundingBox: 128 126 571 406 3 | 4 | % libavl - library for manipulation of binary trees. 5 | % Copyright (C) 1998, 1999, 2000, 2001, 2002, 2004 Free Software 6 | % Foundation, Inc. 7 | % 8 | % This program is free software; you can redistribute it and/or 9 | % modify it under the terms of the GNU General Public License as 10 | % published by the Free Software Foundation; either version 3 of the 11 | % License, or (at your option) any later version. 12 | % 13 | % This program is distributed in the hope that it will be useful, but 14 | % WITHOUT ANY WARRANTY; without even the implied warranty of 15 | % MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. 16 | % See the GNU General Public License for more details. 17 | % 18 | % You should have received a copy of the GNU General Public License 19 | % along with this program; if not, write to: Free Software 20 | % Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 21 | % 02110-1301 USA. 22 | 23 | /BS { 24 | 4 dict begin /t exch def /r exch def /w exch def 25 | /m w 2 div def 26 | gsave 2 t exp 1.5 mul rotate 27 | t .5 sub t 1 add div setgray 28 | 0 0 r 0 360 arc fill 29 | t 6 lt { 30 | r 5 div setlinewidth 31 | newpath 0 0 moveto m neg r 9 mul neg lineto stroke 32 | newpath 0 0 moveto m r 3 mul neg lineto stroke 33 | gsave m neg r 9 mul neg translate m r 1.3 div t 1 add BS grestore 34 | gsave m r 3 mul neg translate m r 1.3 div t .75 add BS grestore 35 | } if 36 | end 37 | grestore 38 | } def 39 | 306 396 translate 40 | 216 9 0 BS 41 | showpage 42 | %%EOF 43 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/COPYING: -------------------------------------------------------------------------------- 1 | Copyright (c) 2005, Google Inc. 2 | All rights reserved. 3 | 4 | Redistribution and use in source and binary forms, with or without 5 | modification, are permitted provided that the following conditions are 6 | met: 7 | 8 | * Redistributions of source code must retain the above copyright 9 | notice, this list of conditions and the following disclaimer. 10 | * Redistributions in binary form must reproduce the above 11 | copyright notice, this list of conditions and the following disclaimer 12 | in the documentation and/or other materials provided with the 13 | distribution. 14 | * Neither the name of Google Inc. nor the names of its 15 | contributors may be used to endorse or promote products derived from 16 | this software without specific prior written permission. 17 | 18 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 19 | "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 20 | LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 21 | A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 22 | OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 23 | SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 24 | LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 25 | DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 26 | THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 27 | (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 28 | OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 29 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/experimental/example.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include "libchash.h" 6 | 7 | static void TestInsert() { 8 | struct HashTable* ht; 9 | HTItem* bck; 10 | 11 | ht = AllocateHashTable(1, 0); /* value is 1 byte, 0: don't copy keys */ 12 | 13 | HashInsert(ht, PTR_KEY(ht, "January"), 31); /* 0: don't overwrite old val */ 14 | bck = HashInsert(ht, PTR_KEY(ht, "February"), 28); 15 | bck = HashInsert(ht, PTR_KEY(ht, "March"), 31); 16 | 17 | bck = HashFind(ht, PTR_KEY(ht, "February")); 18 | assert(bck); 19 | assert(bck->data == 28); 20 | 21 | FreeHashTable(ht); 22 | } 23 | 24 | static void TestFindOrInsert() { 25 | struct HashTable* ht; 26 | int i; 27 | int iterations = 1000000; 28 | int range = 30; /* random number between 1 and 30 */ 29 | 30 | ht = AllocateHashTable(4, 0); /* value is 4 bytes, 0: don't copy keys */ 31 | 32 | /* We'll test how good rand() is as a random number generator */ 33 | for (i = 0; i < iterations; ++i) { 34 | int key = rand() % range; 35 | HTItem* bck = HashFindOrInsert(ht, key, 0); /* initialize to 0 */ 36 | bck->data++; /* found one more of them */ 37 | } 38 | 39 | for (i = 0; i < range; ++i) { 40 | HTItem* bck = HashFind(ht, i); 41 | if (bck) { 42 | printf("%3d: %d\n", bck->key, bck->data); 43 | } else { 44 | printf("%3d: 0\n", i); 45 | } 46 | } 47 | 48 | FreeHashTable(ht); 49 | } 50 | 51 | int main(int argc, char** argv) { 52 | TestInsert(); 53 | TestFindOrInsert(); 54 | return 0; 55 | } 56 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/m4/stl_hash_fun.m4: -------------------------------------------------------------------------------- 1 | # We just try to figure out where hash<> is defined. It's in some file 2 | # that ends in hash_fun.h... 3 | # 4 | # Ideally we'd use AC_CACHE_CHECK, but that only lets us store one value 5 | # at a time, and we need to store two (filename and namespace). 6 | # prints messages itself, so we have to do the message-printing ourselves 7 | # via AC_MSG_CHECKING + AC_MSG_RESULT. (TODO(csilvers): can we cache?) 8 | # 9 | # tr1/functional_hash.h: new gcc's with tr1 support 10 | # stl_hash_fun.h: old gcc's (gc2.95?) 11 | # ext/hash_fun.h: newer gcc's (gcc4) 12 | # stl/_hash_fun.h: STLport 13 | 14 | AC_DEFUN([AC_CXX_STL_HASH_FUN], 15 | [AC_REQUIRE([AC_CXX_STL_HASH]) 16 | AC_MSG_CHECKING(how to include hash_fun directly) 17 | AC_LANG_SAVE 18 | AC_LANG_CPLUSPLUS 19 | ac_cv_cxx_stl_hash_fun="" 20 | for location in functional tr1/functional \ 21 | ext/hash_fun.h ext/stl_hash_fun.h \ 22 | hash_fun.h stl_hash_fun.h \ 23 | stl/_hash_fun.h; do 24 | if test -z "$ac_cv_cxx_stl_hash_fun"; then 25 | AC_TRY_COMPILE([#include <$location>], 26 | [int x = ${ac_cv_cxx_hash_namespace}::hash()(5)], 27 | [ac_cv_cxx_stl_hash_fun="<$location>";]) 28 | fi 29 | done 30 | AC_LANG_RESTORE 31 | AC_DEFINE_UNQUOTED(HASH_FUN_H,$ac_cv_cxx_stl_hash_fun, 32 | [the location of the header defining hash functions]) 33 | AC_DEFINE_UNQUOTED(HASH_NAMESPACE,$ac_cv_cxx_hash_namespace, 34 | [the namespace of the hash<> function]) 35 | AC_MSG_RESULT([$ac_cv_cxx_stl_hash_fun]) 36 | ]) 37 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/experimental/.svn/text-base/example.c.svn-base: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include "libchash.h" 6 | 7 | static void TestInsert() { 8 | struct HashTable* ht; 9 | HTItem* bck; 10 | 11 | ht = AllocateHashTable(1, 0); /* value is 1 byte, 0: don't copy keys */ 12 | 13 | HashInsert(ht, PTR_KEY(ht, "January"), 31); /* 0: don't overwrite old val */ 14 | bck = HashInsert(ht, PTR_KEY(ht, "February"), 28); 15 | bck = HashInsert(ht, PTR_KEY(ht, "March"), 31); 16 | 17 | bck = HashFind(ht, PTR_KEY(ht, "February")); 18 | assert(bck); 19 | assert(bck->data == 28); 20 | 21 | FreeHashTable(ht); 22 | } 23 | 24 | static void TestFindOrInsert() { 25 | struct HashTable* ht; 26 | int i; 27 | int iterations = 1000000; 28 | int range = 30; /* random number between 1 and 30 */ 29 | 30 | ht = AllocateHashTable(4, 0); /* value is 4 bytes, 0: don't copy keys */ 31 | 32 | /* We'll test how good rand() is as a random number generator */ 33 | for (i = 0; i < iterations; ++i) { 34 | int key = rand() % range; 35 | HTItem* bck = HashFindOrInsert(ht, key, 0); /* initialize to 0 */ 36 | bck->data++; /* found one more of them */ 37 | } 38 | 39 | for (i = 0; i < range; ++i) { 40 | HTItem* bck = HashFind(ht, i); 41 | if (bck) { 42 | printf("%3d: %d\n", bck->key, bck->data); 43 | } else { 44 | printf("%3d: 0\n", i); 45 | } 46 | } 47 | 48 | FreeHashTable(ht); 49 | } 50 | 51 | int main(int argc, char** argv) { 52 | TestInsert(); 53 | TestFindOrInsert(); 54 | return 0; 55 | } 56 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/m4/stl_hash_fun.m4: -------------------------------------------------------------------------------- 1 | # We just try to figure out where hash<> is defined. It's in some file 2 | # that ends in hash_fun.h... 3 | # 4 | # Ideally we'd use AC_CACHE_CHECK, but that only lets us store one value 5 | # at a time, and we need to store two (filename and namespace). 6 | # prints messages itself, so we have to do the message-printing ourselves 7 | # via AC_MSG_CHECKING + AC_MSG_RESULT. (TODO(csilvers): can we cache?) 8 | # 9 | # stl_hash_fun.h: old gcc's (gc2.95?) 10 | # ext/hash_fun.h: newer gcc's (gcc4) 11 | # stl/_hash_fun.h: STLport 12 | 13 | AC_DEFUN([AC_CXX_STL_HASH_FUN], 14 | [AC_REQUIRE([AC_CXX_NAMESPACES]) 15 | AC_MSG_CHECKING(how to include hash_fun directly) 16 | AC_LANG_SAVE 17 | AC_LANG_CPLUSPLUS 18 | ac_cv_cxx_stl_hash_fun="" 19 | for location in ext/hash_fun.h ext/stl_hash_fun.h \ 20 | hash_fun.h stl_hash_fun.h \ 21 | stl/_hash_fun.h; do 22 | for namespace in __gnu_cxx "" std stdext; do 23 | if test -z "$ac_cv_cxx_stl_hash_fun"; then 24 | AC_TRY_COMPILE([#include <$location>], 25 | [int x = ${namespace}::hash()(5)], 26 | [ac_cv_cxx_stl_hash_fun="<$location>"; 27 | ac_cv_cxx_hash_namespace="$namespace";]) 28 | fi 29 | done 30 | done 31 | AC_LANG_RESTORE 32 | AC_DEFINE_UNQUOTED(HASH_FUN_H,$ac_cv_cxx_stl_hash_fun, 33 | [the location of /]) 34 | AC_DEFINE_UNQUOTED(HASH_NAMESPACE,$ac_cv_cxx_hash_namespace, 35 | [the namespace of hash_map/hash_set]) 36 | AC_MSG_RESULT([$ac_cv_cxx_stl_hash_fun]) 37 | ]) 38 | -------------------------------------------------------------------------------- /data_structure/avl/sufficient_avl/test.h: -------------------------------------------------------------------------------- 1 | /* Produced by texiweb from libavl.w. */ 2 | 3 | /* libavl - library for manipulation of binary trees. 4 | Copyright (C) 1998, 1999, 2000, 2001, 2002, 2004 Free Software 5 | Foundation, Inc. 6 | 7 | This program is free software; you can redistribute it and/or modify 8 | it under the terms of the GNU General Public License as published by 9 | the Free Software Foundation; either version 3 of the License, or 10 | (at your option) any later version. 11 | 12 | This program is distributed in the hope that it will be useful, 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | GNU General Public License for more details. 16 | 17 | You should have received a copy of the GNU General Public License along 18 | with this program; if not, write to the Free Software Foundation, Inc., 19 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 20 | */ 21 | 22 | #ifndef TEST_H 23 | #define TEST_H 1 24 | 25 | #ifndef LIBAVL_ALLOCATOR 26 | #define LIBAVL_ALLOCATOR 27 | /* Memory allocator. */ 28 | struct libavl_allocator 29 | { 30 | void *(*libavl_malloc) (struct libavl_allocator *, size_t libavl_size); 31 | void (*libavl_free) (struct libavl_allocator *, void *libavl_block); 32 | }; 33 | #endif 34 | 35 | int test_correctness (struct libavl_allocator *allocator, 36 | int insert[], int delete[], int n, int verbosity); 37 | int test_overflow (struct libavl_allocator *, int order[], int n, 38 | int verbosity); 39 | int compare_ints (const void *pa, const void *pb, void *param); 40 | 41 | #endif /* test.h */ 42 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/google/sparsehash/sparseconfig.h: -------------------------------------------------------------------------------- 1 | /* 2 | * NOTE: This file is for internal use only. 3 | * Do not use these #defines in your own program! 4 | */ 5 | 6 | /* Namespace for Google classes */ 7 | #define GOOGLE_NAMESPACE ::google 8 | 9 | /* the location of the header defining hash functions */ 10 | #define HASH_FUN_H 11 | 12 | /* the namespace of the hash<> function */ 13 | #define HASH_NAMESPACE stdext 14 | 15 | /* Define to 1 if you have the header file. */ 16 | #undef HAVE_INTTYPES_H 17 | 18 | /* Define to 1 if the system has the type `long long'. */ 19 | #define HAVE_LONG_LONG 1 20 | 21 | /* Define to 1 if you have the `memcpy' function. */ 22 | #define HAVE_MEMCPY 1 23 | 24 | /* Define to 1 if you have the header file. */ 25 | #undef HAVE_STDINT_H 26 | 27 | /* Define to 1 if you have the header file. */ 28 | #define HAVE_SYS_TYPES_H 1 29 | 30 | /* Define to 1 if the system has the type `uint16_t'. */ 31 | #undef HAVE_UINT16_T 32 | 33 | /* Define to 1 if the system has the type `u_int16_t'. */ 34 | #undef HAVE_U_INT16_T 35 | 36 | /* Define to 1 if the system has the type `__uint16'. */ 37 | #define HAVE___UINT16 1 38 | 39 | /* The system-provided hash function including the namespace. */ 40 | #define SPARSEHASH_HASH HASH_NAMESPACE::hash_compare 41 | 42 | /* The system-provided hash function, in namespace HASH_NAMESPACE. */ 43 | #define SPARSEHASH_HASH_NO_NAMESPACE hash_compare 44 | 45 | /* Stops putting the code inside the Google namespace */ 46 | #define _END_GOOGLE_NAMESPACE_ } 47 | 48 | /* Puts following code inside the Google namespace */ 49 | #define _START_GOOGLE_NAMESPACE_ namespace google { 50 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/sparsehash/internal/sparseconfig.h: -------------------------------------------------------------------------------- 1 | /* 2 | * NOTE: This file is for internal use only. 3 | * Do not use these #defines in your own program! 4 | */ 5 | 6 | /* Namespace for Google classes */ 7 | #define GOOGLE_NAMESPACE ::google 8 | 9 | /* the location of the header defining hash functions */ 10 | #define HASH_FUN_H 11 | 12 | /* the namespace of the hash<> function */ 13 | #define HASH_NAMESPACE stdext 14 | 15 | /* Define to 1 if you have the header file. */ 16 | #undef HAVE_INTTYPES_H 17 | 18 | /* Define to 1 if the system has the type `long long'. */ 19 | #define HAVE_LONG_LONG 1 20 | 21 | /* Define to 1 if you have the `memcpy' function. */ 22 | #define HAVE_MEMCPY 1 23 | 24 | /* Define to 1 if you have the header file. */ 25 | #undef HAVE_STDINT_H 26 | 27 | /* Define to 1 if you have the header file. */ 28 | #define HAVE_SYS_TYPES_H 1 29 | 30 | /* Define to 1 if the system has the type `uint16_t'. */ 31 | #undef HAVE_UINT16_T 32 | 33 | /* Define to 1 if the system has the type `u_int16_t'. */ 34 | #undef HAVE_U_INT16_T 35 | 36 | /* Define to 1 if the system has the type `__uint16'. */ 37 | #define HAVE___UINT16 1 38 | 39 | /* The system-provided hash function including the namespace. */ 40 | #define SPARSEHASH_HASH HASH_NAMESPACE::hash_compare 41 | 42 | /* The system-provided hash function, in namespace HASH_NAMESPACE. */ 43 | #define SPARSEHASH_HASH_NO_NAMESPACE hash_compare 44 | 45 | /* Stops putting the code inside the Google namespace */ 46 | #define _END_GOOGLE_NAMESPACE_ } 47 | 48 | /* Puts following code inside the Google namespace */ 49 | #define _START_GOOGLE_NAMESPACE_ namespace google { 50 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-1.3/packages/rpm/rpm.spec: -------------------------------------------------------------------------------- 1 | %define RELEASE 1 2 | %define rel %{?CUSTOM_RELEASE} %{!?CUSTOM_RELEASE:%RELEASE} 3 | %define prefix /usr 4 | 5 | Name: %NAME 6 | Summary: hash_map and hash_set classes with minimal space overhead 7 | Version: %VERSION 8 | Release: %rel 9 | Group: Development/Libraries 10 | URL: http://code.google.com/p/google-sparsehash 11 | License: BSD 12 | Vendor: Google 13 | Packager: Google 14 | Source: http://%{NAME}.googlecode.com/files/%{NAME}-%{VERSION}.tar.gz 15 | Distribution: Redhat 7 and above. 16 | Buildroot: %{_tmppath}/%{name}-root 17 | Prefix: %prefix 18 | Buildarch: noarch 19 | 20 | %description 21 | The %name package contains several hash-map implementations, similar 22 | in API to SGI's hash_map class, but with different performance 23 | characteristics. sparse_hash_map uses very little space overhead: 1-2 24 | bits per entry. dense_hash_map is typically faster than the default 25 | SGI STL implementation. This package also includes hash-set analogues 26 | of these classes. 27 | 28 | %changelog 29 | * Fri Jan 14 2005 30 | - First draft 31 | 32 | %prep 33 | %setup 34 | 35 | %build 36 | ./configure 37 | make prefix=%prefix 38 | 39 | %install 40 | rm -rf $RPM_BUILD_ROOT 41 | make prefix=$RPM_BUILD_ROOT%{prefix} install 42 | 43 | %clean 44 | rm -rf $RPM_BUILD_ROOT 45 | 46 | %files 47 | %defattr(-,root,root) 48 | 49 | %doc AUTHORS COPYING ChangeLog INSTALL NEWS README TODO doc/dense_hash_map.html doc/dense_hash_set.html doc/sparse_hash_map.html doc/sparse_hash_set.html doc/sparsetable.html doc/implementation.html doc/performance.html doc/index.html doc/designstyle.css 50 | 51 | 52 | %{prefix}/include/google 53 | -------------------------------------------------------------------------------- /data_structure/string/str/str.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int string_comp(char* s1, char* s2) 4 | { 5 | char* p1 = s1; 6 | char* p2 = s2; 7 | while(*p1!='\0' && *p2!='\0') 8 | { 9 | if(*p1>*p2) 10 | { 11 | return 1; 12 | }else if(*p1<*p2) 13 | { 14 | return -1; 15 | }else 16 | { 17 | p1++; 18 | p2++; 19 | } 20 | } 21 | // Length 22 | if(*p1=='\0' && *p2!='\0') 23 | { 24 | return -1; 25 | }else if(*p1!='\0' && *p2=='\0') 26 | { 27 | return 1; 28 | } 29 | else 30 | { 31 | return 0; 32 | } 33 | } 34 | 35 | void string_copy(char* src, char* dst) 36 | { 37 | while(*src!='\0') 38 | { 39 | *dst++ = *src++; 40 | } 41 | *dst = '\0'; 42 | } 43 | 44 | // Append s2 to s1 45 | void string_concat(char* s1, char* s2) 46 | { 47 | // Go to end of s1 48 | while(*s1!='\0') 49 | { 50 | s1++; 51 | } 52 | // Copy s2 53 | while(*s2!='\0') 54 | { 55 | *s1++ = *s2++; 56 | } 57 | // End 58 | *s1 = '\0'; 59 | } 60 | 61 | int string_length(char* s) 62 | { 63 | int len = 0; 64 | 65 | while(*s!='\0') 66 | { 67 | s++; 68 | len++; 69 | } 70 | 71 | return len; 72 | } 73 | 74 | int main() 75 | { 76 | char* s1 = "Liheyuanxx"; 77 | char* s2 = "liheyuan"; 78 | char buf[1024]; 79 | printf("string_comp:%d\n", string_comp(s1, s2)); 80 | string_copy(s1, buf); 81 | printf("copy result:%s\n", buf); 82 | string_concat(buf, s2); 83 | printf("concat result:%s\n", buf); 84 | printf("length:%d\n", string_length(buf)); 85 | return 0; 86 | } 87 | -------------------------------------------------------------------------------- /data_structure/hash_table/sparsehash-2.0.2/src/windows/google/sparsehash/.svn/text-base/sparseconfig.h.svn-base: -------------------------------------------------------------------------------- 1 | /* 2 | * NOTE: This file is for internal use only. 3 | * Do not use these #defines in your own program! 4 | */ 5 | 6 | /* Namespace for Google classes */ 7 | #define GOOGLE_NAMESPACE ::google 8 | 9 | /* the location of the header defining hash functions */ 10 | #define HASH_FUN_H 11 | 12 | /* the namespace of the hash<> function */ 13 | #define HASH_NAMESPACE stdext 14 | 15 | /* Define to 1 if you have the header file. */ 16 | #undef HAVE_INTTYPES_H 17 | 18 | /* Define to 1 if the system has the type `long long'. */ 19 | #define HAVE_LONG_LONG 1 20 | 21 | /* Define to 1 if you have the `memcpy' function. */ 22 | #define HAVE_MEMCPY 1 23 | 24 | /* Define to 1 if you have the header file. */ 25 | #undef HAVE_STDINT_H 26 | 27 | /* Define to 1 if you have the header file. */ 28 | #define HAVE_SYS_TYPES_H 1 29 | 30 | /* Define to 1 if the system has the type `uint16_t'. */ 31 | #undef HAVE_UINT16_T 32 | 33 | /* Define to 1 if the system has the type `u_int16_t'. */ 34 | #undef HAVE_U_INT16_T 35 | 36 | /* Define to 1 if the system has the type `__uint16'. */ 37 | #define HAVE___UINT16 1 38 | 39 | /* The system-provided hash function including the namespace. */ 40 | #define SPARSEHASH_HASH HASH_NAMESPACE::hash_compare 41 | 42 | /* The system-provided hash function, in namespace HASH_NAMESPACE. */ 43 | #define SPARSEHASH_HASH_NO_NAMESPACE hash_compare 44 | 45 | /* Stops putting the code inside the Google namespace */ 46 | #define _END_GOOGLE_NAMESPACE_ } 47 | 48 | /* Puts following code inside the Google namespace */ 49 | #define _START_GOOGLE_NAMESPACE_ namespace google { 50 | --------------------------------------------------------------------------------