Logo Search packages:      
Sourcecode: dansguardian version File versions  Download package


// RegExp class - search text using regular expressions

//Please refer to http://dansguardian.org/?page=copyright2
//for the license for this code.
//Written by Daniel Barron (daniel@// jadeb.com).
//For support go to http://groups.yahoo.com/group/dansguardian

//  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 2 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
//  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, write to the Free Software
//  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

#ifndef __HPP_REGEXP
#define __HPP_REGEXP


#include <sys/types.h>        // needed for size_t used in regex.h

#ifdef HAVE_PCRE
#include <pcreposix.h>
#include <regex.h>

#include <string>
#include <deque>


class RegExp
      // constructor - set sensible defaults
      // destructor - delete regexp if compiled
      // copy constructor
      RegExp(const RegExp & r);
      // compile the given regular expression
      bool comp(const char *exp);
      // match the given text against the pre-compiled expression
      bool match(const char *text);
      // how many matches did the last run generate?
      int numberOfMatches();
      // did it generate any at all?
      bool matched();
      // the i'th match from the last run
      std::string result(int i);
      // position of the i'th match in the overall text
      unsigned int offset(int i);
      // length of the i'th match
      unsigned int length(int i);
      // faster equivalent of STL::Search
      char *search(char *file, char *fileend, char *phrase, char *phraseend);

      // the match results, their positions in the text & their lengths
      std::deque<std::string> results;
      std::deque<unsigned int> offsets;
      std::deque<unsigned int> lengths;

      // have we matched something yet?
      bool imatched;

      // the expression itself
      regex_t reg;
      // whether it's been pre-compiled
      bool wascompiled;
      // the uncompiled form of the expression (checkme: is this only used
      // for debugging purposes?)
      std::string searchstring;


Generated by  Doxygen 1.6.0   Back to index