/usr/include/sofa/helper/set.h is in libsofa1-dev 1.0~beta4-6.
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 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 | /******************************************************************************
* SOFA, Simulation Open-Framework Architecture, version 1.0 beta 4 *
* (c) 2006-2009 MGH, INRIA, USTL, UJF, CNRS *
* *
* This library 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 2.1 of the License, or (at *
* your option) any later version. *
* *
* This library 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 Lesser General Public License *
* for more details. *
* *
* You should have received a copy of the GNU Lesser General Public License *
* along with this library; if not, write to the Free Software Foundation, *
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. *
*******************************************************************************
* SOFA :: Framework *
* *
* Authors: M. Adam, J. Allard, B. Andre, P-J. Bensoussan, S. Cotin, C. Duriez,*
* H. Delingette, F. Falipou, F. Faure, S. Fonteneau, L. Heigeas, C. Mendoza, *
* M. Nesme, P. Neumann, J-P. de la Plata Alcade, F. Poyer and F. Roy *
* *
* Contact information: contact@sofa-framework.org *
******************************************************************************/
#ifndef SOFA_HELPER_SET_H
#define SOFA_HELPER_SET_H
#include <set>
#include <string>
#include <algorithm>
#include <cassert>
#include <iostream>
#include <stdlib.h>
#include <sofa/helper/helper.h>
namespace sofa
{
namespace helper
{
//======================================================================
/// Same as std::set, + input/output operators
///
/// \author Jeremie Allard, 2008
///
//======================================================================
template<
class T,
class Compare = std::less<T>,
class Alloc = std::allocator<T> >
class set: public std::set<T,Compare,Alloc>
{
public:
/// size_type
typedef typename std::set<T,Compare,Alloc>::size_type size_type;
/// reference to a value (read-write)
typedef typename std::set<T,Compare,Alloc>::reference reference;
/// const reference to a value (read only)
typedef typename std::set<T,Compare,Alloc>::const_reference const_reference;
/// iterator
typedef typename std::set<T,Compare,Alloc>::iterator iterator;
/// const iterator
typedef typename std::set<T,Compare,Alloc>::const_iterator const_iterator;
/// Basic constructor
set() {}
/// Constructor
set(const std::set<T, Compare, Alloc>& x): std::set<T,Compare,Alloc>(x) {}
/// Constructor
set<T, Compare, Alloc>& operator=(const std::set<T, Compare, Alloc>& x)
{
std::set<T,Compare,Alloc>::operator = (x);
return (*this);
}
#ifdef __STL_MEMBER_TEMPLATES
/// Constructor
template <class InputIterator>
set(InputIterator first, InputIterator last): std::set<T,Compare,Alloc>(first,last){}
#else /* __STL_MEMBER_TEMPLATES */
/// Constructor
set(const_iterator first, const_iterator last): std::set<T,Compare,Alloc>(first,last){}
#endif /* __STL_MEMBER_TEMPLATES */
std::ostream& write(std::ostream& os) const
{
if( !this->empty() )
{
const_iterator i=this->begin();
os << *i;
++i;
for( ; i!=this->end(); ++i )
os << ' ' << *i;
}
return os;
}
std::istream& read(std::istream& in)
{
T t;
this->clear();
while(in>>t)
{
this->insert(t);
}
if( in.rdstate() & std::ios_base::eofbit ) { in.clear(); }
return in;
}
/// Output stream
inline friend std::ostream& operator<< ( std::ostream& os, const set<T,Compare,Alloc>& vec )
{
return vec.write(os);
}
/// Input stream
inline friend std::istream& operator>> ( std::istream& in, set<T,Compare,Alloc>& vec )
{
return vec.read(in);
}
};
/// Input stream
/// Specialization for reading sets of int and unsigned int using "A-B" notation for all integers between A and B, optionnally specifying a step using "A-B-step" notation.
template<>
inline std::istream& set<int, std::less<int>, std::allocator<int> >::read( std::istream& in )
{
int t;
this->clear();
std::string s;
while(in>>s){
std::string::size_type hyphen = s.find_first_of('-',1);
if (hyphen == std::string::npos)
{
t = atoi(s.c_str());
this->insert(t);
}
else
{
int t1,t2,tinc;
std::string s1(s,0,hyphen);
t1 = atoi(s1.c_str());
std::string::size_type hyphen2 = s.find_first_of('-',hyphen+2);
if (hyphen2 == std::string::npos)
{
std::string s2(s,hyphen+1);
t2 = atoi(s2.c_str());
tinc = (t1<t2) ? 1 : -1;
}
else
{
std::string s2(s,hyphen+1,hyphen2);
std::string s3(s,hyphen2+1);
t2 = atoi(s2.c_str());
tinc = atoi(s3.c_str());
if (tinc == 0)
{
std::cerr << "ERROR parsing \""<<s<<"\": increment is 0\n";
tinc = (t1<t2) ? 1 : -1;
}
if ((t2-t1)*tinc < 0)
{
// increment not of the same sign as t2-t1 : swap t1<->t2
t = t1;
t1 = t2;
t2 = t;
}
}
if (tinc < 0)
for (t=t1;t>=t2;t+=tinc)
this->insert(t);
else
for (t=t1;t<=t2;t+=tinc)
this->insert(t);
}
}
if( in.rdstate() & std::ios_base::eofbit ) { in.clear(); }
return in;
}
/// Input stream
/// Specialization for reading sets of int and unsigned int using "A-B" notation for all integers between A and B
template<>
inline std::istream& set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int> >::read( std::istream& in )
{
unsigned int t;
this->clear();
std::string s;
while(in>>s){
std::string::size_type hyphen = s.find_first_of('-',1);
if (hyphen == std::string::npos)
{
t = atoi(s.c_str());
this->insert(t);
}
else
{
unsigned int t1,t2;
int tinc;
std::string s1(s,0,hyphen);
t1 = (unsigned int)atoi(s1.c_str());
std::string::size_type hyphen2 = s.find_first_of('-',hyphen+2);
if (hyphen2 == std::string::npos)
{
std::string s2(s,hyphen+1);
t2 = (unsigned int)atoi(s2.c_str());
tinc = (t1<t2) ? 1 : -1;
}
else
{
std::string s2(s,hyphen+1,hyphen2);
std::string s3(s,hyphen2+1);
t2 = (unsigned int)atoi(s2.c_str());
tinc = atoi(s3.c_str());
if (tinc == 0)
{
std::cerr << "ERROR parsing \""<<s<<"\": increment is 0\n";
tinc = (t1<t2) ? 1 : -1;
}
if (((int)(t2-t1))*tinc < 0)
{
// increment not of the same sign as t2-t1 : swap t1<->t2
t = t1;
t1 = t2;
t2 = t;
}
}
if (tinc < 0)
for (t=t1;t>=t2;t=(unsigned int)((int)t+tinc))
this->insert(t);
else
for (t=t1;t<=t2;t=(unsigned int)((int)t+tinc))
this->insert(t);
}
}
if( in.rdstate() & std::ios_base::eofbit ) { in.clear(); }
return in;
}
} // namespace helper
} // namespace sofa
#endif
|