~drizzle-trunk/drizzle/development

1340.1.5 by Brian Aker
Update, we now have all of the ANSI INFORMATION_SCHEMA listed.
1
/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
2
 *  vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
3
 *
4
 *  Copyright (C) 2010 Brian Aker
5
 *
6
 *  This program is free software; you can redistribute it and/or modify
7
 *  it under the terms of the GNU General Public License as published by
8
 *  the Free Software Foundation; either version 2 of the License, or
9
 *  (at your option) any later version.
10
 *
11
 *  This program is distributed in the hope that it will be useful,
12
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
13
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14
 *  GNU General Public License for more details.
15
 *
16
 *  You should have received a copy of the GNU General Public License
17
 *  along with this program; if not, write to the Free Software
18
 *  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
19
 */
20
21
#include "config.h"
22
#include "plugin/information_schema_dictionary/dictionary.h"
23
24
using namespace std;
25
using namespace drizzled;
26
27
DomainConstraints::DomainConstraints() :
28
  InformationSchema("DOMAIN_CONSTRAINTS")
29
{
30
  add_field("CONSTRAINT_CATALOG");
31
  add_field("CONSTRAINT_SCHEMA");
32
  add_field("CONSTRAINT_NAME");
33
  add_field("DOMAIN_CATALOG");
34
  add_field("DOMAIN_SCHEMA");
35
  add_field("DOMAIN_NAME");
36
  add_field("IS_DEFERRABLE");
37
  add_field("INITIALLY_DEFERRED");
38
}
39
40
void DomainConstraints::Generator::fill()
41
{
42
}
43
44
bool DomainConstraints::Generator::nextCore()
45
{
46
  return false;
47
}
48
49
bool DomainConstraints::Generator::next()
50
{
51
  while (not nextCore())
52
  {
53
    return false;
54
  }
55
56
  return true;
57
}
58
59
DomainConstraints::Generator::Generator(drizzled::Field **arg) :
60
  InformationSchema::Generator(arg),
61
  is_primed(false)
62
{
63
}
64
65
bool DomainConstraints::Generator::populate()
66
{
67
  if (not next())
68
    return false;
69
70
  fill();
71
72
  return true;
73
}