183 lines
4.1 KiB
C++
183 lines
4.1 KiB
C++
/*
|
|
* The MIT License (MIT)
|
|
*
|
|
* Copyright (C) 2013 Yanyi Wu
|
|
* Copyright (C) 2023, KylinSoft Co., Ltd.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
* to deal in the Software without restriction, including without limitation
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be
|
|
* included in all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
|
|
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
|
|
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
* OTHER DEALINGS IN THE SOFTWARE.
|
|
*
|
|
*/
|
|
#ifndef LIMONP_STD_EXTEMSION_HPP
|
|
#define LIMONP_STD_EXTEMSION_HPP
|
|
|
|
#include <map>
|
|
|
|
#ifdef __APPLE__
|
|
#include <unordered_map>
|
|
#include <unordered_set>
|
|
#elif(__cplusplus >= 201103L)
|
|
#include <unordered_map>
|
|
#include <unordered_set>
|
|
#elif defined _MSC_VER
|
|
#include <unordered_map>
|
|
#include <unordered_set>
|
|
#else
|
|
#include <tr1/unordered_map>
|
|
#include <tr1/unordered_set>
|
|
namespace std {
|
|
using std::tr1::unordered_map;
|
|
using std::tr1::unordered_set;
|
|
}
|
|
|
|
#endif
|
|
|
|
#include <set>
|
|
#include <string>
|
|
#include <vector>
|
|
#include <deque>
|
|
#include <fstream>
|
|
#include <sstream>
|
|
|
|
namespace std {
|
|
|
|
template<typename T>
|
|
ostream& operator << (ostream& os, const vector<T>& v) {
|
|
if(v.empty()) {
|
|
return os << "[]";
|
|
}
|
|
os<<"["<<v[0];
|
|
for(size_t i = 1; i < v.size(); i++) {
|
|
os<<", "<<v[i];
|
|
}
|
|
os<<"]";
|
|
return os;
|
|
}
|
|
|
|
template<>
|
|
inline ostream& operator << (ostream& os, const vector<string>& v) {
|
|
if(v.empty()) {
|
|
return os << "[]";
|
|
}
|
|
os<<"[\""<<v[0];
|
|
for(size_t i = 1; i < v.size(); i++) {
|
|
os<<"\", \""<<v[i];
|
|
}
|
|
os<<"\"]";
|
|
return os;
|
|
}
|
|
|
|
template<typename T>
|
|
ostream& operator << (ostream& os, const deque<T>& dq) {
|
|
if(dq.empty()) {
|
|
return os << "[]";
|
|
}
|
|
os<<"[\""<<dq[0];
|
|
for(size_t i = 1; i < dq.size(); i++) {
|
|
os<<"\", \""<<dq[i];
|
|
}
|
|
os<<"\"]";
|
|
return os;
|
|
}
|
|
|
|
|
|
template<class T1, class T2>
|
|
ostream& operator << (ostream& os, const pair<T1, T2>& pr) {
|
|
os << pr.first << ":" << pr.second ;
|
|
return os;
|
|
}
|
|
|
|
|
|
template<class T>
|
|
string& operator << (string& str, const T& obj) {
|
|
stringstream ss;
|
|
ss << obj; // call ostream& operator << (ostream& os,
|
|
return str = ss.str();
|
|
}
|
|
|
|
template<class T1, class T2>
|
|
ostream& operator << (ostream& os, const map<T1, T2>& mp) {
|
|
if(mp.empty()) {
|
|
os<<"{}";
|
|
return os;
|
|
}
|
|
os<<'{';
|
|
typename map<T1, T2>::const_iterator it = mp.begin();
|
|
os<<*it;
|
|
it++;
|
|
while(it != mp.end()) {
|
|
os<<", "<<*it;
|
|
it++;
|
|
}
|
|
os<<'}';
|
|
return os;
|
|
}
|
|
template<class T1, class T2>
|
|
ostream& operator << (ostream& os, const std::unordered_map<T1, T2>& mp) {
|
|
if(mp.empty()) {
|
|
return os << "{}";
|
|
}
|
|
os<<'{';
|
|
typename std::unordered_map<T1, T2>::const_iterator it = mp.begin();
|
|
os<<*it;
|
|
it++;
|
|
while(it != mp.end()) {
|
|
os<<", "<<*it++;
|
|
}
|
|
return os<<'}';
|
|
}
|
|
|
|
template<class T>
|
|
ostream& operator << (ostream& os, const set<T>& st) {
|
|
if(st.empty()) {
|
|
os << "{}";
|
|
return os;
|
|
}
|
|
os<<'{';
|
|
typename set<T>::const_iterator it = st.begin();
|
|
os<<*it;
|
|
it++;
|
|
while(it != st.end()) {
|
|
os<<", "<<*it;
|
|
it++;
|
|
}
|
|
os<<'}';
|
|
return os;
|
|
}
|
|
|
|
template<class KeyType, class ContainType>
|
|
bool IsIn(const ContainType& contain, const KeyType& key) {
|
|
return contain.end() != contain.find(key);
|
|
}
|
|
|
|
template<class T>
|
|
basic_string<T> & operator << (basic_string<T> & s, ifstream & ifs) {
|
|
return s.assign((istreambuf_iterator<T>(ifs)), istreambuf_iterator<T>());
|
|
}
|
|
|
|
template<class T>
|
|
ofstream & operator << (ofstream & ofs, const basic_string<T>& s) {
|
|
ostreambuf_iterator<T> itr (ofs);
|
|
copy(s.begin(), s.end(), itr);
|
|
return ofs;
|
|
}
|
|
|
|
} // namespace std
|
|
|
|
#endif
|