python - Match a continuously repeated backreference in a given times and no more -

-

in simplified case, want extract repeated number(3 times) input string, 3 times , no more.

#match backreference(\d here) 2 more times #11222(333)34445 matched , consumed,  #then current position moves 11222333^34445 in [3]: re.findall(r'(\d)\1{2}','1122233334445') out[3]: ['2', '3', '4']  #try exclude 11222(333)34445 setting non-backreference(?!\1) #as negative lookahead assertion, skips match of  #11222^(333)34445, captured in next position #112223^(333)4445 in [4]: re.findall(r'(\d)\1{2}(?!\1)','1122233334445') out[4]: ['2', '3', '4']  #backreference cannot go before referenced group in [5]: re.findall(r'(?!\1)(\d)\1{2}(?!\1)','1122233334445') --------------------------------------------------------------------------- error                                     traceback (most recent call last) <ipython-input-5-a5837badf5bb> in <module>() ----> 1 re.findall(r'(?!\1)(\d)\1{2}(?!\1)','1122233334445')  /usr/lib/python2.7/re.pyc in findall(pattern, string, flags)     179      180     empty matches included in result.""" --> 181     return _compile(pattern, flags).findall(string)     182      183 if sys.hexversion >= 0x02020000:  /usr/lib/python2.7/re.pyc in _compile(*key)     249         p = sre_compile.compile(pattern, flags)     250     except error, v: --> 251         raise error, v # invalid expression     252     if not bypass_cache:     253         if len(_cache) >= _maxcache:  error: bogus escape: '\\1'

but expect ['2','4'].

thank you.

you'd need backreference in lookbehind find borders between different digits, before matching sequence without consuming little supported among regex flavors. (\d)(?<!\1.)\1{2}(?!\1) works in .net not in python obviously.

an idea use the great trick @hwnd commented. of great performance downside of getting dispensable elements. idea find boundary between 2 different digits requirement capture inside lookbehind:

(?:^|(?<=(\d))(?!\1))(\d)\2{2}(?!\2)
  • (?:^|(?<=(\d))(?!\1)) part lookbehind finding boundaries between different digits.
  • (\d)\2{2}(?!\2) 2nd capture-group captures digit \2. followed same digit @ least 2x - using negative lookahead not being followed same digit again.

this should give accurate matches requires more steps parser. see test @ regex101.


Comments

Post a Comment

Popular posts from this blog

php - Zend Framework / Skeleton-Application / Composer install issue -

-
i trying create zend framework application using skeleton in netbeans. when run composer install, following error message: "c:\php\php.exe" "c:\composer\composer.phar" "--ansi" "--no-interaction" "update" "--dev" using deprecated option "dev". dev packages installed default now. loading composer repositories package information updating dependencies (including require-dev) requirements not resolved installable set of packages. problem 1 - package requires php >=5.5 php version (5.4.42) not satisfy requirement. problem 2 - installation request zendframework/zendframework 2.5.1 -> satisfiable zendframework/zendframework[2.5.1]. - zendframework/zendframework 2.5.1 requires php >=5.5 -> php version (5.4.42) not satisfy requirement. done. apparently, zend framework only needs php 5.3+ contradicts above. need use php 5.4. my composer.json following: { "name": "
Read more

c# - Better 64-bit byte array hash -

-
i need hash algorithm produces 64-bit hash code ( long ) fewer collisions string.gethashcode() , fast (no expensive calls cryptographic functions). here's implementation of fnv still shows 3% of collisions after testing 2 million random strings. need number way lower. void main() { const string chars = "abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz!#@$%^&*()_+}{\":?><,./;'[]0123456789\\"; const int n = 2000000; var random = new random(); var hashes = new hashset<long>(); int collisions = 0; for(int = 0; < n; i++) { var len = random.next(chars.length); var str = new char[len]; (int j = 0; j < len; j++) { str[j] = chars[random.next(chars.length)]; } var s = new string(str); if(!hashes.add(get64bithash( s ))) collisions++; } console.writeline("collision percentage after " + n + " random strings: " + ((doubl
Read more

python - PyCharm Type error Message -

-
i'm newbie trying out ml/dbn in python (3.4) under pycharm (comm.ed 4.5). following definition def make_thetas(xmin,xmax,n): xs = np.linespace(xmin,xmax,n) widths = (xs[1:] - xs[:-1])/2.0 thetas = xs[:-1] + widths return thetas throws error "class 'tuple' not define ' sub ', '-' operator cannot used on instance" on - operator on third line (widths = ....) ideas on how code running under pycharm - works alright in interactive python window. thx. to all, after g'g lot have found workaround seems work within pycharm. workaround because (even python newbie) expected python not need explicit typecasting, not when using datatypes imported lib such numpy. def make_thetas(xmin,xmax,n): xs = np.array(np.linspace(xmin,xmax,n)) widths = (xs[1:] - xs[:-1])/2.0 thetas = xs[:-1]+ widths return thetas using docstrings type-hinting such below did not work def make_thetas(xmin,xmax,n): "&q
Read more