src/gromacs/trajectoryanalysis/tests/unionfind.cpp

   1 /*
   2  * This file is part of the GROMACS molecular simulation package.
   3  *
   4  * Copyright (c) 2017,2019, by the GROMACS development team, led by
   5  * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
   6  * and including many others, as listed in the AUTHORS file in the
   7  * top-level source directory and at http://www.gromacs.org.
   8  *
   9  * GROMACS is free software; you can redistribute it and/or
  10  * modify it under the terms of the GNU Lesser General Public License
  11  * as published by the Free Software Foundation; either version 2.1
  12  * of the License, or (at your option) any later version.
  13  *
  14  * GROMACS is distributed in the hope that it will be useful,
  15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  17  * Lesser General Public License for more details.
  18  *
  19  * You should have received a copy of the GNU Lesser General Public
  20  * License along with GROMACS; if not, see
  21  * http://www.gnu.org/licenses, or write to the Free Software Foundation,
  22  * Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA.
  23  *
  24  * If you want to redistribute modifications to GROMACS, please
  25  * consider that scientific software is very special. Version
  26  * control is crucial - bugs must be traceable. We will be happy to
  27  * consider code for inclusion in the official distribution, but
  28  * derived work must not be called official GROMACS. Details are found
  29  * in the README & COPYING files - if they are missing, get the
  30  * official version at http://www.gromacs.org.
  31  *
  32  * To help us fund GROMACS development, we humbly ask that you cite
  33  * the research papers on the package. Check out http://www.gromacs.org.
  34  */
  35 /*! \internal \file
  36  * \brief
  37  * Tests for the union-find implementation in unionfind.h.
  38  *
  39  * \author Teemu Murtola <teemu.murtola@gmail.com>
  40  * \ingroup module_trajectoryanalysis
  41  */
  42 #include "gmxpre.h"
  43
  44 #include "gromacs/trajectoryanalysis/modules/unionfind.h"
  45
  46 #include <gmock/gmock.h>
  47 #include <gtest/gtest.h>
  48
  49 namespace
  50 {
  51
  52 /********************************************************************
  53  * Tests for UnionFinder
  54  */
  55
  56 TEST(UnionFinderTest, WorksEmpty)
  57 {
  58     using ::testing::IsEmpty;
  59     gmx::UnionFinder finder;
  60     finder.init(0);
  61     EXPECT_THAT(finder.allSizes(), IsEmpty());
  62 }
  63
  64 TEST(UnionFinderTest, BasicMerges)
  65 {
  66     using ::testing::Each;
  67     using ::testing::UnorderedElementsAre;
  68     gmx::UnionFinder finder;
  69     finder.init(7);
  70     EXPECT_EQ(7U, finder.allSizes().size());
  71     EXPECT_THAT(finder.allSizes(), Each(1));
  72     finder.merge(0, 1);
  73     finder.merge(2, 3);
  74     finder.merge(0, 4);
  75     finder.merge(3, 5);
  76     EXPECT_THAT(finder.allSizes(), UnorderedElementsAre(3, 3, 1));
  77 }
  78
  79 TEST(UnionFinderTest, LargerMerges)
  80 {
  81     using ::testing::UnorderedElementsAre;
  82     gmx::UnionFinder finder;
  83     finder.init(7);
  84     finder.merge(0, 1);
  85     finder.merge(2, 3);
  86     finder.merge(4, 5);
  87     finder.merge(3, 5);
  88     finder.merge(1, 5);
  89     EXPECT_THAT(finder.allSizes(), UnorderedElementsAre(6, 1));
  90 }
  91
  92 TEST(UnionFinderTest, LongRightMerge)
  93 {
  94     using ::testing::ElementsAre;
  95     gmx::UnionFinder finder;
  96     finder.init(7);
  97     finder.merge(0, 1);
  98     finder.merge(1, 2);
  99     finder.merge(2, 3);
 100     finder.merge(3, 4);
 101     finder.merge(4, 5);
 102     finder.merge(5, 6);
 103     EXPECT_THAT(finder.allSizes(), ElementsAre(7));
 104 }
 105
 106 TEST(UnionFinderTest, LongLeftMerge)
 107 {
 108     using ::testing::ElementsAre;
 109     gmx::UnionFinder finder;
 110     finder.init(7);
 111     finder.merge(5, 6);
 112     finder.merge(4, 5);
 113     finder.merge(3, 4);
 114     finder.merge(2, 3);
 115     finder.merge(1, 2);
 116     finder.merge(0, 1);
 117     EXPECT_THAT(finder.allSizes(), ElementsAre(7));
 118 }
 119
 120 /********************************************************************
 121  * Tests for MappedUnionFinder
 122  */
 123
 124 TEST(MappedUnionFinderTest, BasicMerges)
 125 {
 126     using ::testing::Each;
 127     const int              mapping[] = { 1, 1, 2, 2, 4, 6 };
 128     gmx::MappedUnionFinder finder;
 129     finder.initWithGroupIndices(mapping);
 130     EXPECT_EQ(4U, finder.allSizes().size());
 131     EXPECT_THAT(finder.allSizes(), Each(1));
 132     finder.mergeGroups(1, 4);
 133     finder.mergeGroups(2, 6);
 134     EXPECT_EQ(2U, finder.allSizes().size());
 135     EXPECT_THAT(finder.allSizes(), Each(2));
 136 }
 137
 138 } // namespace