///////////////////////////////////////////////////////////////////////////////// // // Copyright (C) 2015- Statoil ASA // Copyright (C) 2015- Ceetron Solutions AS // // ResInsight is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // ResInsight is distributed in the hope that it will be useful, but WITHOUT ANY // WARRANTY; without even the implied warranty of MERCHANTABILITY or // FITNESS FOR A PARTICULAR PURPOSE. // // See the GNU General Public License at // for more details. // ///////////////////////////////////////////////////////////////////////////////// #include "RicWellLogPlotTrackFeatureImpl.h" #include "RimWellLogCurve.h" #include "RimWellLogPlot.h" #include "RimWellLogTrack.h" #include "cvfAssert.h" //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- void RicWellLogPlotTrackFeatureImpl::moveCurvesToWellLogPlotTrack(RimWellLogTrack* destTrack, const std::vector& curves, RimWellLogCurve* curveToInsertAfter) { CVF_ASSERT(destTrack ); std::set srcTracks; std::set srcPlots; for (size_t cIdx = 0; cIdx < curves.size(); cIdx++) { RimWellLogCurve* curve = curves[cIdx]; RimWellLogTrack* wellLogPlotTrack; curve->firstAncestorOrThisOfType(wellLogPlotTrack); if (wellLogPlotTrack) { wellLogPlotTrack->takeOutCurve(curve); wellLogPlotTrack->updateConnectedEditors(); srcTracks.insert(wellLogPlotTrack); RimWellLogPlot* plot; wellLogPlotTrack->firstAncestorOrThisOfType(plot); if (plot) srcPlots.insert(plot); } } size_t insertionStartIndex = 0; if (curveToInsertAfter) insertionStartIndex = destTrack->curveIndex(curveToInsertAfter) + 1; for (size_t cIdx = 0; cIdx < curves.size(); cIdx++) { destTrack->insertCurve(curves[cIdx], insertionStartIndex + cIdx); } for (std::set::iterator pIt = srcPlots.begin(); pIt != srcPlots.end(); ++pIt) { (*pIt)->calculateAvailableDepthRange(); } for (std::set::iterator tIt = srcTracks.begin(); tIt != srcTracks.end(); ++tIt) { (*tIt)->updateXZoomAndParentPlotDepthZoom(); } destTrack->loadDataAndUpdate(); destTrack->updateXZoomAndParentPlotDepthZoom(); destTrack->updateConnectedEditors(); } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- void RicWellLogPlotTrackFeatureImpl::moveTracksToWellLogPlot(RimWellLogPlot* dstWellLogPlot, const std::vector& tracksToMove, RimWellLogTrack* trackToInsertAfter) { CVF_ASSERT(dstWellLogPlot); std::set srcPlots; for (size_t tIdx = 0; tIdx < tracksToMove.size(); tIdx++) { RimWellLogTrack* track = tracksToMove[tIdx]; RimWellLogPlot* srcPlot; track->firstAncestorOrThisOfType(srcPlot); if (srcPlot) { srcPlot->removeTrack(track); srcPlots.insert(srcPlot); } } for (std::set::iterator pIt = srcPlots.begin(); pIt != srcPlots.end(); ++pIt) { (*pIt)->calculateAvailableDepthRange(); (*pIt)->updateTrackNames(); (*pIt)->updateDepthZoom(); (*pIt)->updateConnectedEditors(); } size_t insertionStartIndex = 0; if (trackToInsertAfter) insertionStartIndex = dstWellLogPlot->trackIndex(trackToInsertAfter) + 1; for (size_t tIdx = 0; tIdx < tracksToMove.size(); tIdx++) { dstWellLogPlot->insertTrack(tracksToMove[tIdx], insertionStartIndex + tIdx); } dstWellLogPlot->updateTrackNames(); dstWellLogPlot->updateTracks(); dstWellLogPlot->updateConnectedEditors(); }