1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2010 Brian Aker
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#pragma once
#include <drizzled/enum.h>
#include <drizzled/definitions.h>
#include <string.h>
#include <cassert>
#include <ostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <iosfwd>
#include <boost/algorithm/string.hpp>
namespace drizzled {
namespace identifier {
class Catalog : public Identifier
{
public:
Catalog(const std::string &name_arg);
Catalog(const drizzled::lex_string_t &name_arg);
bool isValid() const;
bool compare(const std::string &arg) const;
const std::string &getPath() const
{
return path;
}
const std::string &getName() const
{
return _name;
}
const std::string &name() const
{
return _name;
}
virtual std::string getSQLPath() const
{
return _name;
}
size_t getHashValue() const
{
return hash_value;
}
friend bool operator<(const Catalog &left, const Catalog &right)
{
return boost::ilexicographical_compare(left.getName(), right.getName());
}
friend std::ostream& operator<<(std::ostream& output, const Catalog &identifier)
{
return output << "Catalog:(" << identifier.getName() << ", " << identifier.getPath() << ")";
}
friend bool operator==(const Catalog &left, const Catalog &right)
{
return boost::iequals(left.getName(), right.getName());
}
private:
void init();
std::string _name;
std::string path;
size_t hash_value;
};
inline std::size_t hash_value(Catalog const& b)
{
return b.getHashValue();
}
} /* namespace identifier */
} /* namespace drizzled */
|