Wed, 31 Dec 2014 06:09:35 +0100
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
michael@0 | 1 | /* Any copyright is dedicated to the Public Domain. |
michael@0 | 2 | http://creativecommons.org/publicdomain/zero/1.0/ */ |
michael@0 | 3 | |
michael@0 | 4 | /** |
michael@0 | 5 | * Check that nodes with locaiton information attached can be properly |
michael@0 | 6 | * verified for containing lines and columns. |
michael@0 | 7 | */ |
michael@0 | 8 | |
michael@0 | 9 | function test() { |
michael@0 | 10 | let { ParserHelpers } = Cu.import("resource:///modules/devtools/Parser.jsm", {}); |
michael@0 | 11 | |
michael@0 | 12 | let node1 = { loc: { |
michael@0 | 13 | start: { line: 1, column: 10 }, |
michael@0 | 14 | end: { line: 10, column: 1 } |
michael@0 | 15 | }}; |
michael@0 | 16 | let node2 = { loc: { |
michael@0 | 17 | start: { line: 1, column: 10 }, |
michael@0 | 18 | end: { line: 1, column: 20 } |
michael@0 | 19 | }}; |
michael@0 | 20 | |
michael@0 | 21 | ok(ParserHelpers.nodeContainsLine(node1, 1), "1st check."); |
michael@0 | 22 | ok(ParserHelpers.nodeContainsLine(node1, 5), "2nd check."); |
michael@0 | 23 | ok(ParserHelpers.nodeContainsLine(node1, 10), "3rd check."); |
michael@0 | 24 | |
michael@0 | 25 | ok(!ParserHelpers.nodeContainsLine(node1, 0), "4th check."); |
michael@0 | 26 | ok(!ParserHelpers.nodeContainsLine(node1, 11), "5th check."); |
michael@0 | 27 | |
michael@0 | 28 | ok(ParserHelpers.nodeContainsLine(node2, 1), "6th check."); |
michael@0 | 29 | ok(!ParserHelpers.nodeContainsLine(node2, 0), "7th check."); |
michael@0 | 30 | ok(!ParserHelpers.nodeContainsLine(node2, 2), "8th check."); |
michael@0 | 31 | |
michael@0 | 32 | ok(!ParserHelpers.nodeContainsPoint(node1, 1, 10), "9th check."); |
michael@0 | 33 | ok(!ParserHelpers.nodeContainsPoint(node1, 10, 1), "10th check."); |
michael@0 | 34 | |
michael@0 | 35 | ok(!ParserHelpers.nodeContainsPoint(node1, 0, 10), "11th check."); |
michael@0 | 36 | ok(!ParserHelpers.nodeContainsPoint(node1, 11, 1), "12th check."); |
michael@0 | 37 | |
michael@0 | 38 | ok(!ParserHelpers.nodeContainsPoint(node1, 1, 9), "13th check."); |
michael@0 | 39 | ok(!ParserHelpers.nodeContainsPoint(node1, 10, 2), "14th check."); |
michael@0 | 40 | |
michael@0 | 41 | ok(ParserHelpers.nodeContainsPoint(node2, 1, 10), "15th check."); |
michael@0 | 42 | ok(ParserHelpers.nodeContainsPoint(node2, 1, 15), "16th check."); |
michael@0 | 43 | ok(ParserHelpers.nodeContainsPoint(node2, 1, 20), "17th check."); |
michael@0 | 44 | |
michael@0 | 45 | ok(!ParserHelpers.nodeContainsPoint(node2, 0, 10), "18th check."); |
michael@0 | 46 | ok(!ParserHelpers.nodeContainsPoint(node2, 2, 20), "19th check."); |
michael@0 | 47 | |
michael@0 | 48 | ok(!ParserHelpers.nodeContainsPoint(node2, 0, 9), "20th check."); |
michael@0 | 49 | ok(!ParserHelpers.nodeContainsPoint(node2, 2, 21), "21th check."); |
michael@0 | 50 | |
michael@0 | 51 | ok(!ParserHelpers.nodeContainsPoint(node2, 1, 9), "22th check."); |
michael@0 | 52 | ok(!ParserHelpers.nodeContainsPoint(node2, 1, 21), "23th check."); |
michael@0 | 53 | |
michael@0 | 54 | finish(); |
michael@0 | 55 | } |