Changeset f8dae2
- Timestamp:
- Oct 20, 2016, 8:52:32 PM (8 years ago)
- Branches:
- Fix_IndependentFragmentGrids
- Parents:
- 8d6a44
- git-author:
- Frederik Heber <heber@…> (09/27/16 08:21:28)
- git-committer:
- Frederik Heber <heber@…> (10/20/16 20:52:32)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/Fragmentation/Exporters/ExportGraph_ToJobs.cpp
r8d6a44 rf8dae2 99 99 /// determine center of fragment 100 100 const Vector center = .5*(_minmax.first + _minmax.second); 101 LOG( 4, "DEBUG: center of fragment is at " << center);101 LOG(2, "DEBUG: center of fragment is at " << center); 102 102 103 103 /// associate center to its containing grid cell (defined by boundary points) … … 111 111 fabs(lower_center[i] - higher_center[i]) < std::numeric_limits<double>::epsilon()*1e4; 112 112 } 113 LOG( 5, "DEBUG: lower_center is " << lower_center << ", higher_center is " << higher_center);113 LOG(2, "DEBUG: lower_center is " << lower_center << ", higher_center is " << higher_center); 114 114 115 115 // fashion min max into cubic box extents of at least extent plus empty … … 117 117 const Vector extent = _minmax.second - _minmax.first; 118 118 double greatest_extent = extent[extent.GreatestComponent()]; 119 LOG(2, "DEBUG: extent of fragment is " << extent << " with greatest extent " << greatest_extent); 119 120 if (greatest_extent > _minimum_empty_boundary) 120 121 greatest_extent *= 3.; … … 128 129 const double greatest_total = total[total.GreatestComponent()]; 129 130 greatest_extent = std::min(greatest_extent, greatest_total); 130 LOG( 5, "DEBUG: extent of fragment is " << extent << ", greatest_extent is" << greatest_extent);131 LOG(2, "DEBUG: Using boundary of " << greatest_extent); 131 132 132 133 /// increase levels around this center to find the matching window … … 136 137 _domain.getDeltaPerAxis(2) 137 138 }; 138 LOG( 6, "DEBUG: delta is " << Vector(delta));139 LOG(2, "DEBUG: delta is " << Vector(delta)); 139 140 const double greatest_delta = std::max(delta[0], std::max(delta[1], delta[2])); 140 141 … … 147 148 int end_steps[NDIM] = { 0, 0, 0 }; 148 149 for (size_t i=0;i<NDIM;++i) { 149 begin_index[i] = round(lower_center[i]/delta[i]) - (half_fragment_gridpoints-1); 150 end_index[i] = round(higher_center[i]/delta[i]) + (half_fragment_gridpoints+(unsigned int)(equal_components[i])); 150 const unsigned int lower_index = round(lower_center[i]/delta[i]); 151 const unsigned int higher_index = round(higher_center[i]/delta[i]); 152 LOG(3, "DEBUG: center is within indices [" << lower_index << ", " << higher_index << "]"); 153 begin_index[i] = lower_index - (half_fragment_gridpoints-1); 154 end_index[i] = higher_index + (half_fragment_gridpoints+(unsigned int)(equal_components[i])); 155 LOG(3, "DEBUG: Intermediate begin end indices for axis #" << i << " are [" 156 << begin_index[i] << ", " << end_index[i] << "]"); 151 157 if (begin_index[i] < 0) 152 158 begin_steps[i] = -begin_index[i]; … … 160 166 end_steps[i] = 0; 161 167 } 168 LOG(3, "DEBUG: Resulting final indices [" << begin_index[i] << ", " 169 << end_index[i] << "] and step indices for axis #" << i << " are [" 170 << begin_steps[i] << ", " << end_steps[i] << "]"); 162 171 } 163 172 for (size_t i=0;i<NDIM;++i) { … … 165 174 fragment_window.end[i] = (end_index[i]-end_steps[i]+begin_steps[i]) * delta[i]; 166 175 } 167 LOG( 6, "DEBUG: fragment begin is " << Vector(fragment_window.begin)176 LOG(2, "DEBUG: fragment begin is " << Vector(fragment_window.begin) 168 177 << ", fragment end is " << Vector(fragment_window.end)); 169 178 … … 191 200 } 192 201 #endif 193 if (DoLog( 6))202 if (DoLog(3)) 194 203 for (size_t i=0;i<NDIM;++i) 195 LOG( 6, "DEBUG: We have " << (fragment_window.end[i] - fragment_window.begin[i])/delta[i]204 LOG(3, "DEBUG: We have " << (fragment_window.end[i] - fragment_window.begin[i])/delta[i] 196 205 << " gridpoints on axis " << i); 197 206
Note:
See TracChangeset
for help on using the changeset viewer.