*.c: General spring-clean of the coding style.

[anag] / anagram.c

/* -*-c-*-
 *
 * Matches anagrams and subgrams
 *
 * (c) 2001 Mark Wooding
 */

/*----- Licensing notice --------------------------------------------------*
 *
 * This file is part of Anag: a simple wordgame helper.
 *
 * Anag is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * Anag is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Anag; if not, write to the Free Software Foundation,
 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */

/*----- Header files ------------------------------------------------------*/

#include "anag.h"

/*----- Data structures ---------------------------------------------------*/

typedef unsigned countmap[UCHAR_MAX + 1];

typedef struct node_gram {
  node n;
  size_t sz;
  countmap count;
} node_gram;

/*----- Main code ---------------------------------------------------------*/

/* --- @compile@ --- *
 *
 * Arguments:	@node_gram *n@ = pointer to node to fill in
 *		@const char *p@ = pointer to string to compile from
 *
 * Returns:	---
 *
 * Use:		Fills in an anagram node with letter frequencies.
 */

static void compile(const char *p, countmap count)
{
  memset(count, 0, sizeof(countmap));
  while (*p) count[(unsigned char)*p++]++;
}

/* --- Node matcher --- */

static int n_gram(node *nn, const char *p, size_t sz)
{
  /* A string X is a subgram of Y unless, for some character CH, X has more
   * characters of value CH than Y.
   *
   * Special feature: count `.' in the pattern as meaning `don't care'.
   */

  node_gram *n = (node_gram *)nn;
  countmap count;
  const char *q;
  unsigned i;

  if (n->sz && sz != n->sz) return (0);
  memcpy(count, n->count, sizeof(count));
  q = p + sz;
  while (p < q) {
    i = (unsigned char)*p++;
    if (count[i]) count[i]--;
    else if (count['.']) count['.']--;
    else return (0);
  }
  return (1);
}

/* --- Node creation --- */

node *anagram(const char *const *av)
{
  node_gram *n = xmalloc(sizeof(*n));
  n->n.func = n_gram;
  compile(av[0], n->count);
  n->sz = strlen(av[0]);
  return (&n->n);
}

node *subgram(const char *const *av)
{
  node_gram *n = xmalloc(sizeof(*n));
  n->n.func = n_gram;
  compile(av[0], n->count);
  n->sz = 0;
  return (&n->n);
}

/*----- That's all, folks -------------------------------------------------*/