Adds immediate migration results

qt6-after/qt6-migrated-legatus/Lts/Common/LtsTimeline/track.cpp

@@ -2,6 +2,7 @@
 
 
 #include "track.h"
+#include <utility>
 
 namespace LtsTimeline
 {
@@ -19,7 +20,7 @@ const Track &Track::track(int id) const noexcept(false)
     return **it;
 
   
-  for (const TrackPtr &track : qAsConst(m_childrenTracks))
+  for (const TrackPtr &track : std::as_const(m_childrenTracks))
   {
     try
     {
@@ -48,7 +49,7 @@ bool Track::hasTrack(int id, bool recursive) const
   if (!recursive)
     return false;
 
-  for (const TrackPtr &trackPtr : qAsConst(m_childrenTracks))
+  for (const TrackPtr &trackPtr : std::as_const(m_childrenTracks))
   {
     if (trackPtr->hasTrack(id, true))
       return true;
@@ -95,7 +96,7 @@ void Track::addCopyItemId(int id)
 
 const Track &Track::parentOf(int id) const noexcept(false)
 {
-  for (const TrackPtr &trackPtr : qAsConst(m_childrenTracks))
+  for (const TrackPtr &trackPtr : std::as_const(m_childrenTracks))
   {
     if (trackPtr->hasTrack(id)) 
       return *trackPtr;
@@ -170,7 +171,7 @@ const QVector<int> Track::copyItemIdsBetween(qint64 start, qint64 end, bool stri
 
   if (recursive)
   {
-    for (const TrackPtr &trackPtr : qAsConst(m_childrenTracks))
+    for (const TrackPtr &trackPtr : std::as_const(m_childrenTracks))
     {
       auto itemPtrRefs2 = trackPtr->_copyItems();
       itemPtrRefs.insert(itemPtrRefs.end(), itemPtrRefs2.begin(), itemPtrRefs2.end());
@@ -215,7 +216,7 @@ const QVector<int> Track::itemIdsBetween(qint64 start, qint64 end, bool strict,
   QVector<int> itemIds;
   itemIds.reserve(m_items.size());
 
-  for (const ItemPtr &itemPtr : qAsConst(m_items))
+  for (const ItemPtr &itemPtr : std::as_const(m_items))
   {
     const Item &item = *itemPtr;
     if (isItemBetween(item, start, end, strict, complete, minimumDuration))
@@ -228,7 +229,7 @@ const QVector<int> Track::itemIdsBetween(qint64 start, qint64 end, bool strict,
     return itemIds;
   }
 
-  for (const TrackPtr &trackPtr : qAsConst(m_childrenTracks))
+  for (const TrackPtr &trackPtr : std::as_const(m_childrenTracks))
     itemIds += trackPtr->itemIdsBetween(start, end, strict, complete, true, minimumDuration);
 
   return itemIds;
@@ -237,7 +238,7 @@ const QVector<int> Track::itemIdsBetween(qint64 start, qint64 end, bool strict,
 
 bool Track::isItemsBetween(qint64 start, qint64 end, const QVector<int> &ignoreIds, bool strict, bool complete, bool recursive, qint64 minimumDuration) const
 {
-  for (const ItemPtr &itemPtr : qAsConst(m_items))
+  for (const ItemPtr &itemPtr : std::as_const(m_items))
   {
     const Item &i = *itemPtr;
     if (!ignoreIds.contains(i.id()))
@@ -246,7 +247,7 @@ bool Track::isItemsBetween(qint64 start, qint64 end, const QVector<int> &ignoreI
   }
 
   
-  for (const int itemId : qAsConst(m_copyItemIds))
+  for (const int itemId : std::as_const(m_copyItemIds))
   {
     const Item &i = item(itemId);
     if (!ignoreIds.contains(i.id()))
@@ -258,7 +259,7 @@ bool Track::isItemsBetween(qint64 start, qint64 end, const QVector<int> &ignoreI
   if (!recursive)
     return false;
 
-  for (const TrackPtr &trackPtr : qAsConst(m_childrenTracks))
+  for (const TrackPtr &trackPtr : std::as_const(m_childrenTracks))
     if (trackPtr->isItemsBetween(start, end, ignoreIds, strict, complete, true, minimumDuration))
       return true;
 
@@ -281,7 +282,7 @@ ItemPtrRefs Track::_items(bool recursive) const
     x.reserve(x.size() + m_copyItemIds.count());
 
   
-  for (const int itemId : qAsConst(m_copyItemIds))
+  for (const int itemId : std::as_const(m_copyItemIds))
   {
     try
     {
@@ -297,7 +298,7 @@ ItemPtrRefs Track::_items(bool recursive) const
     return x;
 
   
-  for (const TrackPtr &t : qAsConst(m_childrenTracks))
+  for (const TrackPtr &t : std::as_const(m_childrenTracks))
   {
     const ItemPtrRefs x2(t->_items(true));
     x.insert(x.end(), x2.begin(), x2.end());
@@ -315,7 +316,7 @@ ItemPtrRefs Track::_copyItems() const
   
   ItemPtrRefs x;
 
-  for (int id : qAsConst(m_copyItemIds))
+  for (int id : std::as_const(m_copyItemIds))
   {
     try
     {
@@ -361,7 +362,7 @@ const QVector<int> Track::_itemIds(bool recursive) const
     return itemIds;
 
   
-  for (const TrackPtr &trackPtr : qAsConst(m_childrenTracks))
+  for (const TrackPtr &trackPtr : std::as_const(m_childrenTracks))
     itemIds += trackPtr->_itemIds(true);
 
   return itemIds;
@@ -381,7 +382,7 @@ ItemPtrRef Track::_item(int id) const noexcept(false)
     return *it;
 
   
-  for (const TrackPtr &track : qAsConst(m_childrenTracks))
+  for (const TrackPtr &track : std::as_const(m_childrenTracks))
   {
     try
     {
@@ -405,7 +406,7 @@ void Track::printTrackIds(bool withItems, int level) const
   if (withItems)
   {
     fprintf(stderr, " ( ");
-    for (const ItemPtr &itemPtr : qAsConst(m_items))
+    for (const ItemPtr &itemPtr : std::as_const(m_items))
     {
       fprintf(stderr, "%d ", itemPtr->id());
     }
@@ -415,7 +416,7 @@ void Track::printTrackIds(bool withItems, int level) const
   fprintf(stderr, "\n");
 
 
-  for (const TrackPtr &trackPtr : qAsConst(m_childrenTracks))
+  for (const TrackPtr &trackPtr : std::as_const(m_childrenTracks))
     trackPtr->printTrackIds(level + 1);
 }
 
@@ -446,7 +447,7 @@ QVector<int> Track::itemIds(bool recursive, bool sorted) const
     return itemIds;
 
   
-  for (const TrackPtr &trackPtr : qAsConst(m_childrenTracks))
+  for (const TrackPtr &trackPtr : std::as_const(m_childrenTracks))
     itemIds += trackPtr->_itemIds(true);
 
   return itemIds;
@@ -640,7 +641,7 @@ const Item &Track::item(int id) const noexcept(false)
     return **it;
 
   
-  for (const TrackPtr &track : qAsConst(m_childrenTracks))
+  for (const TrackPtr &track : std::as_const(m_childrenTracks))
   {
     try
     {
@@ -762,7 +763,7 @@ Item &Track::next(int id) noexcept(false)
 int Track::rowOfTrack(int id) const noexcept(false)
 {
   int row = 0;
-  for (const TrackPtr &trackPtr : qAsConst(m_childrenTracks))
+  for (const TrackPtr &trackPtr : std::as_const(m_childrenTracks))
   {
     if (trackPtr->id() == id)
       return row;