More Windows build fix.
3 * =============================================================================
4 * SourceMod Regular Expressions Extension
5 * Copyright (C) 2004-2008 AlliedModders LLC. All rights reserved.
6 * =============================================================================
8 * This program is free software; you can redistribute it and/or modify it under
9 * the terms of the GNU General Public License, version 3.0, as published by the
10 * Free Software Foundation.
12 * This program is distributed in the hope that it will be useful, but WITHOUT
13 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
14 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
17 * You should have received a copy of the GNU General Public License along with
18 * this program. If not, see <http://www.gnu.org/licenses/>.
20 * As a special exception, AlliedModders LLC gives you permission to link the
21 * code of this program (as well as its derivative works) to "Half-Life 2," the
22 * "Source Engine," the "SourcePawn JIT," and any Game MODs that run on software
23 * by the Valve Corporation. You must obey the GNU General Public License in
24 * all respects for all other code used. Additionally, AlliedModders LLC grants
25 * this exception to all derivative works. AlliedModders LLC defines further
26 * exceptions, found in LICENSE.txt (as of this writing, version JULY-31-2007),
27 * or <http://www.sourcemod.net/license.php>.
36 #include <sh_string.h>
37 #include "extension.h"
68 bool RegEx::isFree(bool set, bool val)
79 int RegEx::Compile(const char *pattern, int iFlags)
84 re = pcre_compile(pattern, iFlags, &mError, &mErrorOffset, NULL);
96 int RegEx::Match(const char *str)
100 if (mFree || re == NULL)
106 subject = new char[strlen(str)+1];
107 strcpy(subject, str);
109 rc = pcre_exec(re, NULL, subject, (int)strlen(subject), 0, 0, ovector, 30);
113 if (rc == PCRE_ERROR_NOMATCH)
126 void RegEx::ClearMatch()
128 // Clears match results
137 const char *RegEx::GetSubstring(int s, char buffer[], int max)
140 if (s >= mSubStrings || s < 0)
143 char *substr_a = subject + ovector[2*s];
144 int substr_l = ovector[2*s+1] - ovector[2*s];
146 for (i = 0; i<substr_l; i++)
150 buffer[i] = substr_a[i];