5389 |
AUTHOR |
AUTHOR |
5390 |
|
|
5391 |
The C++ wrapper was contributed by Google Inc. |
The C++ wrapper was contributed by Google Inc. |
5392 |
Copyright (c) 2006 Google Inc. |
Copyright (c) 2007 Google Inc. |
5393 |
|
|
5394 |
|
|
5395 |
REVISION |
REVISION |
5525 |
ter. For a long string, a lot of stack is required. Consider now this |
ter. For a long string, a lot of stack is required. Consider now this |
5526 |
rewritten pattern, which matches exactly the same strings: |
rewritten pattern, which matches exactly the same strings: |
5527 |
|
|
5528 |
([^<]++|<(?!inet)) |
([^<]++|<(?!inet))+ |
5529 |
|
|
5530 |
This uses very much less stack, because runs of characters that do not |
This uses very much less stack, because runs of characters that do not |
5531 |
contain "<" are "swallowed" in one item inside the parentheses. Recur- |
contain "<" are "swallowed" in one item inside the parentheses. Recur- |
5587 |
|
|
5588 |
REVISION |
REVISION |
5589 |
|
|
5590 |
Last updated: 06 March 2007 |
Last updated: 12 March 2007 |
5591 |
Copyright (c) 1997-2007 University of Cambridge. |
Copyright (c) 1997-2007 University of Cambridge. |
5592 |
------------------------------------------------------------------------------ |
------------------------------------------------------------------------------ |
5593 |
|
|