This file is indexed.

/usr/include/libwildmagic/Wm5Binary2D.h is in libwildmagic-dev 5.13-1.

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
// 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.3 (2010/10/01)

#ifndef WM5BINARY2D_H
#define WM5BINARY2D_H

#include "Wm5ImagicsLIB.h"
#include "Wm5Images.h"

namespace Wm5
{

class WM5_IMAGICS_ITEM Binary2D
{
public:
    // Operations on binary images.  Let the image have b0 columns and b1
    // rows.  The input image must have zeros on its boundaries x = 0,
    // x = b0-1, y = 0, and y = b1-1.  The 0-valued pixels are considered
    // to be background.  The 1-valued pixels are considered to be foreground.
    // Comments about the algorithms are provided in the cpp file.  To save
    // the memory and time, the input image is modified by the algorithms.
    // If you need to preserve the input image, make a copy of it before
    // calling these functions.

    // Some of the operations return collections of indices.  An index i
    // corresponds to coordinates (x,y) = (i % b0, i / b0).
    typedef std::vector<int> IndexArray;

    // Extract boundaries from 1-valued blobs.  The blob interiors are
    // 4-connected and the blob boundaries are 8-connected.  The output is
    // an array of boundaries, each boundary containing a list of pixels
    // in clockwise order in the right-handed (x,y) system [counterclockwise
    // in the left-handed (x,y) system].
    static void GetBoundaries (ImageInt2D& image,
        std::vector<IndexArray>& boundaries);

    // Compute the 8-connected components of a binary image.  The input
    // image is modified to avoid the cost of making a copy.  On output,
    // the image values are the labels for the components.  If storeZeros is
    // true, components[0] contains the indices for the background pixels;
    // otherwise, this array is empty.  When the background is large, the
    // construction of components[0] is time consuming.  The array
    // components[i], i >= 1, contains the indices for the i-th component.
    static void GetComponents8 (ImageInt2D& image, bool storeZeros,
        std::vector<IndexArray>& components);

    // Compute the 4-connected components of a binary image.  The input
    // image is modified to avoid the cost of making a copy.  On output,
    // the image values are the labels for the components.  If storeZeros is
    // true, components[0] contains the indices for the background pixels;
    // otherwise, this array is empty.  When the background is large, the
    // construction of components[0] is time consuming.  The array
    // components[i], i >= 1, contains the indices for the i-th component.
    static void GetComponents4 (ImageInt2D& image, bool storeZeros,
        std::vector<IndexArray>& components);

    // Compute the L1 distance transform.  Given a pixel (x,y), the neighbors
    // (x+1,y), (x-1,y), (x,y+1), and (x,y-1) are 1 unit of distance from
    // (x,y).  The neighbors (x+1,y+1), (x+1,y-1), (x-1,y+1), and (x-1,y-1)
    // are 2 units of distance from (x,y).  On output, the image is the
    // distance transform.
    static void GetL1Distance (ImageInt2D& image, int& maxDistance);

    // Compute the L2 distance transform (Euclidean distance transform).  The
    // distances are exact as long as they are smaller than 100 (see the
    // comments in the source code).  The 'transform' should be the same
    // dimensions as 'image' and its values are all set in this function, so
    // it does not matter what they are on input.
    static void GetL2Distance (const ImageInt2D& image, double& maxDistance,
        ImageDouble2D& transform);

    // Compute a skeleton of the image.  Pixels are trimmed from outside to
    // inside using L1 distance.  Connectivity and cycles of the original
    // blobs are preserved.  The 'skeleton' should be the same dimensions as
    // 'image' and its values are all set in this function, so it does not
    // matter what they are on input.  On output, the image is the skeleton.
    static void GetSkeleton (ImageInt2D& image);

protected:
    // The heart of the boundary extraction.
    static void ExtractBoundary (int x0, int y0, ImageInt2D& image,
        IndexArray& boundary);

    // The heart of the component labeling.
    static void GetComponents (const int numNeighbors, const int delta[],
        bool storeZeros, ImageInt2D& image,
        std::vector<IndexArray>& components);

    // Helper for computing the L2 distance transform.
    static void L2Check (int x, int y, int dx, int dy, ImageInt2D& xNear,
        ImageInt2D& yNear, ImageInt2D& dist);

    // Helpers for skeletonization.
    typedef bool (*InteriorFunction)(ImageInt2D&,int,int);
    static bool Interior4 (ImageInt2D& image, int x, int y);
    static bool Interior3 (ImageInt2D& image, int x, int y);
    static bool Interior2 (ImageInt2D& image, int x, int y);
    static bool MarkInterior (ImageInt2D& image, int value,
        InteriorFunction function);
    static bool IsArticulation (ImageInt2D& image, int x, int y);
    static bool ClearInteriorAdjacent (ImageInt2D& image, int value);
    static const int msArticulation[256];
};

}

#endif