[Quantproject-developers] QuantProject/b1_ADT/Collections DoubleArrayManager.cs, NONE, 1.1

[Marco M. <mi...@us...>]

Update of /cvsroot/quantproject/QuantProject/b1_ADT/Collections
In directory vz-cvs-3.sog:/tmp/cvs-serv24113

Added Files:
	DoubleArrayManager.cs 
Log Message:
Added class for managing arrays of double

--- NEW FILE: DoubleArrayManager.cs ---
/*
QuantProject - Quantitative Finance Library

DoubleArrayManager.cs
Copyright (C) 2011
Marco Milletti

This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.

This program 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 General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
*/

using System;

namespace QuantProject.ADT.Collections
{
	/// <summary>
	/// This class provides functions to manage array of doubles
	/// </summary>
	public class DoubleArrayManager
	{
		public DoubleArrayManager()
		{
			//
			// TODO: Add constructor logic here
			//
		}

		#region GetRatios_commented
//		private static double getRatio( double[] values , int i )
//		{
//			return ( values[ i + 1 ] / values[ i ] );
//		}
//		/// <summary>
//		/// If values contains n elements (V0, V1, ... Vn-1),
//		/// GetRatios returns n-1 elements (E0, E1, ... En-2) where
//		/// Ei = Vi+1 / Vi, for all i=0,1,...n-2
//		/// </summary>
//		/// <param name="values"></param>
//		/// <returns></returns>
//		public static double[] GetRatios( double[] values )
//		{
//			double[] ratios = new double[ values.Length - 1 ];
//			for ( int i=0 ; i < values.Length ; i++ )
//				ratios[ i ] = getRatio( values , i );
//			return ratios;
//		}
		#endregion
		
		private static int extractPositive_countPositive( double[] srcArray )
		{
			int returnValue = 0;
			for(int i = 0; i < srcArray.Length; i++)
				if(srcArray[i] > 0.0)
					returnValue++;
			
			return returnValue;
		}
		private static int extractNegative_countNegative( double[] srcArray )
		{
			int returnValue = 0;
			for(int i = 0; i < srcArray.Length; i++)
				if(srcArray[i] < 0.0)
					returnValue++;
			
			return returnValue;
		}
		/// <summary>
		/// Returns a double array containing only the positive double
		/// values in the given double array
		/// </summary>
		public static double[] ExtractPositive( double[] srcArray )
		{
			double[] returnValue;
			int numOfPositiveDouble = 
				DoubleArrayManager.extractPositive_countPositive(srcArray);
			returnValue = new double[numOfPositiveDouble];
			int idx = 0;
			for(int i = 0; i < numOfPositiveDouble; i++)
			{
				if(srcArray[i] > 0.0)
				{
					returnValue[idx] = srcArray[i];
					idx++;
				}
			}
			return returnValue;
		}
		/// <summary>
		/// Returns a double array containing only the negative double
		/// values in the given double array
		/// </summary>
		public static double[] ExtractNegative( double[] srcArray )
		{
			double[] returnValue;
			int numOfNegativeDouble = 
				DoubleArrayManager.extractNegative_countNegative(srcArray);
			returnValue = new double[numOfNegativeDouble];
			int idx = 0;
			for(int i = 0; i < numOfNegativeDouble; i++)
			{
				if(srcArray[i] < 0.0)
				{
					returnValue[idx] = srcArray[i];
					idx++;
				}
			}
			return returnValue;
		}
	}
}