/usr/include/libGIFTQuHierarchy/include/CQHierarchy.h is in libgnuift0-dev 0.1.14+ds-1ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 | /* -*- mode: c++ -*-
*/
/*
GIFT, a flexible content based image retrieval system.
Copyright (C) 1998, 1999, 2000, 2001, 2002, CUI University of Geneva
Copyright (C) 2003, 2004 Bayreuth University
2005 Bamberg University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
// -*- mode: c++ -*-
#ifndef _CQHIERARCHY
#define _CQHIERARCHY
#include "libGIFTQuHierarchy/include/uses-declarations.h"
/* -*- mode: c++ -*-
*/
/**
*
* CQHierarchy.h
* A CQuery structure which has several children
* queries them one after another,
* weights them, and obtains a common result
*
*
*
* modification history:
*
* WM 20000205 creation
*
*
*
* compiler defines used:
* _CQHIERARCHY avoids double inclusion
*
*/
#include <memory>
#include <map>
#include <list>
#include "libMRML/include/CQuery.h"
#include "libMRML/include/CSelfDestroyPointer.h"
#include "libMRML/include/CIDRelevanceLevelPairList.h"
#include "libMRML/include/CRelevanceLevelList.h"
//#include "CWeightingFunctionPointerList.h"
//#include "CWeightingFunctionPointerHash.h"
#include "libMRML/include/CAlgorithm.h"
#include "libMRML/include/CAccessor.h"
#include "libMRML/include/CAccessorAdminCollection.h"
#include "libMRML/include/CAccessorAdmin.h"
class CScoreBoard;
class CAccessor;
/**
This is a simple hierarchy based browser.
@Author: Wolfgang Müller
*/
class CQHierarchy:public CQuery{
protected:
/** The current position in the hierarchy */
list<TID> mCurrentPath;
/** sets mCurrentPosition to 0*/
void init();
public:
/**
*
* default constructor
*
*/
CQHierarchy();
/**
*
* we need to unregister the accessors used
*
*/
~CQHierarchy();
/**
* In fact, what we are doing here is to get ourselves
* an accessor ACURL2FTS to do a proper fastQuery
*/
CQHierarchy(CAccessorAdminCollection& inAccessorAdminCollection,
CAlgorithm& inAlgorithm);
/**
*
* enables moving in the hierarchy. You can either move down
* (i.e. you select an image) or up in the hierarchy (by getting
* a cui-hierarchy-move-up signal as query).
* RICHLY COMMENTED IN THE *.cc FILE.
*
*@param inQuery an CXMLElement containing a query-step element
*@param inNumberOfInterestingImages preferred number of result images (ignored)
*@param inDifferenceToBest preferred relevance cutoff (ignored)
*/
virtual CIDRelevanceLevelPairList* fastQuery(const CXMLElement& inQuery,
int inNumberOfInterestingImages,
double inDifferenceToBest);
/**
*
* set the Algorithm.
*
*/
virtual bool setAlgorithm(CAlgorithm& inAlgorithm);
}; /* end of class */
#endif
|