This file is indexed.

/usr/include/dolfin/function/LagrangeInterpolator.h is in libdolfin-dev 1.4.0+dfsg-4.

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
// Copyright (C) 2014 Mikael Mortensen
//
// This file is part of DOLFIN.
//
// DOLFIN 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.
//
// DOLFIN 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 DOLFIN. If not, see <http://www.gnu.org/licenses/>.
//
//
// First added:  2014-02-12
// Last changed: 

#ifndef __LAGRANGE_INTERPOLATOR_H
#define __LAGRANGE_INTERPOLATOR_H

namespace dolfin
{
  // Comparison operator for hashing coordinates. Note that two
  // coordinates are considered equal if equal to within specified
  // tolerance.
  struct lt_coordinate
  {
    lt_coordinate(double tolerance) : TOL(tolerance) {}

    bool operator() (const std::vector<double>& x,
                     const std::vector<double>& y) const
    {
      std::size_t n = std::max(x.size(), y.size());
      for (std::size_t i = 0; i < n; ++i)
      {
        double xx = 0.0;
        double yy = 0.0;
        if (i < x.size())
          xx = x[i];
        if (i < y.size())
          yy = y[i];

        if (xx < (yy - TOL))
          return true;
        else if (xx > (yy + TOL))
          return false;
      }
      return false;
    }

    // Tolerance
    const double TOL;                  
  };

  class Expression;
  class Function;
  class GenericDofMap;
  class Mesh;
  class FunctionSpace;

  /// This class interpolates efficiently from a GenericFunction
  /// to a Lagrange Function 

  class LagrangeInterpolator
  {
  public:

    /// Interpolate Expression
    ///
    /// *Arguments*
    ///     u  (_Function_)
    ///         The resulting Function
    ///     u0 (_Expression_)
    ///         The Expression to be interpolated.
    void interpolate(Function& u, const Expression& u0); 

    /// Interpolate function (on possibly non-matching meshes)
    ///
    /// *Arguments*
    ///     u  (_Function_)
    ///         The resulting Function    
    ///     u0 (_Function_)
    ///         The Function to be interpolated.
    void interpolate(Function& u, const Function& u0); 

  private:

    // Create a map from coordinates to a list of dofs that share the coordinate
    std::map<std::vector<double>, std::vector<std::size_t>, lt_coordinate > 
      tabulate_coordinates_to_dofs(const GenericDofMap& dofmap, const Mesh& mesh);

    // Create a map from dof to its component index in Mixed Space
    void extract_dof_component_map(boost::unordered_map<std::size_t, std::size_t>& 
      dof_component_map, const FunctionSpace& V, int* component);

    // Return true if point lies within bounding box
    static bool in_bounding_box(const std::vector<double>& point,
                                const std::vector<double>& bounding_box,
                                const double tol);

  };

}

#endif