/usr/include/eclib/templates.h is in libec-dev 20160720-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 | // templates.h: some utility functions for vector<T> classes
//////////////////////////////////////////////////////////////////////////
//
// Copyright 1990-2012 John Cremona
//
// This file is part of the eclib package.
//
// eclib 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.
//
// eclib 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 eclib; if not, write to the Free Software Foundation,
// Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
//
//////////////////////////////////////////////////////////////////////////
template <class T >
inline ostream& operator<<(ostream& os, const vector<T>& v)
{
os <<"[ ";
copy(v.begin(),v.end(), ostream_iterator<T>(cout, " "));
os << "]";
return os;
}
template <class T >
inline void vec_out(ostream& os, const vector<T>& v, unsigned int n=0)
{
unsigned int m=v.size(); bool trunc=0;
if((n>0)&&(m>n)) {m=n; trunc=1;}
os <<"[ ";
copy(v.begin(),v.begin()+m, ostream_iterator<T>(cout, " "));
if(trunc) os << "...";
os << "]";
}
template <class T >
inline ostream& operator<<(ostream& os, const std::set<T>& v)
{
os <<"{ ";
copy(v.begin(),v.end(), ostream_iterator<T>(cout, " "));
os << "}";
return os;
}
// NB The following will only work properly, giving a result with no
// repeats, if the input vectors are sorted!
template <class T >
vector<T> vector_union(const vector<T>& a, const vector<T>& b)
{
// cout<<"merging "<<a<<" and "<<b<<" using set_union"<<endl;
vector<T> c;
set_union(a.begin(),a.end(),b.begin(),b.end(),inserter(c,c.end()));
// cout<<"result is "<<c<<endl;
return c;
}
// the following returns true if the entries of a and b are equal from
// index "from" to index "from+l-1":
template <class T >
int startswith(const vector<T>& a, const vector<T>& b, long l, long from=0)
{
return equal(a.begin()+from,a.begin()+from+l,b.begin()+from);
}
|