Electroneum
apply_permutation.cpp
Go to the documentation of this file.
1 // Copyright (c) 2017-2019, The Monero Project
2 //
3 // All rights reserved.
4 //
5 // Redistribution and use in source and binary forms, with or without modification, are
6 // permitted provided that the following conditions are met:
7 //
8 // 1. Redistributions of source code must retain the above copyright notice, this list of
9 // conditions and the following disclaimer.
10 //
11 // 2. Redistributions in binary form must reproduce the above copyright notice, this list
12 // of conditions and the following disclaimer in the documentation and/or other
13 // materials provided with the distribution.
14 //
15 // 3. Neither the name of the copyright holder nor the names of its contributors may be
16 // used to endorse or promote products derived from this software without specific
17 // prior written permission.
18 //
19 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
20 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 // MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
22 // THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
26 // STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
27 // THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 
29 #include "gtest/gtest.h"
31 
33 {
34  std::vector<int> v = {};
36  ASSERT_EQ(v, std::vector<int>({}));
37 }
38 
40 {
41  // 0 1 2 3 4 5 6
42  std::vector<int> v = {8, 4, 6, 1, 7, 2, 4};
43  tools::apply_permutation({3, 5, 6, 1, 2, 4, 0}, v);
44  ASSERT_EQ(v, std::vector<int>({1, 2, 4, 4, 6, 7, 8}));
45 }
46 
48 {
49  std::vector<int> v_large = {8, 4, 6, 1, 7, 2, 4, 9};
50  std::vector<int> v_small = {8, 4, 6, 1, 7, 2};
51  try
52  {
53  tools::apply_permutation({3, 5, 6, 1, 2, 4, 0}, v_large);
54  ASSERT_FALSE(true);
55  }
56  catch (const std::exception &e) {}
57  try
58  {
59  tools::apply_permutation({3, 5, 6, 1, 2, 4, 0}, v_small);
60  ASSERT_FALSE(true);
61  }
62  catch (const std::exception &e) {}
63 }
64 
65 TEST(apply_permutation, bad_permutation)
66 {
67  std::vector<int> v = {8, 4, 6, 1, 7, 2, 4};
68  try
69  {
70  tools::apply_permutation({3, 5, 6, 1, 2, 4, 1}, v);
71  ASSERT_FALSE(true);
72  }
73  catch (const std::exception &e) {}
74 }
void apply_permutation(std::vector< size_t > permutation, const F &swap)
#define ASSERT_FALSE(condition)
Definition: gtest.h:1868
#define ASSERT_EQ(val1, val2)
Definition: gtest.h:1956
TEST(apply_permutation, empty)