Loading src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlDirectEikonalMethodsBase_impl.h +6 −6 Original line number Diff line number Diff line Loading @@ -96,10 +96,10 @@ template< typename Real, template< int sizeSArray > void tnlDirectEikonalMethodsBase< Meshes::Grid< 2, Real, Device, Index > >:: updateBlocks( const InterfaceMapType& interfaceMap, MeshFunctionType& aux, MeshFunctionType& helpFunc, ArrayContainer& BlockIterHost, int numThreadsPerBlock/*, Real **sArray*/ ) updateBlocks( InterfaceMapType interfaceMap, MeshFunctionType aux, MeshFunctionType helpFunc, ArrayContainer BlockIterHost, IndexType numThreadsPerBlock/*, Real **sArray*/ ) { #pragma omp parallel for schedule( dynamic ) for( IndexType i = 0; i < BlockIterHost.getSize(); i++ ) Loading Loading @@ -267,13 +267,13 @@ updateBlocks( const InterfaceMapType& interfaceMap, template< typename Real, typename Device, typename Index > template< int sizeSArray > template< IndexType sizeSArray > void tnlDirectEikonalMethodsBase< Meshes::Grid< 3, Real, Device, Index > >:: updateBlocks( const InterfaceMapType& interfaceMap, const MeshFunctionType& aux, MeshFunctionType& helpFunc, ArrayContainer& BlockIterHost, int numThreadsPerBlock/*, Real **sArray*/ ) ArrayContainer BlockIterHost, IndexType numThreadsPerBlock/*, Real **sArray*/ ) { //#pragma omp parallel for schedule( dynamic ) for( IndexType i = 0; i < BlockIterHost.getSize(); i++ ) Loading src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlFastSweepingMethod2D_impl.h +4 −4 Original line number Diff line number Diff line Loading @@ -97,11 +97,11 @@ solve( const MeshPointer& mesh, if( i == 0 ) { printf( "0: mesh x: %d\n", mesh->getDimensions().x() ); printf( "0: mesh y: %d\n", mesh->getDimensions().y() ); //aux.save("aux_proc0.tnl"); /*for( int k = 0; k < mesh->getDimensions().x()*mesh->getDimensions().y(); k++ ) aux.save("aux_proc0.tnl"); for( int k = 0; k < 16*16; k++ ) aux[ k ] = 10; for( int k = 0; k < mesh->getDimensions().x(); k++ ){ for( int l = 0; l < mesh->getDimensions().y(); l++ ) for( int k = 0; k < 16; k++ ){ for( int l = 0; l < 16; l++ ) printf("%f.2\t",aux[ k * 16 + l ] ); printf("\n"); }*/ Loading Loading
src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlDirectEikonalMethodsBase_impl.h +6 −6 Original line number Diff line number Diff line Loading @@ -96,10 +96,10 @@ template< typename Real, template< int sizeSArray > void tnlDirectEikonalMethodsBase< Meshes::Grid< 2, Real, Device, Index > >:: updateBlocks( const InterfaceMapType& interfaceMap, MeshFunctionType& aux, MeshFunctionType& helpFunc, ArrayContainer& BlockIterHost, int numThreadsPerBlock/*, Real **sArray*/ ) updateBlocks( InterfaceMapType interfaceMap, MeshFunctionType aux, MeshFunctionType helpFunc, ArrayContainer BlockIterHost, IndexType numThreadsPerBlock/*, Real **sArray*/ ) { #pragma omp parallel for schedule( dynamic ) for( IndexType i = 0; i < BlockIterHost.getSize(); i++ ) Loading Loading @@ -267,13 +267,13 @@ updateBlocks( const InterfaceMapType& interfaceMap, template< typename Real, typename Device, typename Index > template< int sizeSArray > template< IndexType sizeSArray > void tnlDirectEikonalMethodsBase< Meshes::Grid< 3, Real, Device, Index > >:: updateBlocks( const InterfaceMapType& interfaceMap, const MeshFunctionType& aux, MeshFunctionType& helpFunc, ArrayContainer& BlockIterHost, int numThreadsPerBlock/*, Real **sArray*/ ) ArrayContainer BlockIterHost, IndexType numThreadsPerBlock/*, Real **sArray*/ ) { //#pragma omp parallel for schedule( dynamic ) for( IndexType i = 0; i < BlockIterHost.getSize(); i++ ) Loading
src/TNL/Experimental/Hamilton-Jacobi/Solvers/hamilton-jacobi/tnlFastSweepingMethod2D_impl.h +4 −4 Original line number Diff line number Diff line Loading @@ -97,11 +97,11 @@ solve( const MeshPointer& mesh, if( i == 0 ) { printf( "0: mesh x: %d\n", mesh->getDimensions().x() ); printf( "0: mesh y: %d\n", mesh->getDimensions().y() ); //aux.save("aux_proc0.tnl"); /*for( int k = 0; k < mesh->getDimensions().x()*mesh->getDimensions().y(); k++ ) aux.save("aux_proc0.tnl"); for( int k = 0; k < 16*16; k++ ) aux[ k ] = 10; for( int k = 0; k < mesh->getDimensions().x(); k++ ){ for( int l = 0; l < mesh->getDimensions().y(); l++ ) for( int k = 0; k < 16; k++ ){ for( int l = 0; l < 16; l++ ) printf("%f.2\t",aux[ k * 16 + l ] ); printf("\n"); }*/ Loading