1. Elena Pourmal
  2. hdf5_ep

Source

Raw file
Source viewDiff to previous
            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]);
 
1
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
2
 * Copyright by The HDF Group.                                               *
3
 * Copyright by the Board of Trustees of the University of Illinois.         *
4
 * All rights reserved.                                                      *
5
 *                                                                           *
6
 * This file is part of HDF5.  The full HDF5 copyright notice, including     *
7
 * terms governing use, modification, and redistribution, is contained in    *
8
 * the COPYING file, which can be found at the root of the source code       *
9
 * distribution tree, or in https://support.hdfgroup.org/ftp/HDF5/releases.  *
10
 * If you do not have access to either file, you may request a copy from     *
11
 * help@hdfgroup.org.                                                        *
12
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
13
​
14
/*
15
   FILE
16
       tst.c
17
   Test HDF Ternary Search Tree (tst) routines.
18
​
19
   REMARKS
20
​
21
   DESIGN
22
​
23
   BUGS/LIMITATIONS
24
​
25
   EXPORTED ROUTINES
26
​
27
   AUTHOR
28
       Quincey Koziol
29
​
30
   MODIFICATION HISTORY
31
       12/9/02 - Started coding
32
 */
33
​
34
#include <time.h>
35
#include <stdlib.h>
36
​
37
#include "testhdf5.h"
38
#include "H5STprivate.h"
39
​
40
/* Test words to insert into s TST */
41
static const char *words[]={
42
    "We", "hold", "these", "truths", "to", "be", "self-evident,", "that",
43
    "all", "men", "are", "created", "equal,", "that", "they", "are", "endowed",
44
    "by", "their", "Creator", "with", "certain", "unalienable", "Rights,",
45
    "that", "among", "these", "are", "Life,", "Liberty", "and", "the",
46
    "pursuit", "of", "Happiness."
47
};
48
/* Number of words in test words set */
49
size_t num_words;
50
​
51
/* Number of unique words in test word set */