michael@0: /* Any copyright is dedicated to the Public Domain.
michael@0:  * http://creativecommons.org/publicdomain/zero/1.0/ */
michael@0: 
michael@0: Components.utils.import("resource://gre/modules/BinarySearch.jsm");
michael@0: 
michael@0: function run_test() {
michael@0:   // empty array
michael@0:   ok([], 1, false, 0);
michael@0: 
michael@0:   // one-element array
michael@0:   ok([2], 2, true, 0);
michael@0:   ok([2], 1, false, 0);
michael@0:   ok([2], 3, false, 1);
michael@0: 
michael@0:   // two-element array
michael@0:   ok([2, 4], 2, true, 0);
michael@0:   ok([2, 4], 4, true, 1);
michael@0:   ok([2, 4], 1, false, 0);
michael@0:   ok([2, 4], 3, false, 1);
michael@0:   ok([2, 4], 5, false, 2);
michael@0: 
michael@0:   // three-element array
michael@0:   ok([2, 4, 6], 2, true, 0);
michael@0:   ok([2, 4, 6], 4, true, 1);
michael@0:   ok([2, 4, 6], 6, true, 2);
michael@0:   ok([2, 4, 6], 1, false, 0);
michael@0:   ok([2, 4, 6], 3, false, 1);
michael@0:   ok([2, 4, 6], 5, false, 2);
michael@0:   ok([2, 4, 6], 7, false, 3);
michael@0: 
michael@0:   // duplicates
michael@0:   ok([2, 2], 2, true, 0);
michael@0:   ok([2, 2], 1, false, 0);
michael@0:   ok([2, 2], 3, false, 2);
michael@0: 
michael@0:   // duplicates on the left
michael@0:   ok([2, 2, 4], 2, true, 1);
michael@0:   ok([2, 2, 4], 4, true, 2);
michael@0:   ok([2, 2, 4], 1, false, 0);
michael@0:   ok([2, 2, 4], 3, false, 2);
michael@0:   ok([2, 2, 4], 5, false, 3);
michael@0: 
michael@0:   // duplicates on the right
michael@0:   ok([2, 4, 4], 2, true, 0);
michael@0:   ok([2, 4, 4], 4, true, 1);
michael@0:   ok([2, 4, 4], 1, false, 0);
michael@0:   ok([2, 4, 4], 3, false, 1);
michael@0:   ok([2, 4, 4], 5, false, 3);
michael@0: 
michael@0:   // duplicates in the middle
michael@0:   ok([2, 4, 4, 6], 2, true, 0);
michael@0:   ok([2, 4, 4, 6], 4, true, 1);
michael@0:   ok([2, 4, 4, 6], 6, true, 3);
michael@0:   ok([2, 4, 4, 6], 1, false, 0);
michael@0:   ok([2, 4, 4, 6], 3, false, 1);
michael@0:   ok([2, 4, 4, 6], 5, false, 3);
michael@0:   ok([2, 4, 4, 6], 7, false, 4);
michael@0: 
michael@0:   // duplicates all around
michael@0:   ok([2, 2, 4, 4, 6, 6], 2, true, 0);
michael@0:   ok([2, 2, 4, 4, 6, 6], 4, true, 2);
michael@0:   ok([2, 2, 4, 4, 6, 6], 6, true, 4);
michael@0:   ok([2, 2, 4, 4, 6, 6], 1, false, 0);
michael@0:   ok([2, 2, 4, 4, 6, 6], 3, false, 2);
michael@0:   ok([2, 2, 4, 4, 6, 6], 5, false, 4);
michael@0:   ok([2, 2, 4, 4, 6, 6], 7, false, 6);
michael@0: }
michael@0: 
michael@0: function ok(array, target, expectedFound, expectedIdx) {
michael@0:   let [found, idx] = BinarySearch.search(array, target, cmp);
michael@0:   do_check_eq(found, expectedFound);
michael@0:   do_check_eq(idx, expectedIdx);
michael@0: 
michael@0:   idx = expectedFound ? expectedIdx : -1;
michael@0:   do_check_eq(BinarySearch.indexOf(array, target, cmp), idx);
michael@0:   do_check_eq(BinarySearch.insertionIndexOf(array, target, cmp), expectedIdx);
michael@0: }
michael@0: 
michael@0: function cmp(num1, num2) {
michael@0:   return num1 - num2;
michael@0: }