blob: 2c0313d530c167c5923ed6af7d28315362b30220 [file] [log] [blame]
Alexander Afanasyev2fc2d672012-03-05 16:57:39 -08001/* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil -*- */
2/*
3 * Copyright (c) 2012 University of California, Los Angeles
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License version 2 as
7 * published by the Free Software Foundation;
8 *
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 *
18 * Author: Zhenkai Zhu <zhenkai@cs.ucla.edu>
Chaoyi Bian3e1eb162012-04-03 16:59:32 -070019 * Chaoyi Bian <bcy@pku.edu.cn>
Alexander Afanasyev2fc2d672012-03-05 16:57:39 -080020 * Alexander Afanasyev <alexander.afanasyev@ucla.edu>
21 */
22
23#include "sync-std-name-info.h"
24
Alexander Afanasyevd95c2312013-11-07 13:45:34 -080025// using namespace std;
Alexander Afanasyeva4ce9cf2012-03-06 14:29:58 -080026using namespace boost;
Alexander Afanasyev2fc2d672012-03-05 16:57:39 -080027
28namespace Sync {
29
30
31NameInfoConstPtr
32StdNameInfo::FindOrCreate (const std::string &key)
33{
Alexander Afanasyeva4ce9cf2012-03-06 14:29:58 -080034 // std::cout << "FindOrCreate: " << m_names.size () << "\n";
35
36 NameInfoConstPtr ret;
37
38 NameMap::iterator item = m_names.find (key);
39 if (item != m_names.end ())
40 {
41 ret = item->second.lock ();
42 BOOST_ASSERT (ret != 0);
43 }
44 else
45 {
46 ret = NameInfoPtr (new StdNameInfo (key));
47 weak_ptr<const NameInfo> value (ret);
Alexander Afanasyevd95c2312013-11-07 13:45:34 -080048 std::pair<NameMap::iterator,bool> inserted =
Alexander Afanasyeva4ce9cf2012-03-06 14:29:58 -080049 m_names.insert (make_pair (key, value));
50
51 BOOST_ASSERT (inserted.second); // previous call has to insert value
52 item = inserted.first;
53 }
Alexander Afanasyev2fc2d672012-03-05 16:57:39 -080054
Alexander Afanasyeva4ce9cf2012-03-06 14:29:58 -080055 return ret;
Alexander Afanasyev2fc2d672012-03-05 16:57:39 -080056}
57
58StdNameInfo::StdNameInfo (const std::string &name)
59 : m_name (name)
60{
61 m_id = m_ids ++; // set ID for a newly inserted element
62 m_digest << name;
Alexander Afanasyeva5858032012-03-09 15:55:10 -080063 m_digest.finalize ();
Alexander Afanasyeva4ce9cf2012-03-06 14:29:58 -080064
65 // std::cout << "StdNameInfo: " << name << " = " << m_id << "\n";
66}
67
68StdNameInfo::~StdNameInfo ()
69{
Alexander Afanasyeva4ce9cf2012-03-06 14:29:58 -080070 // cout << "Destructor for " << m_name << "\n";
71 m_names.erase (toString ());
Alexander Afanasyev2fc2d672012-03-05 16:57:39 -080072}
73
Alexander Afanasyevd95c2312013-11-07 13:45:34 -080074std::string
Alexander Afanasyev2fc2d672012-03-05 16:57:39 -080075StdNameInfo::toString () const
76{
77 return m_name;
78}
79
80bool
81StdNameInfo::operator == (const NameInfo &info) const
82{
Alexander Afanasyeva5625322012-03-06 00:03:41 -080083 return m_name == dynamic_cast<const StdNameInfo&> (info).m_name;
84}
85
86bool
87StdNameInfo::operator < (const NameInfo &info) const
88{
89 return m_name < dynamic_cast<const StdNameInfo&> (info).m_name;
Alexander Afanasyev2fc2d672012-03-05 16:57:39 -080090}
91
92} // Sync