X-Git-Url: http://git.indexdata.com/?a=blobdiff_plain;f=dfa%2Fdfa.c;h=73730c80dfdd320d59fee724ea7c93c0f3df9aba;hb=5b4dcfcb99600327a11b58de4fec33003dc4d816;hp=072c39700919854db1a1cb7c641894c785ff1a8b;hpb=75b086d1cbf7d4134e599d2d3b0cd51abb34292a;p=idzebra-moved-to-github.git

diff --git a/dfa/dfa.c b/dfa/dfa.c
index 072c397..73730c8 100644
--- a/dfa/dfa.c
+++ b/dfa/dfa.c
@@ -1,10 +1,23 @@
 /*
- * Copyright (C) 1994-1998, Index Data I/S 
+ * Copyright (C) 1994-1999, Index Data
  * All rights reserved.
  * Sebastian Hammer, Adam Dickmeiss
  *
  * $Log: dfa.c,v $
- * Revision 1.21  1998-06-22 11:33:39  adam
+ * Revision 1.25  1999-02-02 14:50:05  adam
+ * Updated WIN32 code specific sections. Changed header.
+ *
+ * Revision 1.24  1998/10/28 10:48:55  adam
+ * Added type cast to prevent warning.
+ *
+ * Revision 1.23  1998/09/02 14:15:28  adam
+ * Zebra uses GNU Configure.
+ *
+ * Revision 1.22  1998/06/24 12:16:10  adam
+ * Support for relations on text operands. Open range support in
+ * DFA module (i.e. [-j], [g-]).
+ *
+ * Revision 1.21  1998/06/22 11:33:39  adam
  * Added two type casts.
  *
  * Revision 1.20  1998/06/08 14:40:44  adam
@@ -423,18 +436,28 @@ static int read_charset (struct DFA_parse *parse_info)
     {
         if (!esc0 && ch0 == ']')
             break;
-        if (parse_info->cmap)
-        {
-            const char **mapto;
-	    char mapfrom[2];
-            const char *mcp = mapfrom;
-            mapfrom[0] = ch0;
-            mapto = (*parse_info->cmap)(parse_info->cmap_data, &mcp, 1);
-            assert (mapto);
-            ch0 = mapto[0][0];
-        }
-        add_BSet (parse_info->charset, parse_info->look_chars, ch0);
-        ch1 = nextchar_set (parse_info, &esc1);
+	if (!esc0 && ch0 == '-')
+	{
+	    ch1 = ch0;
+	    esc1 = esc0;
+	    ch0 = 1;
+	    add_BSet (parse_info->charset, parse_info->look_chars, ch0);
+	}
+	else
+	{
+	    if (parse_info->cmap)
+	    {
+		const char **mapto;
+		char mapfrom[2];
+		const char *mcp = mapfrom;
+		mapfrom[0] = ch0;
+		mapto = (*parse_info->cmap)(parse_info->cmap_data, &mcp, 1);
+		assert (mapto);
+		ch0 = mapto[0][0];
+	    }
+	    add_BSet (parse_info->charset, parse_info->look_chars, ch0);
+	    ch1 = nextchar_set (parse_info, &esc1);
+	}
         if (!esc1 && ch1 == '-')
         {
             int open_range = 0;
@@ -523,7 +546,7 @@ static int lex_sub(struct DFA_parse *parse_info)
         {
             const int *cc;
             for (cc = parse_info->charMap; *cc; cc += 2)
-                if (*cc == parse_info->look_ch)
+                if (*cc == (int) (parse_info->look_ch))
                 {
                     if (!cc[1])
                         --parse_info->expr_ptr;
@@ -759,6 +782,7 @@ static void dfa_trav (struct DFA_parse *parse_info, struct Tnode *n)
         n->lastpos = mk_Set (poset);
         n->lastpos = add_Set (poset, n->lastpos, n->pos);
         if (debug_dfa_trav)
+	{
             if (n->u.ch[0] < 0)
                 printf ("#%d (n#%d)", -n->u.ch[0], -n->u.ch[1]);
             else if (n->u.ch[1] > n->u.ch[0])
@@ -772,6 +796,7 @@ static void dfa_trav (struct DFA_parse *parse_info, struct Tnode *n)
             }
             else
                 out_char (n->u.ch[0]);
+	}
     }
     if (debug_dfa_trav)
     {
@@ -842,10 +867,12 @@ static void mk_dfa_tran (struct DFA_parse *parse_info, struct DFA_states *dfas)
             for (pos_i = pos; (i = *pos_i) != -1; ++pos_i)
                 if (posar[i]->u.ch[1] >= char_1 
                     && (c=posar[i]->u.ch[0]) < char_0)
+		{
                     if (c < char_1)
                         char_0 = char_1;
                     else
                         char_0 = c;
+		}
 
             if (char_0 > max_char)
                 break;