akmhoque | 66e6618 | 2014-02-21 17:56:03 -0600 | [diff] [blame] | 1 | /* -*- 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> |
| 20 | * Alexander Afanasyev <alexander.afanasyev@ucla.edu> |
| 21 | */ |
| 22 | |
| 23 | #include "sync-std-name-info.h" |
| 24 | |
| 25 | // using namespace std; |
| 26 | using namespace boost; |
| 27 | |
| 28 | namespace Sync { |
| 29 | |
| 30 | |
| 31 | NameInfoConstPtr |
| 32 | StdNameInfo::FindOrCreate (const std::string &key) |
| 33 | { |
| 34 | // 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); |
| 48 | std::pair<NameMap::iterator,bool> inserted = |
| 49 | m_names.insert (make_pair (key, value)); |
| 50 | |
| 51 | BOOST_ASSERT (inserted.second); // previous call has to insert value |
| 52 | item = inserted.first; |
| 53 | } |
| 54 | |
| 55 | return ret; |
| 56 | } |
| 57 | |
| 58 | StdNameInfo::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; |
| 63 | m_digest.finalize (); |
| 64 | |
| 65 | // std::cout << "StdNameInfo: " << name << " = " << m_id << "\n"; |
| 66 | } |
| 67 | |
| 68 | StdNameInfo::~StdNameInfo () |
| 69 | { |
| 70 | // cout << "Destructor for " << m_name << "\n"; |
| 71 | m_names.erase (toString ()); |
| 72 | } |
| 73 | |
| 74 | std::string |
| 75 | StdNameInfo::toString () const |
| 76 | { |
| 77 | return m_name; |
| 78 | } |
| 79 | |
| 80 | bool |
| 81 | StdNameInfo::operator == (const NameInfo &info) const |
| 82 | { |
| 83 | return m_name == dynamic_cast<const StdNameInfo&> (info).m_name; |
| 84 | } |
| 85 | |
| 86 | bool |
| 87 | StdNameInfo::operator < (const NameInfo &info) const |
| 88 | { |
| 89 | return m_name < dynamic_cast<const StdNameInfo&> (info).m_name; |
| 90 | } |
| 91 | |
| 92 | } // Sync |