e6f3239bef
This is one less thing for users to worry about when compiling and linking the library itself
119 lines
3.1 KiB
C++
119 lines
3.1 KiB
C++
#ifndef tree_sitter_stream_methods_h
|
|
#define tree_sitter_stream_methods_h
|
|
|
|
#include <iostream>
|
|
#include <set>
|
|
#include <unordered_map>
|
|
#include <map>
|
|
#include <unordered_set>
|
|
#include <vector>
|
|
#include "tree_sitter/compiler.h"
|
|
|
|
using std::cout;
|
|
|
|
namespace std {
|
|
|
|
template<typename T>
|
|
inline std::ostream& operator<<(std::ostream &stream, const std::vector<T> &vector) {
|
|
stream << std::string("(vector: ");
|
|
bool started = false;
|
|
for (auto item : vector) {
|
|
if (started) stream << std::string(", ");
|
|
stream << item;
|
|
started = true;
|
|
}
|
|
return stream << ")";
|
|
}
|
|
|
|
template<typename T>
|
|
inline std::ostream& operator<<(std::ostream &stream, const std::set<T> &set) {
|
|
stream << std::string("(set: ");
|
|
bool started = false;
|
|
for (auto item : set) {
|
|
if (started) stream << std::string(", ");
|
|
stream << item;
|
|
started = true;
|
|
}
|
|
return stream << ")";
|
|
}
|
|
|
|
template<typename T>
|
|
inline std::ostream& operator<<(std::ostream &stream, const std::unordered_set<T> &set) {
|
|
stream << std::string("(set: ");
|
|
bool started = false;
|
|
for (auto item : set) {
|
|
if (started) stream << std::string(", ");
|
|
stream << item;
|
|
started = true;
|
|
}
|
|
return stream << ")";
|
|
}
|
|
|
|
template<typename TKey, typename TValue>
|
|
inline std::ostream& operator<<(std::ostream &stream, const std::map<TKey, TValue> &map) {
|
|
stream << std::string("(map: ");
|
|
bool started = false;
|
|
for (auto pair : map) {
|
|
if (started) stream << std::string(", ");
|
|
stream << pair.first;
|
|
stream << std::string(" => ");
|
|
stream << pair.second;
|
|
started = true;
|
|
}
|
|
return stream << ")";
|
|
}
|
|
|
|
template<typename TKey, typename TValue>
|
|
inline std::ostream& operator<<(std::ostream &stream, const std::unordered_map<TKey, TValue> &map) {
|
|
stream << std::string("(map: ");
|
|
bool started = false;
|
|
for (auto pair : map) {
|
|
if (started) stream << std::string(", ");
|
|
stream << pair.first;
|
|
stream << std::string(" => ");
|
|
stream << pair.second;
|
|
started = true;
|
|
}
|
|
return stream << ")";
|
|
}
|
|
|
|
template<typename T1, typename T2>
|
|
inline std::ostream& operator<<(std::ostream &stream, const std::pair<T1, T2> &pair) {
|
|
return stream << "{" << pair.first << ", " << pair.second << "}";
|
|
}
|
|
|
|
} // namespace std
|
|
|
|
namespace tree_sitter {
|
|
|
|
using std::ostream;
|
|
using std::string;
|
|
using std::to_string;
|
|
struct RuleEntry;
|
|
class LexAction;
|
|
class ParseAction;
|
|
class ParseState;
|
|
|
|
ostream &operator<<(ostream &, const Grammar &);
|
|
ostream &operator<<(ostream &, const GrammarError &);
|
|
ostream &operator<<(ostream &, const Rule &);
|
|
ostream &operator<<(ostream &, const rule_ptr &);
|
|
ostream &operator<<(ostream &, const RuleEntry &);
|
|
std::ostream &operator<<(ostream &stream, const LexAction &);
|
|
std::ostream &operator<<(ostream &stream, const ParseAction &);
|
|
std::ostream &operator<<(ostream &stream, const ParseState &);
|
|
|
|
namespace build_tables {
|
|
|
|
struct MetadataRange;
|
|
class LexItem;
|
|
class ParseItem;
|
|
|
|
ostream &operator<<(ostream &stream, const MetadataRange &);
|
|
ostream &operator<<(ostream &stream, const LexItem &);
|
|
ostream &operator<<(ostream &stream, const ParseItem &);
|
|
|
|
} // namespace build_tables
|
|
} // namespace tree_sitter
|
|
|
|
#endif
|