1 // Ceres Solver - A fast non-linear least squares minimizer
2 // Copyright 2015 Google Inc. All rights reserved.
3 // http://ceres-solver.org/
5 // Redistribution and use in source and binary forms, with or without
6 // modification, are permitted provided that the following conditions are met:
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.
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.
29 // Author: sameeragarwal@google.com (Sameer Agarwal)
31 #include "ceres/array_utils.h"
38 #include "ceres/fpclassify.h"
39 #include "ceres/stringprintf.h"
40 #include "ceres/types.h"
46 bool IsArrayValid(const int size, const double* x) {
48 for (int i = 0; i < size; ++i) {
49 if (!IsFinite(x[i]) || (x[i] == kImpossibleValue)) {
57 int FindInvalidValue(const int size, const double* x) {
62 for (int i = 0; i < size; ++i) {
63 if (!IsFinite(x[i]) || (x[i] == kImpossibleValue)) {
71 void InvalidateArray(const int size, double* x) {
73 for (int i = 0; i < size; ++i) {
74 x[i] = kImpossibleValue;
79 void AppendArrayToString(const int size, const double* x, string* result) {
80 for (int i = 0; i < size; ++i) {
82 StringAppendF(result, "Not Computed ");
84 if (x[i] == kImpossibleValue) {
85 StringAppendF(result, "Uninitialized ");
87 StringAppendF(result, "%12g ", x[i]);
93 void MapValuesToContiguousRange(const int size, int* array) {
94 std::vector<int> unique_values(array, array + size);
95 std::sort(unique_values.begin(), unique_values.end());
96 unique_values.erase(std::unique(unique_values.begin(),
100 for (int i = 0; i < size; ++i) {
101 array[i] = std::lower_bound(unique_values.begin(),
103 array[i]) - unique_values.begin();
107 } // namespace internal