|
@@ -241,19 +241,23 @@ namespace Lemma {
|
241
|
241
|
//for (ilay=0; ilay<Interfaces.size()-1; ++ilay) {
|
242
|
242
|
std::cout.precision(3);
|
243
|
243
|
for (ilay=0; ilay<Interfaces.size()-1; ++ilay) {
|
244
|
|
- std::cout << "\n\nLayer " << ilay << "\tfrom " << Interfaces(ilay) <<" to "
|
245
|
|
- << Interfaces(ilay+1); // << std::endl;
|
|
244
|
+ //std::cout << "\n\nLayer " << ilay << "\tfrom " << Interfaces(ilay) <<" to "
|
|
245
|
+ // << Interfaces(ilay+1) << std::endl;
|
246
|
246
|
Size(2) = Interfaces(ilay+1) - Interfaces(ilay);
|
247
|
247
|
Origin(2) = Interfaces(ilay);
|
248
|
248
|
|
249
|
|
- #ifdef HAVE_BOOST_PROGRESS
|
|
249
|
+ //#ifdef HAVE_BOOST_PROGRESS
|
250
|
250
|
percent_done = 0;
|
251
|
|
- disp = new boost::progress_display( 100 );
|
|
251
|
+ disp = new ProgressBar( 100 );
|
|
252
|
+ disp->printNewMessage( "Integrating layer " + std::to_string(ilay) + " from " + std::to_string(Interfaces(ilay)) +
|
|
253
|
+ " to " + std::to_string( Interfaces(ilay+1)) );
|
252
|
254
|
IntegrateOnOctreeGrid( vtkOutput );
|
|
255
|
+ //disp->updateLastPrintedMessage("Number of leaves: " + std::to_string(nleaves));
|
|
256
|
+ disp->printNewMessage("Number of leaves: " + std::to_string(nleaves));
|
253
|
257
|
delete disp;
|
254
|
|
- #else
|
255
|
|
- IntegrateOnOctreeGrid( vtkOutput );
|
256
|
|
- #endif
|
|
258
|
+ //#else
|
|
259
|
+ //IntegrateOnOctreeGrid( vtkOutput );
|
|
260
|
+ //#endif
|
257
|
261
|
//std::cout << "Kernel row " << Kern.row(ilay);
|
258
|
262
|
}
|
259
|
263
|
std::cout << "\nFinished KERNEL\n";
|
|
@@ -555,15 +559,13 @@ namespace Lemma {
|
555
|
559
|
void KernelV0::EvaluateKids( const Vector3r& size, const int& level, const Vector3r& cpos,
|
556
|
560
|
const VectorXcr& parentVal ) {
|
557
|
561
|
|
558
|
|
- #ifdef HAVE_BOOST_PROGRESS
|
559
|
562
|
int pdone = (int)(1e2*VOLSUM/(Size[0]*Size[1]*Size[2]));
|
560
|
563
|
if (pdone > percent_done ) {
|
561
|
564
|
percent_done = pdone;
|
562
|
565
|
++(*disp);
|
563
|
566
|
}
|
564
|
|
- #else
|
565
|
|
- std::cout << "\r" << (int)(1e2*VOLSUM/(Size[0]*Size[1]*Size[2])) << "\t" << nleaves;
|
566
|
|
- #endif
|
|
567
|
+ //disp->updateLastPrintedMessage("Number of leaves: " + std::to_string(nleaves));
|
|
568
|
+ //std::cout << "\r" << (int)(1e2*VOLSUM/(Size[0]*Size[1]*Size[2])) << "\t" << nleaves;
|
567
|
569
|
//std::cout.flush();
|
568
|
570
|
|
569
|
571
|
// Next level step, interested in one level below
|
|
@@ -644,15 +646,12 @@ namespace Lemma {
|
644
|
646
|
void KernelV0::EvaluateKids2( const Vector3r& size, const int& level, const Vector3r& cpos,
|
645
|
647
|
const VectorXcr& parentVal, vtkHyperTreeGrid* oct, vtkHyperTreeCursor* curse) {
|
646
|
648
|
|
647
|
|
- #ifdef HAVE_BOOST_PROGRESS
|
648
|
649
|
int pdone = (int)(1e2*VOLSUM/(Size[0]*Size[1]*Size[2]));
|
649
|
650
|
if (pdone > percent_done ) {
|
650
|
651
|
percent_done = pdone;
|
651
|
652
|
++(*disp);
|
652
|
653
|
}
|
653
|
|
- #else
|
654
|
|
- std::cout << "\r" << (int)(1e2*VOLSUM/(Size[0]*Size[1]*Size[2])) << "\t" << nleaves;
|
655
|
|
- #endif
|
|
654
|
+ //disp->updateLastPrintedMessage("Number of leaves: " + std::to_string(nleaves));
|
656
|
655
|
|
657
|
656
|
// Next level step, interested in one level below
|
658
|
657
|
// bitshift requires one extra, faster than, and equivalent to std::pow(2, level+1)
|