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@google.com (Sameer Agarwal) 30 31#include "ceres/array_utils.h" 32 33#include <cmath> 34#include <cstddef> 35#include "ceres/fpclassify.h" 36 37namespace ceres { 38namespace internal { 39 40// It is a near impossibility that user code generates this exact 41// value in normal operation, thus we will use it to fill arrays 42// before passing them to user code. If on return an element of the 43// array still contains this value, we will assume that the user code 44// did not write to that memory location. 45const double kImpossibleValue = 1e302; 46 47bool IsArrayValid(const int size, const double* x) { 48 if (x != NULL) { 49 for (int i = 0; i < size; ++i) { 50 if (!IsFinite(x[i]) || (x[i] == kImpossibleValue)) { 51 return false; 52 } 53 } 54 } 55 return true; 56} 57 58void InvalidateArray(const int size, double* x) { 59 if (x != NULL) { 60 for (int i = 0; i < size; ++i) { 61 x[i] = kImpossibleValue; 62 } 63 } 64} 65 66} // namespace internal 67} // namespace ceres 68