private void ParseOptions(ParseTreeNode node, FvSolutionData rawData)
{
foreach (ParseTreeNode rootEntryNode in node.FindDictEntries(null))
{
var identifier = rootEntryNode.GetEntryIdentifier();
switch (identifier)
{
case "nCorrectors":
rawData.Options.nCorrectors = rootEntryNode.GetBasicValInt();
break;
case "nNonOrthogonalCorrectors":
rawData.Options.nNonOrthogonalCorrectors = rootEntryNode.GetBasicValInt();
break;
case "pdRefOn":
rawData.Options.pdRefOn = rootEntryNode.GetBasicValBool();
break;
case "pdRefCell":
rawData.Options.pdRefCell = rootEntryNode.GetBasicValInt();
break;
case "pdRefValue":
rawData.Options.pdRefValue = rootEntryNode.GetBasicValInt();
break;
case "tempEqnOn":
rawData.Options.tempEqnOn = rootEntryNode.GetBasicValBool();
break;
}
}
}
private void ParseOptions(ParseTreeNode node, FvSolutionData rawData)
{
foreach (ParseTreeNode rootEntryNode in node.FindDictEntries(null))
{
var identifier = rootEntryNode.GetEntryIdentifier();
switch (identifier)
{
case "nCorrectors":
rawData.Options.nCorrectors = rootEntryNode.GetBasicValInt();
break;
case "nNonOrthogonalCorrectors":
rawData.Options.nNonOrthogonalCorrectors = rootEntryNode.GetBasicValInt();
break;
case "pdRefOn":
rawData.Options.pdRefOn = rootEntryNode.GetBasicValBool();
break;
case "pdRefCell":
rawData.Options.pdRefCell = rootEntryNode.GetBasicValInt();
break;
case "pdRefValue":
rawData.Options.pdRefValue = rootEntryNode.GetBasicValInt();
break;
case "tempEqnOn":
rawData.Options.tempEqnOn = rootEntryNode.GetBasicValBool();
break;
}
}
}
private void ParsePatch(ParseTreeNode node, BoundaryPatch s)
{
foreach (ParseTreeNode rootEntryNode in node.FindDictEntries(null))
{
var identifier = rootEntryNode.GetEntryIdentifier();
switch (identifier)
{
case "type":
s.PatchType = rootEntryNode.GetBasicValEnum <PatchType>();
break;
case "rho":
s.Rho = rootEntryNode.GetBasicValString();
break;
case "gradient":
s.GradientFieldType = GetFieldType(rootEntryNode);
s.GradientValue = GetFieldValue(rootEntryNode.ChildNodes[2].ChildNodes[0]);
break;
case "value":
s.ValueFieldType = GetFieldType(rootEntryNode);
s.ValueValue = GetFieldValue(rootEntryNode.ChildNodes[2].ChildNodes[0]);
break;
}
}
}
private void ParseSolvers(ParseTreeNode node, FvSolutionData rawData)
{
foreach (ParseTreeNode rootEntryNode in node.FindDictEntries(null))
{
var s = new MLinearSolver();
s.Name = rootEntryNode.GetEntryIdentifier();
rawData.Solvers.Add(s);
ParseSolver(rootEntryNode.ChildNodes[2], s);
}
}
private void ParsePatches(ParseTreeNode node, FieldData rawData)
{
foreach (ParseTreeNode rootEntryNode in node.FindDictEntries(null))
{
var s = new BoundaryPatch();
s.Name = rootEntryNode.GetEntryIdentifier();
rawData.Patches.Add(s);
ParsePatch(rootEntryNode.ChildNodes[2], s);
}
}
private void ParseSolvers(ParseTreeNode node, FvSolutionData rawData)
{
foreach (ParseTreeNode rootEntryNode in node.FindDictEntries(null))
{
var s = new MLinearSolver();
s.Name = rootEntryNode.GetEntryIdentifier();
rawData.Solvers.Add(s);
ParseSolver(rootEntryNode.ChildNodes[2], s);
}
}
private void ParsePatches(ParseTreeNode node, FieldData rawData)
{
foreach (ParseTreeNode rootEntryNode in node.FindDictEntries(null))
{
var s = new BoundaryPatch();
s.Name = rootEntryNode.GetEntryIdentifier();
rawData.Patches.Add(s);
ParsePatch(rootEntryNode.ChildNodes[2], s);
}
}
private void ParseSolver(ParseTreeNode node, MLinearSolver s)
{
foreach (ParseTreeNode rootEntryNode in node.FindDictEntries(null))
{
var identifier = rootEntryNode.GetEntryIdentifier();
switch (identifier)
{
case "solver":
s.solver = rootEntryNode.GetBasicValEnum <LinearSolver>();
break;
case "smoother":
s.smoother = rootEntryNode.GetBasicValEnum <Smoother>();
break;
case "agglomerator":
s.agglomerator = rootEntryNode.GetBasicValEnum <Agglomerator>();
break;
case "tolerance":
s.tolerance = rootEntryNode.GetBasicValDecimal();
break;
case "relTol":
s.relTol = rootEntryNode.GetBasicValDecimal();
break;
case "nPreSweeps":
s.nPreSweeps = rootEntryNode.GetBasicValInt();
break;
case "nPostSweeps":
s.nPostSweeps = rootEntryNode.GetBasicValInt();
break;
case "nFinestSweeps":
s.nFinestSweeps = rootEntryNode.GetBasicValInt();
break;
case "cacheAgglomeration":
s.cacheAgglomeration = rootEntryNode.GetBasicValBool();
break;
case "nCellsInCoarsestLevel":
s.nCellsInCoarsestLevel = rootEntryNode.GetBasicValInt();
break;
case "mergeLevels":
s.mergeLevels = rootEntryNode.GetBasicValInt();
break;
}
}
}
private void ParseSolver(ParseTreeNode node, MLinearSolver s)
{
foreach (ParseTreeNode rootEntryNode in node.FindDictEntries(null))
{
var identifier = rootEntryNode.GetEntryIdentifier();
switch (identifier)
{
case "solver":
s.solver = rootEntryNode.GetBasicValEnum<LinearSolver>();
break;
case "smoother":
s.smoother = rootEntryNode.GetBasicValEnum<Smoother>();
break;
case "agglomerator":
s.agglomerator = rootEntryNode.GetBasicValEnum<Agglomerator>();
break;
case "tolerance":
s.tolerance = rootEntryNode.GetBasicValDecimal();
break;
case "relTol":
s.relTol = rootEntryNode.GetBasicValDecimal();
break;
case "nPreSweeps":
s.nPreSweeps = rootEntryNode.GetBasicValInt();
break;
case "nPostSweeps":
s.nPostSweeps = rootEntryNode.GetBasicValInt();
break;
case "nFinestSweeps":
s.nFinestSweeps = rootEntryNode.GetBasicValInt();
break;
case "cacheAgglomeration":
s.cacheAgglomeration = rootEntryNode.GetBasicValBool();
break;
case "nCellsInCoarsestLevel":
s.nCellsInCoarsestLevel = rootEntryNode.GetBasicValInt();
break;
case "mergeLevels":
s.mergeLevels = rootEntryNode.GetBasicValInt();
break;
}
}
}
private void ParsePatch(ParseTreeNode node, BoundaryPatch s)
{
foreach (ParseTreeNode rootEntryNode in node.FindDictEntries(null))
{
var identifier = rootEntryNode.GetEntryIdentifier();
switch (identifier)
{
case "type":
s.PatchType = rootEntryNode.GetBasicValEnum<PatchType>();
break;
case "rho":
s.Rho = rootEntryNode.GetBasicValString();
break;
case "gradient":
s.GradientFieldType = GetFieldType(rootEntryNode);
s.GradientValue = GetFieldValue(rootEntryNode.ChildNodes[2].ChildNodes[0]);
break;
case "value":
s.ValueFieldType = GetFieldType(rootEntryNode);
s.ValueValue = GetFieldValue(rootEntryNode.ChildNodes[2].ChildNodes[0]);
break;
}
}
}
