System documentation of the GNU Image-Finding Tool

CQParallel.h
1 /* -*- mode: c++ -*-
2 */
3 /*
4 
5  GIFT, a flexible content based image retrieval system.
6  Copyright (C) 1998, 1999, 2000, 2001, 2002, CUI University of Geneva
7 
8  Copyright (C) 2003, 2004 Bayreuth University
9  2005 Bamberg University
10  This program is free software; you can redistribute it and/or modify
11  it under the terms of the GNU General Public License as published by
12  the Free Software Foundation; either version 2 of the License, or
13  (at your option) any later version.
14 
15  This program is distributed in the hope that it will be useful,
16  but WITHOUT ANY WARRANTY; without even the implied warranty of
17  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18  GNU General Public License for more details.
19 
20  You should have received a copy of the GNU General Public License
21  along with this program; if not, write to the Free Software
22  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
23 
24 */
25 // -*- mode: c++ -*-
26 #ifndef _CQPARALLEL
27 #define _CQPARALLEL
28 #include "libMRML/include/uses-declarations.h"
29 #include "libMRML/include/CQuery.h"
30 #include "libMRML/include/CSelfDestroyPointer.h"
31 // -*- mode: c++ -*-
51 #include <memory>
52 #include <map>
53 #include <list>
54 #include "libMRML/include/CSelfDestroyPointer.h"
55 #include "libMRML/include/CIDRelevanceLevelPairList.h"
56 #include "libMRML/include/CRelevanceLevelList.h"
57 
58 //#include "CWeightingFunctionPointerList.h"
59 //#include "CWeightingFunctionPointerHash.h"
60 
61 #include "libMRML/include/CAlgorithm.h"
62 #include "libMRML/include/CAccessor.h"
63 #include "libMRML/include/CAccessorAdminCollection.h"
64 #include "libMRML/include/CAccessorAdmin.h"
65 
66 
67 class CScoreBoard;
68 class CAccessor;
69 
70 
94 class CQParallel:public CQuery{
95 
99  CAccessorAdminCollection& mAccessorAdminCollection;
100 
102  class lCLocalAccessor{
103  public:
109  list<lCChildren::iterator> mUsedBy;
111  CSelfDestroyPointer<map<TID,double> > mUnifiedResults;
113  double mWeightedSum;
116  lCLocalAccessor();
120  ~lCLocalAccessor();
121  };
122 
123 
138  class lCLocalAccessorMap:public map<string,lCLocalAccessor>{
139  public:
140  };
143  lCLocalAccessorMap mAccessors;
144 
145 
146 protected:
152  virtual void init();
153 
154 public:
160  ~CQParallel();
165  CQParallel(CAccessorAdminCollection& inAccessorAdminCollection,
166  CAlgorithm& inAlgorithm);
167 
176  virtual CXMLElement* query(const CXMLElement& inQuery,
177  int inNumberOfInterestingImages,
178  double inDifferenceToBest);
179 
191  virtual CIDRelevanceLevelPairList* fastQuery(const CXMLElement& inQuery,
192  int inNumberOfInterestingImages,
193  double inDifferenceToBest);
194 
200  virtual CXMLElement* getRandomImages(int inNumberOfInterestingImages)const;
206  virtual list<TID>* getAllIDs()const;
212  virtual list<string>* getAllURLs()const;
218  virtual list<pair<TID,string> >* getAllIDURLPairs()const;
219 
226  virtual bool setAlgorithm(CAlgorithm& inAlgorithm);
227 
239  void finishInit();
240 
241 }; /* end of class */
242 
243 #endif
244 
245 
246 
Definition: CIDRelevanceLevelPairList.h:52
CQParallel(CAccessorAdminCollection &inAccessorAdminCollection, CAlgorithm &inAlgorithm)
In fact, what we are doing here is to get ourselves an accessor ACURL2FTS to do a proper fastQuery...
This class captures the structure of an XML element.
Definition: CXMLElement.h:51
virtual list< pair< TID, string > > * getAllIDURLPairs() const
get the IDs of all images (handed through to accessor)
virtual list< TID > * getAllIDs() const
get the IDs of all images (handed through to accessor)
virtual void init()
Initializer, used by both construcors.
Definition: CScoreBoard.h:60
virtual CXMLElement * getRandomImages(int inNumberOfInterestingImages) const
get some random images
virtual CXMLElement * query(const CXMLElement &inQuery, int inNumberOfInterestingImages, double inDifferenceToBest)
calls fastQuery for every child, merges the results and translates them back into URLs difficulty: ta...
An algorithm is a CXMLElement which is linked to a CSessionManager together they are able to build CQ...
Definition: CAlgorithm.h:43
The Query manager for Queries on inverted Files.
Definition: CQuery.h:73
virtual CIDRelevanceLevelPairList * fastQuery(const CXMLElement &inQuery, int inNumberOfInterestingImages, double inDifferenceToBest)
FIXME: useless in current scenario.
CAccessor * mAccessor
needed to translate URLs to IDs this is a pointer, only because we cannot change references it does n...
Definition: CQuery.h:81
CAccessorAdmin: The goal of this is to make it possible to have a list containing accessors to all po...
Definition: CAccessorAdmin.h:45
This is in fact a collection of collections.
Definition: CAccessorAdminCollection.h:39
FIXME: The name WRONGLY suggests that this actually does parallel processing.
Definition: CQParallel.h:94
CAccessor - an abstract base class for everything accessing a GIFT database.
Definition: CAccessor.h:55
destroys the element it points to or not (depending on user&#39;s choice).
Definition: CSelfDestroyPointer.h:32
void finishInit()
it might be necessary to wait until all the children are added before ending the initialisation phase...
~CQParallel()
we need to unregister the accessors used
virtual bool setAlgorithm(CAlgorithm &inAlgorithm)
set the Algorithm.
virtual list< string > * getAllURLs() const
get the IDs of all images (handed through to accessor)
CAccessorAdmin * mAccessorAdmin
This is where the the Accessor comes from.
Definition: CQuery.h:86

Need for discussion? Want to contribute? Contact
help-gift@gnu.org Generated using Doxygen