michael@0: /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
michael@0: /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this file,
michael@0:  * You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: #include "mozilla/Assertions.h"
michael@0: #include "mozilla/BinarySearch.h"
michael@0: #include "mozilla/Vector.h"
michael@0: 
michael@0: using mozilla::Vector;
michael@0: using mozilla::BinarySearch;
michael@0: 
michael@0: struct Person
michael@0: {
michael@0:   int age;
michael@0:   int id;
michael@0:   Person(int age, int id) : age(age), id(id) {}
michael@0: };
michael@0: 
michael@0: struct GetAge
michael@0: {
michael@0:   Vector<Person> &v;
michael@0:   GetAge(Vector<Person> &v) : v(v) {}
michael@0:   int operator[](size_t index) const { return v[index].age; }
michael@0: };
michael@0: 
michael@0: int main()
michael@0: {
michael@0:   size_t m;
michael@0: 
michael@0:   Vector<int> v1;
michael@0:   v1.append(2);
michael@0:   v1.append(4);
michael@0:   v1.append(6);
michael@0:   v1.append(8);
michael@0: 
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 0, v1.length(), 1, &m) && m == 0);
michael@0:   MOZ_ASSERT( BinarySearch(v1, 0, v1.length(), 2, &m) && m == 0);
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 0, v1.length(), 3, &m) && m == 1);
michael@0:   MOZ_ASSERT( BinarySearch(v1, 0, v1.length(), 4, &m) && m == 1);
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 0, v1.length(), 5, &m) && m == 2);
michael@0:   MOZ_ASSERT( BinarySearch(v1, 0, v1.length(), 6, &m) && m == 2);
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 0, v1.length(), 7, &m) && m == 3);
michael@0:   MOZ_ASSERT( BinarySearch(v1, 0, v1.length(), 8, &m) && m == 3);
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 0, v1.length(), 9, &m) && m == 4);
michael@0: 
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 1, 3, 1, &m) && m == 1);
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 1, 3, 2, &m) && m == 1);
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 1, 3, 3, &m) && m == 1);
michael@0:   MOZ_ASSERT( BinarySearch(v1, 1, 3, 4, &m) && m == 1);
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 1, 3, 5, &m) && m == 2);
michael@0:   MOZ_ASSERT( BinarySearch(v1, 1, 3, 6, &m) && m == 2);
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 1, 3, 7, &m) && m == 3);
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 1, 3, 8, &m) && m == 3);
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 1, 3, 9, &m) && m == 3);
michael@0: 
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 0, 0, 0, &m) && m == 0);
michael@0:   MOZ_ASSERT(!BinarySearch(v1, 0, 0, 9, &m) && m == 0);
michael@0: 
michael@0:   Vector<int> v2;
michael@0:   MOZ_ASSERT(!BinarySearch(v2, 0, 0, 0, &m) && m == 0);
michael@0:   MOZ_ASSERT(!BinarySearch(v2, 0, 0, 9, &m) && m == 0);
michael@0: 
michael@0:   Vector<Person> v3;
michael@0:   v3.append(Person(2, 42));
michael@0:   v3.append(Person(4, 13));
michael@0:   v3.append(Person(6, 360));
michael@0:   MOZ_ASSERT(!BinarySearch(GetAge(v3), 0, v3.length(), 1, &m) && m == 0);
michael@0:   MOZ_ASSERT( BinarySearch(GetAge(v3), 0, v3.length(), 2, &m) && m == 0);
michael@0:   MOZ_ASSERT(!BinarySearch(GetAge(v3), 0, v3.length(), 3, &m) && m == 1);
michael@0:   MOZ_ASSERT( BinarySearch(GetAge(v3), 0, v3.length(), 4, &m) && m == 1);
michael@0:   MOZ_ASSERT(!BinarySearch(GetAge(v3), 0, v3.length(), 5, &m) && m == 2);
michael@0:   MOZ_ASSERT( BinarySearch(GetAge(v3), 0, v3.length(), 6, &m) && m == 2);
michael@0:   MOZ_ASSERT(!BinarySearch(GetAge(v3), 0, v3.length(), 7, &m) && m == 3);
michael@0: }