This file is indexed.

/usr/include/BALL/STRUCTURE/simpleMolecularGraph.h is in libball1.4-dev 1.4.3~beta1-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
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
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
// -*- Mode: C++; tab-width: 2; -*-
// vi: set ts=2:
//

#ifndef BALL_STRUCTURE_SIMPLEMOLECULARGRAPH_H
#define BALL_STRUCTURE_SIMPLEMOLECULARGRAPH_H

#ifndef BALL_KERNEL_ATOM_H
#	include <BALL/KERNEL/atom.h>
#endif

#ifndef BALL_KERNEL_BOND_H
#	include <BALL/KERNEL/bond.h>
#endif

#ifndef BALL_STRUCTURE_MOLECULE_H
#	include <BALL/KERNEL/molecule.h>
#endif

#ifndef BALL_STRUCTURE_FRAGMENT_H
#	include <BALL/KERNEL/fragment.h>
#endif

#include <list>
#include <iostream>
#include <algorithm>

namespace BALL
{
	// forward declarations to resolve nasty dependencies
	template <typename Node, typename Edge> 
	class EdgeItem;

	template <typename Node, typename Edge> 
	class TSimpleMolecularGraph;

	/**	The node type in a molecular graph
		\ingroup StructureMiscellaneous
	*/
	template <typename Node, typename Edge>
	class NodeItem
	{
		public:
		/**	@name	Type definitions
		*/
		//@{
		///
		typedef NodeItem<Node, Edge> NodeItemType;

		///
		typedef EdgeItem<Node, Edge> EdgeItemType;

		///
		typedef typename std::list<EdgeItem<Node, Edge>*>::iterator Iterator;
		///
		typedef typename std::list<EdgeItem<Node, Edge>*>::const_iterator ConstIterator;
		//@}

		friend class TSimpleMolecularGraph<Node, Edge>;

		NodeItem() ;
		NodeItem(const Atom& atom) ;

		Node& getData() ;
		const Node& getData() const ;
		void setData(const Node& data) ;

		const Atom* getAtom() const ;
		Atom* getAtom() ;

		Iterator begin() ;
		ConstIterator begin() const ;
		Iterator end() ;
		ConstIterator end() const ;

		Size getDegree() const ;

		bool operator == (const NodeItem& item) const ;
		bool operator != (const NodeItem& item) const ;

		protected:

		void deleteEdge_(EdgeItemType* item)
			;

		Node	data_;
		Atom* atom_;
		std::list<EdgeItemType*> adjacent_edges_;
	};


	template <typename Node, typename Edge>
	class EdgeItem
	{
		public:
		typedef NodeItem<Node, Edge> NodeItemType;
		typedef EdgeItem<Node, Edge> EdgeItemType;
		typedef typename std::list<NodeItem<Node, Edge>*>::iterator Iterator;
		typedef typename std::list<NodeItem<Node, Edge>*>::const_iterator ConstIterator;

		EdgeItem() 
			: bond_(0), source_(0), target_(0)
		{}

		EdgeItem(const Bond& bond);
		EdgeItem(const Bond& bond, NodeItemType* source, NodeItemType* target);

		NodeItemType& getSource() {return *source_;}
		NodeItemType& getTarget() {return *target_;}
		const NodeItemType& getSource() const {return *source_;}
		const NodeItemType& getTarget() const {return *target_;}
		
		Node& getData() {return data_;}
		const Node& getData() const {return data_;}
		void setData(const Edge& data) { data_ = data; };

		Bond* getBond() { return bond_; }
		const Bond* getBond() const { return bond_; }

		bool operator == (const EdgeItem& item) const { return (bond_ == item.bond_); }
		bool operator != (const EdgeItem& item) const { return (bond_ != item.bond_); }

		protected:
		Edge	data_;
		Bond* bond_;
		NodeItemType* source_;
		NodeItemType* target_;
	};

	template <typename Node, typename Edge>
	EdgeItem<Node, Edge>::EdgeItem(const Bond& bond)
		:	bond_(const_cast<Bond*>(&bond))
	{
	}

	template <typename Node, typename Edge>
	EdgeItem<Node, Edge>::EdgeItem(const Bond& bond, NodeItem<Node, Edge>* first, NodeItem<Node, Edge>* second)
		:	bond_(const_cast<Bond*>(&bond)),
			source_(first),
			target_(second)
	{
	}

	template <typename Node, typename Edge>
	class TSimpleMolecularGraph
	{
		public:
		typedef NodeItem<Node, Edge> NodeItemType;
		typedef EdgeItem<Node, Edge> EdgeItemType;
		typedef typename std::list<NodeItemType>::iterator NodeIterator;
		typedef typename std::list<NodeItemType>::const_iterator NodeConstIterator;
		typedef typename std::list<EdgeItemType>::iterator EdgeIterator;
		typedef typename std::list<EdgeItemType>::const_iterator EdgeConstIterator;

		TSimpleMolecularGraph() ;
		TSimpleMolecularGraph(const Molecule& molecule) ;

		bool newNode(const Atom& atom) ;
		bool newEdge(const Bond& bond) ;

		bool deleteNode(NodeItemType& node);
		bool deleteEdge(EdgeItemType& edge);
				
		bool deleteNode(const Atom& atom);
		bool deleteEdge(const Bond& bond);
				
		NodeIterator beginNode() { return nodes_.begin(); }
		NodeConstIterator beginNode() const { return nodes_.begin(); }
		EdgeIterator beginEdge() { return edges_.begin(); }
		EdgeConstIterator beginEdge() const { return edges_.begin(); }
		NodeIterator endNode() { return nodes_.end(); }
		NodeConstIterator endNode() const { return nodes_.end(); }
		EdgeIterator endEdge() { return edges_.end(); }
		EdgeConstIterator endEdge() const { return edges_.end(); }
		
		bool has(const Atom& atom) const { return atom_to_node_.has(const_cast<Atom*>(&atom)); }
		bool has(const Bond& bond) const { return bond_to_edge_.has(const_cast<Bond*>(&bond)); }

		NodeItemType& getNode(Position index) { return nodes_[index]; };
		const NodeItemType& getNode(Position index) const { return nodes_[index]; };
		EdgeItemType& getEdge(Position index) { return edges_[index]; };
		const EdgeItemType& getEdge(Position index) const { return edges_[index]; };

		/** Return the number of nodes in the graph
		*/
		Size getNumberOfNodes() const ;

		/** Return the number of nodes in the graph
		*/
		Size getNumberOfEdges() const ;

		protected:
		std::list<NodeItemType>	nodes_;
		std::list<EdgeItemType> edges_;
		HashMap<Atom*, NodeItemType*> atom_to_node_;
		HashMap<Bond*, EdgeItemType*> bond_to_edge_;
	};

	/**	Default molecular graph type.
			Each edge and node has a label of type  \link Index Index \endlink .
	*/
	typedef TSimpleMolecularGraph<Index, Index> SimpleMolecularGraph;

	template <typename Node, typename Edge>
	TSimpleMolecularGraph<Node, Edge>::TSimpleMolecularGraph()
			
		:	nodes_(),
			edges_(),
			atom_to_node_(),
			bond_to_edge_()
	{
	}

	template <typename Node, typename Edge>
	TSimpleMolecularGraph<Node, Edge>::TSimpleMolecularGraph(const Molecule& molecule)
			
		:	nodes_(),
			edges_(),
			atom_to_node_(),
			bond_to_edge_()
	{
		AtomConstIterator ai = molecule.beginAtom();
		Atom::BondConstIterator bi;
		for (; +ai; ++ai)
		{
			newNode(*ai);
		}
		for (ai = molecule.beginAtom(); +ai; ++ai)
		{
			for (bi = ai->beginBond(); +bi; ++bi)
			{
				if (bi->getFirstAtom() == &*ai)
				{
					newEdge(*bi);
				}
			}
		}
	}

	template <typename Node, typename Edge>
	bool TSimpleMolecularGraph<Node, Edge>::newNode(const Atom& atom)
		
	{
		Atom* atom_ptr = const_cast<Atom*>(&atom);

		if (atom_to_node_.has(atom_ptr))
		{
			return false;
		}

		nodes_.push_back(NodeItemType(atom));
		atom_to_node_.insert(std::pair<Atom*, NodeItemType*>(atom_ptr, &(nodes_.back())));

		return true;
	}

	template <typename Node, typename Edge>
	bool TSimpleMolecularGraph<Node, Edge>::newEdge(const Bond& bond)
		
	{
		// Create convenience aliases for atoms.
		Atom* first = const_cast<Atom*>(bond.getFirstAtom());
		Atom* second = const_cast<Atom*>(bond.getSecondAtom());	

    // Make sure we have atoms/nodes for this bond/edge.
		if (!atom_to_node_.has(first) || !atom_to_node_.has(second))
		{
			return false;
		}

		// Make sure not to create the same edge twice.
		if (bond_to_edge_.has(const_cast<Bond*>(&bond)))
		{
			return true;
		}
		
		// Create the new edge und add it to the hash map relating
		// the bond to the edge.
		NodeItemType* first_item = atom_to_node_[first];
		NodeItemType* second_item = atom_to_node_[second];
		edges_.push_back(EdgeItemType(bond, first_item, second_item));
		bond_to_edge_.insert(std::pair<Bond*, EdgeItemType*>(const_cast<Bond*>(&bond), &edges_.back()));
		first_item->adjacent_edges_.push_back(&edges_.back());
		second_item->adjacent_edges_.push_back(&edges_.back());

		return true;
	}

	template <typename Node, typename Edge>
	std::ostream& operator << (std::ostream& os, const TSimpleMolecularGraph<Node, Edge>& G)
	{		
		os << "Nodes:" << std::endl;

		typename TSimpleMolecularGraph<Node, Edge>::NodeConstIterator node = G.beginNode();
		Size count = 0;
		for (; node != G.endNode(); ++node)
		{
			os << count++ << ": " << node->getAtom()->getFullName() << " [" << node->getDegree() << "] '" << node->getAtom() << "'" << std::endl;			
		}

		os << "Edges:" << std::endl;	

		typename TSimpleMolecularGraph<Node, Edge>::EdgeConstIterator edge = G.beginEdge();
		count = 0;
		for (; edge != G.endEdge(); ++edge)
		{
			os << count++ << ": " << edge->getSource().getAtom() << "-" << edge->getTarget().getAtom() << " '" << edge->getBond() << "'" << std::endl;
		}

		return os;
	}

	template <typename Node, typename Edge>
	bool TSimpleMolecularGraph<Node, Edge>::deleteNode(const Atom& atom)
	{
		if (!atom_to_node_.has(const_cast<Atom*>(&atom)))
		{
			return false;
		}
		
		return deleteNode(*atom_to_node_[const_cast<Atom*>(&atom)]);
	}

	template <typename Node, typename Edge>
	bool TSimpleMolecularGraph<Node, Edge>::deleteEdge(const Bond& bond)
	{
		if (!bond_to_edge_.has(const_cast<Bond*>(&bond)))
		{
			return false;
		}
		
		return deleteEdge(*bond_to_edge_[const_cast<Bond*>(&bond)]);
	}

	template <typename Node, typename Edge>
	bool TSimpleMolecularGraph<Node, Edge>::deleteNode(typename TSimpleMolecularGraph<Node, Edge>::NodeItemType& node)
	{
		NodeIterator node_it = std::find(nodes_.begin(), nodes_.end(), node);
		if (node_it == nodes_.end())
		{
			return false;
		}

		bool remove = true;
		while (remove)
		{
			remove = false;
			typename NodeItemType::Iterator edge(node.begin());
			for (; edge != node.end(); ++edge)
			{
				deleteEdge(**edge);
				break;
			}
		}

		atom_to_node_.erase(node_it->getAtom());
		nodes_.erase(node_it);
	
		return true;
	}

	template <typename Node, typename Edge>
	bool TSimpleMolecularGraph<Node, Edge>::deleteEdge(typename TSimpleMolecularGraph<Node, Edge>::EdgeItemType& edge)
	{
		typename std::list<EdgeItemType>::iterator edge_it = std::find(edges_.begin(), edges_.end(), edge);
		if (edge_it == edges_.end())
		{
			return false;
		}
		edge.getSource().deleteEdge_(&edge);
		edge.getTarget().deleteEdge_(&edge);
		bond_to_edge_.erase(edge_it->getBond());
		edges_.erase(edge_it);
		
		return true;
	}


	template <typename Node, typename Edge>
	NodeItem<Node, Edge>::NodeItem()
		
		: atom_(0)
	{
	}

	template <typename Node, typename Edge>
	NodeItem<Node, Edge>::NodeItem(const Atom& atom)
		
		:	atom_(const_cast<Atom*>(&atom))
	{
	}

	template <typename Node, typename Edge>
	Node& NodeItem<Node, Edge>::getData()
		
	{
		return data_;
	}

	template <typename Node, typename Edge>
	const Node& NodeItem<Node, Edge>::getData() const 
		
	{	
		return data_;
	}


	template <typename Node, typename Edge>
	void NodeItem<Node, Edge>::setData(const Node& data) 
		
	{ 
		data_ = data; 
	}

	
	template <typename Node, typename Edge>
	const Atom* NodeItem<Node, Edge>::getAtom() const 
		
	{ 
		return atom_;
	}

	template <typename Node, typename Edge>
	Atom* NodeItem<Node, Edge>::getAtom() 
		
	{ 
		return atom_;
	}

	template <typename Node, typename Edge>
	typename NodeItem<Node, Edge>::Iterator NodeItem<Node, Edge>::begin() 
		
	{ 
		return adjacent_edges_.begin(); 
	}
	
	template <typename Node, typename Edge>
	typename NodeItem<Node, Edge>::ConstIterator NodeItem<Node, Edge>::begin() const 
		
	{ 
		return adjacent_edges_.begin(); 
	}

	template <typename Node, typename Edge>
	typename NodeItem<Node, Edge>::Iterator NodeItem<Node, Edge>::end() 
		
	{ 
		return adjacent_edges_.end(); 
	}

	template <typename Node, typename Edge>
	typename NodeItem<Node, Edge>::ConstIterator NodeItem<Node, Edge>::end() const		
		
	{ 
		return adjacent_edges_.end(); 
	}

	template <typename Node, typename Edge>
	Size NodeItem<Node, Edge>::getDegree() const 
		
	{ 
		return (Size)adjacent_edges_.size(); 
	}

	template <typename Node, typename Edge>
	bool NodeItem<Node, Edge>::operator == (const NodeItem& item) const 
		
	{ 
		return (atom_ == item.atom_); 
	}

	template <typename Node, typename Edge>
	bool NodeItem<Node, Edge>::operator != (const NodeItem& item) const 
		
	{ 
		return (atom_ != item.atom_); 
	}

	template <typename Node, typename Edge>
	void NodeItem<Node, Edge>::deleteEdge_(EdgeItemType* item)
		
	{
		Iterator it(std::find(adjacent_edges_.begin(), adjacent_edges_.end(), item));
		if (it != adjacent_edges_.end())
		{
			adjacent_edges_.erase(it);
		}
	}

	template <typename Node, typename Edge>
	BALL_INLINE
	Size TSimpleMolecularGraph<Node, Edge>::getNumberOfNodes() const
		
	{
		return nodes_.size();
	}

	template <typename Node, typename Edge>
	BALL_INLINE
	Size TSimpleMolecularGraph<Node, Edge>::getNumberOfEdges() const
		
	{
		return edges_.size();
	}

  
} // namespace BALL

#endif // BALL_STRUCTURE_MOLECULARGRAPH_H