31 return left.find(x) != left.end();
35 return right.find(y) != right.end();
40 return left.find(ustring(x))->second;
44 return left.find(x)->second;
48 return right.find(y)->second;
51 unordered_map<ustring, int, ustringHash>::const_iterator
begin()
const
55 unordered_map<ustring, int, ustringHash>::const_iterator
end()
const
61 unordered_map<ustring, int, ustringHash> left;
62 unordered_map<int, ustring> right;
#define CCL_NAMESPACE_END
ustring operator[](int y) const
unordered_map< ustring, int, ustringHash >::const_iterator end() const
int operator[](ustring x) const
void insert(const char *x, int y)
unordered_map< ustring, int, ustringHash >::const_iterator begin() const
int operator[](const char *x) const
bool exists(ustring x) const