This file is indexed.

/usr/include/CLAM/ControlArray.hxx is in libclam-dev 1.4.0-6.

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
/*
 * Copyright (c) 2004 MUSIC TECHNOLOGY GROUP (MTG)
 *                         UNIVERSITAT POMPEU FABRA
 *
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * 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
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU 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
 *
 */

#ifndef _ControlArray_hxx_
#define _ControlArray_hxx_

#include "Assert.hxx"
#include <vector>
#include <list>
#include <string>
#include <sstream>

namespace CLAM
{

class Processing;

/**
 * This class wrapps a vector (array) of Controls and gives its Controls
 * automatic names at construction.
 */ 
template <class ControlT>
class ControlArray
{
	typedef std::vector<ControlT *> Controls;
	Controls mControls;

public:
	ControlArray() { }
	ControlArray(int size, const std::string &name, Processing* parent) {
		Resize(size,name,parent);
	}
	ControlArray(int size, const std::list<std::string> &names,
			Processing* parent)
	{
		Resize(size, names, parent);
	}
	template <typename ProcessingType, typename ValueType>
	ControlArray(int size, const std::string &name, ProcessingType * parent,
		void (ProcessingType::*method)(unsigned, ValueType) )
	{
		Resize(size,name,parent,method);
	}
	~ControlArray() { Clear(); }

	ControlT       &operator[](int i)        { return *mControls[i]; }
	const ControlT &operator[](int i) const  { return *mControls[i]; }

	void Resize(int size, const std::string &name, Processing* parent);
	void Resize(int size, const std::list<std::string>& names, Processing* parent);
	template <typename ProcessingType, typename ValueType>
	void Resize(int size, const std::string &name, ProcessingType * parent,
		void (ProcessingType::*method)(unsigned, ValueType) )
	{
		int previousSize = mControls.size();
		if(size < previousSize) 
		{
			Shrink(size);
			return;
		}
		mControls.resize(size);
		for (int i = previousSize; i<size; i++) {
			std::stringstream str;
			str << name << "_" << i;
			mControls[i] = new ControlT(i, str.str(), parent, method);	
		}
	}

	void Append(int size, const std::string &names, Processing* parent);
	void Append(int size, const std::list<std::string>& names, Processing* parent);

	int Size() const { return mControls.size(); }

	void Clear() { Shrink(0); }

protected:
	void Shrink(int size);
};
 	
template <class ControlT>
void ControlArray<ControlT>::Resize(int size, const std::string &name,
		Processing* parent)
{
	int previousSize = mControls.size();
	if(size < previousSize) 
	{
		Shrink(size);
		return;
	}
	mControls.resize(size);
	for (int i = previousSize; i<size; i++) {
		std::stringstream str;
		str << name << "_" << i;
		mControls[i] = new ControlT(str.str(), parent);	
	}
	
}

template <class ControlT>
void ControlArray<ControlT>::Resize(int size,
		const std::list<std::string>& names, Processing* parent)
{
	int previousSize = mControls.size();
	if (size < previousSize) 
	{
		Shrink(size);
		return;
	}
	CLAM_ASSERT(size - previousSize <= int(names.size()),
		"ControlArray::Resize: error, not enough labels provided");
	mControls.resize(size);
	std::list<std::string>::const_iterator name = names.begin();
	for (int i = previousSize; i<size; i++, name++)
		mControls[i] = new ControlT(*name, parent);	
}

template <class ControlT>
void ControlArray<ControlT>::Append(int count, 
		const std::string &name, Processing* parent)
{
	Resize(Size() + count, name, parent);
}

template <class ControlT>
void ControlArray<ControlT>::Append(int count, 
		const std::list<std::string>& names, Processing* parent)
{
	Resize(Size() + count, names, parent);
}


template <class ControlT>
void ControlArray<ControlT>::Shrink(int size)
{
	int previousSize = mControls.size();
	if (size == previousSize) return;
	CLAM_ASSERT(size < previousSize,
		"ControlArray::Cannot Shrink a ControlArray to a larger size");
	for (int i = previousSize-1; i >= size; i--)
		delete mControls[i];	
	mControls.resize(size);
}

}; //namespace CLAM

#endif