3 * $Id: anagram.c,v 1.1 2001/02/04 17:14:42 mdw Exp $
5 * Matches anagrams and subgrams
7 * (c) 2001 Mark Wooding
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of Anag: a simple wordgame helper.
14 * Anag is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU General Public License as published by
16 * the Free Software Foundation; either version 2 of the License, or
17 * (at your option) any later version.
19 * Anag is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU General Public License for more details.
24 * You should have received a copy of the GNU General Public License
25 * along with Anag; if not, write to the Free Software Foundation,
26 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 /*----- Revision history --------------------------------------------------*
32 * Revision 1.1 2001/02/04 17:14:42 mdw
37 /*----- Header files ------------------------------------------------------*/
41 /*----- Data structures ---------------------------------------------------*/
43 typedef struct node_gram {
46 unsigned f[UCHAR_MAX + 1];
49 /*----- Main code ---------------------------------------------------------*/
51 /* --- @compile@ --- *
53 * Arguments: @node_gram *n@ = pointer to node to fill in
54 * @const char *p@ = pointer to string to compile from
56 * Returns: The length of the string.
58 * Use: Fills in an anagram node with letter frequencies.
61 static size_t compile(node_gram *n, const char *p)
65 memset(n->f, 0, sizeof(n->f));
67 i = (unsigned char)*p++;
74 /* --- Node matcher --- */
76 static int n_gram(node *nn, const char *p, size_t sz)
78 node_gram *n = (node_gram *)nn;
79 unsigned f[UCHAR_MAX];
83 if (n->sz && sz != n->sz)
85 memcpy(f, n->f, sizeof(f));
88 i = (unsigned char)*p++;
96 /* --- Node creation --- */
98 node *anagram(const char *const *av)
100 node_gram *n = xmalloc(sizeof(*n));
102 n->sz = compile(n, av[0]);
106 node *subgram(const char *const *av)
108 node_gram *n = xmalloc(sizeof(*n));
115 /*----- That's all, folks -------------------------------------------------*/