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
|
/* -*- 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 _CXEVCOMMUNICATION
#define _CXEVCOMMUNICATION
#include "libMRML/include/uses-declarations.h"
#include <string> //mSessionID
#include "libMRML/include/CXMLElementVisitor.h" //base class
class CCommunicationHandler;
/**
A visitor visiting document trees built from
the communication.
*/
class CXEVCommunication:public CXMLElementVisitor{
protected:
/**
the session in which this message is sent
*/
string mSessionID;
/** CCommunicationHandler which will build the response from
our calls
*/
CCommunicationHandler* mHandler;
public:
/** constructor.
When traversing the tree we need to
call member functions of
the communication handler with
subtrees of the tree we traverse.
*/
CXEVCommunication(CCommunicationHandler* inHandler);
/** actually carrying out the visit */
virtual bool startVisit(const CXMLElement& inVisited);
/** actually carrying out the visit */
virtual void endVisit(const CXMLElement& inVisited);
};
#endif
|
