/usr/include/tulip/cxx/Reflect.cxx is in libtulip-dev 3.1.2-2.3ubuntu3.
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 | //-*-c++-*-
/**
Authors: David Auber, Patrick Mary, Morgan Mathiaut
from the LaBRI Visualization Team
Email : auber@tulip-software.org
Last modification : 13/03/2009
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.
*/
//=======================================================================
//Strucdef implementation
template<typename T> void tlp::StructDef::add(const char* str, const char* inHelp,
const char* inDefValue, bool isMandatory) {
std::list< std::pair<std::string, std::string> >::const_iterator it;
for (it = data.begin(); it != data.end(); ++it) {
if ((*it).first == str)
break;
}
if (it == data.end()) {
data.push_back(std::pair<std::string, std::string>(std::string(str), std::string(typeid(T).name())));
if (inHelp)
help[str] = std::string(inHelp);
if (inDefValue)
defValue[str] = std::string(inDefValue);
mandatory[str] = isMandatory;
}
#ifndef NDEBUG
else {
std::cerr << "StructDef::addVar " << str << " already exists" << std::endl;
}
#endif
}
//=======================================================================
//DataSet implementation
template<typename T> bool tlp::DataSet::get(const std::string& str,T& value) const {
for (std::list< std::pair<std::string, tlp::DataType*> >::const_iterator it =
data.begin(); it != data.end(); ++it) {
const std::pair<std::string, tlp::DataType*> &p = *it;
if (p.first == str) {
value = *((T*) p.second->value);
return true;
}
}
return false;
}
template<typename T> bool tlp::DataSet::getAndFree(const std::string &str,T& value) {
for (std::list< std::pair<std::string, tlp::DataType*> >::iterator it =
data.begin(); it != data.end(); ++it) {
std::pair<std::string, tlp::DataType *> &p = *it;
if (p.first == str) {
value = *((T*) p.second->value);
delete p.second;
data.erase(it);
return true;
}
}
return false;
}
template<typename T>
struct DataTypeContainer :public tlp::DataType {
DataTypeContainer(void *value, std::string str) :DataType(value, str) {}
~DataTypeContainer() {
delete (T*) value;
}
DataType* clone() {
return new DataTypeContainer<T>(new T(*(T*)value), typeName);
}
};
template<typename T> void tlp::DataSet::set(const std::string &str,const T& value) {
DataTypeContainer<T> *tmp= new DataTypeContainer<T>(new T(value), typeid(T).name());
for (std::list< std::pair<std::string, tlp::DataType*> >::iterator it =
data.begin(); it != data.end(); ++it) {
std::pair<std::string, tlp::DataType*> &p = *it;
if (p.first == str) {
delete p.second;
p.second = tmp;
return;
}
}
data.push_back(std::pair<std::string, tlp::DataType*>(str, tmp));
}
//=======================================================================
|