filters.cc

/**************************************************************************
 * basf2 (Belle II Analysis Software Framework)                           *
 * Author: The Belle II Collaboration                                     *
 *                                                                        *
 * See git log for contributors and copyright holders.                    *
 * This file is licensed under LGPL-3.0, see LICENSE.md.                  *
 **************************************************************************/
 
#include <gtest/gtest.h>
 
 
#include <tracking/trackFindingVXD/filterMap/filterFramework/Shortcuts.h>
#include <tuple>
#include <iostream>
#include <math.h>
 
using namespace std;
 
using namespace Belle2;
 
namespace VXDTFfilterTest {
 
  class spacePoint: public tuple<float, float, float> {
  public:
    spacePoint(float x, float y, float z): tuple<float, float, float>(x, y, z)
    {};
  private:
    spacePoint(const spacePoint&) = delete;
  };
 
 
  class SquaredDistance3D : public SelectionVariable< spacePoint , 2, float > {
  public:
    static const std::string name(void) {return "SquaredDistance3D"; };
 
    static float value(const spacePoint& p1, const spacePoint& p2)
    {
      return
        pow(get<0>(p1) - get<0>(p2) , 2) +
        pow(get<1>(p1) - get<1>(p2) , 2) +
        pow(get<2>(p1) - get<2>(p2) , 2) ;
    }
  };
 
 
  class SquaredDistance2Dxy : public SelectionVariable< spacePoint , 2, float > {
  public:
    static const std::string name(void) {return "SquaredDistance2Dxy"; };
 
    static float value(const spacePoint& p1, const spacePoint& p2)
    {
      return
        pow(get<0>(p1) - get<0>(p2) , 2) +
        pow(get<1>(p1) - get<1>(p2) , 2) ;
    }
  };
 
 
  class SquaredDistance1Dx : public SelectionVariable< spacePoint , 2, float > {
  public:
    static const std::string name(void) {return "SquaredDistance1Dx"; };
 
    static float value(const spacePoint& p1, const spacePoint& p2)
    {
      return
        pow(get<0>(p1) - get<0>(p2) , 2);
    }
  };
 
 
  class BooleanVariable : public SelectionVariable< spacePoint , 2, bool > {
  public:
    static const std::string name(void) {return "BooleanVariable"; };
 
    static float value(const spacePoint& p1, const spacePoint& p2)
    {
      return
        get<0>(p1) - get<0>(p2) == 0.;
    }
  };
 
 
  template < class T> class counter {
  public:
    static int N; 
    counter() {}; 
    ~counter() {}; 
  };
 
 
  template<>
  int counter< SquaredDistance3D   >::N(0);
 
 
  template<>
  int counter< SquaredDistance2Dxy >::N(0);
 
 
  template<>
  int counter< SquaredDistance1Dx  >::N(0);
 
 
  class Observer : public VoidObserver {
  public:
    template<class Var, typename ... otherTypes>
    static void notify(const Var&,
                       const otherTypes& ...)
    {
      counter<Var>::N ++ ;
    }
  };
 
 
 
  class FilterTest : public ::testing::Test {
  protected:
  };
 
 
  TEST_F(FilterTest, Range)
  {
 
    Range<double, double> range(0. , 1.);
    EXPECT_TRUE(range.contains(0.5));
    EXPECT_FALSE(range.contains(-1.));
    EXPECT_FALSE(range.contains(0.));
    EXPECT_FALSE(range.contains(1.));
    EXPECT_FALSE(range.contains(2.));
    EXPECT_EQ(0. , range.getInf());
    EXPECT_EQ(1. , range.getSup());
  }
 
  TEST_F(FilterTest, ClosedRange)
  {
 
    ClosedRange<double, double> range(0. , 1.);
    EXPECT_TRUE(range.contains(0.5));
    EXPECT_FALSE(range.contains(-1.));
    EXPECT_TRUE(range.contains(0.));
    EXPECT_TRUE(range.contains(1.));
    EXPECT_FALSE(range.contains(2.));
    EXPECT_EQ(0. , range.getInf());
    EXPECT_EQ(1. , range.getSup());
  }
 
 
  TEST_F(FilterTest, UpperBoundedSet)
  {
 
    UpperBoundedSet<double> upperBoundedSet(0.);
    EXPECT_TRUE(upperBoundedSet.contains(-1.));
    EXPECT_FALSE(upperBoundedSet.contains(0.));
    EXPECT_FALSE(upperBoundedSet.contains(1.));
    EXPECT_EQ(0. , upperBoundedSet.getSup());
  }
 
  TEST_F(FilterTest, ClosedUpperBoundedSet)
  {
 
    ClosedUpperBoundedSet<double> upperBoundedSet(0.);
    EXPECT_TRUE(upperBoundedSet.contains(-1.));
    EXPECT_TRUE(upperBoundedSet.contains(0.));
    EXPECT_FALSE(upperBoundedSet.contains(1.));
    EXPECT_EQ(0. , upperBoundedSet.getSup());
  }
 
 
  TEST_F(FilterTest, LowerBoundedSet)
  {
 
    LowerBoundedSet<double> lowerBoundedSet(0.);
    EXPECT_TRUE(lowerBoundedSet.contains(1.));
    EXPECT_FALSE(lowerBoundedSet.contains(0.));
    EXPECT_FALSE(lowerBoundedSet.contains(-1.));
    EXPECT_EQ(0. , lowerBoundedSet.getInf());
  }
 
  TEST_F(FilterTest, ClosedLowerBoundedSet)
  {
 
    ClosedLowerBoundedSet<double> lowerBoundedSet(0.);
    EXPECT_TRUE(lowerBoundedSet.contains(1.));
    EXPECT_TRUE(lowerBoundedSet.contains(0.));
    EXPECT_FALSE(lowerBoundedSet.contains(-1.));
    EXPECT_EQ(0. , lowerBoundedSet.getInf());
  }
 
 
  TEST_F(FilterTest, SelectionVariableName)
  {
 
    EXPECT_EQ("SquaredDistance3D" , SquaredDistance3D().name());
  }
 
 
  TEST_F(FilterTest, BasicFilter)
  {
    // Very verbose declaration, see below for convenient shortcuts
    Filter< SquaredDistance3D, Range<double, double>, VoidObserver > filter(Range<double, double>(0., 1.));
 
    spacePoint x1(0.0f , 0.0f, 0.0f);
    spacePoint x2(0.5f , 0.0f, 0.0f);
    spacePoint x3(2.0f , 0.0f, 0.0f);
 
    EXPECT_TRUE(filter.accept(x1, x2));
    EXPECT_FALSE(filter.accept(x1, x3));
 
  }
 
 
  TEST_F(FilterTest, ObservedFilter)
  {
    // Very verbose declaration, see below for convenient shortcuts
    Filter< SquaredDistance3D, Range<double, double>, VoidObserver > unobservedFilter(Range<double, double>(0., 1.));
 
    Filter< SquaredDistance3D, Range<double, double>, Observer > filter(unobservedFilter);
    spacePoint x1(0.0f , 0.0f, 0.0f);
    spacePoint x2(0.5f , 0.0f, 0.0f);
    spacePoint x3(2.0f , 0.0f, 0.0f);
    counter< SquaredDistance3D >::N = 0;
 
    EXPECT_TRUE(filter.accept(x1, x2));
    EXPECT_FALSE(filter.accept(x1, x3));
    EXPECT_EQ(2 , counter< SquaredDistance3D >::N);
  }
 
  TEST_F(FilterTest, SwitchingObservers)
  {
    //build an dummy filter which is unobserved (VoidObserver)
    auto dummyFilter = ((-10. <= SquaredDistance3D() <= 10.) &&
                        ((-100. <=  SquaredDistance2Dxy() <= -10.) ||    // put 2nd pair of parentheses to silence warning
                         (-10. <= SquaredDistance1Dx() <= 10.)) &&
                        !(-10. <= SquaredDistance1Dx() <= -10.));
 
    // values are chosen in that way that all sub-filters of dummyFilter have to be called (see comment below)
    // and so that dummyFilter is always true
    spacePoint x1(0.0f , 0.0f, 0.0f);
    spacePoint x2(0.5f , 0.0f, 0.0f);
    spacePoint x3(2.0f , 0.0f, 0.0f);
 
    counter< SquaredDistance3D >::N = 0;
    counter< SquaredDistance1Dx >::N = 0;
    counter< SquaredDistance2Dxy >::N = 0;
 
    dummyFilter.accept(x1, x2);
    dummyFilter.accept(x1, x3);
 
    // useless test as it tests if realy unobserved
    EXPECT_EQ(0 , counter< SquaredDistance3D >::N);
    EXPECT_EQ(0 , counter< SquaredDistance2Dxy >::N);
    EXPECT_EQ(0 , counter< SquaredDistance1Dx >::N);
 
    // Now switch observer, this is done recursively for each of the underlying filters
    // One cannot switch the observer of an existing filter (as it would mean to switch type) so one has to create a new one!
    // Note that if one filter is evaluated as false the other filter are not evaluated anymore and thus not observed!
    auto observedDummyFilter = dummyFilter.observe(Observer());
    observedDummyFilter.accept(x1, x2);
    observedDummyFilter.accept(x1, x3);
 
    EXPECT_EQ(2 , counter< SquaredDistance3D >::N);
    EXPECT_EQ(2 , counter< SquaredDistance2Dxy >::N);
    //Note SquaredDistance1D is used twice in the filter so it is evaluated twice!
    EXPECT_EQ(4 , counter< SquaredDistance1Dx >::N);
  }
 
 
  TEST_F(FilterTest, BypassableFilter)
  {
    bool bypassControl(false);
    // Very verbose declaration, see below for convenient shortcuts
    Filter< SquaredDistance3D, Range<double, double>, Observer > nonBypassableFilter(Range<double, double>(0., 1.));
    auto filter = nonBypassableFilter.bypass(bypassControl);
    spacePoint x1(0.0f , 0.0f, 0.0f);
    spacePoint x2(2.0f , 0.0f, 0.0f);
    counter< SquaredDistance3D >::N = 0;
 
    EXPECT_FALSE(filter.accept(x1, x2));
    EXPECT_EQ(1 , counter< SquaredDistance3D >::N);
 
    bypassControl = true;
    EXPECT_TRUE(filter.accept(x1, x2));
    EXPECT_EQ(2 , counter< SquaredDistance3D >::N);
 
  }
 
 
  TEST_F(FilterTest, Shortcuts)
  {
 
    spacePoint x1(0.0f , 0.0f, 0.0f);
    spacePoint x2(0.5f , 0.0f, 0.0f);
    spacePoint x3(2.0f , 0.0f, 0.0f);
    spacePoint x4(1.0f , 0.0f, 0.0f);
 
    auto filterSup = (SquaredDistance3D() < 1.) ;
    EXPECT_TRUE(filterSup.accept(x1, x2));
    EXPECT_FALSE(filterSup.accept(x1, x4));
    EXPECT_FALSE(filterSup.accept(x1, x3));
 
    auto filterMax = (SquaredDistance3D() <= 1.) ;
    EXPECT_TRUE(filterMax.accept(x1, x2));
    EXPECT_TRUE(filterMax.accept(x1, x4));
    EXPECT_FALSE(filterMax.accept(x1, x3));
 
 
    auto filterSup2 = (1 > SquaredDistance3D()) ;
    EXPECT_TRUE(filterSup2.accept(x1, x2));
    EXPECT_FALSE(filterSup2.accept(x1, x3));
    EXPECT_FALSE(filterSup2.accept(x1, x4));
 
    auto filterMax2 = (1 >= SquaredDistance3D()) ;
    EXPECT_TRUE(filterMax2.accept(x1, x2));
    EXPECT_FALSE(filterMax2.accept(x1, x3));
    EXPECT_TRUE(filterMax2.accept(x1, x4));
 
    auto filterInf = (SquaredDistance3D() > 1.) ;
    EXPECT_TRUE(filterInf.accept(x1, x3));
    EXPECT_FALSE(filterInf.accept(x1, x2));
    EXPECT_FALSE(filterInf.accept(x1, x4));
 
    auto filterMin = (SquaredDistance3D() >= 1.) ;
    EXPECT_TRUE(filterMin.accept(x1, x3));
    EXPECT_FALSE(filterMin.accept(x1, x2));
    EXPECT_TRUE(filterMin.accept(x1, x4));
 
    auto filterInf2 = (1 < SquaredDistance3D()) ;
    EXPECT_TRUE(filterInf2.accept(x1, x3));
    EXPECT_FALSE(filterInf2.accept(x1, x2));
    EXPECT_FALSE(filterInf2.accept(x1, x4));
 
    auto filterMin2 = (1 <= SquaredDistance3D()) ;
    EXPECT_TRUE(filterMin2.accept(x1, x3));
    EXPECT_FALSE(filterMin2.accept(x1, x2));
    EXPECT_TRUE(filterMin2.accept(x1, x4));
 
    auto filterRange = (0. < SquaredDistance3D() < 1);
    EXPECT_FALSE(filterRange.accept(x1, x1));
    EXPECT_TRUE(filterRange.accept(x1, x2));
    EXPECT_FALSE(filterRange.accept(x1, x3));
    EXPECT_FALSE(filterRange.accept(x1, x4));
 
    // cppcheck-suppress compareBoolExpressionWithInt
    auto filterClosedRange = (0. <= SquaredDistance3D() <= 1);
    EXPECT_TRUE(filterClosedRange.accept(x1, x1));
    EXPECT_TRUE(filterClosedRange.accept(x1, x2));
    EXPECT_FALSE(filterClosedRange.accept(x1, x3));
    EXPECT_TRUE(filterClosedRange.accept(x1, x4));
 
  }
 
 
  TEST_F(FilterTest, BooleanOperations)
  {
 
 
    spacePoint x1(0.0f , 0.0f, 0.0f);
    spacePoint x2(1.0f , 0.0f, 0.0f);
    spacePoint x3(2.0f , 0.0f, 0.0f);
 
    auto filter = !(SquaredDistance3D() > 1.);
    EXPECT_TRUE(filter.accept(x1, x2));
    EXPECT_TRUE(filter.accept(x1, x1));
    EXPECT_FALSE(filter.accept(x1, x3));
 
    auto filter2 =
      !(SquaredDistance3D() > 1.) &&
      !(SquaredDistance3D() < 1);
    // i.e. SquaredDistance3D == 1
    EXPECT_TRUE(filter2.accept(x1, x2));
    EXPECT_FALSE(filter2.accept(x1, x1));
    EXPECT_FALSE(filter2.accept(x1, x3));
 
 
    auto filter3 =
      (SquaredDistance3D() > 1.) ||
      (SquaredDistance3D() < 1);
    // i.e. SquaredDistance3D != 1
    EXPECT_FALSE(filter3.accept(x1, x2));
    EXPECT_TRUE(filter3.accept(x1, x1));
    EXPECT_TRUE(filter3.accept(x1, x3));
 
 
  }
 
 
  TEST_F(FilterTest, ShortCircuitsEvaluation)
  {
    auto filter(
      (SquaredDistance2Dxy() < 1).observeLeaf(Observer()) &&
      (SquaredDistance3D()   < 1).observeLeaf(Observer())
    );
 
    spacePoint x1(0.0f , 0.0f, 0.0f);
    spacePoint x3(2.0f , 0.0f, 0.0f);
 
    counter< SquaredDistance3D   >::N = 0;
    counter< SquaredDistance2Dxy >::N = 0;
 
    EXPECT_FALSE(filter.accept(x1, x3));
    // since the pair x1, x3 does not satisfy the SquaredDistance2Dxy
    // requirement, we do expect SquaredDistance2Dxy evaluated once:
    EXPECT_EQ(1 , counter< SquaredDistance2Dxy >::N);
    // and SquaredDistance3D not evaluated at all
    EXPECT_EQ(0 , counter< SquaredDistance3D >::N);
 
    EXPECT_TRUE(filter.accept(x1, x1));
    // in this case Distance2Dxy is satisfied
    EXPECT_EQ(2 , counter< SquaredDistance2Dxy >::N);
    // and Distance3D is evaluated
    EXPECT_EQ(1 , counter< SquaredDistance3D >::N);
 
  }
 
 
  TEST_F(FilterTest, BooleanVariableShortcuts)
  {
    auto filter1(BooleanVariable() == true);
    auto filter2(false == BooleanVariable());
    spacePoint x1(0.0f , 0.0f, 0.0f);
    spacePoint x2(1.0f , 0.0f, 0.0f);
 
    EXPECT_TRUE(filter1.accept(x1, x1));
    EXPECT_FALSE(filter1.accept(x1, x2));
 
 
    EXPECT_FALSE(filter2.accept(x1, x1));
    EXPECT_TRUE(filter2.accept(x1, x2));
 
 
 
  }
 
}