Skip to content

Landscaper: QUnit2 upgrade #12

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Landscaper: QUnit2 upgrade #12

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion package.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -28,7 +28,7 @@
"serve": "1.4.0",
"steal": "0.10.1",
"steal-tools": "0.11.0-pre.9",
"steal-qunit": "0.0.2",
"steal-qunit": "^2.0.0",
"system-npm": "0.3.0",
"testee": "^0.2.0",
"underscore": "1.3.1"
Expand Down
36 changes: 18 additions & 18 deletions rbtree/rbtree_test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@ var QUnit = require("steal-qunit");
var RBTree = require('can-redblacktree');

QUnit.module('can-redblacktree', {
setup: function () {}
beforeEach: function(assert) {}
});

var comparator = function (a, b) {
Expand All @@ -11,20 +11,20 @@ var comparator = function (a, b) {
return a === b ? 0 : a < b ? -1 : 1; // ASC
};

test('Return index on insert', function () {
QUnit.test('Return index on insert', function(assert) {

var tree = new RBTree(comparator);
var alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".split("");

alphabet.forEach(function (letter, index) {
var value = tree.insert(letter);
deepEqual(value, index, 'Returned index of insert');
assert.deepEqual(value, index, 'Returned index of insert');
});

deepEqual(tree.remove('404'), -1, 'Returned "not found" value');
assert.deepEqual(tree.remove('404'), -1, 'Returned "not found" value');
});

test('Return index on remove', function () {
QUnit.test('Return index on remove', function(assert) {

var tree = new RBTree(comparator);
var alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".split("");
Expand All @@ -37,13 +37,13 @@ test('Return index on remove', function () {
// are tested
for (var i = alphabet.length - 1; i >= 0; i--) {
var value = tree.remove(alphabet[i]);
deepEqual(value, i, 'Returned index of remove');
assert.deepEqual(value, i, 'Returned index of remove');
}

deepEqual(tree.remove('404'), -1, 'Returned "not found" value');
assert.deepEqual(tree.remove('404'), -1, 'Returned "not found" value');
});

test('Get index of item', function () {
QUnit.test('Get index of item', function(assert) {

var tree = new RBTree(comparator);
var alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".split("");
Expand All @@ -54,13 +54,13 @@ test('Get index of item', function () {

alphabet.forEach(function (letter, index) {
var value = tree.indexOf(letter);
deepEqual(value, index, 'Found index of value');
assert.deepEqual(value, index, 'Found index of value');
});

deepEqual(tree.indexOf('404'), -1, 'Returned "not found" value');
assert.deepEqual(tree.indexOf('404'), -1, 'Returned "not found" value');
});

test('Get item by index', function () {
QUnit.test('Get item by index', function(assert) {

var tree = new RBTree(comparator);
var alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".split("");
Expand All @@ -71,13 +71,13 @@ test('Get item by index', function () {

alphabet.forEach(function (letter, index) {
var value = tree.getByIndex(index);
deepEqual(value, letter, 'Found value by index');
assert.deepEqual(value, letter, 'Found value by index');
});

deepEqual(tree.getByIndex(100), null, 'Returned "not found" value');
assert.deepEqual(tree.getByIndex(100), null, 'Returned "not found" value');
});

test('leftCount is maintained on insert and remove', function () {
QUnit.test('leftCount is maintained on insert and remove', function(assert) {

var recursiveChildCountTest = function (node, isChild) {
var match = true;
Expand All @@ -102,7 +102,7 @@ test('leftCount is maintained on insert and remove', function () {
match = false;
}

deepEqual(count, storedCount, 'Count from "' + node.data + '"');
assert.deepEqual(count, storedCount, 'Count from "' + node.data + '"');
}

return (isChild ? count : match);
Expand All @@ -122,7 +122,7 @@ test('leftCount is maintained on insert and remove', function () {
letter = letter.shift();
tree.remove(letter);
match = recursiveChildCountTest(tree._root);
ok(match, 'Child count is correct after removing "' + letter + '"');
assert.ok(match, 'Child count is correct after removing "' + letter + '"');
i++;
}

Expand All @@ -142,9 +142,9 @@ test('leftCount is maintained on insert and remove', function () {
alphabet.forEach(function (letter) {
tree.insert(letter);
match = recursiveChildCountTest(tree._root);
ok(match, 'Child count is correct after adding "' + letter + '"');
assert.ok(match, 'Child count is correct after adding "' + letter + '"');
});

centerOutRemove(alphabet.length/2);

});
});
Loading