summaryrefslogtreecommitdiff
path: root/Build/source/utils/xindy/rte/ordrules/ordrules.c
blob: fae3e936d80d30fc0a55c65a20cbbfd9cf7518b9 (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
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
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
/* $Id: ordrules.c,v 1.9 2008/01/09 11:33:44 jschrod Exp $
 *----------------------------------------------------------------------
 *
 * Ordering Rules for Strings
 *
 * [history at end]
 */

#include "ordrules.h"
#include "rxsub.h"

#include <string.h>

/* switch on debugging by excluding the undef directive. */
#define debug
#undef  debug /* */
#include "debug.h"

#ifdef debug
#define DEBUG
#endif

RULE_TABLE* SortRules;  /* rules for generating sortkeys */

RULE_TABLE MergeRules;	/* rules for generating mergekeys */
GROUP_LIST GroupList;	/* list of character groups */
GROUP_LIST HeadingList;	/* list of group headings */

/* The following rule-types can be set by the user: */
#define RT_AUTOMATIC         0
#define RT_STRING            1
#define RT_REGEXP_BASIC      2
#define RT_REGEXP_EXTENDED   3
#define RT_CHAR              4

static RULE_TYPE get_ruletype PROTO(( char *lside, char *rside ));
static int       is_regexp PROTO(( char *s ));
static int       is_CHR_RULE PROTO(( char *s, char *r ));

char  ordrules_string_buffer [BUFLEN];
int   ordrules_string_buffer_used_bytes = 0;

       int   ordrules_msg_logging      = 0;
       char* ordrules_msg_buffer       = 0;
       int   ordrules_msg_buffer_ptr   = 0;
static size_t ordrules_msg_buffer_len   = BUFLEN;
static size_t ordrules_msg_buffer_avail = 0;
static int   ordrules_sort_rule_tables = 0;

#define DEFAULT_SORT_RULE_TABLES 8

#define DBG( expr ) if (ordrules_msg_logging!=0) { expr; }


static void
logs( msg )
char* msg;
{
  size_t msglen = strlen( msg );

  if (NULL == ordrules_msg_buffer) {
    ordrules_msg_buffer = (char*) malloc (ordrules_msg_buffer_len);
    ordrules_msg_buffer_avail = ordrules_msg_buffer_len - 1;
    ordrules_msg_buffer_ptr = 0;
  }
  if (msglen > ordrules_msg_buffer_avail) {
    ordrules_msg_buffer_len *= 2;
   ordrules_msg_buffer = (char*) realloc (ordrules_msg_buffer,
					       ordrules_msg_buffer_len);
    ordrules_msg_buffer_avail = ordrules_msg_buffer_len -
      ordrules_msg_buffer_ptr - 1;
  }
  strcpy(&ordrules_msg_buffer[ordrules_msg_buffer_ptr], msg );
  ordrules_msg_buffer_ptr += msglen;
  ordrules_msg_buffer_avail -= msglen;
  ordrules_msg_buffer[ordrules_msg_buffer_ptr] = '\0';
}

static void
logc( c )
char c;
{
  char msg[2];
  msg[0] = c;
  msg[1] = '\0';
  logs(msg);
}

static void
logi( n )
int n;
{
  char msg[16];
  sprintf(msg, "%d", n);
  logs(msg);
}

/*
 * This function initializes the memory for the SortRules. Since the
 * number of tables is defined dynamically, we allow the repeated
 * definition of tables. In this case the old table is discarded.
 */

int
initialize (num_sort_tables)
int num_sort_tables;
{
  size_t fullsize = num_sort_tables * sizeof(RULE_TABLE);
  if (SortRules != NULL) {
    logs("ORDRULES: Removing old Sort-Tables!\n");
    free( SortRules );
  }
  ordrules_sort_rule_tables = num_sort_tables;
  SortRules = (RULE_TABLE*) malloc (fullsize);
  if (SortRules == NULL) {
      fprintf(stderr,"ordrules: malloc() of %d SortTables failed!\n",
	      num_sort_tables);
      exit(1);
  }
  logs("ORDRULES: Initializing "); logi(num_sort_tables);
  logs(" Sort Tables.\n");
  memset(SortRules, 0, fullsize);
  return(num_sort_tables);
}

int
add_sort_rule (run, left, right, isreject, ruletype)
int run;
char *left;
char *right;
int isreject;
int ruletype;
{
  if (SortRules == NULL) { /* No malloc() done yet */
    if (ordrules_sort_rule_tables == 0) { /* No specification yet. */
      ordrules_sort_rule_tables = DEFAULT_SORT_RULE_TABLES; /* use default */
    }
    logs("ORDRULES: Performing implicit initialization.\n");
    initialize( ordrules_sort_rule_tables ); /* ...then initialize */
  }
  if (0 <= run && run < ordrules_sort_rule_tables) {
    return( add_rule( SortRules[run], left, right, isreject, ruletype, run ));
  } else {
    logs("ORDRULES: add_sort_rule(): run is out of range.\n");
    return -1;
  }
}

int
add_merge_rule (left, right, isreject, ruletype)
char *left;
char *right;
int isreject;
int ruletype;
{
  return( add_rule( MergeRules, left, right, isreject, ruletype, -1));
}

/* insert rule 'left --> right' into ruletable 'table' */
int
add_rule( table, left, right, isreject, ruletype, run)
RULE_TABLE table;
char *left;
char *right;
int isreject;
int ruletype;
int run;
{
  RULE *r;
  RULE_LIST *list;
  char buffer[STRING_MAX];
  char *bptr = buffer;
  unsigned int pos = 0;

  /* new stuff */
  int errcode;
  char errmsg[STRING_MAX];

  /* Use extended regular expression syntax as default. */
  int cflag = REG_EXTENDED;

  dispstart( add_rule );
  dispstr( left );
  dispstr( right );

  r = (RULE *) malloc( sizeof(RULE) );

  switch ( ruletype ) {
    case RT_AUTOMATIC:
      r->type = get_ruletype( left, right ); break;
    case RT_STRING:
      r->type = STR_RULE; break;
    case RT_CHAR:
      r->type = CHR_RULE; break;
    case RT_REGEXP_BASIC:
    case RT_REGEXP_EXTENDED:
      r->type = REG_RULE; break;
  }

  switch (r->type) {

    case REG_RULE:

      if (ruletype == RT_REGEXP_BASIC) {
	/* Use the basic regular expressions as specified. */
	cflag = 0;
      }
      dispstart( REG_RULE );
      dispmsg( bptr copy );
      /* insert '^' in regular expression to match string prefix only */
      *bptr++ = '^'; strcpy( bptr, left );
      r->r.reg.lstr  = (char *) malloc( strlen(buffer) + 1);
      r->r.reg.type = cflag;
      strcpy( r->r.reg.lstr, buffer );
      dispmsg( malloc );
      r->r.reg.lside = (regex_t*) malloc (sizeof(regex_t));
      displong( r->r.reg.lside );
      dispstart( regcomp );
      if ( 0 != (errcode = regcomp( r->r.reg.lside, buffer, REG_EXTENDED ))) {
	regerror( errcode, r->r.reg.lside, errmsg, STRING_MAX );
	DBG(logs("Regular Expression Error: "); logs(errmsg); logs("\n");)
	return( errcode );
      }
      dispend( regcomp );
      r->r.reg.rside = (char *) malloc( strlen(right) + 1);
      strcpy( r->r.reg.rside, right );
      dispstr( r->r.reg.rside );
      displong( r->type );

      /*
       * calculate table index as the first character of 'left'
       * or FORALL_POS if the rule does not start with a fixed charater.
       * A rule starts with a fixed character if this char is escaped.
       * Otherwise the first character might be variable (ie, a character
       * class) or it might be optional.
       */

      if ( left[0] == BSH )  pos = (unsigned char)(left[1]); /* quoted */
      else
        if ( strchr(".([",left[0])==NULL || strchr("*?",left[1])==NULL )
	  pos = FORALL_POS; /* character class or optional */
        else
	  pos = (unsigned char)(left[0]); /* fixed */

      dispend( REG_RULE );
      break;

    case CHR_RULE:
      dispstart( CHR_RULE );
      r->r.chr  = *right;
      pos = (unsigned char)(*left);
      dispend( CHR_RULE );
      break;

    case STR_RULE:
      dispstart( STR_RULE );
      r->r.str.llen = strlen(left);
      r->r.str.lside = (char *) malloc( (size_t)(r->r.str.llen + 1) );
      strcpy(r->r.str.lside,left);
      r->r.str.rlen = strlen(right);
      r->r.str.rside = (char *) malloc( (size_t)(r->r.str.rlen + 1) );
      strcpy(r->r.str.rside,right);
      pos = (unsigned char)(*left);
      dispend( STR_RULE );
      break;
  }

  if (isreject) r->type |= REJECT;

  /* insert new rule into table */
  dispstart(inserting into table);
  dispuint(pos);
  displong(&table[0]);
  list = &table[pos];
  displong(list);
  displong(NULL);
  displong(list->first);
  displong(r);
  if (list->first == NULL) {
    list->first = r;
  } else {
    displong(list->last);
    displong(list->last->next);
    list->last->next = r;
  }
  displong(list->last);
  list->last = r;
  displong(r->next);
  r->next = NULL;
  dispend(inserting into table);

  DBG(
    logs("Mappings: add (");
    if (table == MergeRules) logs("merge"); else logs("sort");
    logs("-rule ");
    switch ( r->type & ~REJECT ) {
      case CHR_RULE:
	logs("`");logc(*left);logs("' `");logc(r->r.chr);logs("' :char");
	break;
      case STR_RULE:
	logs("`");;logs(r->r.str.lside); logs("' `");
	logs(r->r.str.rside);logs("' :string");
	break;
      case REG_RULE:
	logs("`");logs(buffer);logs("' `");
	logs(r->r.reg.rside);logs("' :");
	logc( (r->r.reg.type == REG_EXTENDED) ? 'e' : 'b' );
	logs("regexp");
	break;
    }
    if (run != -1) {
	logs(" :run ");
	logi(run);
    }
    if (r->type&REJECT) logs(" :again");
    logs(").\n");
  )
  dispend( add_rule );
  return( 0 );
}

/* get the type of the rule 'lside --> rside' */
static
RULE_TYPE get_ruletype( lside, rside )
char *lside;
char *rside;
{
  if ( is_regexp( lside ) || is_regexp( rside ) ) return REG_RULE;

  if ( lside[0] != NUL && lside[1] == NUL &&
       rside[0] != NUL && rside[1] == NUL ) return CHR_RULE;

  return STR_RULE;
}

static
int is_CHR_RULE ( lside, rside )
char *lside;
char *rside;
{
  if ( lside[0] != NUL && lside[1] == NUL &&
       rside[0] != NUL && rside[1] == NUL ) return CHR_RULE;

  return STR_RULE;
}

/* return TRUE, if 's' is a regular expression. */
static
int is_regexp( s )
char *s;
{
  for (;*s ; s++ )
    if (*s == BSH) {
      s++;
      if ('0' <= *s && *s <= '9') return TRUE;
    }
    else if (strchr("[]().*+$^?&",*s)) return TRUE;
  return FALSE;
}

#ifdef UNESCAPE
/* not necessary anymore */

/* replace all '\x' sequences with the character they represent */
static void
unescape( s )
register char *s;
{
  register char *d;
  for (d = s; *d = *s; d++)
    if (*s++ == BSH) *d = *s++;
}
#endif

/* apply the rules from 'table' to 'source' and place the substituted result
   in 'dest' */
void apply_rules( table, source, dest, buflen )
RULE_TABLE table;
register char *source;
register char *dest;
register size_t buflen;
{
  register RULE *r;
  register RULE_TYPE rtype;
  register char *newdest = 0;
  char newsource[STRING_MAX];

  /* new stuff */
#define NMATCH 10
  regmatch_t regmatch [NMATCH];
  int eflags = 0;

#ifdef DEBUG
  char *in = source, *out = dest;
#endif

  dispstart( apply_rules );
  dispstr( source );
  dispstr( dest );
  dispint( buflen );

  while ( *source ) {

    /* first check the rules beginning with character '*source' */
    dispint( (unsigned) *source );
    dispint( (unsigned)(*source) );
    dispint( (unsigned char)(*source) );
    dispint( (unsigned int)(*source) );
    for ( r = table[(unsigned char) *source].first; r; r = r->next ) {

      displong( r );
      rtype = (r->type & ~REJECT);

      if ( rtype == CHR_RULE ) {
	dispstart( CHR_RULE );
      	if ((r->type & REJECT))
	  newdest = dest;
	DBG(
	  logs("Mappings: (compare `");logs(source);logs("' :char `");
	  logc(*source); logs("') match!\n");
	  )
	*dest++ = r->r.chr;
	source++;
	dispend( CHR_RULE );
	break;
      }

      else if ( rtype == STR_RULE &&
		!strncmp(source, r->r.str.lside, (size_t)r->r.str.llen)) {
	DBG(
	  logs("Mappings: (compare `");logs(source);logs("' :string `");
	  logs(r->r.str.lside); logs("') match!\n");
	  )
	dispstart( STR_RULE );
	displong( dest );
	strcpy(dest, r->r.str.rside);
      	if ((r->type & REJECT)) newdest = dest;
	displong( newdest );
	dest   += r->r.str.rlen;
	displong( dest );
	source += r->r.str.llen;
	displong( source );
	dispend( STR_RULE );
      	break;
      }

      else {
	if ( rtype == REG_RULE ) {
	  dispstart( REG_RULE );
	  DBG(
	    logs("Mappings: (compare `");logs(source);logs("' :");
	    logc( (r->r.reg.type == REG_EXTENDED) ? 'e' : 'b' );
	    logs("regexp `");
	    logs(r->r.reg.lstr); logs("')");
	    )
	  if ( 0 == regexec( r->r.reg.lside, source,
			     NMATCH, regmatch, eflags ) ) {
	    DBG( logs(" match!\n"); )
	    nrxsub( r->r.reg.rside, regmatch, source, dest, buflen );
	    if ((r->type & REJECT))
	      newdest = dest;
	    dest   = strchr(dest,0);
	    source += regmatch[0].rm_eo;
	    dispend( REG_RULE );
	    break;
	  }
	  DBG( logs("\n"); )
	  dispend( REG_RULE );
	}
      }

    }

    displong( r );
    if ( r == NULL ) {

      dispmsg( r == NULL );
      /* check regular expression rules, that could match all prefixes */
      for ( r = table[FORALL_POS].first; r; r = r->next ) {
	dispstart( for-loop regexps );
	dispstr( r->r.reg.lstr );
	dispstr( r->r.reg.rside );
	displong( r->type );
	dispstr( source );
	DBG(
	  logs("Mappings: (compare `");logs(source);logs("' :");
	  logc( (r->r.reg.type == REG_EXTENDED) ? 'e' : 'b' );
	  logs("regexp `");
	  logs(r->r.reg.lstr); logs("')");
	  )
	if ( 0 == regexec( r->r.reg.lside, source,
			   NMATCH, regmatch, eflags ) ) {
	  DBG( logs(" match!\n"); )
	  dispstart( regexec match! );
	  nrxsub( r->r.reg.rside, regmatch, source, dest, buflen );
      	  if ((r->type & REJECT)) newdest = dest;
	  displong( dest );
	  displong( newdest );
	  source += regmatch[0].rm_eo;
	  displong( source );
	  dest   = strchr(dest,0);
	  displong( dest );
	  dispend( regexec match! );
	  dispend( for-loop regexps );
      	  break;
        }
	DBG( logs("\n"); )
	dispend( for-loop regexps );
      }
      /* no rule matched, copy character */
      if ( r == NULL ){
	dispstart( no rule matched! );
	displong( dest );
	displong( source );
	*dest++ = *source++;
	displong( dest );
	displong( source );
	dispend( no rule matched! );
      }
    }

    displong( r );
    /* should we reject? */
    if ( r != NULL && (r->type & REJECT)) {
      dispstart( REJECT );
      strcpy(dest,source);
      strcpy(newsource,newdest);
#ifdef DEBUG
      fprintf(stderr,"\nordrules: reject in '%s': '%s'.",in,newsource);
#endif
      apply_rules( table, newsource, newdest, STRING_MAX );
      dispend( REJECT );
      dispend( apply_rules );
      return;
    }
  }

  dispstart( last part );
  displong( dest );
  *dest = 0;
  ordrules_string_buffer_used_bytes = strlen( ordrules_string_buffer );
#ifdef DEBUG
#ifdef debug
  dispstr( out );
#endif
#endif

#ifdef DEBUG
  /* if ( strcmp(in,out) ) */
  fprintf(stderr,"\nordrules: %s '%s' generated for '%s'.", table == MergeRules ? "mergekey" : "sortkey", out, in );
#endif

  dispend( last part );
  dispend( apply_rules );
}

char *gen_sortkey ( key, run )
char *key;
int run;
{
  char *sortkey;
  dispstart( gen_sortkey );
  dispstr( key );

  /* If no initialization has been done yet, then do a fallback to the
     default tables. This should not happen usually. */
  if (SortRules == NULL) {
    logs("ORDRULES: Performing implicit initialization.\n");
    initialize( DEFAULT_SORT_RULE_TABLES );
  }

  if (0 <= run && run < ordrules_sort_rule_tables) {
    apply_rules( SortRules[run], key, ordrules_string_buffer, BUFLEN );
  }

  sortkey = (char*) malloc (strlen( ordrules_string_buffer ) +1);
  strcpy( sortkey, ordrules_string_buffer );
  DBG(
    logs("Mappings: (sort-mapping `"); logs(key);
    logs("' :run "); logi(run); logs(") -> `");
    logs(sortkey); logs("'.\n\n");
  )
  dispend( gen_sortkey );
  return( sortkey );
}


char *gen_mergekey ( key )
char *key;
{
  char *mergekey;
  apply_rules( MergeRules, key, ordrules_string_buffer, BUFLEN );
  mergekey = (char*) malloc (strlen( ordrules_string_buffer ) +1);
  strcpy( mergekey, ordrules_string_buffer );
  DBG(
    logs("Mappings: (merge-mapping `"); logs(key); logs("') -> `");
    logs(mergekey); logs("'.\n\n");
    )
  return( mergekey );
}


/* insert a new group entry ('group','letter') into 'list' */
#if 0
void
add_group( list, group, letter )
GROUP_LIST *list;
int group;
char *letter;
{
  GROUP_RULE *new;
  new = (GROUP_RULE *) malloc(sizeof(GROUP_RULE));
  new->id = (group >= 0 ? group + USORTGROUP : group - USORTGROUP);
  new->len = strlen(letter);
  new->let = (char *) malloc(new->len + 1);
  strcpy(new->let,letter);

  /* insert rule into list */
  if (list->first == NULL) list->first = new;
                 else list->last->next = new;
  list->last = new;
  new->next = NULL;

#ifdef DEBUG
  fprintf(stderr,"\nordrules: added group into list '%s' '%s' -> group: %d.",list == &GroupList ? "GroupList" : "HeadingList", new->let,new->id);
#endif
}

/* find the user defined group id for 'sortkey' */
int get_group( sortkey )
char *sortkey;
{
  register GROUP_RULE *r;
  for (r = GroupList.first; r && strncmp(sortkey,r->let,r->len); r = r->next);
#ifdef DEBUG
  if (r != NULL)
    fprintf(stderr,"\nordrules: sortkey '%s' is in group: %d.",sortkey,r->id);
#endif
  return ( r ? r->id : *sortkey );
}

/* find the user defined group heading for id 'group' */
char *get_heading( group )
int group;
{
  register GROUP_RULE *r;
  for ( r = HeadingList.first; r && r->id != group; r = r->next);
#ifdef DEBUG
  if (r != NULL)
    fprintf(stderr,"\nordrules: group: %d has heading '%s'.",r->id,r->let);
#endif
  return ( r ? r->let : NULL );
}
#endif


/*======================================================================
 *
 * $Log: ordrules.c,v $
 * Revision 1.9  2008/01/09 11:33:44  jschrod
 *     Update to CLISP 2.43.
 *
 * Revision 1.8  2005/05/02 21:39:53  jschrod
 *     xindy run time engine 3.0; as used for CLISP 2.33.2.
 *
 * Revision 1.7  1999/07/30 08:34:32  kehr
 * Checked in some debug stuff that was integrated for better testing.
 *
 * Revision 1.6  1997/10/20 11:23:13  kehr
 * New version of sorting rules. Sorting of more complex indexes (i.e.
 * French) is now possible.
 *
 * Revision 1.5  1997/01/17 16:43:40  kehr
 * Several changes for new version 1.1.
 *
 * Revision 1.4  1996/07/18  15:56:40  kehr
 * Checkin after all changes that resulted from the define-letter-group
 * modification were finished. Additionally I found an ugly bug in the
 * ordrules.c file that was discovered when running the system under
 * Solaris (which seems to have signed chars..Whee!). This is fixed now
 * and the Imakefiles and that stuff was improved, too.
 *
 * Revision 1.3  1996/07/03  18:48:48  kehr
 * Changed ordrules.c. The unescape() mechanism was removed so that not too
 * much quoting is necessary anymore. This feature was olnly for the use in
 * the old makeindex-3 systems.
 *
 * Revision 1.2  1996/03/27  20:29:10  kehr
 * It works. Today I had my first success in getting the FFI running with
 * the ordrules-library. The interface is defined in `ordrulei.lsp' and
 * allows direct access to the functions in `ordrules.c'.
 *
 * Revision 1.1  1996/03/26  17:30:58  kehr
 * First check-in of the rx-support for clisp.
 *
 * Revision 1.9  1992/01/03  13:22:10  schrod
 * "unsigned" is not a type. Computation of table index was wrong.
 *
 * Revision 1.8  1991/12/16  14:44:54  schrod
 * fmalloc() statt allocate()
 *
 * Revision 1.7  1991/12/10  20:25:50  schrod
 * Changed all function declarations to ANSI prototypes using ARGS().
 *
 * Revision 1.6  1991/12/10  20:09:58  schrod
 * Reject-rules (*merge_rule and *sort_rule) implemented.
 *
 * Revision 1.5  1991/12/10  19:59:53  schrod
 * Fixed bug in ordrules. Inserting a new group rule at the beginning of
 * a rule list works not with groups, that have the same prefix:
 *
 * 	group_rule "ae" 1
 * 	group_rule "a"  2
 *
 * would put 'aexxx' in group 2.
 *
 * Revision 1.4  1991/12/10  19:49:59  schrod
 * Optimized group-rule handling.
 *
 * Revision 1.3  1991/12/10  19:43:38  schrod
 * Optimized module 'ordrules':
 * - all three types of rules (chr,str,regexp) now allowed for both sort
 *   and merge keys
 *
 * Revision 1.2  1991/12/10  19:20:31  schrod
 * Changed the group merging algorithm to create the group-id of an index key
 * using user defined rules (specified in the style file with commands:
 * `sort_group' and `group_head') instead of the sortkey's first character.
 *
 * Revision 1.1  1991/12/10  17:15:54  schrod
 * Initial revision
 *
 */