Spinning like tooth:


// c_Puls
// buffer_Size
// Second
// fruquent
// rate 1/44 as sounds A
{
	int buffer_Size =  bit_per_second * Second;
	double fruquent = buffer_Size / Second;

	for ( int i = 0; i< (int)fruquent; i++ ) {
		double rate = (i / fruquent);
		double b = rate * buffer_Size;
		if ( (int) b  + 1 < buffer_Size ) {
			m_data[ (int)b ] += c_Puls; 
			m_data[ (int)b + 1] -= c_Puls;
		}
	}
}
// Usage:
// Tooth is more useful and better than "Star Tiara" as expressions.


この記事が気に入ったらサポートをしてみませんか?