Jforrester has uploaded a new change for review. ( 
https://gerrit.wikimedia.org/r/386109 )

Change subject: build: Bump devDependencies to latest and make pass
......................................................................

build: Bump devDependencies to latest and make pass

 eslint-config-wikimedia   0.3.0  →   0.5.0
 grunt-contrib-clean       1.0.0  →   1.1.0
 grunt-eslint             19.0.0  →  20.1.0
 grunt-karma               1.0.0  →   2.0.0
 karma                     1.1.0  →   1.7.1
 karma-chrome-launcher     1.0.1  →   2.2.0
 karma-coverage            1.0.0  →   1.1.1
 karma-firefox-launcher    1.0.0  →   1.0.1
 karma-qunit               1.1.0  →   1.2.1
 qunitjs                  1.23.0  →   2.4.1

Change-Id: I5ce9c93e0241326a3bbb378c79dc32bfdc7da371
---
M package.json
M tests/unicodejs.characterclass.test.js
M tests/unicodejs.graphemebreak.test.js
M tests/unicodejs.test.js
M tests/unicodejs.wordbreak.test.js
5 files changed, 30 insertions(+), 21 deletions(-)


  git pull ssh://gerrit.wikimedia.org:29418/unicodejs refs/changes/09/386109/1

diff --git a/package.json b/package.json
index 1777041..5cdbdbe 100644
--- a/package.json
+++ b/package.json
@@ -18,17 +18,17 @@
   },
   "dependencies": {},
   "devDependencies": {
-    "eslint-config-wikimedia" : "0.3.0",
+    "eslint-config-wikimedia": "0.5.0",
     "grunt": "1.0.1",
-    "grunt-contrib-clean": "1.0.0",
+    "grunt-contrib-clean": "1.1.0",
     "grunt-contrib-concat": "1.0.1",
-    "grunt-eslint": "19.0.0",
-    "grunt-karma": "1.0.0",
-    "karma": "1.1.0",
-    "karma-chrome-launcher": "1.0.1",
-    "karma-coverage": "1.0.0",
-    "karma-firefox-launcher": "1.0.0",
-    "karma-qunit": "1.1.0",
-    "qunitjs": "1.23.0"
+    "grunt-eslint": "20.1.0",
+    "grunt-karma": "2.0.0",
+    "karma": "1.7.1",
+    "karma-chrome-launcher": "2.2.0",
+    "karma-coverage": "1.1.1",
+    "karma-firefox-launcher": "1.0.1",
+    "karma-qunit": "1.2.1",
+    "qunitjs": "2.4.1"
   }
 }
diff --git a/tests/unicodejs.characterclass.test.js 
b/tests/unicodejs.characterclass.test.js
index 476977f..6e3739a 100644
--- a/tests/unicodejs.characterclass.test.js
+++ b/tests/unicodejs.characterclass.test.js
@@ -49,7 +49,7 @@
                '😇', '𝟠'
        ];
 
-       QUnit.expect( 2 );
+       assert.expect( 2 );
        assert.deepEqual( wordChars.join( '' ).match( wordGlobalRegex ), 
wordChars );
        assert.strictEqual( nonWordChars.join( '' ).match( wordGlobalRegex ), 
null );
 } );
diff --git a/tests/unicodejs.graphemebreak.test.js 
b/tests/unicodejs.graphemebreak.test.js
index 0b65b6c..a51d3bb 100644
--- a/tests/unicodejs.graphemebreak.test.js
+++ b/tests/unicodejs.graphemebreak.test.js
@@ -7,7 +7,7 @@
 
 QUnit.module( 'unicodeJS.graphemebreak' );
 
-QUnit.test( 'splitClusters', 1, function ( assert ) {
+QUnit.test( 'splitClusters', function ( assert ) {
        var expected = [
                'a',
                ' ',
diff --git a/tests/unicodejs.test.js b/tests/unicodejs.test.js
index 33032b4..20e3494 100644
--- a/tests/unicodejs.test.js
+++ b/tests/unicodejs.test.js
@@ -14,8 +14,14 @@
                [ [ 0x0040 ], '\\u0040', 'single BMP character' ],
                [ [ 0xFFFF ], '\\uffff', 'highest BMP character' ],
                [
-                       [ 0x005F, [ 0x203F, 0x2040 ], 0x2054, [ 0xFE33, 0xFE34 
],
-                       [ 0xFE4D, 0xFE4F ], 0xFF3F ],
+                       [
+                               0x005F,
+                               [ 0x203F, 0x2040 ],
+                               0x2054,
+                               [ 0xFE33, 0xFE34 ],
+                               [ 0xFE4D, 0xFE4F ],
+                               0xFF3F
+                       ],
                        
'[\\u005f\\u203f-\\u2040\\u2054\\ufe33-\\ufe34\\ufe4d-\\ufe4f\\uff3f]',
                        'multiple BMP ranges (= ExtendNumLet from wordbreak 
rules)'
                ],
@@ -105,7 +111,7 @@
                [ [ [ 0xCCCC, 0xEEEE ] ], 'surrogate overlap 4' ]
        ];
 
-       QUnit.expect( equalityTests.length + throwTests.length );
+       assert.expect( equalityTests.length + throwTests.length );
        for ( i = 0; i < equalityTests.length; i++ ) {
                test = equalityTests[ i ];
                assert.equal(
diff --git a/tests/unicodejs.wordbreak.test.js 
b/tests/unicodejs.wordbreak.test.js
index 6d5d0d8..e54e09d 100644
--- a/tests/unicodejs.wordbreak.test.js
+++ b/tests/unicodejs.wordbreak.test.js
@@ -26,7 +26,7 @@
                }
        };
 
-       QUnit.expect( length + 1 );
+       assert.expect( length + 1 );
 
        for ( i = 0; i <= length; i++ ) {
                result = ( breakOffsets.indexOf( i ) !== -1 );
@@ -60,9 +60,12 @@
                        // U+10308 OLD ITALIC LETTER THE \ud800\udf08
                        // U+1030A OLD ITALIC LETTER KA \ud800\udf0a
                        // U+0302 COMBINING CIRCUMFLEX \u0302
-                       '\ud800\udf08' + '\ud800\udf08\u0302' + '\ud800\udf0a',
+                       '\ud800\udf08' +
+                               '\ud800\udf08\u0302' +
+                               '\ud800\udf0a',
                        ' ',
-                       '\ud800\udf0a' + '\ud800\udf0a',
+                       '\ud800\udf0a' +
+                               '\ud800\udf0a',
                        ' ', '뜨락또르', ' ', '트랙터', ' ', // hangul (composed)
                        // TODO: test the equivalent hangul decomposed into jamo
                        // 
'\u1104\u1173\u1105\u1161\u11a8\u1104\u1169\u1105\u1173 ' +
@@ -77,7 +80,7 @@
        }
        textString = new unicodeJS.TextString( broken.join( '' ) );
 
-       QUnit.expect( textString.getLength() + 1 );
+       assert.expect( textString.getLength() + 1 );
 
        for ( i = 0; i <= textString.getLength(); i++ ) {
                result = ( breakOffsets.indexOf( i ) !== -1 );
@@ -100,7 +103,7 @@
                textString = new unicodeJS.TextString( text ),
                breaks = [ 0, 0, 3, 4, 9, 10, 15, 16, 19, 19 ];
 
-       QUnit.expect( 2 * ( breaks.length - 2 ) );
+       assert.expect( 2 * ( breaks.length - 2 ) );
 
        for ( i = 2; i < breaks.length; i++ ) {
                offset = unicodeJS.wordbreak.nextBreakOffset( textString, 
offset );
@@ -131,7 +134,7 @@
                nextBreaks = [ 6, 12, 19, 25, 31, 42, 49, 55, 57 ],
                prevBreaks = [ 50, 46, 35, 26, 22, 14, 7, 3, 0 ];
 
-       QUnit.expect( nextBreaks.length + prevBreaks.length + 6 );
+       assert.expect( nextBreaks.length + prevBreaks.length + 6 );
 
        for ( i = 0; i < nextBreaks.length; i++ ) {
                offset = unicodeJS.wordbreak.nextBreakOffset( textString, 
offset, true );

-- 
To view, visit https://gerrit.wikimedia.org/r/386109
To unsubscribe, visit https://gerrit.wikimedia.org/r/settings

Gerrit-MessageType: newchange
Gerrit-Change-Id: I5ce9c93e0241326a3bbb378c79dc32bfdc7da371
Gerrit-PatchSet: 1
Gerrit-Project: unicodejs
Gerrit-Branch: master
Gerrit-Owner: Jforrester <[email protected]>

_______________________________________________
MediaWiki-commits mailing list
[email protected]
https://lists.wikimedia.org/mailman/listinfo/mediawiki-commits

Reply via email to