summaryrefslogtreecommitdiffstats
path: root/debian/htdig/htdig-3.2.0b6/htlib/HtRegexList.cc
blob: 2e017627a0bb80e7e0dd2c8cd131b7b685167a81 (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
//
// HtRegexList.cc
//
// HtRegex: A list of HtRegex objects for handling large regex patterns
//
// Part of the ht://Dig package   <http://www.htdig.org/>
// Copyright (c) 1999-2004 The ht://Dig Group
// For copyright details, see the file COPYING in your distribution
// or the GNU Library General Public License (LGPL) version 2 or later 
// <http://www.gnu.org/copyleft/lgpl.html>
//
// $Id: HtRegexList.cc,v 1.5 2004/05/28 13:15:21 lha Exp $
//

#ifdef HAVE_CONFIG_H
#include "htconfig.h"
#endif /* HAVE_CONFIG_H */

#include "HtRegexList.h"
#include <locale.h>

class listnode
{
public:
  listnode		*next;
  Object		*object;
};

HtRegexList::HtRegexList()
{
	compiled = 0;
}

HtRegexList::~HtRegexList()
{
	compiled = 0;
}

const String &HtRegexList::lastError()
{
	return lastErrorMessage;
}

int
HtRegexList::setEscaped(StringList &list, int case_sensitive)
{
  if (list.Count() == 0)
    {
      compiled = false;
      return true;
    }

  String  *str;
  String  transformedLimits, currentPattern, prevPattern;
  HtRegex *limit = new HtRegex;

  list.Start_Get();
  while ((str = (String *) list.Get_Next()))
    {
      if (str->indexOf('[') == 0 && str->lastIndexOf(']') == str->length()-1)
	{
	  transformedLimits = str->sub(1,str->length()-2).get();
	}
      else 	// Backquote any regex special characters
	{
	  transformedLimits = 0;
	  for (int pos = 0; pos < str->length(); pos++)
	    { 
	      if (strchr("^.[$()|*+?{\\", str->Nth(pos)))
		transformedLimits << '\\';
	      transformedLimits << str->Nth(pos);
	    }
	}
      if (!currentPattern.empty())
	currentPattern << "|";
      currentPattern << transformedLimits;
      if (!limit->set(currentPattern.get(), case_sensitive))
	{
	  if (prevPattern.empty()) // we haven't set anything yet!
	    {
	      	lastErrorMessage = limit->lastError();
		compiled = 0;
		return false;
	    }
	  limit->set(prevPattern.get(), case_sensitive); // Go back a step
	  Add(limit);
	  limit = new HtRegex;
	  currentPattern = transformedLimits;
	  if (!limit->set(currentPattern.get(), case_sensitive))
	    {
	      	lastErrorMessage = limit->lastError();
		compiled = 0;
		return false;
	    }
	}
      prevPattern = currentPattern;
    }
  Add(limit); // OK, we're done so just add the last compiled pattern
  
  compiled = 1;
  return true;
}

int
HtRegexList::match(const char * str, int nullpattern, int nullstr)
{
  HtRegex *regx;
	
  if (compiled == 0) return(nullpattern);
  if (str == NULL) return(nullstr);
  if (strlen(str) <= 0) return(nullstr);

  if (number == 0) return(1);	// An empty pattern matches everything

  Start_Get();
  while ((regx = (HtRegex *) Get_Next()))
    {
      if (regx->match(str, nullpattern, nullstr))
	{
	  // Move this one to the front and update pointers
  	  if (cursor.current_index != -1)
  	    {
  	      if (cursor.prev)
  		cursor.prev->next = cursor.current->next;
  	      cursor.prev = 0;
  	      cursor.current->next = head;
  	      head = cursor.current;
  	      cursor.current = head;
  	      cursor.current_index = -1;
  	    }
	  return(1);
	}
    }

  return(0);
}