forked from huawei/mindspore2022
141 lines
3.1 KiB
C++
141 lines
3.1 KiB
C++
/**
|
|
* Copyright 2019 Huawei Technologies Co., Ltd
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
#ifndef MINDSPORE_CCSRC_UTILS_OVERLOAD_H_
|
|
#define MINDSPORE_CCSRC_UTILS_OVERLOAD_H_
|
|
|
|
#include <list>
|
|
#include <utility>
|
|
#include <vector>
|
|
#include <iostream>
|
|
#include <initializer_list>
|
|
#include <unordered_map>
|
|
#include <map>
|
|
#include <memory>
|
|
#include <string>
|
|
|
|
namespace mindspore {
|
|
|
|
template <typename T>
|
|
std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
|
|
out << "[const vector][";
|
|
size_t last = v.size() - 1;
|
|
for (size_t i = 0; i < v.size(); ++i) {
|
|
out << v[i];
|
|
if (i != last) out << ", ";
|
|
}
|
|
out << "]";
|
|
return out;
|
|
}
|
|
|
|
template <typename T>
|
|
std::ostream &operator<<(std::ostream &os, const std::list<T> &vec) {
|
|
bool begin = true;
|
|
os << "[const list][";
|
|
for (auto &item : vec) {
|
|
if (!begin) {
|
|
os << ", ";
|
|
} else {
|
|
begin = false;
|
|
}
|
|
os << item;
|
|
}
|
|
os << "]";
|
|
|
|
return os;
|
|
}
|
|
|
|
template <typename T>
|
|
std::ostream &operator<<(std::ostream &os, const std::initializer_list<T> &vec) {
|
|
bool begin = true;
|
|
os << "[";
|
|
for (auto &item : vec) {
|
|
if (!begin) {
|
|
os << ", ";
|
|
} else {
|
|
begin = false;
|
|
}
|
|
os << item;
|
|
}
|
|
os << "]";
|
|
|
|
return os;
|
|
}
|
|
|
|
template <typename T>
|
|
bool operator==(const std::initializer_list<T> &lhs, const std::initializer_list<T> &rhs) {
|
|
if (lhs.size() != rhs.size()) {
|
|
return false;
|
|
}
|
|
auto lit = lhs.begin();
|
|
auto rit = rhs.begin();
|
|
while (lit != lhs.end()) {
|
|
if (!(*lit == *rit)) {
|
|
return false;
|
|
}
|
|
lit++;
|
|
rit++;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
template <typename T1, typename T2>
|
|
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pair) {
|
|
os << "[const pair]";
|
|
|
|
return os;
|
|
}
|
|
|
|
template <typename T1, typename T2, typename T3>
|
|
std::ostream &operator<<(std::ostream &os, const std::unordered_map<T1, T2, T3> &map) {
|
|
os << "[const unordered_map]";
|
|
return os;
|
|
}
|
|
|
|
template <typename T1, typename T2, typename T3>
|
|
std::ostream &operator<<(std::ostream &os, const std::map<T1, T2, T3> &map) {
|
|
os << "[const map]";
|
|
return os;
|
|
}
|
|
|
|
template <typename T>
|
|
std::string ToString(const std::vector<T> &vec) {
|
|
std::ostringstream buffer;
|
|
|
|
buffer << vec;
|
|
return buffer.str();
|
|
}
|
|
|
|
template <typename T1, typename T2>
|
|
std::string ToString(const std::unordered_map<T1, T2> &map) {
|
|
std::ostringstream buffer;
|
|
|
|
buffer << map;
|
|
return buffer.str();
|
|
}
|
|
|
|
template <typename T1, typename T2>
|
|
std::string ToString(const std::map<T1, T2> &map) {
|
|
std::ostringstream buffer;
|
|
|
|
buffer << map;
|
|
return buffer.str();
|
|
}
|
|
|
|
} // namespace mindspore
|
|
|
|
#endif // MINDSPORE_CCSRC_UTILS_OVERLOAD_H_
|