This file is indexed.

/usr/include/cxx/sidl_Resolve.hxx is in libsidl-dev 1.4.0.dfsg-8.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
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
// 
// File:          sidl_Resolve.hxx
// Symbol:        sidl.Resolve-v0.9.17
// Symbol Type:   enumeration
// Babel Version: 1.4.0 (Revision: 6607 release-1-4-0-branch)
// Release:       $Name:  $
// Revision:      @(#) $Id: $
// Description:   Client-side glue code for sidl.Resolve
// 
// Copyright (c) 2000-2002, Lawrence Livermore National Security, LLC.
// Produced at the Lawrence Livermore National Laboratory.
// Written by the Components Team <components@llnl.gov>
// All rights reserved.
// 
// This file is part of Babel. For more information, see
// http://www.llnl.gov/CASC/components/. Please read the COPYRIGHT file
// for Our Notice and the LICENSE file for the GNU Lesser General Public
// License.
// 
// This program 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) version 2.1 dated February 1999.
// 
// This program 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 terms and
// conditions of the GNU Lesser General Public License for more details.
// 
// You should have recieved a copy of the GNU Lesser General Public License
// along with this program; if not, write to the Free Software Foundation,
// Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
// 
// WARNING: Automatically generated; changes will be lost
// 

#ifndef included_sidl_Resolve_hxx
#define included_sidl_Resolve_hxx


#include "sidl_cxx.hxx"
#include "sidl_Resolve_IOR.h"

namespace sidl { 

  enum Resolve {
    Resolve_LAZY = 0,
    Resolve_NOW = 1,
    Resolve_SCLRESOLVE = 2
  };

} // end namespace sidl


struct sidl_Resolve__array;
namespace sidl {
  // traits specialization
  template<>
  struct array_traits< ::sidl::Resolve > {
    typedef array< ::sidl::Resolve > cxx_array_t;
    typedef ::sidl::Resolve cxx_item_t;
    typedef struct sidl_Resolve__array ior_array_t;
    typedef sidl_long__array ior_array_internal_t;
    typedef enum sidl_Resolve__enum ior_item_t;
    typedef cxx_item_t value_type;
    typedef value_type& reference;
    typedef value_type* pointer;
    typedef const value_type& const_reference;
    typedef const value_type* const_pointer;
    typedef array_iter< array_traits< ::sidl::Resolve > > iterator;
    typedef const_array_iter< array_traits< ::sidl::Resolve > > const_iterator;
  };

  // array specialization
  template<>
  class array< ::sidl::Resolve >: public enum_array< array_traits< 
    ::sidl::Resolve > > {
  public:
    typedef enum_array< array_traits< ::sidl::Resolve > > Base;
    typedef array_traits< ::sidl::Resolve >::cxx_array_t          cxx_array_t;
    typedef array_traits< ::sidl::Resolve >::cxx_item_t           cxx_item_t;
    typedef array_traits< ::sidl::Resolve >::ior_array_t          ior_array_t;
    typedef array_traits< ::sidl::Resolve >::ior_array_internal_t 
      ior_array_internal_t;
    typedef array_traits< ::sidl::Resolve >::ior_item_t           ior_item_t;

    /**
     * conversion from ior to C++ class
     * (constructor/casting operator)
     */
    array( struct sidl_Resolve__array* src = 0) : Base(src) {}

    /**
     * copy constructor
     */
    array( const array< ::sidl::Resolve > &src) {
      d_array = src.d_array;
      if (d_array) addRef();
    }

    /**
     * assignment
     */
    array< ::sidl::Resolve >&
    operator =( const array< ::sidl::Resolve > &rhs) {
      if (d_array != rhs.d_array) {
        if (d_array) deleteRef();
        d_array = rhs.d_array;
        if (d_array) addRef();
      }
      return *this;
    }

  };
}


#endif