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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
/* Part of SWI-Prolog
Author: Jan Wielemaker
E-mail: J.Wielemaker@vu.nl
WWW: http://www.swi-prolog.org
Copyright (c) 1999-2011, University of Amsterdam
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef _TABLE_H_INCLUDED
#define _TABLE_H_INCLUDED
#define TABLE_VERSION "1.2.3"
#include <SWI-Prolog.h>
#include "order.h"
#ifdef __WINDOWS__
#include <windows.h>
#endif
#define TABLE_MAGIC 32635373 /* just a number */
#define MAXFIELDS 256 /* max fields in a file */
#define FIELD_ATOM 0 /* type of the field */
#define FIELD_STRING 1
#define FIELD_CODELIST 2 /* list of ASCII codes */
#define FIELD_INTEGER 3
#define FIELD_HEX 4
#define FIELD_FLOAT 5
#define FIELD_SORTED 0x1 /* Flags: field is sorted */
#define FIELD_UNIQUE 0x2 /* There is only one entry */
#define FIELD_DOWNCASE 0x4 /* Downcase the input from the field */
#define FIELD_MAPSPACETOUNDERSCORE 0x8 /* ' ' --> '_' mapping */
#define FIELD_ALLOWBADNUM 0x10 /* ignore (fail) on bad numerical */
#define CMP_DICT 0x1 /* dictionary order */
#define CMP_IGNORECASE 0x2 /* ignore case */
typedef ssize_t table_offset_t; /* general offset */
typedef struct fieldtag
{ atom_t name; /* name of the field */
int index; /* ordinal number */
int type; /* type of the field */
int width; /* > 0: fixed-width field */
int arg; /* argument in term */
OrdTable ord; /* ordering table (if sorted oddly) */
int flags; /* general flags */
} field, *Field;
typedef struct tabletag
{ int magic; /* TABLE_MAGIC */
atom_t file; /* name of the file */
int nfields; /* # fields in the table */
Field fields; /* field description terms */
int keyfield; /* 0-based index of key (or -1) */
int record_sep; /* record separator */
int field_sep; /* field separator */
int escape; /* escape character (-1: none) */
char *escape_table; /* escape mapping table */
unsigned encoding; /* REP_* */
functor_t record_functor; /* functor for record */
char *window; /* pointer to the current window */
size_t window_size; /* size of the current window */
int opened;
char *buffer; /* buffer for the file */
size_t size; /* size of the `window' */
#ifdef __WINDOWS__
HANDLE hfile; /* handle to the file */
HANDLE hmap; /* handle to the map */
#endif
#ifdef __unix__
int fd; /* file descriptor */
#endif
} table, *Table;
#define QUERY_DONTCARE 0x01 /* don't consider this field */
#define QUERY_EXACT 0x02 /* Must match exactly */
#define QUERY_PREFIX 0x04 /* Prefix match */
#define QUERY_SUBSTRING 0x08 /* Substring match */
#define QUERY_MALLOCVAL 0x10 /* value is malloced ptr */
#define QUERY_READ 0x20 /* read this field */
#define TECH_LINEAR 0x1 /* simple linear search */
#define TECH_BINARY 0x2 /* use binary search */
#define TECH_UNIQUE 0x4 /* key is unique */
typedef struct fieldquerytag
{ union
{ long i; /* value as integer */
char * s; /* value as string */
double f; /* value as float */
void * ptr; /* anonymous pointer */
term_t term; /* value as term (read) */
} value;
size_t length; /* length of string */
OrdTable ord; /* ordering table */
int flags;
} queryfield, *QueryField;
typedef struct querytag
{ Table table; /* table to work on */
table_offset_t offset; /* current working offset */
int nvars; /* number of variable (read) fields */
int technique; /* use binary search */
queryfield field[1]; /* the fields */
} query, *Query;
#endif /*_TABLE_H_INCLUDED*/
|
