| 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394 |
- /**
- * @file CAvl_footer.h
- * @author Ambroz Bizjak <ambrop7@gmail.com>
- *
- * @section LICENSE
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * 3. Neither the name of the author nor the
- * names of its contributors may be used to endorse or promote products
- * derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
- * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
- * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
- #undef CAVL_PARAM_USE_COUNTS
- #undef CAVL_PARAM_NAME
- #undef CAVL_PARAM_ENTRY
- #undef CAVL_PARAM_LINK
- #undef CAVL_PARAM_KEY
- #undef CAVL_PARAM_ARG
- #undef CAVL_PARAM_COUNT
- #undef CAVL_PARAM_COUNT_MAX
- #undef CAVL_PARAM_NULL
- #undef CAVL_PARAM_DEREF
- #undef CAVL_PARAM_COMPARE_NODES
- #undef CAVL_PARAM_COMPARE_KEY_NODE
- #undef CAVL_PARAM_NODE_LINK
- #undef CAVL_PARAM_NODE_BALANCE
- #undef CAVL_PARAM_NODE_PARENT
- #undef CAVL_PARAM_NODE_COUNT
- #undef CAVL_PARAM_KEYS_ARE_INDICES
- #undef CAvl
- #undef CAvlEntry
- #undef CAvlLink
- #undef CAvlNode
- #undef CAvlArg
- #undef CAvlKey
- #undef CAvlCount
- #undef CAvlNullLink
- #undef CAvl_Init
- #undef CAvl_Deref
- #undef CAvl_Insert
- #undef CAvl_Remove
- #undef CAvl_Lookup
- #undef CAvl_LookupExact
- #undef CAvl_GetFirst
- #undef CAvl_GetLast
- #undef CAvl_GetNext
- #undef CAvl_GetPrev
- #undef CAvl_IsEmpty
- #undef CAvl_Verify
- #undef CAvl_Count
- #undef CAvl_IndexOf
- #undef CAvl_GetAt
- #undef CAvl_InsertAt
- #undef CAvl_link
- #undef CAvl_balance
- #undef CAvl_parent
- #undef CAvl_count
- #undef CAvl_nullnode
- #undef CAvl_compare_nodes
- #undef CAvl_compare_key_node
- #undef CAvl_check_parent
- #undef CAvl_verify_recurser
- #undef CAvl_assert_tree
- #undef CAvl_update_count_from_children
- #undef CAvl_rotate
- #undef CAvl_subtree_min
- #undef CAvl_subtree_max
- #undef CAvl_replace_subtree_fix_counts
- #undef CAvl_swap_nodes
- #undef CAvl_rebalance
- #undef CAvl_child_count
- #undef CAvl_MAX
- #undef CAvl_OPTNEG
|
