?? globals.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: Data Fields</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.4 --><div class="qindex"><a class="qindex" 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="qindexHL" href="globals.html">Globals</a></div><div class="qindex"><a class="qindexHL" href="globals.html">All</a> | <a class="qindex" href="globals_func.html">Functions</a> | <a class="qindex" href="globals_type.html">Typedefs</a></div><div class="qindex"><a class="qindex" href="#index_a">a</a> | <a class="qindex" href="#index_h">h</a> | <a class="qindex" href="#index_i">i</a> | <a class="qindex" href="#index_l">l</a> | <a class="qindex" href="#index_p">p</a> | <a class="qindex" href="#index_q">q</a> | <a class="qindex" href="#index_s">s</a> | <a class="qindex" href="#index_t">t</a></div><p>Here is a list of all documented functions, variables, defines, enums, and typedefs with links to the documentation:<p><h3><a class="anchor" name="index_a">- a -</a></h3><ul><li>ArrayList: <a class="el" href="arraylist_8h.html#a0">arraylist.h</a><li>arraylist_append(): <a class="el" href="arraylist_8h.html#a5">arraylist.h</a><li>arraylist_clear(): <a class="el" href="arraylist_8h.html#a11">arraylist.h</a><li>arraylist_free(): <a class="el" href="arraylist_8h.html#a4">arraylist.h</a><li>arraylist_index_of(): <a class="el" href="arraylist_8h.html#a10">arraylist.h</a><li>arraylist_insert(): <a class="el" href="arraylist_8h.html#a9">arraylist.h</a><li>arraylist_new(): <a class="el" href="arraylist_8h.html#a3">arraylist.h</a><li>arraylist_prepend(): <a class="el" href="arraylist_8h.html#a6">arraylist.h</a><li>arraylist_remove(): <a class="el" href="arraylist_8h.html#a7">arraylist.h</a><li>arraylist_remove_range(): <a class="el" href="arraylist_8h.html#a8">arraylist.h</a><li>arraylist_sort(): <a class="el" href="arraylist_8h.html#a12">arraylist.h</a><li>ArrayListCompareFunc: <a class="el" href="arraylist_8h.html#a2">arraylist.h</a><li>ArrayListEqualFunc: <a class="el" href="arraylist_8h.html#a1">arraylist.h</a><li>AVLTree: <a class="el" href="avltree_8h.html#a0">avltree.h</a><li>avltree_free(): <a class="el" href="avltree_8h.html#a4">avltree.h</a><li>avltree_insert(): <a class="el" href="avltree_8h.html#a5">avltree.h</a><li>avltree_lookup(): <a class="el" href="avltree_8h.html#a9">avltree.h</a><li>avltree_lookup_node(): <a class="el" href="avltree_8h.html#a8">avltree.h</a><li>avltree_new(): <a class="el" href="avltree_8h.html#a3">avltree.h</a><li>avltree_node_key(): <a class="el" href="avltree_8h.html#a11">avltree.h</a><li>avltree_node_left_child(): <a class="el" href="avltree_8h.html#a13">avltree.h</a><li>avltree_node_parent(): <a class="el" href="avltree_8h.html#a15">avltree.h</a><li>avltree_node_right_child(): <a class="el" href="avltree_8h.html#a14">avltree.h</a><li>avltree_node_value(): <a class="el" href="avltree_8h.html#a12">avltree.h</a><li>avltree_num_entries(): <a class="el" href="avltree_8h.html#a18">avltree.h</a><li>avltree_remove(): <a class="el" href="avltree_8h.html#a7">avltree.h</a><li>avltree_remove_node(): <a class="el" href="avltree_8h.html#a6">avltree.h</a><li>avltree_root_node(): <a class="el" href="avltree_8h.html#a10">avltree.h</a><li>avltree_subtree_height(): <a class="el" href="avltree_8h.html#a16">avltree.h</a><li>avltree_to_array(): <a class="el" href="avltree_8h.html#a17">avltree.h</a><li>AVLTreeCompareFunc: <a class="el" href="avltree_8h.html#a2">avltree.h</a><li>AVLTreeNode: <a class="el" href="avltree_8h.html#a1">avltree.h</a></ul><h3><a class="anchor" name="index_h">- h -</a></h3><ul><li>hash_table_foreach(): <a class="el" href="hashtable_8h.html#a13">hashtable.h</a><li>hash_table_foreach_remove(): <a class="el" href="hashtable_8h.html#a14">hashtable.h</a><li>hash_table_free(): <a class="el" href="hashtable_8h.html#a7">hashtable.h</a><li>hash_table_insert(): <a class="el" href="hashtable_8h.html#a9">hashtable.h</a><li>hash_table_lookup(): <a class="el" href="hashtable_8h.html#a10">hashtable.h</a><li>hash_table_new(): <a class="el" href="hashtable_8h.html#a6">hashtable.h</a><li>hash_table_num_entries(): <a class="el" href="hashtable_8h.html#a12">hashtable.h</a><li>hash_table_register_free_functions(): <a class="el" href="hashtable_8h.html#a8">hashtable.h</a><li>hash_table_remove(): <a class="el" href="hashtable_8h.html#a11">hashtable.h</a><li>HashTable: <a class="el" href="hashtable_8h.html#a0">hashtable.h</a><li>HashTableEqualFunc: <a class="el" href="hashtable_8h.html#a2">hashtable.h</a><li>HashTableFreeFunc: <a class="el" href="hashtable_8h.html#a3">hashtable.h</a><li>HashTableHashFunc: <a class="el" href="hashtable_8h.html#a1">hashtable.h</a><li>HashTableIterator: <a class="el" href="hashtable_8h.html#a4">hashtable.h</a><li>HashTableRemoveIterator: <a class="el" href="hashtable_8h.html#a5">hashtable.h</a></ul><h3><a class="anchor" name="index_i">- i -</a></h3><ul><li>int_compare(): <a class="el" href="compare-int_8h.html#a1">compare-int.h</a><li>int_equal(): <a class="el" href="compare-int_8h.html#a0">compare-int.h</a><li>int_hash(): <a class="el" href="hash-int_8h.html#a0">hash-int.h</a></ul><h3><a class="anchor" name="index_l">- l -</a></h3><ul><li>list_append(): <a class="el" href="list_8h.html#a6">list.h</a><li>list_data(): <a class="el" href="list_8h.html#a9">list.h</a><li>list_find_data(): <a class="el" href="list_8h.html#a18">list.h</a><li>list_foreach(): <a class="el" href="list_8h.html#a14">list.h</a><li>list_free(): <a class="el" href="list_8h.html#a4">list.h</a><li>list_length(): <a class="el" href="list_8h.html#a12">list.h</a><li>list_next(): <a class="el" href="list_8h.html#a8">list.h</a><li>list_nth_data(): <a class="el" href="list_8h.html#a11">list.h</a><li>list_nth_entry(): <a class="el" href="list_8h.html#a10">list.h</a><li>list_prepend(): <a class="el" href="list_8h.html#a5">list.h</a><li>list_prev(): <a class="el" href="list_8h.html#a7">list.h</a><li>list_remove_data(): <a class="el" href="list_8h.html#a16">list.h</a><li>list_remove_entry(): <a class="el" href="list_8h.html#a15">list.h</a><li>list_sort(): <a class="el" href="list_8h.html#a17">list.h</a><li>list_to_array(): <a class="el" href="list_8h.html#a13">list.h</a><li>ListCompareFunc: <a class="el" href="list_8h.html#a2">list.h</a><li>ListEntry: <a class="el" href="list_8h.html#a0">list.h</a><li>ListEqualFunc: <a class="el" href="list_8h.html#a3">list.h</a><li>ListIterator: <a class="el" href="list_8h.html#a1">list.h</a></ul><h3><a class="anchor" name="index_p">- p -</a></h3><ul><li>pointer_compare(): <a class="el" href="compare-pointer_8h.html#a1">compare-pointer.h</a><li>pointer_equal(): <a class="el" href="compare-pointer_8h.html#a0">compare-pointer.h</a><li>pointer_hash(): <a class="el" href="hash-pointer_8h.html#a0">hash-pointer.h</a></ul><h3><a class="anchor" name="index_q">- q -</a></h3><ul><li>Queue: <a class="el" href="queue_8h.html#a0">queue.h</a><li>queue_free(): <a class="el" href="queue_8h.html#a2">queue.h</a><li>queue_is_empty(): <a class="el" href="queue_8h.html#a9">queue.h</a><li>queue_new(): <a class="el" href="queue_8h.html#a1">queue.h</a><li>queue_peek_head(): <a class="el" href="queue_8h.html#a5">queue.h</a><li>queue_peek_tail(): <a class="el" href="queue_8h.html#a8">queue.h</a><li>queue_pop_head(): <a class="el" href="queue_8h.html#a4">queue.h</a><li>queue_pop_tail(): <a class="el" href="queue_8h.html#a7">queue.h</a><li>queue_push_head(): <a class="el" href="queue_8h.html#a3">queue.h</a><li>queue_push_tail(): <a class="el" href="queue_8h.html#a6">queue.h</a></ul><h3><a class="anchor" name="index_s">- s -</a></h3><ul><li>Set: <a class="el" href="set_8h.html#a0">set.h</a><li>set_foreach(): <a class="el" href="set_8h.html#a12">set.h</a><li>set_free(): <a class="el" href="set_8h.html#a7">set.h</a><li>set_insert(): <a class="el" href="set_8h.html#a9">set.h</a><li>set_intersection(): <a class="el" href="set_8h.html#a16">set.h</a><li>set_new(): <a class="el" href="set_8h.html#a6">set.h</a><li>set_num_entries(): <a class="el" href="set_8h.html#a13">set.h</a><li>set_query(): <a class="el" href="set_8h.html#a11">set.h</a><li>set_register_free_function(): <a class="el" href="set_8h.html#a8">set.h</a><li>set_remove(): <a class="el" href="set_8h.html#a10">set.h</a><li>set_to_array(): <a class="el" href="set_8h.html#a14">set.h</a><li>set_union(): <a class="el" href="set_8h.html#a15">set.h</a><li>SetCopyFunc: <a class="el" href="set_8h.html#a3">set.h</a><li>SetEqualFunc: <a class="el" href="set_8h.html#a2">set.h</a><li>SetFreeFunc: <a class="el" href="set_8h.html#a5">set.h</a><li>SetHashFunc: <a class="el" href="set_8h.html#a1">set.h</a><li>SetIterator: <a class="el" href="set_8h.html#a4">set.h</a><li>slist_append(): <a class="el" href="slist_8h.html#a6">slist.h</a><li>slist_data(): <a class="el" href="slist_8h.html#a8">slist.h</a><li>slist_find_data(): <a class="el" href="slist_8h.html#a17">slist.h</a><li>slist_foreach(): <a class="el" href="slist_8h.html#a13">slist.h</a><li>slist_free(): <a class="el" href="slist_8h.html#a4">slist.h</a><li>slist_length(): <a class="el" href="slist_8h.html#a11">slist.h</a><li>slist_next(): <a class="el" href="slist_8h.html#a7">slist.h</a><li>slist_nth_data(): <a class="el" href="slist_8h.html#a10">slist.h</a><li>slist_nth_entry(): <a class="el" href="slist_8h.html#a9">slist.h</a><li>slist_prepend(): <a class="el" href="slist_8h.html#a5">slist.h</a><li>slist_remove_data(): <a class="el" href="slist_8h.html#a15">slist.h</a><li>slist_remove_entry(): <a class="el" href="slist_8h.html#a14">slist.h</a><li>slist_sort(): <a class="el" href="slist_8h.html#a16">slist.h</a><li>slist_to_array(): <a class="el" href="slist_8h.html#a12">slist.h</a><li>SListCompareFunc: <a class="el" href="slist_8h.html#a2">slist.h</a><li>SListEntry: <a class="el" href="slist_8h.html#a0">slist.h</a><li>SListEqualFunc: <a class="el" href="slist_8h.html#a3">slist.h</a><li>SListIterator: <a class="el" href="slist_8h.html#a1">slist.h</a><li>string_compare(): <a class="el" href="compare-string_8h.html#a1">compare-string.h</a><li>string_equal(): <a class="el" href="compare-string_8h.html#a0">compare-string.h</a><li>string_hash(): <a class="el" href="hash-string_8h.html#a0">hash-string.h</a><li>string_nocase_compare(): <a class="el" href="compare-string_8h.html#a3">compare-string.h</a><li>string_nocase_equal(): <a class="el" href="compare-string_8h.html#a2">compare-string.h</a><li>string_nocase_hash(): <a class="el" href="hash-string_8h.html#a1">hash-string.h</a></ul><h3><a class="anchor" name="index_t">- t -</a></h3><ul><li>trie_free(): <a class="el" href="trie_8h.html#a2">trie.h</a><li>trie_insert(): <a class="el" href="trie_8h.html#a3">trie.h</a><li>trie_lookup(): <a class="el" href="trie_8h.html#a4">trie.h</a><li>trie_new(): <a class="el" href="trie_8h.html#a1">trie.h</a><li>trie_num_entries(): <a class="el" href="trie_8h.html#a6">trie.h</a><li>trie_remove(): <a class="el" href="trie_8h.html#a5">trie.h</a></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 + -