1 // Ceres Solver - A fast non-linear least squares minimizer 2 // Copyright 2012 Google Inc. All rights reserved. 3 // 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: sameeragarwal (at) google.com (Sameer Agarwal) 30 31 #include "ceres/array_utils.h" 32 33 #include <limits> 34 #include <cmath> 35 #include "gtest/gtest.h" 36 37 namespace ceres { 38 namespace internal { 39 40 TEST(ArrayUtils, IsArrayValid) { 41 double x[3]; 42 x[0] = 0.0; 43 x[1] = 1.0; 44 x[2] = 2.0; 45 EXPECT_TRUE(IsArrayValid(3, x)); 46 x[1] = std::numeric_limits<double>::infinity(); 47 EXPECT_FALSE(IsArrayValid(3, x)); 48 x[1] = std::numeric_limits<double>::quiet_NaN(); 49 EXPECT_FALSE(IsArrayValid(3, x)); 50 x[1] = std::numeric_limits<double>::signaling_NaN(); 51 EXPECT_FALSE(IsArrayValid(3, x)); 52 EXPECT_TRUE(IsArrayValid(1, NULL)); 53 InvalidateArray(3, x); 54 EXPECT_FALSE(IsArrayValid(3, x)); 55 } 56 57 } // namespace internal 58 } // namespace ceres 59
