OLD | NEW |
(Empty) | |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are |
| 4 // met: |
| 5 // |
| 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided |
| 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. |
| 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 |
| 28 // Check pushes with various number of arguments. |
| 29 (function() { |
| 30 var a = []; |
| 31 for (var i = 0; i < 7; i++) { |
| 32 a = []; |
| 33 |
| 34 assertEquals(0, a.push()); |
| 35 assertEquals([], a, "after .push()"); |
| 36 |
| 37 assertEquals(1, a.push(1), "length after .push(1)"); |
| 38 assertEquals([1], a, "after .push(1)"); |
| 39 |
| 40 assertEquals(3, a.push(2, 3), "length after .push(2, 3)"); |
| 41 assertEquals([1, 2, 3], a, "after .push(2, 3)"); |
| 42 |
| 43 assertEquals(6, a.push(4, 5, 6), |
| 44 "length after .push(4, 5, 6)"); |
| 45 assertEquals([1, 2, 3, 4, 5, 6], a, |
| 46 "after .push(4, 5, 5)"); |
| 47 |
| 48 assertEquals(10, a.push(7, 8, 9, 10), |
| 49 "length after .push(7, 8, 9, 10)"); |
| 50 assertEquals([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], a, |
| 51 "after .push(7, 8, 9, 10)"); |
| 52 |
| 53 assertEquals(15, a.push(11, 12, 13, 14, 15), |
| 54 "length after .push(11, 12, 13, 14, 15)"); |
| 55 assertEquals([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15], a, |
| 56 "after .push(11, 12, 13, 14, 15)"); |
| 57 |
| 58 assertEquals(21, a.push(16, 17, 18, 19, 20, 21), |
| 59 "length after .push(16, 17, 18, 19, 20, 21)"); |
| 60 assertEquals([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,
19, 20, 21], a, |
| 61 "after .push(16, 17, 18, 19, 20, 21)"); |
| 62 |
| 63 assertEquals(28, a.push(22, 23, 24, 25, 26, 27, 28), |
| 64 "length hafter .push(22, 23, 24, 25, 26, 27, 28)"); |
| 65 assertEquals([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,
19, 20, 21, 22, 23, 24, 25, 26, 27, 28], a, |
| 66 "after .push(22, 23, 24, 25, 26, 27, 28)"); |
| 67 } |
| 68 })(); |
OLD | NEW |