From 2d97cf97b0a50451791a0f48a47f9962fdb1dce6 Mon Sep 17 00:00:00 2001
From: fencl <fenclmat@fjfi.cvut.cz>
Date: Wed, 4 Jul 2018 09:35:29 +0200
Subject: [PATCH] Forgot to comment wildfire computation
---
.../tnlDirectEikonalMethodsBase_impl.h | 4 ++--
.../hamilton-jacobi/tnlFastSweepingMethod2D_impl.h | 12 ++++++------
2 files changed, 8 insertions(+), 8 deletions(-)
diff --git a/src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlDirectEikonalMethodsBase_impl.h b/src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlDirectEikonalMethodsBase_impl.h
index c742a11b50..cd4eb9e24b 100644
--- a/src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlDirectEikonalMethodsBase_impl.h
+++ b/src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlDirectEikonalMethodsBase_impl.h
@@ -155,7 +155,7 @@ initInterface( const MeshFunctionPointer& _input,
{
MeshFunctionType input = _input.getData();
- double A[320][320];
+ /*double A[320][320];
std::ifstream fileInit("/home/maty/Downloads/initData.txt");
for (int i = 0; i < 320; i++)
@@ -164,7 +164,7 @@ initInterface( const MeshFunctionPointer& _input,
fileInit.close();
for (int i = 0; i < 320; i++)
for (int j = 0; j < 320; j++)
- input[i*320 + j] = A[i][j];
+ input[i*320 + j] = A[i][j];*/
MeshFunctionType& output = _output.modifyData();
diff --git a/src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlFastSweepingMethod2D_impl.h b/src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlFastSweepingMethod2D_impl.h
index e5a9c39f30..83333b190d 100644
--- a/src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlFastSweepingMethod2D_impl.h
+++ b/src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlFastSweepingMethod2D_impl.h
@@ -64,7 +64,7 @@ solve( const MeshPointer& mesh,
const AnisotropyPointer& anisotropy,
MeshFunctionPointer& u )
{
- MeshFunctionType v;
+ /*MeshFunctionType v;
v.setMesh(mesh);
double A[320][320];
for (int i = 0; i < 320; i++)
@@ -80,7 +80,7 @@ solve( const MeshPointer& mesh,
for (int i = 0; i < 320; i++)
for (int j = 0; j < 320; j++)
v[i*320 + j] = A[i][j];
- v.save("mapa.tnl");
+ v.save("mapa.tnl");*/
MeshFunctionPointer auxPtr;
@@ -111,7 +111,7 @@ solve( const MeshPointer& mesh,
{
cell.refresh();
if( ! interfaceMap( cell ) )
- this->updateCell( aux, cell, v( cell ) );
+ this->updateCell( aux, cell );
}
}
@@ -128,7 +128,7 @@ solve( const MeshPointer& mesh,
//std::cerr << "2 -> ";
cell.refresh();
if( ! interfaceMap( cell ) )
- this->updateCell( aux, cell, v( cell ) );
+ this->updateCell( aux, cell );
}
}
@@ -145,7 +145,7 @@ solve( const MeshPointer& mesh,
//std::cerr << "3 -> ";
cell.refresh();
if( ! interfaceMap( cell ) )
- this->updateCell( aux, cell, v( cell ) );
+ this->updateCell( aux, cell );
}
}
@@ -162,7 +162,7 @@ solve( const MeshPointer& mesh,
//std::cerr << "4 -> ";
cell.refresh();
if( ! interfaceMap( cell ) )
- this->updateCell( aux, cell, v( cell ) );
+ this->updateCell( aux, cell );
}
}
--
GitLab