Source
TestErrPrintf("%d: TST node values don't match!, found->eqkid=%s, sort_uniq_words[%u]=%s\n",__LINE__,(char *)found->eqkid,(unsigned)u,sort_uniq_words[u]);
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* *
* This file is part of HDF5. The full HDF5 copyright notice, including *
* terms governing use, modification, and redistribution, is contained in *
* the COPYING file, which can be found at the root of the source code *
* distribution tree, or in https://support.hdfgroup.org/ftp/HDF5/releases. *
* If you do not have access to either file, you may request a copy from *
* help@hdfgroup.org. *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/*
FILE
tst.c
Test HDF Ternary Search Tree (tst) routines.
REMARKS
DESIGN
BUGS/LIMITATIONS
EXPORTED ROUTINES
AUTHOR
Quincey Koziol
MODIFICATION HISTORY
12/9/02 - Started coding
*/
/* Test words to insert into s TST */
static const char *words[]={
"We", "hold", "these", "truths", "to", "be", "self-evident,", "that",
"all", "men", "are", "created", "equal,", "that", "they", "are", "endowed",
"by", "their", "Creator", "with", "certain", "unalienable", "Rights,",
"that", "among", "these", "are", "Life,", "Liberty", "and", "the",
"pursuit", "of", "Happiness."
};
/* Number of words in test words set */
size_t num_words;
/* Number of unique words in test word set */
size_t num_uniq_words;
/* Unique words in test word set */
char **uniq_words;