/usr/include/casacore/casa/Containers/Stack.tcc is in casacore-dev 2.2.0-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 | //# Stack.cc: Implementation of a stack using the doubly linked list class
//# Copyright (C) 1993,1994,1995,1996,2000
//# Associated Universities, Inc. Washington DC, USA.
//#
//# This library is free software; you can redistribute it and/or modify it
//# under the terms of the GNU Library General Public License as published by
//# the Free Software Foundation; either version 2 of the License, or (at your
//# option) any later version.
//#
//# This library 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 Library General Public
//# License for more details.
//#
//# You should have received a copy of the GNU Library General Public License
//# along with this library; if not, write to the Free Software Foundation,
//# Inc., 675 Massachusetts Ave, Cambridge, MA 02139, USA.
//#
//# Correspondence concerning AIPS++ should be addressed as follows:
//# Internet email: aips2-request@nrao.edu.
//# Postal address: AIPS++ Project Office
//# National Radio Astronomy Observatory
//# 520 Edgemont Road
//# Charlottesville, VA 22903-2475 USA
//#
//# $Id$
#ifndef CASA_STACK_TCC
#define CASA_STACK_TCC
#include <casacore/casa/Containers/Stack.h>
#include <casacore/casa/Containers/StackError.h>
namespace casacore { //# NAMESPACE CASACORE - BEGIN
template<class elem> Stack<elem>::~Stack() {
if ( topOfStack )
delete topOfStack;
}
template<class elem> Stack<elem>::Stack(const Stack<elem> &other) : topOfStack(0) {
if ( other.topOfStack ) {
const Link<elem> *cur = other.topOfStack;
Link<elem> *last = topOfStack = new Link<elem>(cur->val());
while ( (cur = cur->next()) )
last = new Link<elem>(cur->val(),last);
}
}
template<class elem> Stack<elem> &Stack<elem>::operator=(const Stack<elem> &other) {
if ( topOfStack ) {
delete topOfStack;
topOfStack = 0;
}
if ( other.topOfStack ) {
const Link<elem> *cur = other.topOfStack;
Link<elem> *last = topOfStack = new Link<elem>(cur->val());
while ( (cur = cur->next()) )
last = new Link<elem>(cur->val(),last);
}
return *this;
}
} //# NAMESPACE CASACORE - END
#endif
|