This file is indexed.

/usr/include/libwildmagic/Wm5Polygon2.inl is in libwildmagic-dev 5.13-1+b2.

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
// Geometric Tools, LLC
// Copyright (c) 1998-2014
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
//
// File Version: 5.0.0 (2010/01/01)

//----------------------------------------------------------------------------
template <typename Real>
Polygon2<Real>::Polygon2 (int numVertices, Vector2<Real>* vertices)
    :
    mNumVertices(numVertices)
{
    // The polygon must be at least a triangle.
    assertion(numVertices >= 4 && vertices,
        "Invalid input to Polygon2 constructor\n");

    mVertices = vertices;
}
//----------------------------------------------------------------------------
template <typename Real>
Polygon2<Real>::Polygon2 (const Polygon2& polygon)
{
    mVertices = 0;
    *this = polygon;
}
//----------------------------------------------------------------------------
template <typename Real>
Polygon2<Real>::~Polygon2 ()
{
}
//----------------------------------------------------------------------------
template <typename Real>
Polygon2<Real>& Polygon2<Real>::operator= (const Polygon2& polygon)
{
    mNumVertices = polygon.mNumVertices;
    mVertices = polygon.mVertices;
    return *this;
}
//----------------------------------------------------------------------------
template <typename Real>
int Polygon2<Real>::GetNumVertices () const
{
    return mNumVertices;
}
//----------------------------------------------------------------------------
template <typename Real>
const Vector2<Real>* Polygon2<Real>::GetVertices () const
{
    return mVertices;
}
//----------------------------------------------------------------------------
template <typename Real>
const Vector2<Real>& Polygon2<Real>::GetVertex (int i) const
{
    assertion(0 <= i && i < mNumVertices, "Invalid index in GetVertex\n");
    return mVertices[i];
}
//----------------------------------------------------------------------------
template <typename Real>
void Polygon2<Real>::SetVertex (int i, const Vector2<Real>& vertex)
{
    assertion(0 <= i && i < mNumVertices, "Invalid index in SetVertex\n");
    mVertices[i] = vertex;
}
//----------------------------------------------------------------------------
template <typename Real>
Vector2<Real> Polygon2<Real>::ComputeVertexAverage () const
{
    Vector2<Real> average = mVertices[0];
    for (int i = 1; i < mNumVertices; ++i)
    {
        average += mVertices[i];
    }
    average /= (Real)mNumVertices;
    return average;
}
//----------------------------------------------------------------------------
template <typename Real>
Real Polygon2<Real>::ComputePerimeterLength () const
{
    Real perimeterLength = (Real)0;
    for (int i0 = 0, i1 = 1; i1 < mNumVertices; ++i0, ++i1)
    {
        Vector2<Real> edge = mVertices[i1] - mVertices[i0];
        perimeterLength += edge.Length();
    }
    return perimeterLength;
}
//----------------------------------------------------------------------------
template <typename Real>
Real Polygon2<Real>::ComputeArea () const
{
    const int last = mNumVertices - 1;
    Real area = mVertices[0][0]*(mVertices[1][1] - mVertices[last][1]) +
        mVertices[last][0]*(mVertices[0][1] - mVertices[last-1][1]);

    for (int im1 = 0, i = 1, ip1 = 2; i < last; ++im1, ++i, ++ip1)
    {
        area += mVertices[i][0]*(mVertices[ip1][1] - mVertices[im1][1]);
    }

    area *= (Real)0.5;

    return area;
}
//----------------------------------------------------------------------------