/usr/include/linbox/vector/pair.h is in liblinbox-dev 1.4.2-3.
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 | /* Copyright (C) 2010 LinBox
* Written by JG Dumas <Jean-Guillaume.Dumas@imag.fr>
*
*
*
* ========LICENCE========
* This file is part of the library LinBox.
*
* LinBox 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
* ========LICENCE========
*/
// Pair of I and T : struct { column index, value }
// =======================================================================
#ifndef __LINBOX_pair_H
#define __LINBOX_pair_H
#include <iostream>
// ---------------------------------------------------
//
/// Pair of I and T : struct { column index, value }
template<class I, class T> class Pair {
public:
typedef Pair<I, T> Self_t;
typedef T Type_t;
typedef I first_type;
typedef T second_type;
// ~Pair() {};
Pair() {};
Pair(const I jj, const T& val) :
first(jj),second(val)
{};
Pair(const Self_t& p) :
first(p.first),second(p.second)
{};
T getvalue() const { return second; };
I getindex() const { return first; };
I j() const { return first; };
T affect(const T& val) { return second = val; };
T change_value(const T& val) { return second = val; };
I change_j(const I jj) { return first = jj; };
I change_index(const I jj) { return first = jj; };
Self_t assign(const T& val)
{
second = val;
return *this;
};
Self_t assign(const I jj, const T& val)
{
second = val;
first = jj;
return *this;
};
I decr() { return --first; };
I operator--() { return --first; };
I operator--(int) { return first--; };
I incr() { return ++first; };
I operator++() { return ++first; };
I operator++(int) { return first++; };
friend inline std::istream& operator>> (std::istream& is, Pair<I, T>& a)
{
is >> a.first >> a.second;
return is;
}
friend inline std::ostream& operator<< (std::ostream& o, const Pair<I, T> a)
{
return o << a.first << " " << a.second ;
}
public:
I first;
T second;
};
#endif // __LINBOX_pair_H
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,:0,t0,+0,=s
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
|