Exemplo n.º 1
0
void Fft::CopyIn (/*SampleIter& iter*/ int SampleCount, short *Samples)
{
//    int cSample = iter.Count();
	int cSample = SampleCount;
    if (cSample > m_Points)
        return;

    // make space for cSample samples at the end of tape
    // shifting previous samples towards the beginning
    memmove (m_aTape, &m_aTape[cSample], 
              (m_Points - cSample) * sizeof(double));
    // copy samples from iterator to tail end of tape
    int iTail  = m_Points - cSample;
    for (int i = 0; i < cSample; i++/*, iter.Advance()*/)
    {
        m_aTape [i + iTail] = (double) /*iter.GetSample()*/ Samples[i];
    }
    // Initialize the FFT buffer
    for (int i = 0; i < m_Points; i++)
        PutAt (i, m_aTape[i]);
}
Exemplo n.º 2
0
int distance::LD (char const *s, char const *t)
{
int *d; // pointer to matrix
int n; // length of s
int m; // length of t
int i; // iterates through s
int j; // iterates through t
char s_i; // ith character of s
char t_j; // jth character of t
int cost; // cost
int result; // result
int cell; // contents of target cell
int above; // contents of cell immediately above
int left; // contents of cell immediately to left
int diag; // contents of cell immediately above and to left
int sz; // number of cells in matrix

  // Step 1

  n = strlen (s);
  m = strlen (t);
  if (n == 0) {
    return m;
  }
  if (m == 0) {
    return n;
  }
  sz = (n+1) * (m+1) * sizeof (int);
  d = (int *) malloc (sz);

  // Step 2

  for (i = 0; i <= n; i++) {
    PutAt (d, i, 0, n, i);
  }

  for (j = 0; j <= m; j++) {
    PutAt (d, 0, j, n, j);
  }

  // Step 3

  for (i = 1; i <= n; i++) {

    s_i = s[i-1];

    // Step 4

    for (j = 1; j <= m; j++) {

      t_j = t[j-1];

      // Step 5

      if (s_i == t_j) {
        cost = 0;
      }
      else {
        cost = 1;
      }

      // Step 6

      above = GetAt (d,i-1,j, n);
      left = GetAt (d,i, j-1, n);
      diag = GetAt (d, i-1,j-1, n);
      cell = Minimum (above + 1, left + 1, diag + cost);
      PutAt (d, i, j, n, cell);
    }
  }

  // Step 7

  result = GetAt (d, n, m, n);
  free (d);
  return result;

}