From 98e1e01b60e129ae5505bba4a6c3312783b48d20 Mon Sep 17 00:00:00 2001 From: Karl Williamson Date: Thu, 6 Sep 2012 10:01:38 -0600 Subject: [PATCH 1/1] regcomp.c: Wrap some long lines --- regcomp.c | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) diff --git a/regcomp.c b/regcomp.c index 6edfb1c..a508ce2 100644 --- a/regcomp.c +++ b/regcomp.c @@ -7013,9 +7013,10 @@ S_reg_scan_name(pTHX_ RExC_state_t *pRExC_state, U32 flags) * list.) * Taking the complement (inverting) an inversion list is quite simple, if the * first element is 0, remove it; otherwise add a 0 element at the beginning. - * This implementation reserves an element at the beginning of each inversion list - * to contain 0 when the list contains 0, and contains 1 otherwise. The actual - * beginning of the list is either that element if 0, or the next one if 1. + * This implementation reserves an element at the beginning of each inversion + * list to contain 0 when the list contains 0, and contains 1 otherwise. The + * actual beginning of the list is either that element if 0, or the next one if + * 1. * * More about inversion lists can be found in "Unicode Demystified" * Chapter 13 by Richard Gillam, published by Addison-Wesley. -- 1.8.3.1