src/Deprecated/acquire.cc
// sosi: Memeory allocation and copying avoidable with class integer matrix!
Memeory allocation and copying avoidable with class integer matrix!
Memeory allocation and copying avoidable with class integer matrix!
acquire::acquire (const acquire& ACQ1)
  {
  LS = ACQ1.LS;			
  pos = ACQ1.pos;		
  I = new int[pos];		
  J = new int[pos];		
  A = new complex[pos];		
  B = new complex[pos];		
  for(int i=0; i<pos; i++)
    {
    A[i] = ACQ1.A[i];		
    B[i] = ACQ1.B[i];		
    I[i] = ACQ1.I[i]; 		
    J[i] = ACQ1.J[i];		
    }
  bs = ACQ1.bs;			
  Sm1 = ACQ1.Sm1;		
  siginf = ACQ1.siginf;		
  trinf = ACQ1.trinf;		
  }
acquire :: acquire ( const acquire & ACQ1 ) { LS = ACQ1 . LS ; pos = ACQ1 . pos ; I = new int [ pos ] ; J = new int [ pos ] ; A = new complex [ pos ] ; B = new complex [ pos ] ; for ( int i = 0 ; i < pos ; i ++ ) { A [ i ] = ACQ1 . A [ i ] ; B [ i ] = ACQ1 . B [ i ] ; I [ i ] = ACQ1 . I [ i ] ; J [ i ] = ACQ1 . J [ i ] ; } bs = ACQ1 . bs ; Sm1 = ACQ1 . Sm1 ; siginf = ACQ1 . siginf ; trinf = ACQ1 . trinf ; }
sosi: Memeory allocation and copying avoidable with class integer matrix!
sosi : Memeory allocation and copying avoidable with class integer matrix!
// Input	ACQ1  : Acquire // None		ACQ   : Acquire (this) constructed from ACQ1 // Copy the Liouville space size // Copy number of necessary points // Minimum i index array // Minimum j index array // Minimum A array (detector) // Minimum B array (propagator) // Copy A array (detector equivalent) // Copy B array (time prop. equivalent) // Copy array for index i // Copy array for index j // Copy basis (eigenbasis of prop) // Copy the Liouville inverse eigenvectors // Copy the infinite time density matrix // Copy the infinite time trace