blob: 6b3e86ce694484d708c78866fdb958243eab7dd1 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
/* -*- C++ -*- */
// $Id$
/* This may look like C code, but it is really -*- C++ -*- */
/* Data and function members for defining values and operations of a list node.
Copyright (C) 1989 Free Software Foundation, Inc.
written by Douglas C. Schmidt (schmidt@ics.uci.edu)
This file is part of GNU GPERF.
GNU GPERF 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 1, or (at your option)
any later version.
GNU GPERF 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 GNU GPERF; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111, USA. */
#ifndef list_node_h
#define list_node_h 1
#include "Options.h"
struct List_Node
{
List_Node (char *key, int len);
static void set_sort (char *base, int len);
List_Node *link;
// TRUE if key has an identical KEY_SET as another key.
List_Node *next;
// Points to next element on the list.
char *key;
// Each keyword string stored here.
char *rest;
// Additional information for building hash function.
char *char_set;
// Set of characters to hash, specified by user.
int length;
// Length of the key.
int hash_value;
// Hash value for the key.
int occurrence;
// A metric for frequency of key set occurrences.
int index;
// Position of this node relative to other nodes.
};
#endif
|
