mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
141 lines
5.3 KiB
JavaScript
141 lines
5.3 KiB
JavaScript
/* ***** BEGIN LICENSE BLOCK *****
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
*
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
* the License. You may obtain a copy of the License at
|
|
* http://www.mozilla.org/MPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
* for the specific language governing rights and limitations under the
|
|
* License.
|
|
*
|
|
* The Original Code is mozilla.org code.
|
|
*
|
|
* The Initial Developer of the Original Code is Mozilla Foundation.
|
|
* Portions created by the Initial Developer are Copyright (C) 2010
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
* Benjamin Stover <bstover@mozilla.com> (original author)
|
|
*
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
* the provisions above, a recipient may use your version of this file under
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
*
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
Components.utils.import("resource://gre/modules/Geometry.jsm");
|
|
|
|
function test() {
|
|
ok(Rect, "Rect class exists");
|
|
for (var fname in tests) {
|
|
tests[fname]();
|
|
}
|
|
}
|
|
|
|
let tests = {
|
|
testGetDimensions: function() {
|
|
let r = new Rect(5, 10, 100, 50);
|
|
ok(r.left == 5, "rect has correct left value");
|
|
ok(r.top == 10, "rect has correct top value");
|
|
ok(r.right == 105, "rect has correct right value");
|
|
ok(r.bottom == 60, "rect has correct bottom value");
|
|
ok(r.width == 100, "rect has correct width value");
|
|
ok(r.height == 50, "rect has correct height value");
|
|
ok(r.x == 5, "rect has correct x value");
|
|
ok(r.y == 10, "rect has correct y value");
|
|
},
|
|
|
|
testIsEmpty: function() {
|
|
let r = new Rect(0, 0, 0, 10);
|
|
ok(r.isEmpty(), "rect with nonpositive width is empty");
|
|
let r = new Rect(0, 0, 10, 0);
|
|
ok(r.isEmpty(), "rect with nonpositive height is empty");
|
|
let r = new Rect(0, 0, 10, 10);
|
|
ok(!r.isEmpty(), "rect with positive dimensions is not empty");
|
|
},
|
|
|
|
testRestrictTo: function() {
|
|
let r1 = new Rect(10, 10, 100, 100);
|
|
let r2 = new Rect(50, 50, 100, 100);
|
|
r1.restrictTo(r2);
|
|
ok(r1.equals(new Rect(50, 50, 60, 60)), "intersection is non-empty");
|
|
|
|
let r1 = new Rect(10, 10, 100, 100);
|
|
let r2 = new Rect(120, 120, 100, 100);
|
|
r1.restrictTo(r2);
|
|
ok(r1.isEmpty(), "intersection is empty");
|
|
|
|
let r1 = new Rect(10, 10, 100, 100);
|
|
let r2 = new Rect(0, 0, 0, 0);
|
|
r1.restrictTo(r2);
|
|
ok(r1.isEmpty(), "intersection of rect and empty is empty");
|
|
|
|
let r1 = new Rect(0, 0, 0, 0);
|
|
let r2 = new Rect(0, 0, 0, 0);
|
|
r1.restrictTo(r2);
|
|
ok(r1.isEmpty(), "intersection of empty and empty is empty");
|
|
},
|
|
|
|
testExpandToContain: function() {
|
|
let r1 = new Rect(10, 10, 100, 100);
|
|
let r2 = new Rect(50, 50, 100, 100);
|
|
r1.expandToContain(r2);
|
|
ok(r1.equals(new Rect(10, 10, 140, 140)), "correct expandToContain on intersecting rectangles");
|
|
|
|
let r1 = new Rect(10, 10, 100, 100);
|
|
let r2 = new Rect(120, 120, 100, 100);
|
|
r1.expandToContain(r2);
|
|
ok(r1.equals(new Rect(10, 10, 210, 210)), "correct expandToContain on non-intersecting rectangles");
|
|
|
|
let r1 = new Rect(10, 10, 100, 100);
|
|
let r2 = new Rect(0, 0, 0, 0);
|
|
r1.expandToContain(r2);
|
|
ok(r1.equals(new Rect(10, 10, 100, 100)), "expandToContain of rect and empty is rect");
|
|
|
|
let r1 = new Rect(10, 10, 0, 0);
|
|
let r2 = new Rect(0, 0, 0, 0);
|
|
r1.expandToContain(r2);
|
|
ok(r1.isEmpty(), "expandToContain of empty and empty is empty");
|
|
},
|
|
|
|
testSubtract: function testSubtract() {
|
|
function equals(rects1, rects2) {
|
|
return rects1.length == rects2.length && rects1.every(function(r, i) {
|
|
return r.equals(rects2[i]);
|
|
});
|
|
}
|
|
|
|
let r1 = new Rect(0, 0, 100, 100);
|
|
let r2 = new Rect(500, 500, 100, 100);
|
|
ok(equals(r1.subtract(r2), [r1]), "subtract area outside of region yields same region");
|
|
|
|
let r1 = new Rect(0, 0, 100, 100);
|
|
let r2 = new Rect(-10, -10, 50, 120);
|
|
ok(equals(r1.subtract(r2), [new Rect(40, 0, 60, 100)]), "subtracting vertical bar from edge leaves one rect");
|
|
|
|
let r1 = new Rect(0, 0, 100, 100);
|
|
let r2 = new Rect(-10, -10, 120, 50);
|
|
ok(equals(r1.subtract(r2), [new Rect(0, 40, 100, 60)]), "subtracting horizontal bar from edge leaves one rect");
|
|
|
|
let r1 = new Rect(0, 0, 100, 100);
|
|
let r2 = new Rect(40, 40, 20, 20);
|
|
ok(equals(r1.subtract(r2), [
|
|
new Rect(0, 0, 40, 100),
|
|
new Rect(40, 0, 20, 40),
|
|
new Rect(40, 60, 20, 40),
|
|
new Rect(60, 0, 40, 100)]),
|
|
"subtracting rect in middle leaves union of rects");
|
|
},
|
|
};
|