/**
 * Copyright (C) 2009 - present by OpenGamma Inc. and the OpenGamma group of companies
 *
 * Please see distribution for license.
 */
package com.opengamma.analytics.financial.model.volatility.local;

import static org.testng.AssertJUnit.assertEquals;
import static org.testng.AssertJUnit.assertFalse;

import org.testng.annotations.Test;

import com.opengamma.analytics.financial.model.tree.RecombiningBinomialTree;
import com.opengamma.util.test.TestGroup;

/**
 * Test.
 */
@Test(groups = TestGroup.UNIT)
public class ImpliedTreeResultTest {
  private static final Double[][] SPOT1 = new Double[][] {new Double[] {100.}, new Double[] {95., 105.}, new Double[] {90., 100., 110.}};
  private static final Double[][] VOL1 = new Double[][] {new Double[] {0.1}, new Double[] {0.05, 0.4}};
  private static final Double[][] SPOT2 = new Double[][] {new Double[] {200.}, new Double[] {95., 105.}, new Double[] {90., 100., 110.}};
  private static final Double[][] VOL2 = new Double[][] {new Double[] {0.2}, new Double[] {0.05, 0.4}};

  @Test(expectedExceptions = IllegalArgumentException.class)
  public void testNullSpot() {
    new ImpliedTreeResult(null, new RecombiningBinomialTree<>(VOL1));
  }

  @Test(expectedExceptions = IllegalArgumentException.class)
  public void testNullVol() {
    new ImpliedTreeResult(new RecombiningBinomialTree<>(SPOT1), null);
  }

  @Test(expectedExceptions = IllegalArgumentException.class)
  public void testWrongSize() {
    new ImpliedTreeResult(new RecombiningBinomialTree<>(SPOT1), new RecombiningBinomialTree<>(SPOT2));
  }

  @Test
  public void testGetters() {
    final ImpliedTreeResult result = new ImpliedTreeResult(new RecombiningBinomialTree<>(SPOT1), new RecombiningBinomialTree<>(VOL1));
    assertEquals(result.getSpotPriceTree(), new RecombiningBinomialTree<>(SPOT1));
    assertEquals(result.getLocalVolatilityTree(), new RecombiningBinomialTree<>(VOL1));
  }

  @Test
  public void testHashCodeAndEquals() {
    final ImpliedTreeResult result = new ImpliedTreeResult(new RecombiningBinomialTree<>(SPOT1), new RecombiningBinomialTree<>(VOL1));
    ImpliedTreeResult other = new ImpliedTreeResult(new RecombiningBinomialTree<>(SPOT1), new RecombiningBinomialTree<>(VOL1));
    assertEquals(result, other);
    assertEquals(result.hashCode(), other.hashCode());
    other = new ImpliedTreeResult(new RecombiningBinomialTree<>(SPOT2), new RecombiningBinomialTree<>(VOL1));
    assertFalse(result.equals(other));
    other = new ImpliedTreeResult(new RecombiningBinomialTree<>(SPOT1), new RecombiningBinomialTree<>(VOL2));
    assertFalse(result.equals(other));
  }
}