blob: 9f0fa0dfdcbaec5df8459559b8aa91e6862385e9 [file] [log] [blame]
akmhoque66e66182014-02-21 17:56:03 -06001/* -*- 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>
19 * Chaoyi Bian <bcy@pku.edu.cn>
Vince Lehman0a7da612014-10-29 14:39:29 -050020 * Alexander Afanasyev <alexander.afanasyev@ucla.edu>
akmhoque66e66182014-02-21 17:56:03 -060021 */
22
23#include "sync-std-name-info.h"
24
akmhoque66e66182014-02-21 17:56:03 -060025namespace Sync {
26
27
28NameInfoConstPtr
29StdNameInfo::FindOrCreate (const std::string &key)
30{
31 // std::cout << "FindOrCreate: " << m_names.size () << "\n";
Vince Lehman0a7da612014-10-29 14:39:29 -050032
akmhoque66e66182014-02-21 17:56:03 -060033 NameInfoConstPtr ret;
Vince Lehman0a7da612014-10-29 14:39:29 -050034
akmhoque66e66182014-02-21 17:56:03 -060035 NameMap::iterator item = m_names.find (key);
36 if (item != m_names.end ())
37 {
38 ret = item->second.lock ();
39 BOOST_ASSERT (ret != 0);
40 }
41 else
42 {
43 ret = NameInfoPtr (new StdNameInfo (key));
44 weak_ptr<const NameInfo> value (ret);
45 std::pair<NameMap::iterator,bool> inserted =
46 m_names.insert (make_pair (key, value));
Vince Lehman0a7da612014-10-29 14:39:29 -050047
akmhoque66e66182014-02-21 17:56:03 -060048 BOOST_ASSERT (inserted.second); // previous call has to insert value
49 item = inserted.first;
50 }
51
52 return ret;
53}
54
55StdNameInfo::StdNameInfo (const std::string &name)
56 : m_name (name)
57{
58 m_id = m_ids ++; // set ID for a newly inserted element
59 m_digest << name;
60 m_digest.finalize ();
61
62 // std::cout << "StdNameInfo: " << name << " = " << m_id << "\n";
63}
64
65StdNameInfo::~StdNameInfo ()
66{
67 // cout << "Destructor for " << m_name << "\n";
68 m_names.erase (toString ());
69}
70
71std::string
72StdNameInfo::toString () const
73{
74 return m_name;
75}
76
77bool
78StdNameInfo::operator == (const NameInfo &info) const
79{
80 return m_name == dynamic_cast<const StdNameInfo&> (info).m_name;
81}
82
83bool
84StdNameInfo::operator < (const NameInfo &info) const
85{
86 return m_name < dynamic_cast<const StdNameInfo&> (info).m_name;
87}
88
89} // Sync