📄 index.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>C Algorithms: C Algorithms Library</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.4 --><div class="qindex"><a class="qindexHL" href="index.html">Main Page</a> | <a class="qindex" href="annotated.html">Data Structures</a> | <a class="qindex" href="files.html">File List</a> | <a class="qindex" href="functions.html">Data Fields</a> | <a class="qindex" href="globals.html">Globals</a></div><h1>C Algorithms Library </h1><p><h2><a class="anchor" name="Introduction">Introduction</a></h2>The C programming language includes a very limited standard library in comparison to other modern programming languages. This is a collection of common Computer Science data structures and algorithms which may be used in C projects.<p>The code is licensed under the Modified BSD license, and as a result may be reused in any project, whether Proprietary or Open Source.<h2><a class="anchor" name="Data_structures">Data structures</a></h2><h3><a class="anchor" name="Collections">Collections</a></h3><ul><li><a class="el" href="arraylist_8h.html">ArrayList </a>: Automatically resizing array. </li><li><a class="el" href="list_8h.html">Doubly linked list </a>: A set of values stored in a list with links that point in both directions. </li><li><a class="el" href="slist_8h.html">Singly linked list </a>: A set of values stored in a list with links that point in one direction. </li><li><a class="el" href="queue_8h.html">Queue </a>: Double ended queue which can be used as a FIFO or a stack. </li><li><a class="el" href="set_8h.html">Set </a>: Unordered set of values.</li></ul><h3><a class="anchor" name="Mappings">Mappings</a></h3><ul><li><a class="el" href="hashtable_8h.html">Hash table </a>: Collection of values which can be addressed using a key. </li><li><a class="el" href="trie_8h.html">Trie </a>: Fast mapping using strings as keys.</li></ul><h3><a class="anchor" name="Binary_search_trees">Binary search trees</a></h3><ul><li><a class="el" href="avltree_8h.html">AVL tree </a>: Balanced binary search tree with O(log n) worst case performance.</li></ul><h2><a class="anchor" name="Utility_functions">Utility functions</a></h2>All of the above data structures operate on void pointers. It is sometimes necessary to compare values (when sorting a list, for example) or generate a hash key (in a hash table or set). This is done by providing a pointer to a function which provides this functionality. The following functions provide this functionality for some common data types.<p><ul><li>Integer <a class="el" href="compare-int_8h.html">comparison </a> and <a class="el" href="hash-int_8h.html">hash </a> functions. </li><li>String <a class="el" href="compare-string_8h.html">comparison </a> and <a class="el" href="hash-string_8h.html">hash </a> functions. </li><li>Generic (void) pointer <a class="el" href="compare-pointer_8h.html">comparison </a> and <a class="el" href="hash-pointer_8h.html">hash </a> functions. </li></ul><hr size="1"><address style="align: right;"><small>Generated on Mon Jan 30 18:56:23 2006 for C Algorithms by <a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.4 </small></address></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -