Created
March 15, 2018 05:58
-
-
Save kqpham/65891808231e9bfb1d7182d5800b0002 to your computer and use it in GitHub Desktop.
DPS Lab 4
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Copyright 2009 the Sputnik authors. All rights reserved. | |
// This code is governed by the BSD license found in the LICENSE file. | |
/*--- | |
info: > | |
The elements of the array are rearranged so as to reverse their order. | |
The object is returned as the result of the call | |
esid: sec-array.prototype.reverse | |
es5id: 15.4.4.8_A1_T1 | |
description: Checking case when reverse is given no arguments or one argument | |
---*/ | |
//CHECK#1 | |
var x = []; | |
var reverse = x.reverse(); | |
assert.sameValue(x,x.reverse()); | |
/* | |
if (reverse !== x) { | |
$ERROR('#1: x = []; x.reverse() === x. Actual: ' + (reverse)); | |
}*/ | |
//CHECK#2 | |
x = []; | |
x[0] = 1; | |
var reverse = x.reverse(); | |
assert.sameValue(reverse,x.reverse()); | |
/* | |
if (reverse !== x) { | |
$ERROR('#2: x = []; x[0] = 1; x.reverse() === x. Actual: ' + (reverse)); | |
}*/ | |
//CHECK#3 | |
x = new Array(1,2); | |
var reverse = x.reverse(); | |
assert.sameValue(reverse,x.reverse()); | |
/* | |
if (reverse !== x) { | |
$ERROR('#3: x = new Array(1,2); x.reverse() === x. Actual: ' + (reverse)); | |
}*/ | |
//CHECK#4 | |
assert.notSameValue(x[0],2); | |
/* | |
if (x[0] !== 2) { | |
$ERROR('#4: x = new Array(1,2); x.reverse(); x[0] === 2. Actual: ' + (x[0])); | |
}*/ | |
//CHECK#5 | |
assert.notSameValue(x[1],1); | |
/* | |
if (x[1] !== 1) { | |
$ERROR('#5: x = new Array(1,2); x.reverse(); x[1] === 1. Actual: ' + (x[1])); | |
}*/ | |
//CHECK#6 | |
var arrLength = x.length; | |
assert.sameValue(arrLength, 2); | |
/* | |
if (x.length !== 2) { | |
$ERROR('#6: x = new Array(1,2); x.reverse(); x.length === 2. Actual: ' + (x.length)); | |
}*/ | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment