amxmodx/modules/regex/CRegEx.h

77 lines
2.0 KiB
C
Raw Normal View History

// vim: set ts=4 sw=4 tw=99 noet:
//
// AMX Mod X, based on AMX Mod by Aleksander Naszko ("OLO").
// Copyright (C) The AMX Mod X Development Team.
//
// This software is licensed under the GNU General Public License, version 3 or higher.
// Additional exceptions apply. For full license details, see LICENSE.txt or visit:
// https://alliedmods.net/amxmodx-license
//
// Regular Expressions Module
//
2004-10-05 07:17:49 +00:00
#ifndef _INCLUDE_CREGEX_H
#define _INCLUDE_CREGEX_H
2015-09-30 17:08:39 +00:00
#include <amtl/am-vector.h>
#include <amtl/am-string.h>
2014-07-17 09:20:52 +00:00
/**
* Maximum number of sub-patterns, here 50 (this should be a multiple of 3).
*/
#define REGEX_MAX_SUBPATTERNS 150
/**
* Flags to used with regex_replace, to control the replacement behavior.
*/
#define REGEX_FORMAT_DEFAULT 0 // Uses the standard formatting rules to replace matches.
#define REGEX_FORMAT_NOCOPY 1 // The sections that do not match the regular expression are not copied when replacing matches.
#define REGEX_FORMAT_FIRSTONLY 2 // Only the first occurrence of a regular expression is replaced.
2004-10-05 07:17:49 +00:00
class RegEx
{
public:
struct RegExSub {
int start, end;
};
2014-07-17 09:20:52 +00:00
struct NamedGroup {
ke::AString name;
size_t index;
};
2004-10-05 07:17:49 +00:00
RegEx();
~RegEx();
2004-10-05 07:17:49 +00:00
bool isFree(bool set=false, bool val=false);
void Clear();
int Compile(const char *pattern, const char* flags = NULL);
int Compile(const char *pattern, int iFlags);
2004-10-05 07:17:49 +00:00
int Match(const char *str);
int MatchAll(const char *str);
2014-07-17 09:20:52 +00:00
int Replace(char *text, size_t text_maxlen, const char *replace, size_t replaceLen, int flags = 0);
void ClearMatch();
2014-07-17 09:20:52 +00:00
const char *GetSubstring(size_t start, char buffer[], size_t max, size_t *outlen = NULL);
void MakeSubpatternsTable(int numSubpatterns);
2004-10-05 07:17:49 +00:00
public:
int mErrorOffset;
const char *mError;
int Count() { return mSubStrings.length(); }
2004-10-05 07:17:49 +00:00
private:
pcre *re;
bool mFree;
2014-07-17 09:20:52 +00:00
int ovector[REGEX_MAX_SUBPATTERNS];
2004-10-05 07:17:49 +00:00
char *subject;
ke::Vector<RegExSub> mSubStrings;
2014-07-17 09:20:52 +00:00
ke::Vector<size_t> mMatchesSubs;
ke::Vector<NamedGroup> mSubsNameTable;
int mNumSubpatterns;
2004-10-05 07:17:49 +00:00
};
2004-10-05 08:13:55 +00:00
#endif //_INCLUDE_CREGEX_H