00001 // Copyright 2008 Michael Marsh, University of Maryland. 00002 // 00003 // This file is part of pydtn. 00004 // 00005 // pydtn is free software: you can redistribute it and/or modify 00006 // it under the terms of the GNU General Public License as published by 00007 // the Free Software Foundation, either version 3 of the License, or 00008 // (at your option) any later version. 00009 // 00010 // pydtn is distributed in the hope that it will be useful, 00011 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00012 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00013 // GNU General Public License for more details. 00014 // 00015 // You should have received a copy of the GNU General Public License 00016 // along with pydtn. If not, see <http://www.gnu.org/licenses/>. 00017 // 00018 // The views and conclusions contained in the software and documentation 00019 // are those of the authors and should not be interpreted as representing 00020 // official policies, either expressed or implied, of the University 00021 // of Maryland. 00022 // 00023 // pydtn extends and embeds the Python interpreter, which is 00024 // Copyright 2001-2006 Python Software Foundation, All Rights Reserved, 00025 // and is released under the PSF License Agreement. 00026 // 00027 // RANLUX random number generation uses the Boost library, 00028 // Copyright 1994-2006 by various authors (details in individual files), 00029 // which is released under the Boost Software License, Version 1.0. 00030 00031 #include "Manager.h" 00032 00033 using namespace SampleAppNS; 00034 00035 Manager::Manager() 00036 { 00037 } 00038 00039 Manager::~Manager() 00040 { 00041 m_nodeMap.clear(); 00042 } 00043 00044 void 00045 Manager::add( SampleApp* app, WrapNode* node ) 00046 { 00047 if ( 0 == app ) return; 00048 if ( 0 == node ) return; 00049 m_nodeMap.insert(NodeMap::value_type(app,node)); 00050 m_appMap.insert(AppMap::value_type(node,app)); 00051 } 00052 00053 WrapNode* 00054 Manager::lookup( SampleApp* app ) 00055 { 00056 NodeMap::iterator itr = m_nodeMap.find( app ); 00057 if ( m_nodeMap.end() == itr ) return 0; 00058 return itr->second; 00059 } 00060 00061 SampleApp* 00062 Manager::lookup( WrapNode* node ) 00063 { 00064 AppMap::iterator itr = m_appMap.find( node ); 00065 if ( m_appMap.end() == itr ) return 0; 00066 return itr->second; 00067 }
1.5.4