1 /* ***** BEGIN LICENSE BLOCK *****
2 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
4 * The contents of this file are subject to the Mozilla Public License Version
5 * 1.1 (the "License"); you may not use this file except in compliance with
6 * the License. You may obtain a copy of the License at
7 * http://www.mozilla.org/MPL/
9 * Software distributed under the License is distributed on an "AS IS" basis,
10 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
11 * for the specific language governing rights and limitations under the
14 * The Original Code is Java XPCOM Bindings.
16 * The Initial Developer of the Original Code is
18 * Portions created by the Initial Developer are Copyright (C) 2005
19 * IBM Corporation. All Rights Reserved.
22 * Javier Pedemonte (jhpedemonte@gmail.com)
24 * Alternatively, the contents of this file may be used under the terms of
25 * either the GNU General Public License Version 2 or later (the "GPL"), or
26 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
27 * in which case the provisions of the GPL or the LGPL are applicable instead
28 * of those above. If you wish to allow use of your version of this file only
29 * under the terms of either the GPL or the LGPL, and not to allow others to
30 * use your version of this file under the terms of the MPL, indicate your
31 * decision by deleting the provisions above and replace them with the notice
32 * and other provisions required by the GPL or the LGPL. If you do not delete
33 * the provisions above, a recipient may use your version of this file under
34 * the terms of any one of the MPL, the GPL or the LGPL.
36 * ***** END LICENSE BLOCK ***** */
38 import org
.mozilla
.xpcom
.VersionComparator
;
40 public class TestVersionComparator
{
42 public static void main(String
[] args
) {
43 String
[] comparisons
= {
71 VersionComparator comp
= new VersionComparator();
73 // test comparisons in both directions
74 for (int i
= 0; i
< comparisons
.length
- 1; i
++) {
75 int res
= comp
.compare(comparisons
[i
], comparisons
[i
+ 1]);
78 res
= comp
.compare(comparisons
[i
+ 1], comparisons
[i
]);
82 // test equality in both directions
83 for (int i
= 0; i
< equality
.length
- 1; i
++) {
84 int res
= comp
.compare(equality
[i
], equality
[i
+ 1]);
87 res
= comp
.compare(equality
[i
+ 1], equality
[i
]);
91 System
.out
.println("-- passed");
94 private static void _assert(boolean expression
) {
96 Throwable t
= new Throwable();