abstractprocessordecorator.cpp 3.91 KB
Newer Older
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
// ================================================================================================
// 
// This file is part of the TUMVis Visualization Framework.
// 
// If not explicitly stated otherwise: Copyright (C) 2012, all rights reserved,
//      Christian Schulte zu Berge (christian.szb@in.tum.de)
//      Chair for Computer Aided Medical Procedures
//      Technische Universitt Mnchen
//      Boltzmannstr. 3, 85748 Garching b. Mnchen, Germany
// 
// The licensing of this softare is not yet resolved. Until then, redistribution in source or
// binary forms outside the CAMP chair is not permitted, unless explicitly stated in legal form.
// However, the names of the original authors and the above copyright notice must retain in its
// original state in any case.
// 
// Legal disclaimer provided by the BSD license:
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY 
// AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR 
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 
// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
// 
// ================================================================================================

#include "abstractprocessordecorator.h"

#include "tgt/assert.h"
#include "tgt/shadermanager.h"

namespace TUMVis {

    void AbstractProcessorDecorator::addProperties(HasPropertyCollection* propCollection) {
    }

    void AbstractProcessorDecorator::renderProlog(const DataContainer& dataContainer, tgt::Shader* shader) {

    }

    void AbstractProcessorDecorator::renderEpilog(tgt::Shader* shader) {

    }

    std::string AbstractProcessorDecorator::generateHeader() const {
        return "";
    }


// ================================================================================================

    HasProcessorDecorators::~HasProcessorDecorators() {
        for (std::vector<AbstractProcessorDecorator*>::iterator it = _decorators.begin(); it != _decorators.end(); ++it)
            delete *it;
    }

    void HasProcessorDecorators::addDecorator(AbstractProcessorDecorator* decorator) {
        tgtAssert(decorator != 0, "Decorator must not be 0.");
        _decorators.push_back(decorator);
    }

    void HasProcessorDecorators::decoratePropertyCollection(HasPropertyCollection* propCollection) const {
        for (std::vector<AbstractProcessorDecorator*>::const_iterator it = _decorators.begin(); it != _decorators.end(); ++it)
            (*it)->addProperties(propCollection);
    }

    void HasProcessorDecorators::decorateRenderProlog(const DataContainer& dataContainer, tgt::Shader* shader) const {
        for (std::vector<AbstractProcessorDecorator*>::const_iterator it = _decorators.begin(); it != _decorators.end(); ++it)
            (*it)->renderProlog(dataContainer, shader);
    }

    void HasProcessorDecorators::decorateRenderEpilog(tgt::Shader* shader) const {
        for (std::vector<AbstractProcessorDecorator*>::const_iterator it = _decorators.begin(); it != _decorators.end(); ++it)
            (*it)->renderEpilog(shader);
    }

    std::string HasProcessorDecorators::getDecoratedHeader() const {
        std::string toReturn;
        for (std::vector<AbstractProcessorDecorator*>::const_iterator it = _decorators.begin(); it != _decorators.end(); ++it)
            toReturn.append((*it)->generateHeader());
        return toReturn;
    }


}