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 // Flags: --expose-debug-as debug |
| 29 // Get the Debug object exposed from the debug context global object. |
| 30 |
| 31 Debug = debug.Debug |
| 32 |
| 33 function CheckCompareOneWay(s1, s2) { |
| 34 var diff_array = Debug.LiveEdit.CompareStringsLinewise(s1, s2); |
| 35 |
| 36 var pos1 = 0; |
| 37 var pos2 = 0; |
| 38 print("Compare:"); |
| 39 for (var i = 0; i < diff_array.length; i += 3) { |
| 40 var similar_length = diff_array[i] - pos1; |
| 41 assertEquals(s1.substring(pos1, pos1 + similar_length), |
| 42 s2.substring(pos2, pos2 + similar_length)); |
| 43 |
| 44 print(s1.substring(pos1, pos1 + similar_length)); |
| 45 pos1 += similar_length; |
| 46 pos2 += similar_length; |
| 47 print("<<< " + pos1 + " " + diff_array[i + 1]); |
| 48 print(s1.substring(pos1, pos1 + diff_array[i + 1])); |
| 49 print("==="); |
| 50 print(s2.substring(pos2, pos2 + diff_array[i + 2])); |
| 51 print(">>> " + pos2 + " " + diff_array[i + 2]); |
| 52 pos1 += diff_array[i + 1]; |
| 53 pos2 += diff_array[i + 2]; |
| 54 } |
| 55 { |
| 56 // After last change |
| 57 var similar_length = s1.length - pos1; |
| 58 assertEquals(similar_length, s2.length - pos2); |
| 59 assertEquals(s1.substring(pos1, pos1 + similar_length), |
| 60 s2.substring(pos2, pos2 + similar_length)); |
| 61 |
| 62 print(s1.substring(pos1, pos1 + similar_length)); |
| 63 } |
| 64 print(""); |
| 65 } |
| 66 |
| 67 function CheckCompare(s1, s2) { |
| 68 CheckCompareOneWay(s1, s2); |
| 69 CheckCompareOneWay(s2, s1); |
| 70 } |
| 71 |
| 72 CheckCompare("", ""); |
| 73 |
| 74 CheckCompare("a", "b"); |
| 75 |
| 76 CheckCompare( |
| 77 "yesterday\nall\nmy\ntroubles\nseemed\nso\nfar\naway", |
| 78 "yesterday\nall\nmy\ntroubles\nseem\nso\nfar\naway" |
| 79 ); |
| 80 |
| 81 CheckCompare( |
| 82 "yesterday\nall\nmy\ntroubles\nseemed\nso\nfar\naway", |
| 83 "\nall\nmy\ntroubles\nseemed\nso\nfar\naway" |
| 84 ); |
| 85 |
| 86 CheckCompare( |
| 87 "yesterday\nall\nmy\ntroubles\nseemed\nso\nfar\naway", |
| 88 "all\nmy\ntroubles\nseemed\nso\nfar\naway" |
| 89 ); |
| 90 |
| 91 CheckCompare( |
| 92 "yesterday\nall\nmy\ntroubles\nseemed\nso\nfar\naway", |
| 93 "yesterday\nall\nmy\ntroubles\nseemed\nso\nfar\naway\n" |
| 94 ); |
| 95 |
| 96 CheckCompare( |
| 97 "yesterday\nall\nmy\ntroubles\nseemed\nso\nfar\naway", |
| 98 "yesterday\nall\nmy\ntroubles\nseemed\nso\n" |
| 99 ); |
| 100 |
OLD | NEW |