KisWatershedWorker.cpp File Reference

#include "KisWatershedWorker.h"
#include <KoColorSpaceRegistry.h>
#include <KoColorSpace.h>
#include <KoColor.h>
#include <KoAlwaysInline.h>
#include <KoUpdater.h>
#include "kis_lazy_fill_tools.h"
#include "kis_paint_device_debug_utils.h"
#include "kis_paint_device.h"
#include "kis_painter.h"
#include "kis_sequential_iterator.h"
#include "kis_scanline_fill.h"
#include "kis_random_accessor_ng.h"
#include <boost/heap/fibonacci_heap.hpp>
#include <set>
#include <QElapsedTimer>
#include <boost/accumulators/accumulators.hpp>
#include <boost/accumulators/statistics/stats.hpp>
#include <boost/accumulators/statistics/mean.hpp>
#include <boost/accumulators/statistics/min.hpp>

Go to the source code of this file.

Classes
struct	KisWatershedWorker::Private

Functions
ALWAYS_INLINE void	addForeignAlly (qint32 currGroupId, qint32 prevGroupId, FillGroup &currGroup, FillGroup &prevGroup, FillGroup::LevelData &currLevelData, FillGroup::LevelData &prevLevelData, const QPoint &currPt, const QPoint &prevPt, bool sameLevel)
ALWAYS_INLINE void	decrementLevelEdge (FillGroup::LevelData &currLevelData, FillGroup::LevelData &prevLevelData, quint8 currLevel, quint8 prevLevel)
ALWAYS_INLINE void	incrementLevelEdge (FillGroup::LevelData &currLevelData, FillGroup::LevelData &prevLevelData, quint8 currLevel, quint8 prevLevel)
ALWAYS_INLINE void	removeForeignAlly (qint32 currGroupId, qint32 prevGroupId, FillGroup &currGroup, FillGroup &prevGroup, FillGroup::LevelData &currLevelData, FillGroup::LevelData &prevLevelData, const QPoint &currPt, const QPoint &prevPt, bool sameLevel)

Function Documentation

addForeignAlly()

ALWAYS_INLINE void addForeignAlly	(	qint32	currGroupId,
		qint32	prevGroupId,
		FillGroup &	currGroup,
		FillGroup &	prevGroup,
		FillGroup::LevelData &	currLevelData,
		FillGroup::LevelData &	prevLevelData,
		const QPoint &	currPt,
		const QPoint &	prevPt,
		bool	sameLevel )

Definition at line 400 of file KisWatershedWorker.cpp.

{
    if (currGroup.colorIndex != prevGroup.colorIndex || !sameLevel) {
        prevLevelData.foreignEdgeSize++;
        currLevelData.foreignEdgeSize++;
 
        if (sameLevel) {
            currLevelData.conflictWithGroup[prevGroupId].insert(currPt);
            prevLevelData.conflictWithGroup[currGroupId].insert(prevPt);
        }
 
    } else {
        prevLevelData.allyEdgeSize++;
        currLevelData.allyEdgeSize++;
    }
 
 
}

decrementLevelEdge()

ALWAYS_INLINE void decrementLevelEdge	(	FillGroup::LevelData &	currLevelData,
		FillGroup::LevelData &	prevLevelData,
		quint8	currLevel,
		quint8	prevLevel )

Definition at line 471 of file KisWatershedWorker.cpp.

{
    Q_ASSERT(currLevel != prevLevel);
 
    if (currLevel > prevLevel) {
        currLevelData.negativeEdgeSize--;
        prevLevelData.positiveEdgeSize--;
    } else {
        currLevelData.positiveEdgeSize--;
        prevLevelData.negativeEdgeSize--;
    }
}

incrementLevelEdge()

ALWAYS_INLINE void incrementLevelEdge	(	FillGroup::LevelData &	currLevelData,
		FillGroup::LevelData &	prevLevelData,
		quint8	currLevel,
		quint8	prevLevel )

Definition at line 455 of file KisWatershedWorker.cpp.

{
    Q_ASSERT(currLevel != prevLevel);
 
    if (currLevel > prevLevel) {
        currLevelData.negativeEdgeSize++;
        prevLevelData.positiveEdgeSize++;
    } else {
        currLevelData.positiveEdgeSize++;
        prevLevelData.negativeEdgeSize++;
    }
}

removeForeignAlly()

ALWAYS_INLINE void removeForeignAlly	(	qint32	currGroupId,
		qint32	prevGroupId,
		FillGroup &	currGroup,
		FillGroup &	prevGroup,
		FillGroup::LevelData &	currLevelData,
		FillGroup::LevelData &	prevLevelData,
		const QPoint &	currPt,
		const QPoint &	prevPt,
		bool	sameLevel )

Definition at line 426 of file KisWatershedWorker.cpp.

{
    if (currGroup.colorIndex != prevGroup.colorIndex || !sameLevel) {
        prevLevelData.foreignEdgeSize--;
        currLevelData.foreignEdgeSize--;
 
        if (sameLevel) {
            std::multiset<QPoint, CompareQPoints> &currSet = currLevelData.conflictWithGroup[prevGroupId];
            currSet.erase(currSet.find(currPt));
 
            std::multiset<QPoint, CompareQPoints> &prevSet = prevLevelData.conflictWithGroup[currGroupId];
            prevSet.erase(prevSet.find(prevPt));
        }
 
    } else {
        prevLevelData.allyEdgeSize--;
        currLevelData.allyEdgeSize--;
    }
 
 
}