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
|
/* -*- 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
*/
#ifndef _CDISTANCECALCULATOR
#define _CDISTANCECALCULATOR
#include "libGIFTAcDistanceMatrix/include/uses-declarations.h"
#include <functional>
#include "libGIFTAcDistanceMatrix/include/CPersistentTranslatedIndexMatrix.h"
#include <cmath>
#include "libMRML/include/CMagic.h"
template<class TTIterator,
class TTInserter,
class TTFunction>
void do_for_equal_first(const TTIterator& inBegin1,
const TTIterator& inEnd1,
const TTIterator& inBegin2,
const TTIterator& inEnd2,
TTInserter& inInserter,
const TTFunction& f){
TTIterator i=inBegin1;
TTIterator j=inBegin2;
//this algorithm assumes, that both the lists are sorted for their ID
//otherwhise NOTHING is assumed
while(i!=inEnd1 &&
j!=inEnd2 ){
if(i->first<j->first){
i++;
}else{
// i->first >= j->first
if(j->first<i->first){
j++;
}else{
// i.e. i->first == j->first holds
// output is squashing the difference of the distances,
// of elements with identical ID
inInserter=(make_pair(i->first,
f(i->second,
j->second)));
i++;
j++;
}
}
}
}
// for testing: nice and radical
//#define TTSquash CDiscreteSquasher
//more adapted to the real user...
//#define TTSquash CStandardSquasher
//template<class TTID,class TTContent,class TTSquasher>
class CDistanceCalculator:public CMagic{
public: // public type definitions
/** The content of this is a matrix from int to float */
typedef CPersistentTranslatedIndexMatrix<int,float> CContent;
/** */
typedef CContent::CIDContentPairList CIDtoDistanceList;
/** */
typedef CContent::CIndexList CIDList;
/** */
CContent mContent;
protected:
/** the ID type within this class */
typedef int CID;
/** Delete the pivot from a probabilistic set when digesting feedback?
See my thesis for an explanation
*/
bool mDeletePivot;
public:
///
void setDeletePivot(bool inDeletePivot);
///
CDistanceCalculator(const char* inFileName);
///
bool calculateDistances(const CID& inID,
CIDtoDistanceList& outDistances,
bool inDeletePivot)const;
///
operator bool()const;
};
#endif
|
