primitive_FST.cpp File Reference

#include <cmath>

Include dependency graph for primitive_FST.cpp:

Go to the source code of this file.

Functions
int	seanindex (int m, int l, int bw)
void	seanindex2 (int m, int l, int bw, int *loc)
void	transpose (double *array, int size)

Function Documentation

seanindex()

int seanindex	(	int	m,
		int	l,
		int	bw
	)

Definition at line 65 of file primitive_FST.cpp.

{     
  int bigL;

  bigL = bw - 1;

  if( m >= 0 )
    return( m * ( bigL + 1 ) - ( ( m * (m - 1) ) /2 ) + ( l - m ) );
  else
    return( ( ( bigL * ( bigL + 3 ) ) /2 ) + 1 +
        ( ( bigL + m ) * ( bigL + m + 1 ) / 2 ) + ( l - std::abs( m ) ) );
}

seanindex2()

void seanindex2	(	int	m,
		int	l,
		int	bw,
		int *	loc
	)

Definition at line 93 of file primitive_FST.cpp.

{     
  int bigL;
  
  bigL = bw - 1;
  
  /* first index for (l,m) */
  loc[0] = m * ( bigL + 1 ) - ( ( m * (m - 1) ) /2 ) + ( l - m );
  
  /* second index for (l,-m) */
  loc[1] = ( ( bigL * ( bigL + 3 ) ) /2 ) + 1 +
    ( ( bigL - m ) * ( bigL - m + 1 ) / 2 ) + ( l -  m ) ;

}

transpose()

void transpose	(	double *	array,
		int	size
	)

Definition at line 121 of file primitive_FST.cpp.

{
  int i, j;
  double t1, t2, t3, t4;

  for(i = 0; i < size; i += 2)
    {
      t1 = array[(i * size) + i + 1];
      array[(i * size) + i + 1] = array[((i + 1) * size) + i];
      array[((i + 1) * size) + i] = t1;
      for(j = (i + 2); j < size; j += 2)
    {
      t1 = array[(i*size)+j]; t2 = array[(i*size)+j+1];
      t3 = array[((i+1)*size)+j]; t4 = array[((i+1)*size)+j+1];
      array[(i*size)+j] = array[(j*size)+i];
      array[(i*size)+j+1] = array[((j+1)*size)+i];
      array[((i+1)*size)+j] = array[(j*size)+i+1];
      array[((i+1)*size)+j+1] = array[((j+1)*size)+i+1];
      array[(j*size)+i] = t1;
      array[((j+1)*size)+i] = t2;
      array[(j*size)+i+1] = t3;
      array[((j+1)*size)+i+1] = t4;
    }
    }
}