1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193
|
// Copyright (c) 2018, ETH Zurich and UNC Chapel Hill.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// * Neither the name of ETH Zurich and UNC Chapel Hill nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
// Author: Johannes L. Schoenberger (jsch at inf.ethz.ch)
#ifndef COLMAP_SRC_UTIL_MISC_H_
#define COLMAP_SRC_UTIL_MISC_H_
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <boost/filesystem.hpp>
#include "util/endian.h"
#include "util/logging.h"
#include "util/string.h"
namespace colmap {
#ifndef STRINGIFY
#define STRINGIFY(s) STRINGIFY_(s)
#define STRINGIFY_(s) #s
#endif // STRINGIFY
// Append trailing slash to string if it does not yet end with a slash.
std::string EnsureTrailingSlash(const std::string& str);
// Check whether file name has the file extension (case insensitive).
bool HasFileExtension(const std::string& file_name, const std::string& ext);
// Split the path into its root and extension, for example,
// "dir/file.jpg" into "dir/file" and ".jpg".
void SplitFileExtension(const std::string& path, std::string* root,
std::string* ext);
// Check if the path points to an existing directory.
bool ExistsFile(const std::string& path);
// Check if the path points to an existing directory.
bool ExistsDir(const std::string& path);
// Check if the path points to an existing file or directory.
bool ExistsPath(const std::string& path);
// Create the directory if it does not exist.
void CreateDirIfNotExists(const std::string& path);
// Extract the base name of a path, e.g., "image.jpg" for "/dir/image.jpg".
std::string GetPathBaseName(const std::string& path);
// Get the path of the parent directory for the given path.
std::string GetParentDir(const std::string& path);
// Join multiple paths into one path.
template <typename... T>
std::string JoinPaths(T const&... paths);
// Return list of files in directory.
std::vector<std::string> GetFileList(const std::string& path);
// Return list of files, recursively in all sub-directories.
std::vector<std::string> GetRecursiveFileList(const std::string& path);
// Return list of directories, recursively in all sub-directories.
std::vector<std::string> GetDirList(const std::string& path);
// Return list of directories, recursively in all sub-directories.
std::vector<std::string> GetRecursiveDirList(const std::string& path);
// Get the size in bytes of a file.
size_t GetFileSize(const std::string& path);
// Print first-order heading with over- and underscores to `std::cout`.
void PrintHeading1(const std::string& heading);
// Print second-order heading with underscores to `std::cout`.
void PrintHeading2(const std::string& heading);
// Check if vector contains elements.
template <typename T>
bool VectorContainsValue(const std::vector<T>& vector, const T value);
template <typename T>
bool VectorContainsDuplicateValues(const std::vector<T>& vector);
// Parse CSV line to a list of values.
template <typename T>
std::vector<T> CSVToVector(const std::string& csv);
// Concatenate values in list to comma-separated list.
template <typename T>
std::string VectorToCSV(const std::vector<T>& values);
// Read contiguous binary blob from file.
template <typename T>
void ReadBinaryBlob(const std::string& path, std::vector<T>* data);
// Write contiguous binary blob to file.
template <typename T>
void WriteBinaryBlob(const std::string& path, const std::vector<T>& data);
// Read each line of a text file into a separate element. Empty lines are
// ignored and leading/trailing whitespace is removed.
std::vector<std::string> ReadTextFileLines(const std::string& path);
// Remove an argument from the list of command-line arguments.
void RemoveCommandLineArgument(const std::string& arg, int* argc, char** argv);
////////////////////////////////////////////////////////////////////////////////
// Implementation
////////////////////////////////////////////////////////////////////////////////
template <typename... T>
std::string JoinPaths(T const&... paths) {
boost::filesystem::path result;
int unpack[]{0, (result = result / boost::filesystem::path(paths), 0)...};
static_cast<void>(unpack);
return result.string();
}
template <typename T>
bool VectorContainsValue(const std::vector<T>& vector, const T value) {
return std::find_if(vector.begin(), vector.end(), [value](const T element) {
return element == value;
}) != vector.end();
}
template <typename T>
bool VectorContainsDuplicateValues(const std::vector<T>& vector) {
std::vector<T> unique_vector = vector;
return std::unique(unique_vector.begin(), unique_vector.end()) !=
unique_vector.end();
}
template <typename T>
std::string VectorToCSV(const std::vector<T>& values) {
std::string string;
for (const T value : values) {
string += std::to_string(value) + ", ";
}
return string.substr(0, string.length() - 2);
}
template <typename T>
void ReadBinaryBlob(const std::string& path, std::vector<T>* data) {
std::ifstream file(path, std::ios::binary | std::ios::ate);
CHECK(file.is_open()) << path;
file.seekg(0, std::ios::end);
const size_t num_bytes = file.tellg();
CHECK_EQ(num_bytes % sizeof(T), 0);
data->resize(num_bytes / sizeof(T));
file.seekg(0, std::ios::beg);
ReadBinaryLittleEndian<T>(&file, data);
}
template <typename T>
void WriteBinaryBlob(const std::string& path, const std::vector<T>& data) {
std::ofstream file(path, std::ios::binary);
CHECK(file.is_open()) << path;
WriteBinaryLittleEndian<T>(&file, data);
}
} // namespace colmap
#endif // COLMAP_SRC_UTIL_MISC_H_
|