casa6

//# ClassFileName.cc:  this defines ClassName, which ...

//# Copyright (C) 1998,1999,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$

​

//# Includes

​

#include <synthesis/Parallel/SerialTransport.h>

#include <casacore/casa/Containers/Record.h>

​

using namespace casacore;

namespace casa { //# NAMESPACE CASA - BEGIN

​

  // OK this is all pretty straight forward.  Just assign the pointers.  

  // On the gets check it's nonzero first.  Probably should throw an 

  // exception.

​

SerialTransport::SerialTransport(): PTransport(), inQue(0), outQue(0), lastInQue(0)

{

    if (debug_p) {

        cerr << "constructing SerialTransport" << std::endl;

    }

    _data.resize(20);

}

​

Int SerialTransport::add2Queue(void *item){

   if (debug_p) {

       cerr << ">add2Queue: " << item << ", " << inQue << ", " << outQue << ", " <<

           lastInQue << ", " << _data.nelements() << "\n";

   }

​

   _data[inQue] = item;

   ++inQue;

   // This was here from ancient times. It looks wrong. Applicator/algorithm for example

   // won't work at all.

   // outQue = 0;  // eh? only strict put... get sequence supported?

​

   if(inQue >= _data.nelements())

      _data.resize(inQue*2, false, true);

   lastInQue = inQue;

​