/usr/include/tulip/cxx/VectorPropertyAnimation.cxx is in libtulip-dev 4.4.0dfsg2-2.
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 | /*
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip 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.
*
*/
#include <tulip/ForEach.h>
template<typename PropType, typename RealType, typename VectorType, unsigned int SIZE>
VectorPropertyAnimation<PropType, RealType, VectorType, SIZE>::VectorPropertyAnimation(tlp::Graph *graph, PropType *start, PropType *end,
PropType *out, tlp::BooleanProperty *selection, int frameCount, bool computeNodes, bool computeEdges,QObject* parent) :
CachedPropertyAnimation<PropType, RealType, RealType> (graph, start, end, out, selection, frameCount, computeNodes, computeEdges,parent) {
assert(frameCount > 1);
if (this->_computeNodes) {
tlp::node n;
forEach(n, this->_graph->getNodes()) {
if (this->_selection && !this->_selection->getNodeValue(n))
continue;
std::pair<PropVector, PropVector> values(PropVector(this->_start->getNodeValue(n)), PropVector(this->_end->getNodeValue(n)));
if (steps.find(values) == steps.end()) {
tlp::Vector<double, SIZE> stepsVector;
for (unsigned int i = 0; i < SIZE; ++i)
stepsVector[i] = ((double)values.second[i] - (double)values.first[i]) * 1. / (frameCount - 1);
steps[values] = stepsVector;
}
}
}
if (this->_computeEdges) {
tlp::edge e;
forEach(e, this->_graph->getEdges()) {
if (this->_selection && !this->_selection->getEdgeValue(e))
continue;
std::pair<PropVector, PropVector> values(PropVector(this->_start->getEdgeValue(e)), PropVector(this->_end->getEdgeValue(e)));
if (steps.find(values) == steps.end()) {
tlp::Vector<double, SIZE> stepsVector;
for (unsigned int i = 0; i < SIZE; ++i)
stepsVector[i] = ((double) (values.second[i] - (double)values.first[i])) * 1. / (frameCount - 1);
steps[values] = stepsVector;
}
}
}
}
template<typename PropType, typename RealType, typename VectorType, unsigned int SIZE>
RealType VectorPropertyAnimation<PropType, RealType, VectorType, SIZE>::getNodeFrameValue(const RealType &startValue, const RealType &endValue,
int frame) {
PropVector result((PropVector)startValue);
std::pair<PropVector, PropVector> values(result, (PropVector) endValue);
tlp::Vector<double, SIZE> stepVal(steps[values]);
for (unsigned i=0; i < SIZE; ++i)
result[i] += stepVal[i] * frame;
return RealType(result);
}
template<typename PropType, typename RealType, typename VectorType, unsigned int SIZE>
RealType VectorPropertyAnimation<PropType, RealType, VectorType, SIZE>::getEdgeFrameValue(const RealType &startValue, const RealType &endValue,
int frame) {
return getNodeFrameValue(startValue, endValue, frame);
}
|