/************************************************************************* * * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * Copyright 2008 by Sun Microsystems, Inc. * * OpenOffice.org - a multi-platform office productivity suite * * $RCSfile: urp_replycontainer.hxx,v $ * $Revision: 1.5 $ * * This file is part of OpenOffice.org. * * OpenOffice.org is free software: you can redistribute it and/or modify * it under the terms of the GNU Lesser General Public License version 3 * only, as published by the Free Software Foundation. * * OpenOffice.org is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License version 3 for more details * (a copy is included in the LICENSE file that accompanied this code). * * You should have received a copy of the GNU Lesser General Public License * version 3 along with OpenOffice.org. If not, see * * for a copy of the LGPLv3 License. * ************************************************************************/ #include #include #include #include #include "urp_threadid.hxx" namespace bridges_urp { class ClientJob; typedef ::std::hash_map< ::rtl::ByteSequence , ::std::list < ClientJob * > , HashThreadId , EqualThreadId > Id2ClientJobStackMap; class urp_ClientJobContainer { public: void add( const ::rtl::ByteSequence &id , ClientJob *p ) { ::osl::MutexGuard guard( m_mutex ); m_map[id].push_back( p ); } ClientJob *remove( const ::rtl::ByteSequence & id ) { ::osl::MutexGuard guard( m_mutex ); Id2ClientJobStackMap::iterator ii = m_map.find( id ); ClientJob *p = 0; if( ii != m_map.end() ) { p = (*ii).second.back(); (*ii).second.pop_back(); if( (*ii).second.empty() ) { m_map.erase( ii ); } } return p; } private: ::osl::Mutex m_mutex; Id2ClientJobStackMap m_map; }; }