r46103 - in /trunk/liblist-moreutils-perl: Changes META.yml MoreUtils.xs README debian/changelog lib/List/MoreUtils.pm t/List-MoreUtils.t

gregoa at users.alioth.debian.org gregoa at users.alioth.debian.org
Mon Oct 19 21:15:37 UTC 2009


Author: gregoa
Date: Mon Oct 19 21:15:29 2009
New Revision: 46103

URL: http://svn.debian.org/wsvn/pkg-perl/?sc=1&rev=46103
Log:
New upstream release (closes: #546632).

Modified:
    trunk/liblist-moreutils-perl/Changes
    trunk/liblist-moreutils-perl/META.yml
    trunk/liblist-moreutils-perl/MoreUtils.xs
    trunk/liblist-moreutils-perl/README
    trunk/liblist-moreutils-perl/debian/changelog
    trunk/liblist-moreutils-perl/lib/List/MoreUtils.pm
    trunk/liblist-moreutils-perl/t/List-MoreUtils.t

Modified: trunk/liblist-moreutils-perl/Changes
URL: http://svn.debian.org/wsvn/pkg-perl/trunk/liblist-moreutils-perl/Changes?rev=46103&op=diff
==============================================================================
--- trunk/liblist-moreutils-perl/Changes (original)
+++ trunk/liblist-moreutils-perl/Changes Mon Oct 19 21:15:29 2009
@@ -1,4 +1,16 @@
 Revision history for Perl extension List::Any/List::MoreUtils.
+
+0.25_02 Sat Aug  1 06:41:55 EDT 2009
+        - MS VC++ 7 doesn't like inline nor 'long long'
+          (patch provided by Taro Nishino (taro DOT nishino AT gmail.com)
+        - Newx isbn't around in older perls so use New(0,...) instead
+
+0.25_01 Thu Jul 30 17:43:20 EDT 2009 
+        - it seems the only way of handling the stack that works on all 
+          flavors of the multicall API is by making a shallow copy of it
+          and use that between the PUSH/POP_MULTICALL bracket
+        - fix awkward ok() override in List-MoreUtils.t so that it reports
+          line numbers in test failures properly
 
 0.24  Sun Jul 19 08:26:35 EDT 2009
         - List::MoreUtils was not handling the stack properly when the stack was grown

Modified: trunk/liblist-moreutils-perl/META.yml
URL: http://svn.debian.org/wsvn/pkg-perl/trunk/liblist-moreutils-perl/META.yml?rev=46103&op=diff
==============================================================================
--- trunk/liblist-moreutils-perl/META.yml (original)
+++ trunk/liblist-moreutils-perl/META.yml Mon Oct 19 21:15:29 2009
@@ -1,6 +1,6 @@
 --- #YAML:1.0
 name:               List-MoreUtils
-version:            0.24
+version:            0.25_02
 abstract:           Provide the stuff missing in List::Util
 author:
     - Tassilo von Parseval <tassilo.von.parseval at rwth-aachen.de>

Modified: trunk/liblist-moreutils-perl/MoreUtils.xs
URL: http://svn.debian.org/wsvn/pkg-perl/trunk/liblist-moreutils-perl/MoreUtils.xs?rev=46103&op=diff
==============================================================================
--- trunk/liblist-moreutils-perl/MoreUtils.xs (original)
+++ trunk/liblist-moreutils-perl/MoreUtils.xs Mon Oct 19 21:15:29 2009
@@ -155,7 +155,13 @@
 
 #define FUNC_NAME GvNAME(GvEGV(ST(items)))
 
-inline static int 
+#ifdef _MSC_VER
+#   define INLINE
+#else
+#   define INLINE inline
+#endif
+
+INLINE static int 
 in_pad (const char *name, SV *code) {
 
     GV *gv;
@@ -243,6 +249,24 @@
 	SvREFCNT_dec(what);
 
 }
+
+#define dSTACK                                  \
+    SV **args
+
+#define STA(i)  args[i]
+
+#define COPY_STACK                              \
+    New(0, args, items, SV*);                     \
+    Copy(&PL_stack_base[ax], args, items, SV*)
+    
+#define FREE_STACK                              \
+    Safefree(args)
+
+#define FREE_STACK_REFRESH(n)                   \
+    EXTEND(SP, n);                              \
+    Copy(args, &PL_stack_base[ax], n, SV*);     \
+    FREE_STACK
+
    
 MODULE = List::MoreUtils		PACKAGE = List::MoreUtils		
 
@@ -252,7 +276,8 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
+
     register int i;
     GV *gv;
     HV *stash;
@@ -261,20 +286,24 @@
 
     if (items <= 1)
 	XSRETURN_UNDEF;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
 	    
     for(i = 1 ; i < items ; ++i) {
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
 	if (SvTRUE(*PL_stack_sp)) {
 	    POP_MULTICALL;
+            FREE_STACK;
 	    XSRETURN_YES;
 	}
     }
     POP_MULTICALL;
+    FREE_STACK;
     XSRETURN_NO;
 }
 
@@ -284,7 +313,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -293,20 +322,24 @@
 
     if (items <= 1)
 	XSRETURN_UNDEF;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
  
     for(i = 1 ; i < items ; i++) {
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
 	if (!SvTRUE(*PL_stack_sp)) {
 	    POP_MULTICALL;
+            FREE_STACK;
 	    XSRETURN_NO;
 	}
     }
     POP_MULTICALL;
+    FREE_STACK;
     XSRETURN_YES;
 }
 
@@ -317,7 +350,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -326,20 +359,24 @@
 
     if (items <= 1)
 	XSRETURN_YES;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
 
     for(i = 1 ; i < items ; ++i) {
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
 	if (SvTRUE(*PL_stack_sp)) {
 	    POP_MULTICALL;
+            FREE_STACK;
 	    XSRETURN_NO;
 	}
     }
     POP_MULTICALL;
+    FREE_STACK;
     XSRETURN_YES;
 }
 
@@ -349,7 +386,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -358,20 +395,24 @@
 
     if (items <= 1)
 	XSRETURN_UNDEF;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
 	    
     for(i = 1 ; i < items ; ++i) {
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
 	if (!SvTRUE(*PL_stack_sp)) {
 	    POP_MULTICALL;
+            FREE_STACK;
 	    XSRETURN_YES;
 	}
     }
     POP_MULTICALL;
+    FREE_STACK;
     XSRETURN_NO;
 }
 
@@ -381,7 +422,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -391,18 +432,21 @@
 
     if (items <= 1)
 	goto done;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
 
     for(i = 1 ; i < items ; ++i) {
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
 	if (SvTRUE(*PL_stack_sp)) 
 	    count++;
     }
     POP_MULTICALL;
+    FREE_STACK;
 
     done:
     RETVAL = count;
@@ -416,7 +460,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -426,18 +470,21 @@
 
     if (items <= 1)
 	goto done;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
 
     for(i = 1 ; i < items ; ++i) {
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
 	if (!SvTRUE(*PL_stack_sp)) 
 	    count++;
     }
     POP_MULTICALL;
+    FREE_STACK;
 
     done:
     RETVAL = count;
@@ -451,7 +498,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -461,12 +508,15 @@
     RETVAL = -1;
     
     if (items > 1) {
+
+        COPY_STACK;
+
 	cv = sv_2cv(code, &stash, &gv, 0);
 	PUSH_MULTICALL(cv);
 	SAVESPTR(GvSV(PL_defgv));
  
 	for (i = 1 ; i < items ; ++i) {
-	    GvSV(PL_defgv) = PL_stack_base[ax+i];
+	    GvSV(PL_defgv) = STA(i);
 	    MULTICALL;
 	    if (SvTRUE(*PL_stack_sp)) {
 		RETVAL = i-1;
@@ -474,6 +524,7 @@
 	    }
 	}
 	POP_MULTICALL;
+        FREE_STACK;
     }
 }
 OUTPUT:
@@ -485,7 +536,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -495,12 +546,15 @@
     RETVAL = -1;
     
     if (items > 1) {
+
+        COPY_STACK;
+
 	cv = sv_2cv(code, &stash, &gv, 0);
 	PUSH_MULTICALL(cv);
 	SAVESPTR(GvSV(PL_defgv));
  
 	for (i = items-1 ; i > 0 ; --i) {
-	    GvSV(PL_defgv) = PL_stack_base[ax+i];
+	    GvSV(PL_defgv) = STA(i);
 	    MULTICALL;
 	    if (SvTRUE(*PL_stack_sp)) {
 		RETVAL = i-1;
@@ -508,6 +562,7 @@
 	    }
 	}
 	POP_MULTICALL;
+        FREE_STACK;
     }
 }
 OUTPUT:
@@ -605,7 +660,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -615,17 +670,20 @@
     
     if (items <= 1)
 	XSRETURN_EMPTY;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
 	    
     for(i = 1 ; i < items ; ++i) {
-	GvSV(PL_defgv) = newSVsv(PL_stack_base[ax+i]);
+	GvSV(PL_defgv) = newSVsv(STA(i));
 	MULTICALL;
-        PL_stack_base[ax+i-1] = GvSV(PL_defgv);
+        STA(i-1) = GvSV(PL_defgv);
     }
     POP_MULTICALL;
+    FREE_STACK_REFRESH(items-1);
 
     done:
     XSRETURN(items-1);
@@ -637,8 +695,8 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
-    register int i, j;
+    dMULTICALL; dSTACK;
+    register int i, j, k;
     HV *stash;
     CV *cv;
     GV *gv;
@@ -646,13 +704,15 @@
 
     if (items <= 1)
 	XSRETURN_EMPTY;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
 
     for (i = 1; i < items; i++) {
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
 	if (SvTRUE(*PL_stack_sp)) {
 	    break;
@@ -661,10 +721,12 @@
 
     POP_MULTICALL;
 
-    for (j = i + 1; j < items; ++j)
-	PL_stack_base[ax+j-i-1] = PL_stack_base[ax+j];
-
-    XSRETURN(items-i-1);
+    for (j = i + 1, k = 0; j < items; ++j, ++k)
+	STA(k) = STA(j);
+
+    FREE_STACK_REFRESH(k);
+
+    XSRETURN(k);
 }
 
 void
@@ -673,8 +735,8 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
-    register int i, j;
+    dMULTICALL; dSTACK;
+    register int i, j, k;
     HV *stash;
     CV *cv;
     GV *gv;
@@ -682,13 +744,15 @@
 
     if (items <= 1)
 	XSRETURN_EMPTY;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
 
     for (i = 1; i < items; i++) {
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
 	if (SvTRUE(*PL_stack_sp)) {
 	    break;
@@ -697,10 +761,12 @@
 
     POP_MULTICALL;
 
-    for (j = i; j < items; j++)
-	PL_stack_base[ax+j-i] = PL_stack_base[ax+j];
-
-    XSRETURN(items-i);
+    for (j = i, k = 0; j < items; ++j, ++k)
+        STA(k) = STA(j);
+
+    FREE_STACK_REFRESH(k);
+
+    XSRETURN(k);
 }
 
 void
@@ -709,7 +775,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -718,22 +784,26 @@
     
     if (items <= 1)
 	XSRETURN_EMPTY;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
 
     for (i = 1; i < items; i++) {
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
 	if (SvTRUE(*PL_stack_sp)) {
 	    break;
 	}
-	PL_stack_base[ax+i-1] = PL_stack_base[ax+i];
+        STA(i-1) = STA(i);
     }
 
     POP_MULTICALL;
 
+    FREE_STACK_REFRESH(i-1);
+
     XSRETURN(i-1);
 }
 
@@ -743,7 +813,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -752,15 +822,17 @@
 
     if (items <= 1)
 	XSRETURN_EMPTY;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
 
     for (i = 1; i < items; ++i) {
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
-	PL_stack_base[ax+i-1] = PL_stack_base[ax+i];
+	STA(i-1) = STA(i);
 	if (SvTRUE(*PL_stack_sp)) {
 	    ++i;
 	    break;
@@ -769,6 +841,8 @@
 
     POP_MULTICALL;
 
+    FREE_STACK_REFRESH(i-1);
+
     XSRETURN(i-1);
 }
 
@@ -778,7 +852,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i, j;
     HV *stash;
     GV *gv;
@@ -787,21 +861,24 @@
 
     if (items <= 1)
 	XSRETURN_EMPTY;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
     SAVESPTR(GvSV(PL_defgv));
     
     for (i = 1, j = 0; i < items; i++) {
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
 	if (SvTRUE(*PL_stack_sp)) {
-	    PL_stack_base[ax+j] = newSViv(i-1);
-	    j++;
+	    STA(j++) = newSViv(i-1);
 	}
     }
 
     POP_MULTICALL;
+
+    FREE_STACK_REFRESH(j);
 
     for (i = 0; i < j; ++i)
         sv_2mortal(PL_stack_base[ax+i]);
@@ -815,7 +892,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -825,20 +902,24 @@
     RETVAL = &PL_sv_undef;
     
     if (items > 1) {
+
+        COPY_STACK;
+
 	cv = sv_2cv(code, &stash, &gv, 0);
 	PUSH_MULTICALL(cv);
 	SAVESPTR(GvSV(PL_defgv));
 
 	for (i = items-1 ; i > 0 ; --i) {
-	    GvSV(PL_defgv) = PL_stack_base[ax+i];
+	    GvSV(PL_defgv) = STA(i);
 	    MULTICALL;
 	    if (SvTRUE(*PL_stack_sp)) {
 		/* POP_MULTICALL further down will decrement it by one */
-		SvREFCNT_inc(RETVAL = PL_stack_base[ax+i]);
+		SvREFCNT_inc(RETVAL = STA(i));
 		break;
 	    }
 	}
 	POP_MULTICALL;
+        FREE_STACK;
     }
 }
 OUTPUT:
@@ -850,7 +931,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i;
     HV *stash;
     GV *gv;
@@ -860,20 +941,24 @@
     RETVAL = &PL_sv_undef;
     
     if (items > 1) {
+
+        COPY_STACK;
+
 	cv = sv_2cv(code, &stash, &gv, 0);
 	PUSH_MULTICALL(cv);
 	SAVESPTR(GvSV(PL_defgv));
 
 	for (i = 1; i < items; ++i) {
-	    GvSV(PL_defgv) = PL_stack_base[ax+i];
+	    GvSV(PL_defgv) = STA(i);
 	    MULTICALL;
 	    if (SvTRUE(*PL_stack_sp)) {
 		/* POP_MULTICALL further down will decrement it by one */
-		SvREFCNT_inc(RETVAL = PL_stack_base[ax+i]);
+		SvREFCNT_inc(RETVAL = STA(i));
 		break;
 	    }
 	}
 	POP_MULTICALL;
+        FREE_STACK;
     }
 }
 OUTPUT:
@@ -1300,7 +1385,7 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     register int i, j;
     HV *stash;
     GV *gv;
@@ -1313,6 +1398,8 @@
     
     if (items == 1)
 	XSRETURN_EMPTY;
+
+    COPY_STACK;
 
     cv = sv_2cv(code, &stash, &gv, 0);
     PUSH_MULTICALL(cv);
@@ -1320,7 +1407,7 @@
 
     for(i = 1 ; i < items ; ++i) {
 	int idx;
-	GvSV(PL_defgv) = PL_stack_base[ax+i];
+	GvSV(PL_defgv) = STA(i);
 	MULTICALL;
 	idx = SvIV(*PL_stack_sp);
 
@@ -1335,11 +1422,12 @@
 	}
 	if (!tmp[idx])
 	    tmp[idx] = newAV();
-	av_push(tmp[idx], PL_stack_base[ax+i]);
-	SvREFCNT_inc(PL_stack_base[ax+i]);
+	av_push(tmp[idx], STA(i));
+	SvREFCNT_inc(STA(i));
     }
     POP_MULTICALL;
     SPAGAIN;
+    FREE_STACK;
 
     EXTEND(SP, last);
     for (i = 0; i < last; ++i) {
@@ -1428,17 +1516,19 @@
 PROTOTYPE: &@
 CODE:
 {
-    dMULTICALL;
+    dMULTICALL; dSTACK;
     HV *stash;
     GV *gv;
     CV *cv;
     I32 gimme = GIMME; /* perl-5.5.4 bus-errors out later when using GIMME 
                           therefore we save its value in a fresh variable */
 
-    register long long i, j;
+    register long i, j;
     int val = -1;
 
     if (items > 1) {
+
+        COPY_STACK;
 
 	cv = sv_2cv(code, &stash, &gv, 0);
 	PUSH_MULTICALL(cv);
@@ -1447,12 +1537,12 @@
         i = 0;
         j = items - 1;
         do {
-            long long k = ((double)(i + j)) / 2.0;
+            long k = ((double)(i + j)) / 2.0;
 
             if (k >= items-1)
                 break;
 
-            GvSV(PL_defgv) = PL_stack_base[ax+1+k];
+            GvSV(PL_defgv) = STA(1+k);
             MULTICALL;
             val = SvIV(*PL_stack_sp);
 
@@ -1460,7 +1550,8 @@
                 POP_MULTICALL;
                 if (gimme == G_SCALAR)
                     XSRETURN_YES;
-                SvREFCNT_inc(RETVAL = PL_stack_base[ax+1+k]);
+                SvREFCNT_inc(RETVAL = STA(1+k));
+                FREE_STACK;
                 goto yes;
             }
             if (val < 0) {
@@ -1470,6 +1561,7 @@
             }
         } while (i <= j);
         POP_MULTICALL;
+        FREE_STACK;
     }
 
     if (gimme == G_ARRAY)

Modified: trunk/liblist-moreutils-perl/README
URL: http://svn.debian.org/wsvn/pkg-perl/trunk/liblist-moreutils-perl/README?rev=46103&op=diff
==============================================================================
--- trunk/liblist-moreutils-perl/README (original)
+++ trunk/liblist-moreutils-perl/README Mon Oct 19 21:15:29 2009
@@ -1,5 +1,5 @@
-List-MoreUtils version 0.24
-===========================
+List-MoreUtils version 0.25_02
+==============================
 
 Provide the missing functionality from List::Util (see "SUGGESTED ADDITIONS" in
 its manpage).

Modified: trunk/liblist-moreutils-perl/debian/changelog
URL: http://svn.debian.org/wsvn/pkg-perl/trunk/liblist-moreutils-perl/debian/changelog?rev=46103&op=diff
==============================================================================
--- trunk/liblist-moreutils-perl/debian/changelog (original)
+++ trunk/liblist-moreutils-perl/debian/changelog Mon Oct 19 21:15:29 2009
@@ -1,3 +1,9 @@
+liblist-moreutils-perl (0.25~02-1) UNRELEASED; urgency=low
+
+  * New upstream release (closes: #546632).
+
+ -- gregor herrmann <gregoa at debian.org>  Mon, 19 Oct 2009 23:14:32 +0200
+
 liblist-moreutils-perl (0.24-1) unstable; urgency=low
 
   [ gregor herrmann ]

Modified: trunk/liblist-moreutils-perl/lib/List/MoreUtils.pm
URL: http://svn.debian.org/wsvn/pkg-perl/trunk/liblist-moreutils-perl/lib/List/MoreUtils.pm?rev=46103&op=diff
==============================================================================
--- trunk/liblist-moreutils-perl/lib/List/MoreUtils.pm (original)
+++ trunk/liblist-moreutils-perl/lib/List/MoreUtils.pm Mon Oct 19 21:15:29 2009
@@ -19,7 +19,7 @@
 
 @EXPORT_OK = ( @{ $EXPORT_TAGS{'all'} } );
 
-$VERSION = '0.24';
+$VERSION = '0.25_02';
 
 eval {
     local $ENV{PERL_DL_NONLAZY} = 0 if $ENV{PERL_DL_NONLAZY};
@@ -727,7 +727,7 @@
 
 =head1 VERSION
 
-This is version 0.22.
+This is version 0.25_01.
 
 =head1 BUGS
 

Modified: trunk/liblist-moreutils-perl/t/List-MoreUtils.t
URL: http://svn.debian.org/wsvn/pkg-perl/trunk/liblist-moreutils-perl/t/List-MoreUtils.t?rev=46103&op=diff
==============================================================================
--- trunk/liblist-moreutils-perl/t/List-MoreUtils.t (original)
+++ trunk/liblist-moreutils-perl/t/List-MoreUtils.t Mon Oct 19 21:15:29 2009
@@ -9,12 +9,13 @@
     local $^W = 0;
     *ok = sub ($;$$) {
         if (@_ == 1) {
-            skip(List::MoreUtils::_XScompiled() ? 0 : "XS portion not compiled", $_[0]);
+            @_ = (List::MoreUtils::_XScompiled() ? 0 : "XS portion not compiled", $_[0]);
         } elsif (@_ == 2) {
-            skip(List::MoreUtils::_XScompiled() ? 0 : "XS portion not compiled", $_[0], $_[1]);
+            @_ = (List::MoreUtils::_XScompiled() ? 0 : "XS portion not compiled", $_[0], $_[1]);
         } else {
-            skip(List::MoreUtils::_XScompiled() ? 0 : "XS portion not compiled", $_[0], $_[1], $_[2]);
+            @_ = (List::MoreUtils::_XScompiled() ? 0 : "XS portion not compiled", $_[0], $_[1], $_[2]);
         }
+        goto &skip;
     };
 }
 




More information about the Pkg-perl-cvs-commits mailing list