This file is indexed.

/usr/include/colib/objlist.h is in libiulib-dev 0.4+is+0.3-3ubuntu1.

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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
// -*- C++ -*-

// Copyright 2006 Deutsches Forschungszentrum fuer Kuenstliche Intelligenz 
// or its licensors, as applicable.
// Copyright 1995-2005 by Thomas M. Breuel
// 
// You may not use this file except under the terms of the accompanying license.
// 
// Licensed under the Apache License, Version 2.0 (the "License"); you
// may not use this file except in compliance with the License. You may
// obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
// 
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// 
// Project: iulib -- image understanding library
// File: objlist.h
// Purpose: nicer interface for narray< autoref<T> >
// Responsible: tmb
// Reviewer: 
// Primary Repository: 
// Web Sites: www.iupr.org, www.dfki.de

/// \file objlist.h
/// \brief A nicer interface for an array of references.

#ifndef h_objlist_
#define h_objlist_

#include "colib/narray.h"
#include "smartptr.h"

namespace colib {

    /// \brief Wrapper for narray that makes lists of objects less painful.

    template <class T>
    class objlist {
    public:
        typedef autoref<T> Element;
        narray<Element> data;

        int length() {
            return data.length();
        }
        
        T &push() {
            return data.push().ref();
        }

        T &pop() {
            return data.pop().ref();
        }

        T &last() {
            return data.last().ref();
        }

        T &operator()(int i0) {
            return data[i0].ref();
        }

        T &operator[](int i0) {
            return data[i0].ref();
        }

        T &ref(int i0) {
            return data[i0].ref();
        }

        T *ptr(int i0) {
            return data[i0].ptr();
        }

        T *move(int i0) {
            return data[i0].move();
        }

        void resize(int n) {
            data.dealloc();
            data.resize(n);
        }

        void clear() {
            for(int i=0;i<data.length();i++)
                data[i].dealloc();
            data.clear();
        }

        void dealloc() {
            data.dealloc();
        }

        void dealloc(int i) {
            data[i].dealloc();
        }
    };

    template <class T>
    void move(narray<T> &out,objlist<T> &in) {
        int n = in.length();
        out.resize(n);
        for(int i=0;i<n;i++)
            move(out[i],in[i]);
    }

    /// \brief Wrapper for narray that makes lists of objects less painful.

    template <class T>
    class ptrlist {
    public:
        typedef autodel<T> Element;
        narray<Element> data;

        int length() {
            return data.length();
        }
        
	void push(T *value) {
            data.push() = value;
        }
	void push(autodel<T> &value) {
            data.push() = value;
        }

        T &pop() {
            return data.pop().ref();
        }

        T &last() {
            return data.last().ref();
        }

        T &operator()(int i0) {
            return data[i0].ref();
        }

        T &operator[](int i0) {
            return data[i0].ref();
        }

        T &ref(int i0) {
            return data[i0].ref();
        }

        T *ptr(int i0) {
            return data[i0].ptr();
        }

        T *move(int i0) {
            return data[i0].move();
        }

        void resize(int n) {
            data.dealloc();
            data.resize(n);
        }

        void clear() {
            for(int i=0;i<data.length();i++)
                data[i].dealloc();
            data.clear();
        }

        void dealloc() {
            data.dealloc();
        }

        void dealloc(int i) {
            data[i].dealloc();
        }
    };
}

#endif