1
/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
2
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
4
* Copyright (C) 2010 Brian Aker
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.
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.
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
23
#include <boost/bind.hpp>
24
#include <boost/thread/mutex.hpp>
25
#include <boost/thread/shared_mutex.hpp>
27
#include "drizzled/session.h"
28
#include "drizzled/identifier/table.h"
29
#include "drizzled/definition/cache.h"
31
#include "drizzled/table/instance.h"
35
namespace definition {
37
table::instance::Shared::shared_ptr Cache::find(const identifier::Table::Key &key)
39
boost::mutex::scoped_lock scopedLock(_mutex);
41
Map::iterator iter= cache.find(key);
42
if (iter != cache.end())
44
return (*iter).second;
47
return table::instance::Shared::shared_ptr();
50
void Cache::erase(const identifier::Table::Key &key)
52
boost::mutex::scoped_lock scopedLock(_mutex);
57
bool Cache::insert(const identifier::Table::Key &key, table::instance::Shared::shared_ptr share)
59
boost::mutex::scoped_lock scopedLock(_mutex);
60
std::pair<Map::iterator, bool> ret=
61
cache.insert(std::make_pair(key, share));
66
void Cache::CopyFrom(drizzled::table::instance::Shared::vector &vector)
68
boost::mutex::scoped_lock scopedLock(_mutex);
70
vector.reserve(definition::Cache::singleton().size());
72
std::transform(cache.begin(),
74
std::back_inserter(vector),
75
boost::bind(&Map::value_type::second, _1) );
76
assert(vector.size() == cache.size());
79
} /* namespace definition */
80
} /* namespace drizzled */