Feature hb

Common/include/config_structure.inl

@@ -69,7 +69,7 @@ inline unsigned long CConfig::GetnExtIter(void) { return nExtIter; }
 
 inline unsigned short CConfig::GetnTimeInstances(void) { return nTimeInstances; }
 
-inline su2double CConfig::GetTimeSpectral_Period(void) { return TimeSpectral_Period; }
+inline su2double CConfig::GetHarmonicBalance_Period(void) { return HarmonicBalance_Period; }
 
 inline void CConfig::SetExtIter(unsigned long val_iter) { ExtIter = val_iter; }
 
@@ -561,6 +561,8 @@ inline su2double CConfig::GetPlunging_Ampl_Y(unsigned short val_iZone) { return
 
 inline su2double CConfig::GetPlunging_Ampl_Z(unsigned short val_iZone) { return  Plunging_Ampl_Z[val_iZone]; }
 
+inline su2double* CConfig::GetOmega_HB(void) { return  Omega_HB; }
+
 inline unsigned short CConfig::GetMoveMotion_Origin(unsigned short val_marker) {return MoveMotion_Origin[val_marker]; }
 
 inline su2double CConfig::GetminTurkelBeta() { return  Min_Beta_RoeTurkel; }

Common/include/dual_grid_structure.hpp

@@ -651,18 +651,18 @@ class CPoint : public CDualGrid {
 	 */
 	su2double **GetGridVel_Grad(void);
 
-	/*! 
+	/*!
 	 * \brief Add the value of the coordinates to the <i>Coord_Sum</i> vector for implicit smoothing.
 	 * \param[in] val_coord_sum - Value of the coordinates to add.
 	 */	
 	void AddCoord_Sum(su2double *val_coord_sum);
 
-	/*! 
+	/*!
 	 * \brief Initialize the vector <i>Coord_Sum</i>.
 	 */	
 	void SetCoord_SumZero(void);
 
-	/*! 
+	/*!
 	 * \brief Set the value of the vector <i>Coord_Old</i> for implicit smoothing.
 	 * \param[in] val_coord_old - Value of the coordinates.
 	 */	

Common/include/dual_grid_structure.inl

@@ -106,17 +106,17 @@ inline su2double **CPoint::GetGridVel_Grad(void) { return GridVel_Grad; }
 
 inline void CPoint::SetCoord_Old(su2double *val_coord_old) {
 	for (unsigned short iDim = 0; iDim < nDim; iDim++)
-		Coord_Old[iDim] = val_coord_old[iDim]; 
+		Coord_Old[iDim] = val_coord_old[iDim];
 }
 
 inline void CPoint::SetCoord_SumZero(void) {
 	for (unsigned short iDim = 0; iDim < nDim; iDim++)
-	Coord_Sum[iDim] = 0.0; 
+	Coord_Sum[iDim] = 0.0;
 }
 
 inline void CPoint::AddCoord_Sum(su2double *val_coord_sum) { 
-	for (unsigned short iDim = 0; iDim < nDim; iDim++) 
-		Coord_Sum[iDim] += val_coord_sum[iDim]; 
+	for (unsigned short iDim = 0; iDim < nDim; iDim++)
+		Coord_Sum[iDim] += val_coord_sum[iDim];
 }
 
 inline void CPoint::SetGridVel(unsigned short val_dim, su2double val_gridvel) { GridVel[val_dim] = val_gridvel; }
@@ -140,13 +140,13 @@ inline bool CPoint::GetAgglomerate_Indirect (void) { return Agglomerate_Indirect
 
 inline void CPoint::SetAgglomerate_Indirect(bool val_agglomerate) { Agglomerate_Indirect = val_agglomerate; };
 
-inline void CPoint::SetVertex(long val_vertex, unsigned short val_nmarker) { 
+inline void CPoint::SetVertex(long val_vertex, unsigned short val_nmarker) {
 	if (Boundary) Vertex[val_nmarker] = val_vertex;
 }
 
 inline unsigned short CPoint::GetnChildren_CV (void) { return nChildren_CV; }
 
-inline long CPoint::GetVertex(unsigned short val_marker) { 
+inline long CPoint::GetVertex(unsigned short val_marker) {
 	if (Boundary) return Vertex[val_marker];
 	else return -1; 
 }

Common/include/grid_adaptation_structure.hpp

@@ -114,7 +114,7 @@ class CGridAdaptation {
 	 */	
 	void GetAdjResidual(CGeometry *geometry, CConfig *config);
 
-	/*! 
+	/*!
 	 * \brief Do a complete adaptation of the computational grid.
 	 * \param[in] geometry - Geometrical definition of the problem.
 	 * \param[in] strength - Adaptation Strength.	 

Common/include/grid_movement_structure.hpp

@@ -42,7 +42,6 @@
 #include <cstdlib>
 #include <fstream>
 #include <cmath>
-
 #include <ctime>
 
 #include "geometry_structure.hpp"
@@ -530,7 +529,7 @@ class CFreeFormDefBox : public CGridMovement {
 	 * \param[in] n - Upper coefficient.
 	 * \param[in] m - Lower coefficient.
 	 * \return Value of the binomial coefficient n over m.
-	 */		
+	 */
 	su2double Binomial(unsigned short n, unsigned short m);
 
 	/*! 

Common/include/option_structure.hpp

@@ -1237,20 +1237,20 @@ static const map<string, ENUM_AXIS_ORIENTATION> Axis_Orientation_Map = CCreateMa
  * \brief types of schemes for unsteady computations
  */
 enum ENUM_UNSTEADY {
-  STEADY = 0,             /*!< \brief A steady computation. */
-  TIME_STEPPING = 1,		/*!< \brief Use a time stepping strategy for unsteady computations. */
-  DT_STEPPING_1ST = 2,	/*!< \brief Use a dual time stepping strategy for unsteady computations (1st order). */
-  DT_STEPPING_2ND = 3,	/*!< \brief Use a dual time stepping strategy for unsteady computations (2nd order). */
-  ROTATIONAL_FRAME = 4,   /*!< \brief Use a rotational source term. */
-  TIME_SPECTRAL = 5       	/*!< \brief Use a time spectral source term. */
+  STEADY = 0,            /*!< \brief A steady computation. */
+  TIME_STEPPING = 1,		 /*!< \brief Use a time stepping strategy for unsteady computations. */
+  DT_STEPPING_1ST = 2,	 /*!< \brief Use a dual time stepping strategy for unsteady computations (1st order). */
+  DT_STEPPING_2ND = 3,	 /*!< \brief Use a dual time stepping strategy for unsteady computations (2nd order). */
+  ROTATIONAL_FRAME = 4,  /*!< \brief Use a rotational source term. */
+  HARMONIC_BALANCE = 5    /*!< \brief Use a harmonic balance source term. */
 
 };
 static const map<string, ENUM_UNSTEADY> Unsteady_Map = CCreateMap<string, ENUM_UNSTEADY>
 ("NO", STEADY)
 ("TIME_STEPPING", TIME_STEPPING)
 ("DUAL_TIME_STEPPING-1ST_ORDER", DT_STEPPING_1ST)
 ("DUAL_TIME_STEPPING-2ND_ORDER", DT_STEPPING_2ND)
-("TIME_SPECTRAL", TIME_SPECTRAL)
+("HARMONIC_BALANCE", HARMONIC_BALANCE)
 ("ROTATIONAL_FRAME", ROTATIONAL_FRAME);
 
 /*!

Common/include/primal_grid_structure.inl

@@ -138,7 +138,6 @@ inline unsigned short CTriangle::GetnNeighbor_Elements(void) { return nNeighbor_
 inline void CTriangle::SetDomainElement(unsigned long val_domainelement) { DomainElement = val_domainelement; }
 
 inline unsigned long CTriangle::GetDomainElement(void) { return DomainElement; }
-
 inline unsigned short CQuadrilateral::GetFaces(unsigned short val_face, unsigned short val_index) { return Faces[val_face][val_index]; }
 
 inline unsigned short CQuadrilateral::GetNeighbor_Nodes(unsigned short val_node, unsigned short val_index) { return Neighbor_Nodes[val_node][val_index]; }