File: array.c

package info (click to toggle)
bow 19991122-4
  • links: PTS
  • area: main
  • in suites: woody
  • size: 2,544 kB
  • ctags: 2,987
  • sloc: ansic: 38,660; lisp: 1,072; makefile: 594; perl: 492; yacc: 149; sh: 91
file content (309 lines) | stat: -rw-r--r-- 8,692 bytes parent folder | download | duplicates (3)
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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
/* Implementation of arrays that can grow. */

/* Copyright (C) 1997, 1998, 1999 Andrew McCallum

   Written by:  Andrew Kachites McCallum <mccallum@cs.cmu.edu>

   This file is part of the Bag-Of-Words Library, `libbow'.

   This library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Library General Public License
   as published by the Free Software Foundation, version 2.
   
   This library 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
   Library General Public License for more details.

   You should have received a copy of the GNU Library General Public
   License along with this library; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA */

#include <bow/libbow.h>
#include <assert.h>

/* The magic-string written at the beginning of archive files, so that
   we can verify we are in the right place for when reading. */
#define HEADER_STRING "bow_array\n"

int bow_array_default_capacity = 1024;
int bow_array_default_growth_factor = 2;

/* Allocate, initialize and return a new array structure. */
bow_array *
bow_array_new (int capacity, int entry_size, void (*free_func)())
{
  bow_array *ret;

  ret = bow_malloc (sizeof (bow_array));
  bow_array_init (ret, capacity, entry_size, free_func);
  return ret;
}

/* Initialize an already allocated array structure. */
void
bow_array_init (bow_array *array, int capacity, 
		int entry_size, void (*free_func)())
{
  if (capacity == 0)
    capacity = bow_array_default_capacity;
  array->size = capacity;
  array->length = 0;
  array->entry_size = entry_size;
  array->free_func = free_func;
  array->growth_factor = 2;
  array->entries = bow_malloc (array->size * entry_size);
}

#define ADDR_ENTRY_AT_INDEX(ARRAY, INDEX)	\
(((char*)((ARRAY)->entries)) + (INDEX * (ARRAY)->entry_size))

/* Append an entry to the array.  Return its index. */
int
bow_array_append (bow_array *array, void *entry)
{
  if (array->length >= array->size)
    {
      /* The array must grow to accommodate the new entry. */
      array->size *= array->growth_factor;
      array->size /= array->growth_factor - 1;
      array->entries = bow_realloc (array->entries, 
				    array->size * array->entry_size);
    }
  memcpy (ADDR_ENTRY_AT_INDEX (array, array->length), entry,
	  array->entry_size);
  return (array->length)++;
}

/* Append an entry to the array by reading from fp.  Return its index,
   or -1 if there are no more entries to be read. */
int
bow_array_append_from_fp_inc (bow_array *array, 
			      int (*read_func)(void*,FILE*), 
			      FILE *fp)
{
  int c = fgetc(fp);

  if (feof(fp))  
    return -1; /* we've hit eof -- bail out */
  ungetc(c, fp);
 
  if (array->length >= array->size)
    {
      /* The array must grow to accommodate the new entry. */
      array->size *= array->growth_factor;
      array->size /= array->growth_factor - 1;
      array->entries = bow_realloc (array->entries, 
				    array->size * array->entry_size);
    }
  (*read_func) (ADDR_ENTRY_AT_INDEX (array, array->length), fp);

  return (array->length)++;
}

/* Return what will be the index of the next entry to be appended */
int
bow_array_next_index (bow_array *array)
{
  return array->length;
}

/* Return a pointer to the array entry at index INDEX. */
void *
bow_array_entry_at_index (bow_array *array, int index)
{
  assert (index < array->length);
  return ADDR_ENTRY_AT_INDEX (array, index);
}

/* Write the array ARRAY to the file-pointer FP, using the function
   WRITE_FUNC to write each of the entries in ARRAY. */
void
bow_array_write (bow_array *array, int (*write_func)(void*,FILE*), FILE *fp)
{
  int i;

  fprintf (fp, HEADER_STRING);
  bow_fwrite_int (array->length, fp);
  bow_fwrite_int (array->entry_size, fp);
  for (i = 0; i < array->length; i++)
    (*write_func) (ADDR_ENTRY_AT_INDEX (array, i), fp);
}

/* Write the incremental format header to the file-pointer FP */
void
bow_array_write_header_inc (bow_array *array, FILE *fp)
{
  bow_fwrite_int (array->entry_size, fp);
  fflush (fp);
}

/* Write one entry in incremental format to the file-pointer FP, using the function
   WRITE_FUNC. It will fseek to the appropriate location to write. */
void
bow_array_write_entry_inc (bow_array *array, int i, int (*write_func)(void*,FILE*), FILE *fp)
{
  fseek (fp, sizeof (int) + array->entry_size * i, SEEK_SET);
 (*write_func) (ADDR_ENTRY_AT_INDEX (array, i), fp);
 fflush (fp);
}

/* Return a new array, created by reading file-pointer FP, and using
   the function READ_FUNC to read each of the array entries. The
   returned array will have entry-freeing-function FREE_FUNC. */
bow_array *
bow_array_new_from_fp_inc (int (*read_func)(void*,FILE*), 
			   void (*free_func)(),
			   FILE *fp)
{
  int entry_size;
  bow_array *ret;

  bow_fread_int (&entry_size, fp);
  ret = bow_array_new (0, entry_size, free_func);
 
  while (bow_array_append_from_fp_inc (ret, read_func, fp) != -1)
    ;

  return ret;
}

/* Return a new array, created by reading file-pointer FP, and using
   the function READ_FUNC to read each of the array entries.  The
   array entries will have size MIN_ENTRY_SIZE, or larger, if
   indicated by the data in FP; this is useful when a structure is
   re-defined to be larger.  The returned array will have
   entry-freeing-function FREE_FUNC.  */
bow_array *
bow_array_new_with_entry_size_from_data_fp (int min_entry_size,
					    int (*read_func)(void*,FILE*), 
					    void (*free_func)(),
					    FILE *fp)
{
  int length;
  int entry_size;
  bow_array *ret;
  int i;

  /* Make sure the FP is positioned corrected to read a bow_int4str.
     Look for the magic string we are expecting. */
  {
    const char *magic = HEADER_STRING;
    while (*magic)
      {
	if (*magic != fgetc (fp))
	  bow_error ("Proper header not found in file.");
	magic++;
      }
  }

  bow_fread_int (&length, fp);
  bow_fread_int (&entry_size, fp);
  if (entry_size < min_entry_size)
    entry_size = min_entry_size;
  ret = bow_array_new (length, entry_size, free_func);
  for (i = 0; i < length; i++)
    (*read_func) (ADDR_ENTRY_AT_INDEX (ret, i), fp);
  ret->length = length;
  return ret;
}

/* Return a new array, created by reading file-pointer FP, and using
   the function READ_FUNC to read each of the array entries.  The
   returned array will have entry-freeing-function FREE_FUNC. */
bow_array *
bow_array_new_from_data_fp (int (*read_func)(void*,FILE*), 
			    void (*free_func)(),
			    FILE *fp)
{
  return bow_array_new_with_entry_size_from_data_fp (0, read_func,
						     free_func, fp);
}

#if 0
/* Define an iterator over a cdocs array */

struct bow_cdocs_iterator_context {
  bow_array *cdocs;
  int ci;
  int di;
}
#define CONTEXT ((struct bow_cdocs_iterator_context*)context)

static void
cdocs_iterator_reset (int ignored, void *context)
{
  CONTEXT->di = 0;
}

static int
array_iterator_advance_to_next (void *context)
{
  bow_cdoc *cdoc;
  if (CONTEXT->di >= CONTEXT->array->length)
    return 0;
  while (CONTEXT->di < CONTEXT->cdocs->length)
    {
      CONTEXT->di++;
      cdoc = bow_array_entry_at_index (CONTEXT->cdocs, CONTEXT->di)
      if (cdoc->class == CONTEXT->ci)
	break;
    }
  if (CONTEXT->di >= CONTEXT->cdocs->length)
    return 0;
  return 1;
}

static int
cdocs_iterator_index (void *context)
{
  if (CONTEXT->di >= CONTEXT->cdocs->length)
    return INT_MIN;
  return CONTEXT->di;
}

static double
cdocs_iterator_count_for_doc (void *context)
{
  bow_cdocs *cdocs;
  if (CONTEXT->di >= CONTEXT->cdocs->length)
    return 0.0/0;		/* NaN */
  cdoc = bow_array_entry_at_index (CONTEXT->cdocs, CONTEXT->di)
  return cdoc->word_count;
}


bow_iterator_double *
bow_array_iterator_for_ci_new (bow_array *array, int ci)
{
  bow_iterator_double *ret;
  void *context;

  ret = bow_malloc (sizeof (bow_iterator_double) + 
		    sizeof (struct bow_array_iterator_context));
  ret->reset = array_iterator_reset_at_wi;
  ret->advance = array_iterator_advance_to_next_di;
  ret->index = array_iterator_doc_index;
  ret->value = array_iterator_count_for_doc;
  context = ret->context = (char*)ret + sizeof (bow_iterator_double);
  CONTEXT->array = array;
  CONTEXT->ci = ci;
  CONTEXT->dv = NULL;
  CONTEXT->dvi = 0;
  return ret;
}
#undef CONTEXT
#endif

/* Free the memory held by the array ARRAY. */
void
bow_array_free (bow_array *array)
{
  if (array->free_func)
    {
      while ((array->length)--)
	(*(array->free_func)) (ADDR_ENTRY_AT_INDEX (array, array->length));
    }
  bow_free (array->entries);
  bow_free (array);
}