mfbt/tests/TestBinarySearch.cpp
author Luke Wagner <luke@mozilla.com>
Thu, 15 May 2014 12:30:45 -0500
changeset 202615 ce34c13388f2e45d763ad017b757d4ce965bd93f
parent 198118 0de0cedf6a7dd87c4a76a198243a5280402550b0
child 206590 d7dc39d162348d21bd2b51b3a3b56fa2fe969dd5
permissions -rw-r--r--
Bug 1007383 - Include asm.js frames in JS::DescribeStack (r=jandem,robcee)

/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this file,
 * You can obtain one at http://mozilla.org/MPL/2.0/. */

#include "mozilla/Assertions.h"
#include "mozilla/BinarySearch.h"
#include "mozilla/Vector.h"

using mozilla::Vector;
using mozilla::BinarySearch;

struct Person
{
  int age;
  int id;
  Person(int age, int id) : age(age), id(id) {}
};

struct GetAge
{
  Vector<Person> &v;
  GetAge(Vector<Person> &v) : v(v) {}
  int operator[](size_t index) const { return v[index].age; }
};

int main()
{
  size_t m;

  Vector<int> v1;
  v1.append(2);
  v1.append(4);
  v1.append(6);
  v1.append(8);

  MOZ_ASSERT(!BinarySearch(v1, 0, v1.length(), 1, &m) && m == 0);
  MOZ_ASSERT( BinarySearch(v1, 0, v1.length(), 2, &m) && m == 0);
  MOZ_ASSERT(!BinarySearch(v1, 0, v1.length(), 3, &m) && m == 1);
  MOZ_ASSERT( BinarySearch(v1, 0, v1.length(), 4, &m) && m == 1);
  MOZ_ASSERT(!BinarySearch(v1, 0, v1.length(), 5, &m) && m == 2);
  MOZ_ASSERT( BinarySearch(v1, 0, v1.length(), 6, &m) && m == 2);
  MOZ_ASSERT(!BinarySearch(v1, 0, v1.length(), 7, &m) && m == 3);
  MOZ_ASSERT( BinarySearch(v1, 0, v1.length(), 8, &m) && m == 3);
  MOZ_ASSERT(!BinarySearch(v1, 0, v1.length(), 9, &m) && m == 4);

  MOZ_ASSERT(!BinarySearch(v1, 1, 3, 1, &m) && m == 1);
  MOZ_ASSERT(!BinarySearch(v1, 1, 3, 2, &m) && m == 1);
  MOZ_ASSERT(!BinarySearch(v1, 1, 3, 3, &m) && m == 1);
  MOZ_ASSERT( BinarySearch(v1, 1, 3, 4, &m) && m == 1);
  MOZ_ASSERT(!BinarySearch(v1, 1, 3, 5, &m) && m == 2);
  MOZ_ASSERT( BinarySearch(v1, 1, 3, 6, &m) && m == 2);
  MOZ_ASSERT(!BinarySearch(v1, 1, 3, 7, &m) && m == 3);
  MOZ_ASSERT(!BinarySearch(v1, 1, 3, 8, &m) && m == 3);
  MOZ_ASSERT(!BinarySearch(v1, 1, 3, 9, &m) && m == 3);

  MOZ_ASSERT(!BinarySearch(v1, 0, 0, 0, &m) && m == 0);
  MOZ_ASSERT(!BinarySearch(v1, 0, 0, 9, &m) && m == 0);

  Vector<int> v2;
  MOZ_ASSERT(!BinarySearch(v2, 0, 0, 0, &m) && m == 0);
  MOZ_ASSERT(!BinarySearch(v2, 0, 0, 9, &m) && m == 0);

  Vector<Person> v3;
  v3.append(Person(2, 42));
  v3.append(Person(4, 13));
  v3.append(Person(6, 360));
  MOZ_ASSERT(!BinarySearch(GetAge(v3), 0, v3.length(), 1, &m) && m == 0);
  MOZ_ASSERT( BinarySearch(GetAge(v3), 0, v3.length(), 2, &m) && m == 0);
  MOZ_ASSERT(!BinarySearch(GetAge(v3), 0, v3.length(), 3, &m) && m == 1);
  MOZ_ASSERT( BinarySearch(GetAge(v3), 0, v3.length(), 4, &m) && m == 1);
  MOZ_ASSERT(!BinarySearch(GetAge(v3), 0, v3.length(), 5, &m) && m == 2);
  MOZ_ASSERT( BinarySearch(GetAge(v3), 0, v3.length(), 6, &m) && m == 2);
  MOZ_ASSERT(!BinarySearch(GetAge(v3), 0, v3.length(), 7, &m) && m == 3);
}