File indexing completed on 2024-05-12 15:58:28

 /*
  *  SPDX-FileCopyrightText: 2009 Dmitry Kazakov <dimula73@gmail.com>
  *
  *  SPDX-License-Identifier: GPL-2.0-or-later
  */
 
 #ifndef __KIS_MERGE_WALKER_H
 #define __KIS_MERGE_WALKER_H
 
 #include "kis_types.h"
 #include "kis_base_rects_walker.h"
 
 class KisMergeWalker;
 typedef KisSharedPtr<KisMergeWalker> KisMergeWalkerSP;
 
 class KRITAIMAGE_EXPORT KisMergeWalker : public virtual KisBaseRectsWalker
 {
 
 public:
     /**
      * NO_FILTHY flag notifies the walker that there should be no (!)
      * filthy node in the update. It means that the projection() of
      * the node is already guaranteed to be ready, we just need to
      * update all the higher-level nodes. Used by KisTransformMask
      * regeneration code.
      */
     enum Flags {
         DEFAULT = 0,
         NO_FILTHY
     };
 
     KisMergeWalker(QRect cropRect, Flags flags = DEFAULT);
 
     ~KisMergeWalker() override;
 
     UpdateType type() const override;
 
 protected:
     KisMergeWalker() : m_flags(DEFAULT) {}
     KisMergeWalker(Flags flags) : m_flags(flags) {}
 
     /**
      * Begins visiting nodes starting with @p startWith.
      * First it climbs to the top of the graph, collecting
      * changeRects (it calls @ref registerChangeRect for every node).
      * Then it goes down to the bottom collecting needRects
      * for every branch.
      */
     void startTrip(KisProjectionLeafSP startWith) override;
 
     using KisBaseRectsWalker::startTrip;
 
     void startTripWithMask(KisProjectionLeafSP filthyMask, KisMergeWalker::Flags flags);
 
 private:
     void startTripImpl(KisProjectionLeafSP startLeaf, Flags flags);
 
 private:
     /**
      * Visits a node @leaf and goes on crowling
      * towards the top of the graph, calling visitHigherNode() or
      * startTrip() one more time. After the top is reached
      * returns back to the @leaf.
      */
     void visitHigherNode(KisProjectionLeafSP leaf, NodePosition positionToFilthy);
 
     /**
      * Visits a node @leaf and goes on crowling
      * towards the bottom of the graph, calling visitLowerNode() or
      * startTrip() one more time.
      */
     void visitLowerNode(KisProjectionLeafSP leaf);
 
 private:
     const Flags m_flags;
 };
 
 
 #endif /* __KIS_MERGE_WALKER_H */