blob: ff1bcd77214d11cad3ac9ef651909622bc8ce973 [file] [log] [blame]
Austin Schuh1d1e6ea2020-12-23 21:56:30 -08001// Ceres Solver - A fast non-linear least squares minimizer
Austin Schuh3de38b02024-06-25 18:25:10 -07002// Copyright 2023 Google Inc. All rights reserved.
Austin Schuh1d1e6ea2020-12-23 21:56:30 -08003// http://code.google.com/p/ceres-solver/
4//
5// Redistribution and use in source and binary forms, with or without
6// modification, are permitted provided that the following conditions are met:
7//
8// * Redistributions of source code must retain the above copyright notice,
9// this list of conditions and the following disclaimer.
10// * Redistributions in binary form must reproduce the above copyright notice,
11// this list of conditions and the following disclaimer in the documentation
12// and/or other materials provided with the distribution.
13// * Neither the name of Google Inc. nor the names of its contributors may be
14// used to endorse or promote products derived from this software without
15// specific prior written permission.
16//
17// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27// POSSIBILITY OF SUCH DAMAGE.
28//
29// Author: darius.rueckert@fau.de (Darius Rueckert)
30//
31
32#include "ceres/internal/array_selector.h"
33
34#include "gtest/gtest.h"
35
Austin Schuh3de38b02024-06-25 18:25:10 -070036namespace ceres::internal {
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080037
38// This test only checks, if the correct array implementations are selected. The
39// test for FixedArray is in fixed_array_test.cc. Tests for std::array and
40// std::vector are not included in ceres.
41TEST(ArraySelector, FixedArray) {
42 ArraySelector<int, DYNAMIC, 20> array1(10);
43 static_assert(
Austin Schuh3de38b02024-06-25 18:25:10 -070044 std::is_base_of<internal::FixedArray<int, 20>, decltype(array1)>::value);
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080045 EXPECT_EQ(array1.size(), 10);
46
47 ArraySelector<int, DYNAMIC, 10> array2(20);
48 static_assert(
Austin Schuh3de38b02024-06-25 18:25:10 -070049 std::is_base_of<internal::FixedArray<int, 10>, decltype(array2)>::value);
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080050 EXPECT_EQ(array2.size(), 20);
51}
52
53TEST(ArraySelector, Array) {
54 ArraySelector<int, 10, 20> array1(10);
Austin Schuh3de38b02024-06-25 18:25:10 -070055 static_assert(std::is_base_of<std::array<int, 10>, decltype(array1)>::value);
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080056 EXPECT_EQ(array1.size(), 10);
57
58 ArraySelector<int, 20, 20> array2(20);
Austin Schuh3de38b02024-06-25 18:25:10 -070059 static_assert(std::is_base_of<std::array<int, 20>, decltype(array2)>::value);
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080060 EXPECT_EQ(array2.size(), 20);
61}
62
63TEST(ArraySelector, Vector) {
64 ArraySelector<int, 20, 10> array1(20);
Austin Schuh3de38b02024-06-25 18:25:10 -070065 static_assert(std::is_base_of<std::vector<int>, decltype(array1)>::value);
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080066 EXPECT_EQ(array1.size(), 20);
67
68 ArraySelector<int, 1, 0> array2(1);
Austin Schuh3de38b02024-06-25 18:25:10 -070069 static_assert(std::is_base_of<std::vector<int>, decltype(array2)>::value);
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080070 EXPECT_EQ(array2.size(), 1);
71}
72
Austin Schuh3de38b02024-06-25 18:25:10 -070073} // namespace ceres::internal