/** * @file SAvl_footer.h * @author Ambroz Bizjak * * @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 SAVL_PARAM_NAME #undef SAVL_PARAM_FEATURE_COUNTS #undef SAVL_PARAM_FEATURE_NOKEYS #undef SAVL_PARAM_TYPE_ENTRY #undef SAVL_PARAM_TYPE_KEY #undef SAVL_PARAM_TYPE_ARG #undef SAVL_PARAM_TYPE_COUNT #undef SAVL_PARAM_VALUE_COUNT_MAX #undef SAVL_PARAM_FUN_COMPARE_ENTRIES #undef SAVL_PARAM_FUN_COMPARE_KEY_ENTRY #undef SAVL_PARAM_MEMBER_NODE #undef SAvl #undef SAvlEntry #undef SAvlArg #undef SAvlKey #undef SAvlCount #undef SAvlNode #undef SAvl_Init #undef SAvl_Insert #undef SAvl_Remove #undef SAvl_Lookup #undef SAvl_LookupExact #undef SAvl_GetFirstGreater #undef SAvl_GetLastLesser #undef SAvl_GetFirstGreaterEqual #undef SAvl_GetLastLesserEqual #undef SAvl_GetFirst #undef SAvl_GetLast #undef SAvl_GetNext #undef SAvl_GetPrev #undef SAvl_IsEmpty #undef SAvl_Verify #undef SAvl_Count #undef SAvl_IndexOf #undef SAvl_GetAt #undef SAvl__Tree #undef SAvl__TreeRef #undef SAvl__TreeLink #undef SAvl__TreeDeref #undef SAvl__Tree_Init #undef SAvl__Tree_Insert #undef SAvl__Tree_Remove #undef SAvl__Tree_Lookup #undef SAvl__Tree_LookupExact #undef SAvl__Tree_GetFirstGreater #undef SAvl__Tree_GetLastLesser #undef SAvl__Tree_GetFirstGreaterEqual #undef SAvl__Tree_GetLastLesserEqual #undef SAvl__Tree_GetFirst #undef SAvl__Tree_GetLast #undef SAvl__Tree_GetNext #undef SAvl__Tree_GetPrev #undef SAvl__Tree_IsEmpty #undef SAvl__Tree_Verify #undef SAvl__Tree_Count #undef SAvl__Tree_IndexOf #undef SAvl__Tree_GetAt