Enter your search terms GNU-Darwin Web Submit search form

pcre++.h Go to the documentation of this file. /* * * $Id: pcre++.h,v 1.1.1.1 2001/12/30 04:01:36 zarahg Exp $ * * This file is part of the PCRE++ Class Library. * * By accessing this software, PCRE++, you are duly informed * of and agree to be bound by the conditions described below * in this notice: * * This software product, PCRE++, is developed by Thomas Linden * and copyrighted (C) 2002 by Thomas Linden, with all rights * reserved. * * There is no charge for PCRE++ software. You can redistribute * it and/or modify it under the terms of the GNU Lesser General * Public License, which is incorporated by reference herein. * * PCRE++ is distributed WITHOUT ANY WARRANTY, IMPLIED OR EXPRESS, * OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE or that * the use of it will not infringe on any third party's intellec- * tual property rights. * * You should have received a copy of the GNU Lesser General Public * License along with PCRE++. Copies can also be obtained from: * * http://www.gnu.org/licenses/lgpl.txt * * or by writing to: * * Free Software Foundation, Inc. * 59 Temple Place, Suite 330 * Boston, MA 02111-1307 * USA * * Or contact: * * "Thomas Linden" <tom@daemon.de> * * */ #ifndef HAVE_PCRE_PP_H #define HAVE_PCRE_PP_H #include <string> #include <sstream> #include <vector> #include <stdexcept> extern "C" { #include <pcre.h> } using namespace std; typedef vector<string> Array; typedef vector<string>::iterator ArrayIterator; class Pcre { private: string _expression; /* the given regular expression */ unsigned int _flags; /* the given flags, 0 if not defined */ bool case_t, global_t; /* internal compile flags, used by replace() and split() */ pcre *p_pcre; /* pcre object pointer */ pcre_extra *p_pcre_extra; /* stuff required by pcre lib */ int sub_len; int *sub_vec; int erroffset; char *err_str; Array *resultset; /* store substrings, if any */ /* reset all counters and free objects, prepare for another search */ void reset(); /* compile the pattern */ void Compile(int flags); /* do the actual search, will be called by the public ::search(..) methods */ bool dosearch(const string& stuff, int OffSet); /* do the actual split() job, called by the various wrapper split() methods */ Array _split(const string& piece, int limit, int start_offset, int end_offset); /* replace $1 .. $n with the corresponding substring, used by replace() */ string _replace_vars(const string& piece); /* init pointers with NULL */ void Pcre::zero(); public: class exception : public runtime_error { private: string translate(int num) { string msg; switch(num) { case -1: msg = "PCRE_ERROR_NOMATCH"; break; case -2: msg = "PCRE_ERROR_NULL"; break; case -3: msg = "PCRE_ERROR_BADOPTION"; break; case -4: msg = "PCRE_ERROR_BADMAGIC"; break; case -5: msg = "PCRE_ERROR_UNKNOWN_NODE"; break; case -6: msg = "PCRE_ERROR_NOMEMORY"; break; case -7: msg = "PCRE_ERROR_NOSUBSTRING"; break; } return msg; } public: exception(const string & msg) : runtime_error(msg) { } exception(int num) : runtime_error(translate(num)) { } }; bool did_match; int num_matches; Pcre(); Pcre(const string& expression); Pcre(const string& expression, const string& flags); Pcre(const Pcre &P); const Pcre& operator = (const string& expression); const Pcre& operator = (const Pcre &P); ~Pcre(); bool search(const string& stuff); bool search(const string& stuff, int OffSet); Array* get_sub_strings(); string get_match(int pos); int get_match_start(int pos); int get_match_end(int pos); int get_match_start(); int get_match_end(); size_t get_match_length(int pos); bool matched() { return did_match; }; int matches() { return num_matches; }; Array split(const string& piece); Array split(const string& piece, int limit); Array split(const string& piece, int limit, int start_offset); Array split(const string& piece, int limit, int start_offset, int end_offset); Array split(const string& piece, vector<int> positions); string replace(const string& piece, const string& with); }; #endif