00001 /* -*- mode: c++ -*- 00002 */ 00003 /* 00004 00005 GIFT, a flexible content based image retrieval system. 00006 Copyright (C) 1998, 1999, 2000, 2001, 2002, CUI University of Geneva 00007 00008 Copyright (C) 2003, 2004 Bayreuth University 00009 2005 Bamberg University 00010 This program is free software; you can redistribute it and/or modify 00011 it under the terms of the GNU General Public License as published by 00012 the Free Software Foundation; either version 2 of the License, or 00013 (at your option) any later version. 00014 00015 This program is distributed in the hope that it will be useful, 00016 but WITHOUT ANY WARRANTY; without even the implied warranty of 00017 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00018 GNU General Public License for more details. 00019 00020 You should have received a copy of the GNU General Public License 00021 along with this program; if not, write to the Free Software 00022 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 00023 00024 */ 00025 // -*- mode: c++ -*- 00026 #ifndef _CACHIERARCHY 00027 #define _CACHIERARCHY 00028 #include "libGIFTAcHierarchy/include/uses-declarations.h" 00029 #include <list> 00030 #include <map> 00031 #include "libMRML/include/CAccessorImplementation.h" 00032 00033 class CXMLElement; 00034 #include "libMRML/include/CIDRelevanceLevelPairList.h" 00035 #include "libMRML/include/CMutex.h" // multithreading 00052 class CAcHierarchy:public CAccessorImplementation{ 00053 protected: 00055 CMutex mMutexHierarchy; 00057 bool isOK; 00069 typedef list<TID> CPath; 00074 typedef list<TID> CChildren; 00078 CPath mNodeStack; 00083 typedef map<CPath,CChildren> CGraph; 00089 CGraph mEdges; 00096 void init(string inFileName); 00101 void addEdge(const CPath& inFather, 00102 TID inSon); 00103 00104 public: 00117 CAcHierarchy(const CXMLElement& inConfiguration); 00123 CIDRelevanceLevelPairList* getChildren(const CPath& inID)const; 00127 void addElement(TID inID, 00128 string inLocation, 00129 string inThumbnail); 00135 void push(TID inNode); 00142 void popNodeAndRegisterEdge(); 00146 operator bool()const; 00147 }; 00148 00149 #endif