utils.hpp

Go to the documentation of this file.

/*****************************************************************************
 * This file is part of uvgVPCCenc V-PCC encoder.
 *
 * Copyright (c) 2024-present, Tampere University, ITU/ISO/IEC, project contributors
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without modification,
 * are permitted (subject to the limitations in the disclaimer below) 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 Tampere University, ITU/ISO/IEC nor the names of its
 *   contributors may be used to endorse or promote products derived from
 *   this software without specific prior written permission.
 *
 * NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE.
 * 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 HOLDER 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
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 * INCLUDING NEGLIGENCE OR OTHERWISE ARISING IN ANY WAY OUT OF THE USE OF THIS
 ****************************************************************************/
 
 
#pragma once
 
#include <array>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <sstream>
 
#include "log.hpp"
 
namespace uvgutils {
 
template <typename T, size_t N>
class VectorN : public std::array<T, N> {
   public:
    VectorN() : std::array<T, N>() {}
    VectorN(T x, T y, T z) : std::array<T, 3>({x, y, z}) {}
    VectorN(std::array<T, N>& arr) : std::array<T, N>(arr) {}
    VectorN(std::array<T, N>&& arr) : std::array<T, N>(std::move(arr)) {}
    VectorN(const std::array<T, N>& arr) { std::copy(arr.begin(), arr.end(), this->begin()); }
    template <typename U>
    VectorN<T, N> operator+(const VectorN<U, N>& other) const {
        VectorN<T, N> result;
        for (size_t i = 0; i < N; ++i) {
            result[i] = (*this)[i] + other[i];
        }
        return result;
    }
 
    template <typename U>
    VectorN<T, N> operator-(const VectorN<U, N>& other) const {
        VectorN<T, N> result;
        for (size_t i = 0; i < N; ++i) {
            result[i] = (*this)[i] - other[i];
        }
        return result;
    }
 
    VectorN<double, N> operator-(const VectorN<double, N>& other) const {
        VectorN<double, N> result;
        for (size_t i = 0; i < N; ++i) {
            result[i] = (*this)[i] - other[i];
        }
        return result;
    }
 
    VectorN<T, N> operator-() const {
        VectorN<T, N> result;
        for (size_t i = 0; i < N; ++i) {
            result[i] = -(*this)[i];
        }
        return result;
    }
 
    template <typename U>
    VectorN<T, N>& operator+=(const VectorN<U, N>& other) {
        for (size_t i = 0; i < N; ++i) {
            (*this)[i] += other[i];
        }
        return *this;
    }
 
    template <typename U>
    VectorN<T, N>& operator/=(const U& val) {
        (*this)[0] /= val;
        (*this)[1] /= val;
        (*this)[2] /= val;
        return *this;
    }
};
 
inline std::string zeroPad(size_t value, size_t width) {
    std::ostringstream oss;
    oss << std::setw(width) << std::setfill('0') << value;
    return oss.str();
};
 
// Round the given number to the nearest bigger multiple.
// equivalent to : return = ceil(numberF/multipleF) * multiple;
// Examples : roundUp(7,8) = 8;  roundUp(17,8) = 24;
inline size_t roundUp(const size_t& number, const size_t& multiple) { return (number + multiple - 1) & -multiple; }
 
}  // namespace uvgutils