blob: 30638894308d14da12d8d09a5d77ee1d1d4ce4b7 (
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
// -*- C++ -*-
/**
* Copyright (C) 1989 Free Software Foundation, Inc.
* written by Douglas C. Schmidt (d.schmidt@vanderbilt.edu)
*
* This file is part of GNU GPERF.
*
* This program 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifndef LIST_NODE_H
#define LIST_NODE_H
#include "ace/config-all.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
#include "Options.h"
#include "ace/Copy_Disabled.h"
/**
* Data and function members for defining values and operations of
* a list node.
*/
class List_Node : private ACE_Copy_Disabled
{
public:
/// Constructor.
List_Node (char *key, int len);
/// Destructor.
~List_Node (void);
static void sort (char *base, int len);
/// TRUE if key has an identical KEY_SET as another key.
List_Node *link;
/// Points to next element on the list.
List_Node *next;
/// Each keyword string stored here.
char *key;
/// Additional information for building hash function.
char *rest;
/// Set of characters to hash, specified by user.
char *keysig;
/// Length of the key.
int length;
/// Hash value for the key.
int hash_value;
/// A metric for frequency of key set occurrences.
int occurrence;
/// Position of this node relative to other nodes.
int slot;
};
#endif /* LIST_NODE_H */
|
