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
139
140
|
/* bigram -- list bigrams for locate
Copyright (C) 1994, 2007, 2009-2011, 2016 Free Software Foundation,
Inc.
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 3 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, see <http://www.gnu.org/licenses/>.
*/
/* Usage: bigram < text > bigrams
Use `code' to encode a file using this output.
Read a file from stdin and write out the bigrams (pairs of
adjacent characters), one bigram per line, to stdout. To reduce
needless duplication in the output, it starts finding the
bigrams on each input line at the character where that line
first differs from the previous line (i.e., in the ASCII
remainder). Therefore, the input should be sorted in order to
get the least redundant output.
Written by James A. Woods <jwoods@adobe.com>.
Modified by David MacKenzie <djm@gnu.ai.mit.edu>. */
/* config.h must always be included first. */
#include <config.h>
/* system headers. */
#include <errno.h>
#include <stdio.h>
#include <locale.h>
#include <string.h>
#include <stdlib.h>
#include <sys/types.h>
/* gnulib headers. */
#include "closeout.h"
#include "gettext.h"
#include "progname.h"
#include "xalloc.h"
#include "error.h"
/* find headers would go here but we don't need any. */
/* We use gettext because for example xmalloc may issue an error message. */
#if ENABLE_NLS
# include <libintl.h>
# define _(Text) gettext (Text)
#else
# define _(Text) Text
#define textdomain(Domain)
#define bindtextdomain(Package, Directory)
#endif
/* Return the length of the longest common prefix of strings S1 and S2. */
static int
prefix_length (char *s1, char *s2)
{
register char *start;
for (start = s1; *s1 == *s2 && *s1 != '\0'; s1++, s2++)
;
return s1 - start;
}
int
main (int argc, char **argv)
{
char *path; /* The current input entry. */
char *oldpath; /* The previous input entry. */
size_t pathsize, oldpathsize; /* Amounts allocated for them. */
int line_len; /* Length of input line. */
if (argv[0])
set_program_name (argv[0]);
else
set_program_name ("bigram");
#ifdef HAVE_SETLOCALE
setlocale (LC_ALL, "");
#endif
bindtextdomain (PACKAGE, LOCALEDIR);
textdomain (PACKAGE);
(void) argc;
if (atexit (close_stdout))
{
error (EXIT_FAILURE, errno, _("The atexit library function failed"));
}
pathsize = oldpathsize = 1026; /* Increased as necessary by getline. */
path = xmalloc (pathsize);
oldpath = xmalloc (oldpathsize);
/* Set to empty string, to force the first prefix count to 0. */
oldpath[0] = '\0';
while ((line_len = getline (&path, &pathsize, stdin)) > 0)
{
register int count; /* The prefix length. */
register int j; /* Index into input line. */
path[line_len - 1] = '\0'; /* Remove the newline. */
/* Output bigrams in the remainder only. */
count = prefix_length (oldpath, path);
for (j = count; path[j] != '\0' && path[j + 1] != '\0'; j += 2)
{
putchar (path[j]);
putchar (path[j + 1]);
putchar ('\n');
}
{
/* Swap path and oldpath and their sizes. */
char *tmppath = oldpath;
size_t tmppathsize = oldpathsize;
oldpath = path;
oldpathsize = pathsize;
path = tmppath;
pathsize = tmppathsize;
}
}
free (path);
free (oldpath);
return 0;
}
|
