diff options
| author | Oskari Timperi <oskari.timperi@iki.fi> | 2014-01-07 14:47:05 +0200 |
|---|---|---|
| committer | Oskari Timperi <oskari.timperi@iki.fi> | 2014-01-07 14:47:05 +0200 |
| commit | 522b066870988b60b67efcc118cc1a33c9e35547 (patch) | |
| tree | ef6149a972f09cec0b904a50fcfacf21b8072c69 /TRexpp.h | |
| parent | 0fd92fe3ad425d87c3647a3b51fbd2204e1fb1d2 (diff) | |
| download | tiny-rex-522b066870988b60b67efcc118cc1a33c9e35547.tar.gz tiny-rex-522b066870988b60b67efcc118cc1a33c9e35547.zip | |
strip spaces
Diffstat (limited to 'TRexpp.h')
| -rw-r--r-- | TRexpp.h | 24 |
1 files changed, 12 insertions, 12 deletions
@@ -5,11 +5,11 @@ Copyright (C) 2003-2004 Alberto Demichelis - This software is provided 'as-is', without any express - or implied warranty. In no event will the authors be held + This software is provided 'as-is', without any express + or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. - Permission is granted to anyone to use this software for + Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: @@ -38,28 +38,28 @@ public: TRexpp() { _exp = (TRex *)0; } ~TRexpp() { CleanUp(); } // compiles a regular expression - void Compile(const TRexChar *pattern) { + void Compile(const TRexChar *pattern) { const TRexChar *error; CleanUp(); if(!(_exp = trex_compile(pattern,&error))) throw TRexParseException(error); } // return true if the given text match the expression - bool Match(const TRexChar* text) { - return _exp?(trex_match(_exp,text) != 0):false; + bool Match(const TRexChar* text) { + return _exp?(trex_match(_exp,text) != 0):false; } // Searches for the first match of the expression in a zero terminated string - bool Search(const TRexChar* text, const TRexChar** out_begin, const TRexChar** out_end) { - return _exp?(trex_search(_exp,text,out_begin,out_end) != 0):false; + bool Search(const TRexChar* text, const TRexChar** out_begin, const TRexChar** out_end) { + return _exp?(trex_search(_exp,text,out_begin,out_end) != 0):false; } // Searches for the first match of the expression in a string sarting at text_begin and ending at text_end - bool SearchRange(const TRexChar* text_begin,const TRexChar* text_end,const TRexChar** out_begin, const TRexChar** out_end) { - return _exp?(trex_searchrange(_exp,text_begin,text_end,out_begin,out_end) != 0):false; + bool SearchRange(const TRexChar* text_begin,const TRexChar* text_end,const TRexChar** out_begin, const TRexChar** out_end) { + return _exp?(trex_searchrange(_exp,text_begin,text_end,out_begin,out_end) != 0):false; } bool GetSubExp(int n, const TRexChar** out_begin, int *out_len) { TRexMatch match; - TRexBool res = _exp?(trex_getsubexp(_exp,n,&match)):TRex_False; + TRexBool res = _exp?(trex_getsubexp(_exp,n,&match)):TRex_False; if(res) { *out_begin = match.begin; *out_len = match.len; @@ -72,4 +72,4 @@ private: void CleanUp() { if(_exp) trex_free(_exp); _exp = (TRex *)0; } TRex *_exp; }; -#endif //_TREXPP_H_
\ No newline at end of file +#endif //_TREXPP_H_ |
