This file is indexed.

/usr/include/gtkmathview/MathView/SparseMap.hh is in libgtkmathview-dev 0.8.0-14.

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
// Copyright (C) 2000-2007, Luca Padovani <padovani@sti.uniurb.it>.
// 
// This file is part of GtkMathView, a flexible, high-quality rendering
// engine for MathML documents.
// 
// GtkMathView 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 3 of the License, or
// (at your option) any later version.
// 
// GtkMathView 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 program.  If not, see <http://www.gnu.org/licenses/>.

#ifndef __SparseMap_hh__
#define __SparseMap_hh__

#include "gmv_defines.h"

template <class T, int M, int N>
class GMV_MathView_EXPORT SparseMap
{
public:
  SparseMap(void)
  {
    for (unsigned i = 0; i < (1 << N); i++)
      defData[i] = T();
    for (unsigned i = 0; i < (1 << M); i++)
      data[i] = defData;
  }

  ~SparseMap()
  {
    for (unsigned i = 0; i < (1 << M); i++)
      {
	if (data[i] != defData) delete [] data[i];
	data[i] = 0;
      }
  }

protected:
  unsigned I(unsigned index) const
  { return index >> N; }

  unsigned J(unsigned index) const
  { return index & ((1 << N) - 1); }

public:
  void set(size_t index, const T& v)
  {
    unsigned i = I(index);
    assert(i < (1 << M));
    if (data[i] == defData)
      {
	data[i] = new T[1 << N];
	for (unsigned j = 0; j < (1 << N); j++)
	  data[i][j] = T();
      }
    data[i][J(index)] = v;
  }

  const T& operator[](size_t index) const
  { return data[I(index)][J(index)]; }

private:
  typedef T* TBlock;

  TBlock data[1 << M];
  T defData[1 << N];
};

#endif // __SparseMap_hh__