Back to index

glibc  2.9
Classes | Functions
collate-test.c File Reference
#include <ctype.h>
#include <error.h>
#include <locale.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

Go to the source code of this file.

Classes

struct  lines

Functions

static int xstrcoll (const void *, const void *)
int main (int argc, char *argv[])
static int xstrcoll (void *ptr1, const void *ptr2) const

Class Documentation

struct lines

Definition at line 29 of file collate-test.c.

Class Members
char * key
char * line
char * xfrm

Function Documentation

int main ( int  argc,
char *  argv[] 
)

Definition at line 38 of file collate-test.c.

{
  int result = 0;
  size_t nstrings, nstrings_max;
  struct lines *strings;
  char *line = NULL;
  size_t len = 0;
  size_t n;

  if (argc < 2)
    error (1, 0, "usage: %s <random seed>", argv[0]);

  setlocale (LC_ALL, "");

  nstrings_max = 100;
  nstrings = 0;
  strings = (struct lines *) malloc (nstrings_max * sizeof (struct lines));
  if (strings == NULL)
    {
      perror (argv[0]);
      exit (1);
    }

  while (1)
    {
      int l;
      if (getline (&line, &len, stdin) < 0)
       break;

      if (nstrings == nstrings_max)
       {
         strings = (struct lines *) realloc (strings,
                                         (nstrings_max *= 2)
                                          * sizeof (*strings));
         if (strings == NULL)
           {
             perror (argv[0]);
             exit (1);
           }
       }
      strings[nstrings].line = strdup (line);
      l = strcspn (line, ":(;");
      while (l > 0 && isspace (line[l - 1]))
       --l;
      strings[nstrings].key = strndup (line, l);
      ++nstrings;
    }
  free (line);

  /* First shuffle.  */
  srandom (atoi (argv[1]));
  for (n = 0; n < 10 * nstrings; ++n)
    {
      int r1, r2, r;
      size_t idx1 = random () % nstrings;
      size_t idx2 = random () % nstrings;
      struct lines tmp = strings[idx1];
      strings[idx1] = strings[idx2];
      strings[idx2] = tmp;

      /* While we are at it a first little test.  */
      r1 = strcoll (strings[idx1].key, strings[idx2].key);
      r2 = strcoll (strings[idx2].key, strings[idx1].key);
      r = r1 * r2;

      if (r > 0 || (r == 0 && r1 != 0) || (r == 0 && r2 != 0))
       printf ("`%s' and `%s' collate wrong: %d vs. %d\n",
              strings[idx1].key, strings[idx2].key, r1, r2);
    }

  /* Now sort.  */
  qsort (strings, nstrings, sizeof (struct lines), xstrcoll);

  /* Print the result.  */
  for (n = 0; n < nstrings; ++n)
    {
      fputs (strings[n].line, stdout);
      free (strings[n].line);
      free (strings[n].key);
    }
  free (strings);

  return result;
}

Here is the call graph for this function:

static int xstrcoll ( const void *  ,
const void *   
) [static]

Here is the caller graph for this function:

static int xstrcoll ( void *  ptr1,
const void *  ptr2 
) const [static]

Definition at line 125 of file collate-test.c.

{
  const struct lines *l1 = (const struct lines *) ptr1;
  const struct lines *l2 = (const struct lines *) ptr2;

  return strcoll (l1->key, l2->key);
}

Here is the call graph for this function: