summaryrefslogtreecommitdiffstats
path: root/xpcom/tests/gtest/TestArrayAlgorithm.cpp
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-19 00:47:55 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-19 00:47:55 +0000
commit26a029d407be480d791972afb5975cf62c9360a6 (patch)
treef435a8308119effd964b339f76abb83a57c29483 /xpcom/tests/gtest/TestArrayAlgorithm.cpp
parentInitial commit. (diff)
downloadfirefox-26a029d407be480d791972afb5975cf62c9360a6.tar.xz
firefox-26a029d407be480d791972afb5975cf62c9360a6.zip
Adding upstream version 124.0.1.upstream/124.0.1
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'xpcom/tests/gtest/TestArrayAlgorithm.cpp')
-rw-r--r--xpcom/tests/gtest/TestArrayAlgorithm.cpp108
1 files changed, 108 insertions, 0 deletions
diff --git a/xpcom/tests/gtest/TestArrayAlgorithm.cpp b/xpcom/tests/gtest/TestArrayAlgorithm.cpp
new file mode 100644
index 0000000000..fbaf9a6a24
--- /dev/null
+++ b/xpcom/tests/gtest/TestArrayAlgorithm.cpp
@@ -0,0 +1,108 @@
+/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
+/* vim: set ts=8 sts=2 et sw=2 tw=80: */
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+#include "gtest/gtest.h"
+
+#include "mozilla/ArrayAlgorithm.h"
+#include "mozilla/Result.h"
+#include "mozilla/ResultExtensions.h"
+#include "nsTArray.h"
+
+using namespace mozilla;
+using std::begin;
+using std::end;
+
+namespace {
+constexpr static int32_t arr1[3] = {1, 2, 3};
+}
+
+TEST(nsAlgorithm_TransformIntoNewArrayAbortOnErr, NoError_Fallible)
+{
+ auto res = TransformIntoNewArrayAbortOnErr(
+ begin(arr1), end(arr1),
+ [](const int32_t value) -> Result<int64_t, nsresult> {
+ return value * 10;
+ },
+ fallible);
+ ASSERT_TRUE(res.isOk());
+ const nsTArray<int64_t>& out = res.inspect();
+
+ const nsTArray<int64_t> expected = {10, 20, 30};
+ ASSERT_EQ(expected, out);
+}
+
+TEST(nsAlgorithm_TransformIntoNewArrayAbortOnErr, NoError_Fallible_Range)
+{
+ auto res = TransformIntoNewArrayAbortOnErr(
+ arr1,
+ [](const int32_t value) -> Result<int64_t, nsresult> {
+ return value * 10;
+ },
+ fallible);
+ ASSERT_TRUE(res.isOk());
+ const nsTArray<int64_t>& out = res.inspect();
+
+ const nsTArray<int64_t> expected = {10, 20, 30};
+ ASSERT_EQ(expected, out);
+}
+
+TEST(nsAlgorithm_TransformIntoNewArrayAbortOnErr, ErrorOnOther_Fallible)
+{
+ auto res = TransformIntoNewArrayAbortOnErr(
+ begin(arr1), end(arr1),
+ [](const int32_t value) -> Result<int64_t, nsresult> {
+ if (value > 1) {
+ return Err(NS_ERROR_FAILURE);
+ }
+ return value * 10;
+ },
+ fallible);
+ ASSERT_TRUE(res.isErr());
+ ASSERT_EQ(NS_ERROR_FAILURE, res.inspectErr());
+}
+
+TEST(nsAlgorithm_TransformIntoNewArray, NoError)
+{
+ auto res = TransformIntoNewArray(
+ begin(arr1), end(arr1),
+ [](const int32_t value) -> int64_t { return value * 10; });
+
+ const nsTArray<int64_t> expected = {10, 20, 30};
+ ASSERT_EQ(expected, res);
+}
+
+TEST(nsAlgorithm_TransformIntoNewArray, NoError_Range)
+{
+ auto res = TransformIntoNewArray(
+ arr1, [](const int32_t value) -> int64_t { return value * 10; });
+
+ const nsTArray<int64_t> expected = {10, 20, 30};
+ ASSERT_EQ(expected, res);
+}
+
+TEST(nsAlgorithm_TransformIntoNewArray, NoError_Fallible)
+{
+ auto res = TransformIntoNewArray(
+ begin(arr1), end(arr1),
+ [](const int32_t value) -> int64_t { return value * 10; }, fallible);
+ ASSERT_TRUE(res.isOk());
+ const nsTArray<int64_t>& out = res.inspect();
+
+ const nsTArray<int64_t> expected = {10, 20, 30};
+ ASSERT_EQ(expected, out);
+}
+
+TEST(nsAlgorithm_TransformIntoNewArray, NoError_Fallible_Range)
+{
+ auto res = TransformIntoNewArray(
+ arr1, [](const int32_t value) -> int64_t { return value * 10; },
+ fallible);
+ ASSERT_TRUE(res.isOk());
+ const nsTArray<int64_t>& out = res.inspect();
+
+ const nsTArray<int64_t> expected = {10, 20, 30};
+ ASSERT_EQ(expected, out);
+}