aboutsummaryrefslogtreecommitdiffstats
path: root/src/m_key_server_sync/test/KeyServerBatchLogicTest.cpp
blob: 2404b1476638192439086bd2ea7addd5e3460bca (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
/**
 * Copyright (C) 2021-2024 Saturneric <eric@bktus.com>
 *
 * This file is part of GpgFrontend.
 *
 * GpgFrontend is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * GpgFrontend is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with GpgFrontend. If not, see <https://www.gnu.org/licenses/>.
 *
 * The initial version of the source code is inherited from
 * the gpg4usb project, which is under GPL-3.0-or-later.
 *
 * All the source code of GpgFrontend was modified and released by
 * Saturneric <eric@bktus.com> starting on May 12, 2021.
 *
 * SPDX-License-Identifier: GPL-3.0-or-later
 *
 */

#include <gtest/gtest.h>

#include "KeyServerBatchLogic.h"

using KeyServerBatchLogic::BatchKey;

namespace {

auto Key(const QString& fpr, qint64 channel = 0) -> BatchKey {
  return {channel, fpr.right(16), fpr};
}

}  // namespace

TEST(KeyServerBatchLogicTest, OneKeyOrASelectionBecomeOneList) {
  const auto one = KeyServerBatchLogic::Normalise(Key("AAAA"), std::nullopt);
  ASSERT_EQ(one.size(), 1);
  EXPECT_EQ(one.front().fingerprint, "AAAA");

  const auto many = KeyServerBatchLogic::Normalise(
      std::nullopt, QList<BatchKey>{Key("AAAA"), Key("BBBB")});
  ASSERT_EQ(many.size(), 2);
  EXPECT_EQ(many[1].fingerprint, "BBBB");

  EXPECT_TRUE(
      KeyServerBatchLogic::Normalise(std::nullopt, std::nullopt).isEmpty());
}

TEST(KeyServerBatchLogicTest, AKeyNamedTwiceIsActedOnOnceInFirstOrder) {
  // Case and surrounding space do not make a fingerprint a different key.
  const auto keys = KeyServerBatchLogic::Normalise(
      Key("bbbb"), QList<BatchKey>{Key("AAAA"), Key(" BBBB "), Key("AAAA")});
  ASSERT_EQ(keys.size(), 2);
  EXPECT_EQ(keys[0].fingerprint, "bbbb");
  EXPECT_EQ(keys[1].fingerprint, "AAAA");
}

TEST(KeyServerBatchLogicTest, AKeyWithoutAFingerprintIsDropped) {
  const auto keys = KeyServerBatchLogic::Normalise(
      std::nullopt, QList<BatchKey>{Key(""), Key("  "), Key("CCCC")});
  ASSERT_EQ(keys.size(), 1);
  EXPECT_EQ(keys.front().fingerprint, "CCCC");
}

TEST(KeyServerBatchLogicTest, BlocksJoinIntoOneImportOnSeparateLines) {
  const QByteArray a = "-----BEGIN PGP PUBLIC KEY BLOCK-----\nA\n"
                       "-----END PGP PUBLIC KEY BLOCK-----";
  const QByteArray b = "-----BEGIN PGP PUBLIC KEY BLOCK-----\nB\n"
                       "-----END PGP PUBLIC KEY BLOCK-----\n";
  const auto joined = KeyServerBatchLogic::JoinForImport({a, "", "  \n", b});
  EXPECT_EQ(joined, a + "\n" + b);
  EXPECT_TRUE(KeyServerBatchLogic::JoinForImport({}).isEmpty());
}

TEST(KeyServerBatchLogicTest, SummariesCountAndListFailures) {
  const auto clean = KeyServerBatchLogic::RefreshSummary(3, 3, {});
  EXPECT_TRUE(clean.contains("3 of 3"));
  EXPECT_FALSE(clean.contains("Failed"));

  const auto partial =
      KeyServerBatchLogic::RefreshSummary(1, 2, {"BBBB: not found"});
  EXPECT_TRUE(partial.contains("1 of 2"));
  EXPECT_TRUE(partial.contains("BBBB: not found"));

  const auto published = KeyServerBatchLogic::PublishSummary(
      2, 2, "keys.openpgp.org", {});
  EXPECT_TRUE(published.contains("2 of 2"));
  EXPECT_TRUE(published.contains("keys.openpgp.org"));
}