Commit 4919d292 authored by Andres Mejia's avatar Andres Mejia

Imported Upstream version 2.0.1+dfsg

parent 6f5eaded

Too many changes to show.

To preserve performance only 1000 of 1000+ files are displayed.

projectM -- Milkdrop-esque visualisation SDK
Copyright (C)2003-2007 projectM Team
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
See 'LICENSE.txt' included within this release
For the purposes of the copyright statement in the preamble of each source
code file comprising projectM, the projectM team are:
Carmelo Piccione
Parser
Evaluator
Pulse Audio support (projectM-pulseaudio)
Qt GUI (projectM-qt)
Peter Sperl
Beat Detection
Rendering
XMMS Support (projectM-xmms)
libvisual Support (projectM-libvisual)
Alligator Descartes
Media Player Support (iTunes, Winamp, Windows Media Player)
Test application frameworks (projectM-wxvis, projectM-sdlvis)
DVD application (projectM-movie)
Win32 screensaver (projectM-screensaver)
Roger Dannenburg
Advice & Support
#ifndef PROJECTM_ALGORITHMS_HPP
#define PROJECTM_ALGORITHMS_HPP
#include <cassert>
/// A collection of algorithms generically written over map style containers
namespace Algorithms
{
template <class TraverseFunctor, class Container>
void traverse(Container & container)
{
TraverseFunctor functor;
for (typename Container::iterator pos = container.begin(); pos != container.end(); ++pos)
{
assert(pos->second);
functor(pos->second);
}
}
template <class TraverseFunctor, class Container>
void traverseVector(Container & container)
{
TraverseFunctor functor;
for (typename Container::iterator pos = container.begin(); pos != container.end(); ++pos)
{
assert(*pos);
functor(*pos);
}
}
template <class TraverseFunctor, class Container>
void traverse(Container & container, TraverseFunctor & functor)
{
for (typename Container::iterator pos = container.begin(); pos != container.end(); ++pos)
{
assert(pos->second);
functor(pos->second);
}
}
namespace TraverseFunctors
{
template <class Data>
class DeleteFunctor
{
public:
void operator() (Data * data)
{
assert(data);
delete(data);
}
};
}
}
#endif
/**
* projectM -- Milkdrop-esque visualisation SDK
* Copyright (C)2003-2004 projectM Team
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
* See 'LICENSE.txt' included within this release
*
*/
/**
* Takes sound data from wherever and returns beat detection values
* Uses statistical Energy-Based methods. Very simple
*
* Some stuff was taken from Frederic Patin's beat-detection article,
* you'll find it online
*/
#include <stdlib.h>
#include <stdio.h>
#include "wipemalloc.h"
#include "Common.hpp"
#include "PCM.hpp"
#include <cmath>
#include "BeatDetect.hpp"
DLLEXPORT BeatDetect::BeatDetect(PCM *pcm) {
int x,y;
this->pcm=pcm;
this->vol_instant=0;
this->vol_history=0;
for (y=0;y<80;y++)
{
this->vol_buffer[y]=0;
}
this->beat_buffer_pos=0;
for (x=0;x<32;x++) {
this->beat_instant[x]=0;
this->beat_history[x]=0;
this->beat_val[x]=1.0;
this->beat_att[x]=1.0;
this->beat_variance[x]=0;
for (y=0;y<80;y++) {
this->beat_buffer[x][y]=0;
}
}
this->treb = 0;
this->mid = 0;
this->bass = 0;
this->vol_old = 0;
this->beat_sensitivity = 10.00;
this->treb_att = 0;
this->mid_att = 0;
this->bass_att = 0;
this->vol = 0;
}
DLLEXPORT BeatDetect::~BeatDetect()
{
}
void BeatDetect::reset() {
this->treb = 0;
this->mid = 0;
this->bass = 0;
this->treb_att = 0;
this->mid_att = 0;
this->bass_att = 0;
}
void BeatDetect::detectFromSamples() {
vol_old = vol;
bass=0;mid=0;treb=0;
getBeatVals(pcm->pcmdataL,pcm->pcmdataR);
}
void BeatDetect::getBeatVals( float *vdataL,float *vdataR ) {
int linear=0;
int x,y;
float temp2=0;
vol_instant=0;
for ( x=0;x<16;x++)
{
beat_instant[x]=0;
for ( y=linear*2;y<(linear+8+x)*2;y++)
{
beat_instant[x]+=((vdataL[y]*vdataL[y])+(vdataR[y]*vdataR[y]))*(1.0/(8+x));
// printf( "beat_instant[%d]: %f %f %f\n", x, beat_instant[x], vdataL[y], vdataR[y] );
vol_instant+=((vdataL[y]*vdataL[y])+(vdataR[y]*vdataR[y]))*(1.0/512.0);
}
//printf("1");
linear=y/2;
beat_history[x]-=(beat_buffer[x][beat_buffer_pos])*.0125;
beat_buffer[x][beat_buffer_pos]=beat_instant[x];
beat_history[x]+=(beat_instant[x])*.0125;
beat_val[x]=(beat_instant[x])/(beat_history[x]);
beat_att[x]+=(beat_instant[x])/(beat_history[x]);
//printf("2\n");
}
//printf("b\n");
vol_history-=(vol_buffer[beat_buffer_pos])*.0125;
vol_buffer[beat_buffer_pos]=vol_instant;
vol_history+=(vol_instant)*.0125;