link_map.h

Go to the documentation of this file.

/*  This file is part of OMCSNetCPP

    OMCSNetCPP is free software; you can redistribute it and/or modify
    it under the terms of the GNU Lesser General Public License as published by
    the Free Software Foundation; either version 2.1 of the License, or
    (at your option) any later version.

    OMCSNetCPP 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 for more details.

    You should have received a copy of the GNU Lesser General Public License
    along with OMCSNetCPP; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

#ifndef _LINK_MAP

#define _LINK_MAP

#include <map>
#include <string>

#include "link.h"
#include "link_list.h"

class CFindPathConfig;
class CTextIDMap;

typedef std::map<SemanticID, CSemanticLink *>   CSemanticLinkMap;

typedef CSemanticLinkMap::iterator              CSemanticLinkMap_i;
typedef CSemanticLinkMap::const_iterator        CSemanticLinkMap_ci;

class CLinkMap
{
        public:
                bool Load(FILE        *a_fp,
                          CConceptMap &a_conceptMap);

                bool Save(FILE *a_fp)
                {
                        if (!a_fp)
                        {
                                return false;
                        }

                        u_int l_size = m_linkMap.size();

                        fwrite(&l_size, sizeof(u_int), 1, a_fp);

                        CSemanticLinkMap_i i;

                        for (i = m_linkMap.begin();i != m_linkMap.end();++i)
                        {
                                if (false == (*i).second->Save(a_fp))
                                {
                                        return false;
                                }
                        }

                        return true;
                }

                bool FindPathTo(const SemanticID       a_dstID,
                                      CFindPathConfig &a_config);

                CSemanticLinkMap_i GetIterator()
                {
                        return m_linkMap.begin();
                }

                CSemanticLink *GetNext(CSemanticLinkMap_i &a_iter)
                {
                        if (a_iter != m_linkMap.end())
                        {
                                CSemanticLink *l_link = (*a_iter).second;

                                ++a_iter;

                                return l_link;
                        }

                        return NULL;
                }       

                CSemanticLink *Lookup(const SemanticID a_id)
                {
                        CSemanticLinkMap_i i;

                        i = m_linkMap.find(a_id);

                        if (m_linkMap.end() != i)
                        {
                                return (*i).second;
                        }

                        return NULL;
                }

                void Store(CSemanticLink *a_link);

                void Remove(const SemanticID a_id);

                u_int GetSize() const
                {
                        return m_linkMap.size();
                }

                CLinkMap() {}

                ~CLinkMap() {}

        private:
                CSemanticLinkMap m_linkMap;
};

#endif

---