本文整理汇总了C#中ComplexF类的典型用法代码示例。如果您正苦于以下问题：C# ComplexF类的具体用法？C# ComplexF怎么用？C# ComplexF使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
ComplexF类属于命名空间，在下文中一共展示了ComplexF类的20个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的C#代码示例。
示例1: Sqrt
/// <summary>
/// Calculate the square root of a complex number
/// </summary>
/// <param name="c"></param>
/// <returns></returns>
static public ComplexF Sqrt( ComplexF c ) {
double x = c.Re;
double y = c.Im;
double modulus = Math.Sqrt( x*x + y*y );
int sign = ( y < 0 ) ? -1 : 1;
c.Re = (float)( _halfOfRoot2 * Math.Sqrt( modulus + x ) );
c.Im = (float)( _halfOfRoot2 * sign * Math.Sqrt( modulus - x ) );
return c;
}
开发者ID:HiWill，项目名称:Ocean_mobile_with_boat_physic，代码行数:17，代码来源:ComplexMath.cs
示例2: Pow
//---------------------------------------------------------------------------------------------------
/// <summary>
/// Calculate the power of a complex number
/// </summary>
/// <param name="c"></param>
/// <param name="exponent"></param>
/// <returns></returns>
public static ComplexF Pow( ComplexF c, double exponent )
{
double x = c.Re;
double y = c.Im;
double modulus = Math.Pow( x*x + y*y, exponent * 0.5 );
double argument = Math.Atan2( y, x ) * exponent;
c.Re = (float)( modulus * System.Math.Cos( argument ) );
c.Im = (float)( modulus * System.Math.Sin( argument ) );
return c;
}
开发者ID:remy22，项目名称:AudioVSTToolbox，代码行数:20，代码来源:ComplexMath.cs
示例3: SumRecursion
static private ComplexF SumRecursion( ComplexF[] data, int start, int end ) {
Debug.Assert( 0 <= start, "start = " + start );
Debug.Assert( start < end, "start = " + start + " and end = " + end );
Debug.Assert( end <= data.Length, "end = " + end + " and data.Length = " + data.Length );
if( ( end - start ) <= 1000 ) {
ComplexF sum = ComplexF.Zero;
for( int i = start; i < end; i ++ ) {
sum += data[ i ];
}
return sum;
}
else {
int middle = ( start + end ) >> 1;
return SumRecursion( data, start, middle ) + SumRecursion( data, middle, end );
}
}
开发者ID:hoyle-a，项目名称:mobileocean，代码行数:17，代码来源:ComplexStats.cs
示例4: InitWaveGenerator
void InitWaveGenerator()
{
// Wind restricted to one direction, reduces calculations
Vector2 wind = new Vector2 (windx, 0.0f);
// Initialize wave generator
for (int y=0; y<height; y++) {
for (int x=0; x<width; x++) {
float yc = y < height / 2f ? y : -height + y;
float xc = x < width / 2f ? x : -width + x;
Vector2 vec_k = new Vector2 (2.0f * Mathf.PI * xc / size.x, 2.0f * Mathf.PI * yc / size.z);
h0 [width * y + x] = new ComplexF (GaussianRnd (), GaussianRnd ()) * 0.707f * (float)System.Math.Sqrt (P_spectrum (vec_k, wind));
}
}
for (int y=0; y<n_height; y++) {
for (int x=0; x<n_width; x++) {
float yc = y < n_height / 2f ? y : -n_height + y;
float xc = x < n_width / 2f ? x : -n_width + x;
Vector2 vec_k = new Vector2 (2.0f * Mathf.PI * xc / (size.x / normal_scale), 2.0f * Mathf.PI * yc / (size.z / normal_scale));
n0 [n_width * y + x] = new ComplexF (GaussianRnd (), GaussianRnd ()) * 0.707f * (float)System.Math.Sqrt (P_spectrum (vec_k, wind));
}
}
}
开发者ID:Cocoss，项目名称:pirates，代码行数:24，代码来源:Ocean.cs
示例5: Invert
/// <summary>
/// Invert each element in the array
/// </summary>
/// <param name="array"></param>
static public void Invert( ComplexF[] array ) {
for( int i = 0; i < array.Length; i ++ ) {
array[i] = ((ComplexF) 1 ) / array[i];
}
}
开发者ID:hoyle-a，项目名称:mobileocean，代码行数:9，代码来源:ComplexArray.cs
示例6: Copy
/// <summary>
/// Copy an array
/// </summary>
/// <param name="dest"></param>
/// <param name="source"></param>
static public void Copy( ComplexF[] dest, ComplexF[] source ) {
Debug.Assert( dest != null );
Debug.Assert( source != null );
Debug.Assert( dest.Length == source.Length );
for( int i = 0; i < dest.Length; i ++ ) {
dest[i] = source[i];
}
}
开发者ID:hoyle-a，项目名称:mobileocean，代码行数:13，代码来源:ComplexArray.cs
示例7: Divide
/// <summary>
/// Divide each element in target array with corresponding element in rhs array
/// </summary>
/// <param name="target"></param>
/// <param name="rhs"></param>
static public void Divide( ComplexF[] target, ComplexF[] rhs ) {
ComplexArray.Divide( target, rhs, target );
}
开发者ID:hoyle-a，项目名称:mobileocean，代码行数:8，代码来源:ComplexArray.cs
示例8: Multiply
/// <summary>
/// Multiply each element in target array with corresponding element in rhs array
/// </summary>
/// <param name="target"></param>
/// <param name="rhs"></param>
static public void Multiply( ComplexF[] target, ComplexF[] rhs ) {
ComplexArray.Multiply( target, rhs, target );
}
开发者ID:hoyle-a，项目名称:mobileocean，代码行数:8，代码来源:ComplexArray.cs
示例9: Scale
/// <summary>
/// Multiply each element in the array by a specific value
/// </summary>
/// <param name="array"></param>
/// <param name="scale"></param>
static public void Scale( ComplexF[] array, ComplexF scale ) {
Debug.Assert( array != null );
int length = array.Length;
for( int i = 0; i < length; i ++ ) {
array[i] *= scale;
}
}
开发者ID:hoyle-a，项目名称:mobileocean，代码行数:13，代码来源:ComplexArray.cs
示例10: LockBufferCF
static private void LockBufferCF( int length, ref ComplexF[] buffer ) {
if( length != _bufferCF.Length ) {
_bufferCF = new ComplexF[ length ];
}
buffer = _bufferCF;
}
开发者ID:daffodilistic，项目名称:Ocean_Community_Next_Gen，代码行数:7，代码来源:Fourier.cs
示例11: ReorderArray
//-------------------------------------------------------------------------------------
static private void ReorderArray( ComplexF[] data ) {
int length = data.Length;
int[] reversedBits = GetReversedBits( Log2( length ) );
for( int i = 0; i < length; i ++ ) {
int swap = reversedBits[ i ];
if( swap > i ) {
ComplexF temp = data[ i ];
data[ i ] = data[ swap ];
data[ swap ] = temp;
}
}
}
开发者ID:daffodilistic，项目名称:Ocean_Community_Next_Gen，代码行数:18，代码来源:Fourier.cs
示例12: Swap
/// <summary>
/// Swap two complex numbers
/// </summary>
/// <param name="a"></param>
/// <param name="b"></param>
static public void Swap( ref ComplexF a, ref ComplexF b ) {
ComplexF temp = a;
a = b;
b = temp;
}
开发者ID:HiWill，项目名称:Ocean_mobile_with_boat_physic，代码行数:10，代码来源:ComplexMath.cs
示例13: FFT
/// <summary>
/// Compute a 1D fast Fourier transform of a dataset of complex numbers.
/// </summary>
/// <param name="data"></param>
/// <param name="direction"></param>
public static void FFT( ComplexF[] data, FourierDirection direction ) {
if( data == null ) {
throw new ArgumentNullException( "data" );
}
Fourier.FFT( data, data.Length, direction );
}
开发者ID:hoyle-a，项目名称:mobileocean，代码行数:11，代码来源:Fourier.cs
示例14: FFT_Quick
/// <summary>
/// Compute a 1D fast Fourier transform of a dataset of complex numbers.
/// </summary>
/// <param name="data"></param>
/// <param name="length"></param>
/// <param name="direction"></param>
public static void FFT_Quick( ComplexF[] data, int length, FourierDirection direction ) {
/*if( data == null ) {
throw new ArgumentNullException( "data" );
}
if( data.Length < length ) {
throw new ArgumentOutOfRangeException( "length", length, "must be at least as large as 'data.Length' parameter" );
}
if( Fourier.IsPowerOf2( length ) == false ) {
throw new ArgumentOutOfRangeException( "length", length, "must be a power of 2" );
}
Fourier.SyncLookupTableLength( length );*/
int ln = Fourier.Log2( length );
// reorder array
Fourier.ReorderArray( data );
// successive doubling
int N = 1;
int signIndex = ( direction == FourierDirection.Forward ) ? 0 : 1;
for( int level = 1; level <= ln; level ++ ) {
int M = N;
N <<= 1;
float[] uRLookup = _uRLookupF[ level, signIndex ];
float[] uILookup = _uILookupF[ level, signIndex ];
for( int j = 0; j < M; j ++ ) {
float uR = uRLookup[j];
float uI = uILookup[j];
for( int even = j; even < length; even += N ) {
int odd = even + M;
float r = data[ odd ].Re;
float i = data[ odd ].Im;
float odduR = r * uR - i * uI;
float odduI = r * uI + i * uR;
r = data[ even ].Re;
i = data[ even ].Im;
data[ even ].Re = r + odduR;
data[ even ].Im = i + odduI;
data[ odd ].Re = r - odduR;
data[ odd ].Im = i - odduI;
}
}
}
}
开发者ID:hoyle-a，项目名称:mobileocean，代码行数:61，代码来源:Fourier.cs
示例15: Swap
static private void Swap( ref ComplexF a, ref ComplexF b ) {
ComplexF temp = a;
a = b;
b = temp;
}
开发者ID:hoyle-a，项目名称:mobileocean，代码行数:5，代码来源:Fourier.cs
示例16: IsEqual
/// <summary>
/// Determine whether the elements in the two arrays are the same
/// </summary>
/// <param name="array1"></param>
/// <param name="array2"></param>
/// <param name="tolerance"></param>
/// <returns></returns>
static public bool IsEqual( ComplexF[] array1, ComplexF[] array2, float tolerance ) {
if ( array1.Length != array2.Length ) {
return false;
}
for( int i = 0; i < array1.Length; i ++ ) {
if( ComplexF.IsEqual( array1[i], array2[i], tolerance ) == false ) {
return false;
}
}
return true;
}
开发者ID:hoyle-a，项目名称:mobileocean，代码行数:18，代码来源:ComplexArray.cs
示例17: Offset
/// <summary>
/// Add a specific value to each element in the array
/// </summary>
/// <param name="array"></param>
/// <param name="offset"></param>
static public void Offset( ComplexF[] array, ComplexF offset ) {
int length = array.Length;
for( int i = 0; i < length; i ++ ) {
array[i] += offset;
}
}
开发者ID:hoyle-a，项目名称:mobileocean，代码行数:11，代码来源:ComplexArray.cs
示例18: UnlockBufferCF
static private void UnlockBufferCF( ref ComplexF[] buffer ) {
buffer = null;
}
开发者ID:daffodilistic，项目名称:Ocean_Community_Next_Gen，代码行数:3，代码来源:Fourier.cs
示例19: LinearFFT_Quick
private static void LinearFFT_Quick( ComplexF[] data, int start, int inc, int length, FourierDirection direction ) {
// copy to buffer
ComplexF[] buffer = null;
LockBufferCF( length, ref buffer );
int j = start;
for( int i = 0; i < length; i ++ ) {
buffer[ i ] = data[ j ];
j += inc;
}
FFT( buffer, length, direction );
// copy from buffer
j = start;
for( int i = 0; i < length; i ++ ) {
data[ j ] = buffer[ i ];
j += inc;
}
UnlockBufferCF( ref buffer );
}
开发者ID:daffodilistic，项目名称:Ocean_Community_Next_Gen，代码行数:21，代码来源:Fourier.cs
示例20: FFT
//======================================================================================
/// <summary>
/// Compute a 1D fast Fourier transform of a dataset of complex numbers.
/// </summary>
/// <param name="data"></param>
/// <param name="length"></param>
/// <param name="direction"></param>
public static void FFT( ComplexF[] data, int length, FourierDirection direction ) {
SyncLookupTableLength( length );
int ln = Log2( length );
// reorder array
ReorderArray( data );
// successive doubling
int N = 1;
int signIndex = ( direction == FourierDirection.Forward ) ? 0 : 1;
for( int level = 1; level <= ln; level ++ ) {
int M = N;
N <<= 1;
float[] uRLookup = _uRLookupF[ level, signIndex ];
float[] uILookup = _uILookupF[ level, signIndex ];
for( int j = 0; j < M; j ++ ) {
float uR = uRLookup[j];
float uI = uILookup[j];
for( int even = j; even < length; even += N ) {
int odd = even + M;
float r = data[ odd ].Re;
float i = data[ odd ].Im;
float odduR = r * uR - i * uI;
float odduI = r * uI + i * uR;
r = data[ even ].Re;
i = data[ even ].Im;
data[ even ].Re = r + odduR;
data[ even ].Im = i + odduI;
data[ odd ].Re = r - odduR;
data[ odd ].Im = i - odduI;
}
}
}
}
开发者ID:daffodilistic，项目名称:Ocean_Community_Next_Gen，代码行数:55，代码来源:Fourier.cs
注：本文中的ComplexF类示例整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。 |
客服电话
APP下载
官方微信
请发表评论