This file is indexed.

/usr/include/SyFi/OrderedPtvSet.h is in libsyfi1.0-dev 1.0.0.dfsg-1.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
85
86
87
88
89
// Copyright (C) 2006-2009 Kent-Andre Mardal and Simula Research Laboratory
//
// This file is part of SyFi.
//
// SyFi 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.
//
// SyFi 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 SyFi. If not, see <http://www.gnu.org/licenses/>.

#ifndef SIMPLEX_IS_INCLUDED
#define SIMPLEX_IS_INCLUDED

#include "Ptv.h"
#include <vector>
#include <iterator>
#include <iostream>

/*
 * Note: at present the OrderedPtvSet class is more general than a OrderedPtvSet.
 * It is actually a point set. Still, we will only use it as a OrderedPtvSet.
 * It might be that we should use a different name and/or implement
 * a sub class or something which is strictly a OrderedPtvSet.
 */

using namespace std;

namespace SyFi
{

	class OrderedPtvSet
	{
		vector<Ptv> Ptvs;

		public:
			OrderedPtvSet();
			OrderedPtvSet(const Ptv& p0, const Ptv& p1);
			OrderedPtvSet(const Ptv& p0, const Ptv& p1, const Ptv& p2);
			OrderedPtvSet(const Ptv& p0, const Ptv& p1, const Ptv& p2, const Ptv& p3);
			virtual ~OrderedPtvSet();

			void append(const Ptv& p);
			unsigned int size() const;
			const Ptv& operator [] (unsigned int i) const;
			Ptv& operator [] (unsigned int i);
			OrderedPtvSet& operator = (const OrderedPtvSet& p);
			bool less(const OrderedPtvSet& s) const;
	};

	struct OrderedPtvSet_is_less : public std::binary_function<OrderedPtvSet, OrderedPtvSet, bool>
	{
		bool operator() (const OrderedPtvSet &lh, const OrderedPtvSet &rh) const { return lh.less(rh);  }
	};

	std::ostream & operator<< ( std::ostream& os, const OrderedPtvSet& p);

	// Note that this OrderedPtvSet_i might be implemented as a subclass ?
	class OrderedPtvSet_i
	{
		pair<OrderedPtvSet,vector<unsigned int> >  si;

		public:
			OrderedPtvSet_i();
			OrderedPtvSet_i(OrderedPtvSet& s, unsigned int i);
			OrderedPtvSet_i(OrderedPtvSet& s, unsigned int i0, unsigned int i1);
			virtual ~OrderedPtvSet_i();

			const OrderedPtvSet& get_OrderedPtvSet() const;
			unsigned int get_i(unsigned int n) const;
			unsigned int size() const;
			bool less(const OrderedPtvSet_i& si) const;
	};

	struct OrderedPtvSet_i_is_less : public std::binary_function<OrderedPtvSet_i, OrderedPtvSet_i, bool>
	{
		bool operator() (const OrderedPtvSet_i &lh, const OrderedPtvSet_i &rh) const { return lh.less(rh);  }
	};

	std::ostream & operator<< ( std::ostream& os, const OrderedPtvSet_i& si);

}								 // namespace SyFi
#endif