#include <kis_lazy_fill_graph.h>

Classes
struct	EdgeIndexBin

struct	traversal_category

struct	VertexDescriptor

Public Types
typedef transform_iterator< adjacent_vertex_function, degree_iterator >	adjacency_iterator

typedef kis_detail::lazy_fill_graph_adjacent_vertex_at< type >	adjacent_vertex_function

typedef counting_iterator< degree_size_type >	degree_iterator

typedef EdgeIndex	degree_size_type

typedef directed_tag	directed_category

typedef std::pair< vertex_descriptor, vertex_descriptor >	edge_descriptor

typedef kis_detail::lazy_fill_graph_edge_at< type >	edge_function

typedef counting_iterator< edges_size_type >	edge_index_iterator

typedef transform_iterator< edge_function, edge_index_iterator >	edge_iterator

typedef disallow_parallel_edge_tag	edge_parallel_category

typedef long	EdgeIndex

enum	EdgeIndexBinId { HORIZONTAL , HORIZONTAL_REVERSED , VERTICAL , VERTICAL_REVERSED , LABEL_A , LABEL_A_REVERSED , LABEL_B , LABEL_B_REVERSED }

typedef EdgeIndex	edges_size_type

typedef kis_detail::lazy_fill_graph_out_edge_at< type >	out_edge_function

typedef transform_iterator< out_edge_function, degree_iterator >	out_edge_iterator

typedef KisLazyFillGraph	type

typedef VertexDescriptor	vertex_descriptor

typedef kis_detail::lazy_fill_graph_vertex_at< KisLazyFillGraph >	vertex_function

typedef counting_iterator< vertices_size_type >	vertex_index_iterator

typedef transform_iterator< vertex_function, vertex_index_iterator >	vertex_iterator

typedef long	VertexIndex

typedef VertexIndex	vertices_size_type

Public Member Functions
edge_descriptor	edge_at (edges_size_type edge_index) const

edges_size_type	index_of (edge_descriptor edge) const

vertices_size_type	index_of (vertex_descriptor vertex) const

	KisLazyFillGraph ()

	KisLazyFillGraph (const QRect &mainRect, const KisRegion &aLabelRegion, const KisRegion &bLabelRegion)

edges_size_type	num_edges () const

vertices_size_type	num_vertices () const

degree_size_type	out_degree (vertex_descriptor vertex) const

edge_descriptor	out_edge_at (vertex_descriptor vertex, degree_size_type out_edge_index) const

QRect	rect () const

QSize	size () const

vertex_descriptor	vertex_at (vertices_size_type vertex_index) const

	~KisLazyFillGraph ()

Static Public Member Functions
static vertex_descriptor	null_vertex ()

Public Attributes
QRect	m_aLabelArea

QVector< QRect >	m_aLabelRects

vertices_size_type	m_aReversedEdgesStart

QRect	m_bLabelArea

QVector< QRect >	m_bLabelRects

vertices_size_type	m_bReversedEdgesStart

QVector< EdgeIndexBin >	m_edgeBins

vertices_size_type	m_height

QRect	m_mainArea

vertices_size_type	m_numAEdges

vertices_size_type	m_numBEdges

vertices_size_type	m_numEdges

vertices_size_type	m_numVertices

vertices_size_type	m_width

vertices_size_type	m_x

vertices_size_type	m_y

Static Private Member Functions
static bool	findInRects (const QVector< QRect > &rects, const QPoint &pt)

static vertices_size_type	numVacantEdges (const vertex_descriptor &vertex, const QRect &rc)

Friends
std::pair< typename type::adjacency_iterator, typename type::adjacency_iterator >	adjacent_vertices (typename type::vertex_descriptor vertex, const type &graph)

std::pair< typename type::edge_descriptor, bool >	edge (typename type::vertex_descriptor source_vertex, typename type::vertex_descriptor destination_vertex, const type &graph)

type::edge_descriptor	edge_at (typename type::edges_size_type edge_index, const type &graph)

std::pair< typename type::edge_iterator, typename type::edge_iterator >	edges (const type &graph)

lazy_fill_graph_index_map< type, typename type::edge_descriptor, typename type::edges_size_type >	get (edge_index_t, const type &graph)

type::edges_size_type	get (edge_index_t, const type &graph, typename type::edge_descriptor edge)

lazy_fill_graph_reverse_edge_map< typename type::edge_descriptor >	get (edge_reverse_t, const type &graph)

lazy_fill_graph_index_map< type, typename type::vertex_descriptor, typename type::vertices_size_type >	get (vertex_index_t, const type &graph)

type::vertices_size_type	get (vertex_index_t, const type &graph, typename type::vertex_descriptor vertex)

template<typename Graph , typename Descriptor , typename Index >
struct	lazy_fill_graph_index_map

template<typename Descriptor >
struct	lazy_fill_graph_reverse_edge_map

type::edges_size_type	num_edges (const type &graph)

type::vertices_size_type	num_vertices (const type &graph)

QDebug	operator<< (QDebug dbg, const KisLazyFillGraph::edge_descriptor &e)

QDebug	operator<< (QDebug dbg, const KisLazyFillGraph::vertex_descriptor &v)

type::degree_size_type	out_degree (typename type::vertex_descriptor vertex, const type &graph)

type::edge_descriptor	out_edge_at (typename type::vertex_descriptor vertex, typename type::degree_size_type out_edge_index, const type &graph)

std::pair< typename type::out_edge_iterator, typename type::out_edge_iterator >	out_edges (typename type::vertex_descriptor vertex, const type &graph)

type::vertex_descriptor	vertex (typename type::vertices_size_type vertex_index, const type &graph)

std::pair< typename type::vertex_iterator, typename type::vertex_iterator >	vertices (const type &graph)

Detailed Description

Definition at line 234 of file kis_lazy_fill_graph.h.

Member Typedef Documentation

◆ adjacency_iterator

typedef transform_iterator<adjacent_vertex_function, degree_iterator> KisLazyFillGraph::adjacency_iterator

Definition at line 299 of file kis_lazy_fill_graph.h.

◆ adjacent_vertex_function

typedef kis_detail::lazy_fill_graph_adjacent_vertex_at<type> KisLazyFillGraph::adjacent_vertex_function

Definition at line 298 of file kis_lazy_fill_graph.h.

◆ degree_iterator

typedef counting_iterator<degree_size_type> KisLazyFillGraph::degree_iterator

Definition at line 293 of file kis_lazy_fill_graph.h.

◆ degree_size_type

typedef EdgeIndex KisLazyFillGraph::degree_size_type

Definition at line 246 of file kis_lazy_fill_graph.h.

◆ directed_category

typedef directed_tag KisLazyFillGraph::directed_category

Definition at line 302 of file kis_lazy_fill_graph.h.

◆ edge_descriptor

typedef std::pair<vertex_descriptor, vertex_descriptor> KisLazyFillGraph::edge_descriptor

Definition at line 277 of file kis_lazy_fill_graph.h.

◆ edge_function

typedef kis_detail::lazy_fill_graph_edge_at<type> KisLazyFillGraph::edge_function

Definition at line 289 of file kis_lazy_fill_graph.h.

◆ edge_index_iterator

typedef counting_iterator<edges_size_type> KisLazyFillGraph::edge_index_iterator

Definition at line 288 of file kis_lazy_fill_graph.h.

◆ edge_iterator

typedef transform_iterator<edge_function, edge_index_iterator> KisLazyFillGraph::edge_iterator

Definition at line 290 of file kis_lazy_fill_graph.h.

◆ edge_parallel_category

typedef disallow_parallel_edge_tag KisLazyFillGraph::edge_parallel_category

Definition at line 303 of file kis_lazy_fill_graph.h.

◆ EdgeIndex

typedef long KisLazyFillGraph::EdgeIndex

Definition at line 241 of file kis_lazy_fill_graph.h.

◆ edges_size_type

typedef EdgeIndex KisLazyFillGraph::edges_size_type

Definition at line 245 of file kis_lazy_fill_graph.h.

◆ out_edge_function

typedef kis_detail::lazy_fill_graph_out_edge_at<type> KisLazyFillGraph::out_edge_function

Definition at line 294 of file kis_lazy_fill_graph.h.

◆ out_edge_iterator

typedef transform_iterator<out_edge_function, degree_iterator> KisLazyFillGraph::out_edge_iterator

Definition at line 295 of file kis_lazy_fill_graph.h.

◆ type

typedef KisLazyFillGraph KisLazyFillGraph::type

Definition at line 237 of file kis_lazy_fill_graph.h.

◆ vertex_descriptor

typedef VertexDescriptor KisLazyFillGraph::vertex_descriptor

Definition at line 276 of file kis_lazy_fill_graph.h.

◆ vertex_function

typedef kis_detail::lazy_fill_graph_vertex_at<KisLazyFillGraph> KisLazyFillGraph::vertex_function

Definition at line 284 of file kis_lazy_fill_graph.h.

◆ vertex_index_iterator

typedef counting_iterator<vertices_size_type> KisLazyFillGraph::vertex_index_iterator

Definition at line 283 of file kis_lazy_fill_graph.h.

◆ vertex_iterator

typedef transform_iterator<vertex_function, vertex_index_iterator> KisLazyFillGraph::vertex_iterator

Definition at line 285 of file kis_lazy_fill_graph.h.

◆ VertexIndex

typedef long KisLazyFillGraph::VertexIndex

Definition at line 240 of file kis_lazy_fill_graph.h.

◆ vertices_size_type

typedef VertexIndex KisLazyFillGraph::vertices_size_type

Definition at line 244 of file kis_lazy_fill_graph.h.

Member Enumeration Documentation

◆ EdgeIndexBinId

enum KisLazyFillGraph::EdgeIndexBinId

Enumerator
HORIZONTAL
HORIZONTAL_REVERSED
VERTICAL
VERTICAL_REVERSED
LABEL_A
LABEL_A_REVERSED
LABEL_B
LABEL_B_REVERSED

Definition at line 399 of file kis_lazy_fill_graph.h.

                        {
        HORIZONTAL,
        HORIZONTAL_REVERSED,
        VERTICAL,
        VERTICAL_REVERSED,
        LABEL_A,
        LABEL_A_REVERSED,
        LABEL_B,
        LABEL_B_REVERSED,
    };

Constructor & Destructor Documentation

◆ KisLazyFillGraph() [1/2]

KisLazyFillGraph::KisLazyFillGraph ( )

inline

Definition at line 320 of file kis_lazy_fill_graph.h.

320{}

◆ KisLazyFillGraph() [2/2]

KisLazyFillGraph::KisLazyFillGraph	(	const QRect &	mainRect,
		const KisRegion &	aLabelRegion,
		const KisRegion &	bLabelRegion )

inline

Definition at line 322 of file kis_lazy_fill_graph.h.

        : m_x(mainRect.x()),
          m_y(mainRect.y()),
          m_width(mainRect.width()),
          m_height(mainRect.height())
    {
        m_mainArea = mainRect;
        m_aLabelArea = aLabelRegion.boundingRect();
        m_bLabelArea = bLabelRegion.boundingRect();
 
        m_aLabelRects = aLabelRegion.rects();
        m_bLabelRects = bLabelRegion.rects();
 
        KIS_ASSERT(m_mainArea.contains(m_aLabelArea));
        KIS_ASSERT(m_mainArea.contains(m_bLabelArea));
 
        m_numVertices = m_width * m_height + 2;
 
        m_edgeBins << EdgeIndexBin(0,                 m_mainArea.adjusted(0, 0, -1, 0), HORIZONTAL);
        m_edgeBins << EdgeIndexBin(m_edgeBins.last(), m_mainArea.adjusted(0, 0, -1, 0), HORIZONTAL_REVERSED);
 
        m_edgeBins << EdgeIndexBin(m_edgeBins.last(), m_mainArea.adjusted(0, 0, 0, -1), VERTICAL);
        m_edgeBins << EdgeIndexBin(m_edgeBins.last(), m_mainArea.adjusted(0, 0, 0, -1), VERTICAL_REVERSED);
 
        Q_FOREACH (const QRect &rc, m_aLabelRects) {
            m_edgeBins << EdgeIndexBin(m_edgeBins.last(), rc, LABEL_A);
        }
 
        // out_edge_at relies on the sequential layout of reversed edges of one type
        m_aReversedEdgesStart = m_edgeBins.last().last() + 1;
 
        Q_FOREACH (const QRect &rc, m_aLabelRects) {
            m_edgeBins << EdgeIndexBin(m_edgeBins.last(), rc, LABEL_A_REVERSED);
        }
 
        m_numAEdges = m_edgeBins.last().last() + 1 - m_aReversedEdgesStart;
 
        Q_FOREACH (const QRect &rc, m_bLabelRects) {
            m_edgeBins << EdgeIndexBin(m_edgeBins.last(), rc, LABEL_B);
        }
 
        // out_edge_at relies on the sequential layout of reversed edges of one type
        m_bReversedEdgesStart = m_edgeBins.last().last() + 1;
 
        Q_FOREACH (const QRect &rc, m_bLabelRects) {
            m_edgeBins << EdgeIndexBin(m_edgeBins.last(), rc, LABEL_B_REVERSED);
        }
 
        m_numBEdges = m_edgeBins.last().last() + 1 - m_bReversedEdgesStart;
 
        m_numEdges = m_edgeBins.last().last() + 1;
    }

References KisRegion::boundingRect(), HORIZONTAL, HORIZONTAL_REVERSED, KIS_ASSERT, LABEL_A, LABEL_A_REVERSED, LABEL_B, LABEL_B_REVERSED, m_aLabelArea, m_aLabelRects, m_aReversedEdgesStart, m_bLabelArea, m_bLabelRects, m_bReversedEdgesStart, m_edgeBins, m_height, m_mainArea, m_numAEdges, m_numBEdges, m_numEdges, m_numVertices, m_width, KisRegion::rects(), VERTICAL, and VERTICAL_REVERSED.

◆ ~KisLazyFillGraph()

KisLazyFillGraph::~KisLazyFillGraph ( )

inline

Definition at line 377 of file kis_lazy_fill_graph.h.

                        {
 
    }

Member Function Documentation

◆ edge_at()

edge_descriptor KisLazyFillGraph::edge_at ( edges_size_type edge_index ) const

inline

Definition at line 636 of file kis_lazy_fill_graph.h.

                                                              {
 
        int binIndex = 0;
 
        while (binIndex < m_edgeBins.size() &&
               !m_edgeBins[binIndex].contains(edge_index)) {
 
            binIndex++;
        }
 
        if (binIndex >= m_edgeBins.size()) {
            return edge_descriptor();
        }
 
        return m_edgeBins[binIndex].edgeAt(edge_index);
    }

References m_edgeBins.

◆ findInRects()

static bool KisLazyFillGraph::findInRects	(	const QVector< QRect > &	rects,
		const QPoint &	pt )

inlinestaticprivate

Definition at line 690 of file kis_lazy_fill_graph.h.

                                                                                  {
        bool result = false;
 
        auto it = rects.constBegin();
        for (; it != rects.constEnd(); ++it) {
 
            if (it->contains(pt)) {
                result = true;
                break;
            }
        }
        return result;
    }

◆ index_of() [1/2]

edges_size_type KisLazyFillGraph::index_of ( edge_descriptor edge ) const

inline

Definition at line 654 of file kis_lazy_fill_graph.h.

                                                         {
        edges_size_type index = -1;
 
        auto it = m_edgeBins.constBegin();
        for (; it != m_edgeBins.constEnd(); ++it) {
 
            index = it->indexOf(edge);
            if (index >= 0) break;
        }
 
        return index;
    }

References edge, and m_edgeBins.

◆ index_of() [2/2]

vertices_size_type KisLazyFillGraph::index_of ( vertex_descriptor vertex ) const

inline

Definition at line 597 of file kis_lazy_fill_graph.h.

                                                                {
        vertices_size_type vertex_index = -1;
 
        switch (vertex.type) {
        case vertex_descriptor::NORMAL:
            vertex_index = vertex.x - m_x + (vertex.y - m_y) * m_width;
            break;
        case vertex_descriptor::LABEL_A:
            vertex_index = m_numVertices - 2;
            break;
        case vertex_descriptor::LABEL_B:
            vertex_index = m_numVertices - 1;
            break;
        }
 
        return vertex_index;
    }

References KisLazyFillGraph::VertexDescriptor::LABEL_A, KisLazyFillGraph::VertexDescriptor::LABEL_B, m_numVertices, m_width, m_x, m_y, KisLazyFillGraph::VertexDescriptor::NORMAL, KisLazyFillGraph::VertexDescriptor::type, vertex, KisLazyFillGraph::VertexDescriptor::x, and KisLazyFillGraph::VertexDescriptor::y.

◆ null_vertex()

static vertex_descriptor KisLazyFillGraph::null_vertex ( )

inlinestatic

Definition at line 310 of file kis_lazy_fill_graph.h.

    {
        vertex_descriptor maxed_out_vertex(
            std::numeric_limits<vertices_size_type>::max(),
            std::numeric_limits<vertices_size_type>::max(),
            vertex_descriptor::NORMAL);
 
        return (maxed_out_vertex);
    }

References KisLazyFillGraph::VertexDescriptor::NORMAL.

◆ num_edges()

edges_size_type KisLazyFillGraph::num_edges ( ) const

inline

Definition at line 592 of file kis_lazy_fill_graph.h.

                                             {
      return (m_numEdges);
    }

References m_numEdges.

◆ num_vertices()

vertices_size_type KisLazyFillGraph::num_vertices ( ) const

inline

Definition at line 587 of file kis_lazy_fill_graph.h.

                                                   {
      return (m_numVertices);
    }

References m_numVertices.

◆ numVacantEdges()

static vertices_size_type KisLazyFillGraph::numVacantEdges	(	const vertex_descriptor &	vertex,
		const QRect &	rc )

inlinestaticprivate

Definition at line 668 of file kis_lazy_fill_graph.h.

                                                                                               {
        vertices_size_type vacantEdges = 4;
 
        if (vertex.x == rc.x()) {
            vacantEdges--;
        }
 
        if (vertex.y == rc.y()) {
            vacantEdges--;
        }
 
        if (vertex.x == rc.right()) {
            vacantEdges--;
        }
 
        if (vertex.y == rc.bottom()) {
            vacantEdges--;
        }
 
        return vacantEdges;
    }

References vertex, KisLazyFillGraph::VertexDescriptor::x, and KisLazyFillGraph::VertexDescriptor::y.

◆ out_degree()

degree_size_type KisLazyFillGraph::out_degree ( vertex_descriptor vertex ) const

inline

Definition at line 705 of file kis_lazy_fill_graph.h.

                                                                {
        degree_size_type out_edge_count = 0;
        if (index_of(vertex) < 0) return out_edge_count;
 
        switch (vertex.type) {
        case vertex_descriptor::NORMAL: {
            out_edge_count = numVacantEdges(vertex, m_mainArea);
 
            const QPoint pt = QPoint(vertex.x, vertex.y);
 
            if (m_aLabelArea.contains(pt) && findInRects(m_aLabelRects, pt)) {
                out_edge_count++;
            }
 
            if (m_bLabelArea.contains(pt) && findInRects(m_bLabelRects, pt)) {
                out_edge_count++;
            }
 
            break;
        }
        case vertex_descriptor::LABEL_A:
            out_edge_count = m_numAEdges;
            break;
        case vertex_descriptor::LABEL_B:
            out_edge_count = m_numBEdges;
            break;
        }
 
        return (out_edge_count);
    }

References findInRects(), index_of(), KisLazyFillGraph::VertexDescriptor::LABEL_A, KisLazyFillGraph::VertexDescriptor::LABEL_B, m_aLabelArea, m_aLabelRects, m_bLabelArea, m_bLabelRects, m_mainArea, m_numAEdges, m_numBEdges, KisLazyFillGraph::VertexDescriptor::NORMAL, numVacantEdges(), KisLazyFillGraph::VertexDescriptor::type, vertex, KisLazyFillGraph::VertexDescriptor::x, and KisLazyFillGraph::VertexDescriptor::y.

◆ out_edge_at()

edge_descriptor KisLazyFillGraph::out_edge_at	(	vertex_descriptor	vertex,
		degree_size_type	out_edge_index ) const

inline

Definition at line 738 of file kis_lazy_fill_graph.h.

                                                                        {
 
        const QPoint pt = QPoint(vertex.x, vertex.y);
        vertex_descriptor dst_vertex = vertex;
 
        switch (vertex.type) {
        case vertex_descriptor::NORMAL:
            if (vertex.x > m_mainArea.x() && !out_edge_index--) {
                dst_vertex.x--;
            } else if (vertex.y > m_mainArea.y() && !out_edge_index--) {
                dst_vertex.y--;
            } else if (vertex.x < m_mainArea.right() && !out_edge_index--) {
                dst_vertex.x++;
            } else if (vertex.y < m_mainArea.bottom() && !out_edge_index--) {
                dst_vertex.y++;
            } else if (m_aLabelArea.contains(pt) && findInRects(m_aLabelRects, pt) && !out_edge_index--) {
                dst_vertex = vertex_descriptor(0, 0, vertex_descriptor::LABEL_A);
            } else if (m_bLabelArea.contains(pt) && findInRects(m_bLabelRects, pt) && !out_edge_index--) {
                dst_vertex = vertex_descriptor(0, 0, vertex_descriptor::LABEL_B);
            } else {
                dbgImage << ppVar(vertex) << ppVar(out_edge_index) << ppVar(out_degree(vertex));
                qFatal("Wrong edge sub-index");
            }
            break;
        case vertex_descriptor::LABEL_A: {
            edge_descriptor edge = edge_at(m_aReversedEdgesStart + out_edge_index);
            dst_vertex = edge.second;
            break;
        }
        case vertex_descriptor::LABEL_B: {
            edge_descriptor edge = edge_at(m_bReversedEdgesStart + out_edge_index);
            dst_vertex = edge.second;
            break;
        }
        }
 
        return std::make_pair(vertex, dst_vertex);
    }

References dbgImage, edge, edge_at, findInRects(), KisLazyFillGraph::VertexDescriptor::LABEL_A, KisLazyFillGraph::VertexDescriptor::LABEL_B, m_aLabelArea, m_aLabelRects, m_aReversedEdgesStart, m_bLabelArea, m_bLabelRects, m_bReversedEdgesStart, m_mainArea, KisLazyFillGraph::VertexDescriptor::NORMAL, out_degree, ppVar, KisLazyFillGraph::VertexDescriptor::type, vertex, KisLazyFillGraph::VertexDescriptor::x, and KisLazyFillGraph::VertexDescriptor::y.

◆ rect()

QRect KisLazyFillGraph::rect ( ) const

inline

Definition at line 382 of file kis_lazy_fill_graph.h.

382{ return QRect(m_x, m_y, m_width, m_height); }

References m_height, m_width, m_x, and m_y.

◆ size()

QSize KisLazyFillGraph::size ( ) const

inline

Definition at line 381 of file kis_lazy_fill_graph.h.

381{ return QSize(m_width, m_height); }

References m_height, and m_width.

◆ vertex_at()

vertex_descriptor KisLazyFillGraph::vertex_at ( vertices_size_type vertex_index ) const

inline

Definition at line 617 of file kis_lazy_fill_graph.h.

                                                                        {
        vertex_descriptor vertex;
 
        if (vertex_index == m_numVertices - 2) {
            vertex.type = vertex_descriptor::LABEL_A;
        } else if (vertex_index == m_numVertices - 1) {
            vertex.type = vertex_descriptor::LABEL_B;
        } else if (vertex_index >= 0) {
            vertex.x = vertex_index % m_width + m_x;
            vertex.y = vertex_index / m_width + m_y;
            vertex.type = vertex_descriptor::NORMAL;
        }
 
      return vertex;
    }

References KisLazyFillGraph::VertexDescriptor::LABEL_A, KisLazyFillGraph::VertexDescriptor::LABEL_B, m_numVertices, m_width, m_x, m_y, KisLazyFillGraph::VertexDescriptor::NORMAL, KisLazyFillGraph::VertexDescriptor::type, vertex, KisLazyFillGraph::VertexDescriptor::x, and KisLazyFillGraph::VertexDescriptor::y.

Friends And Related Symbol Documentation

◆ adjacent_vertices

std::pair< typename type::adjacency_iterator, typename type::adjacency_iterator > adjacent_vertices	(	typename type::vertex_descriptor	vertex,
		const type &	graph )

friend

Definition at line 849 of file kis_lazy_fill_graph.h.

                                          {
      typedef typename type::degree_iterator degree_iterator;
      typedef typename type::adjacent_vertex_function adjacent_vertex_function;
      typedef typename type::adjacency_iterator adjacency_iterator;
 
      return (std::make_pair
              (adjacency_iterator(degree_iterator(0),
                                 adjacent_vertex_function(vertex, &graph)),
               adjacency_iterator(degree_iterator(graph.out_degree(vertex)),
                                 adjacent_vertex_function(vertex, &graph))));
    }

◆ edge

std::pair< typename type::edge_descriptor, bool > edge	(	typename type::vertex_descriptor	source_vertex,
		typename type::vertex_descriptor	destination_vertex,
		const type &	graph )

friend

Definition at line 867 of file kis_lazy_fill_graph.h.

                             {
 
        std::pair<typename type::edge_descriptor, bool> edge_exists =
            std::make_pair(std::make_pair(source_vertex, destination_vertex), false);
 
        const edges_size_type index = graph.index_of(edge_exists.first);
 
        edge_exists.second = index >= 0;
 
        return edge_exists;
    }

◆ edge_at

type::edge_descriptor edge_at	(	typename type::edges_size_type	edge_index,
		const type &	graph )

friend

Definition at line 891 of file kis_lazy_fill_graph.h.

                               {
      return (graph.edge_at(edge_index));
    }

◆ edges

std::pair< typename type::edge_iterator, typename type::edge_iterator > edges ( const type & graph )

friend

Definition at line 898 of file kis_lazy_fill_graph.h.

                             {
      typedef typename type::edge_index_iterator edge_index_iterator;
      typedef typename type::edge_function edge_function;
      typedef typename type::edge_iterator edge_iterator;
 
      return (std::make_pair
              (edge_iterator(edge_index_iterator(0),
                             edge_function(&graph)),
               edge_iterator(edge_index_iterator(graph.num_edges()),
                             edge_function(&graph))));
    }

◆ get [1/5]

lazy_fill_graph_index_map< type, typename type::edge_descriptor, typename type::edges_size_type > get	(	edge_index_t	,
		const type &	graph )

friend

Definition at line 949 of file kis_lazy_fill_graph.h.

                                         {
        return (lazy_fill_graph_index_map<
                type,
                typename type::edge_descriptor,
                typename type::edges_size_type>(graph));
    }

◆ get [2/5]

type::edges_size_type get	(	edge_index_t	,
		const type &	graph,
		typename type::edge_descriptor	edge )

friend

Definition at line 925 of file kis_lazy_fill_graph.h.

                                           {
 
        type::edges_size_type index = graph.index_of(edge);
        LF_SANITY_ASSERT(index >= 0);
        return index;
    }

◆ get [3/5]

lazy_fill_graph_reverse_edge_map< typename type::edge_descriptor > get	(	edge_reverse_t	,
		const type &	graph )

friend

Definition at line 958 of file kis_lazy_fill_graph.h.

                                           {
        Q_UNUSED(graph);
        return (lazy_fill_graph_reverse_edge_map<
                typename type::edge_descriptor>());
    }

◆ get [4/5]

lazy_fill_graph_index_map< type, typename type::vertex_descriptor, typename type::vertices_size_type > get	(	vertex_index_t	,
		const type &	graph )

friend

Definition at line 938 of file kis_lazy_fill_graph.h.

                                           {
        return (lazy_fill_graph_index_map<
                type,
                typename type::vertex_descriptor,
                typename type::vertices_size_type>(graph));
    }

◆ get [5/5]

type::vertices_size_type get	(	vertex_index_t	,
		const type &	graph,
		typename type::vertex_descriptor	vertex )

friend

Definition at line 915 of file kis_lazy_fill_graph.h.

                                               {
 
        type::vertices_size_type index = graph.index_of(vertex);
        LF_SANITY_ASSERT(index >= 0);
        return index;
    }

◆ lazy_fill_graph_index_map

template<typename Graph , typename Descriptor , typename Index >

friend struct lazy_fill_graph_index_map

friend

Definition at line 967 of file kis_lazy_fill_graph.h.

◆ lazy_fill_graph_reverse_edge_map

template<typename Descriptor >

friend struct lazy_fill_graph_reverse_edge_map

friend

Definition at line 970 of file kis_lazy_fill_graph.h.

◆ num_edges

type::edges_size_type num_edges ( const type & graph )

friend

Definition at line 886 of file kis_lazy_fill_graph.h.

                                 {
      return (graph.num_edges());
    }

◆ num_vertices

type::vertices_size_type num_vertices ( const type & graph )

friend

Definition at line 799 of file kis_lazy_fill_graph.h.

                                    {
        return (graph.num_vertices());
    }

◆ operator<< [1/2]

QDebug operator<<	(	QDebug	dbg,
		const KisLazyFillGraph::edge_descriptor &	e )

friend

Definition at line 1009 of file kis_lazy_fill_graph.h.

                                                                        {
    KisLazyFillGraph::vertex_descriptor src = e.first;
    KisLazyFillGraph::vertex_descriptor dst = e.second;
 
    dbg.nospace() << "(" << src << " -> " << dst << ")";
    return dbg.space();
}

◆ operator<< [2/2]

QDebug operator<<	(	QDebug	dbg,
		const KisLazyFillGraph::vertex_descriptor &	v )

friend

Definition at line 999 of file kis_lazy_fill_graph.h.

                                                                          {
    const QString type =
        v.type == KisLazyFillGraph::vertex_descriptor::NORMAL ? "normal" :
        v.type == KisLazyFillGraph::vertex_descriptor::LABEL_A ? "label_A" :
        v.type == KisLazyFillGraph::vertex_descriptor::LABEL_B ? "label_B" : "<unknown>";
 
    dbg.nospace() << "(" << v.x << ", " << v.y << ", " << type << ")";
    return dbg.space();
}

◆ out_degree

type::degree_size_type out_degree	(	typename type::vertex_descriptor	vertex,
		const type &	graph )

friend

Definition at line 830 of file kis_lazy_fill_graph.h.

                        {
        return (graph.out_degree(vertex));
    }

◆ out_edge_at

type::edge_descriptor out_edge_at	(	typename type::vertex_descriptor	vertex,
		typename type::degree_size_type	out_edge_index,
		const type &	graph )

friend

Definition at line 837 of file kis_lazy_fill_graph.h.

                                   {
        return (graph.out_edge_at(vertex, out_edge_index));
    }

◆ out_edges

std::pair< typename type::out_edge_iterator, typename type::out_edge_iterator > out_edges	(	typename type::vertex_descriptor	vertex,
		const type &	graph )

friend

Definition at line 816 of file kis_lazy_fill_graph.h.

                                 {
        typedef typename type::degree_iterator degree_iterator;
        typedef typename type::out_edge_function out_edge_function;
        typedef typename type::out_edge_iterator out_edge_iterator;
 
        return (std::make_pair
                (out_edge_iterator(degree_iterator(0),
                                   out_edge_function(vertex, &graph)),
                 out_edge_iterator(degree_iterator(graph.out_degree(vertex)),
                                   out_edge_function(vertex, &graph))));
    }

◆ vertex

type::vertex_descriptor vertex	(	typename type::vertices_size_type	vertex_index,
		const type &	graph )

friend

Definition at line 804 of file kis_lazy_fill_graph.h.

                              {
 
        return (graph.vertex_at(vertex_index));
    }

◆ vertices

std::pair< typename type::vertex_iterator, typename type::vertex_iterator > vertices ( const type & graph )

friend

Definition at line 786 of file kis_lazy_fill_graph.h.

                                {
        typedef typename type::vertex_iterator vertex_iterator;
        typedef typename type::vertex_function vertex_function;
        typedef typename type::vertex_index_iterator vertex_index_iterator;
 
        return (std::make_pair
                (vertex_iterator(vertex_index_iterator(0),
                                 vertex_function(&graph)),
                 vertex_iterator(vertex_index_iterator(graph.num_vertices()),
                                 vertex_function(&graph))));
    }

Member Data Documentation

◆ m_aLabelArea

QRect KisLazyFillGraph::m_aLabelArea

Definition at line 577 of file kis_lazy_fill_graph.h.

◆ m_aLabelRects

QVector<QRect> KisLazyFillGraph::m_aLabelRects

Definition at line 581 of file kis_lazy_fill_graph.h.

◆ m_aReversedEdgesStart

vertices_size_type KisLazyFillGraph::m_aReversedEdgesStart

Definition at line 394 of file kis_lazy_fill_graph.h.

◆ m_bLabelArea

QRect KisLazyFillGraph::m_bLabelArea

Definition at line 578 of file kis_lazy_fill_graph.h.

◆ m_bLabelRects

QVector<QRect> KisLazyFillGraph::m_bLabelRects

Definition at line 582 of file kis_lazy_fill_graph.h.

◆ m_bReversedEdgesStart

vertices_size_type KisLazyFillGraph::m_bReversedEdgesStart

Definition at line 395 of file kis_lazy_fill_graph.h.

◆ m_edgeBins

QVector<EdgeIndexBin> KisLazyFillGraph::m_edgeBins

Definition at line 575 of file kis_lazy_fill_graph.h.

◆ m_height

vertices_size_type KisLazyFillGraph::m_height

Definition at line 389 of file kis_lazy_fill_graph.h.

◆ m_mainArea

QRect KisLazyFillGraph::m_mainArea

Definition at line 579 of file kis_lazy_fill_graph.h.

◆ m_numAEdges

vertices_size_type KisLazyFillGraph::m_numAEdges

Definition at line 396 of file kis_lazy_fill_graph.h.

◆ m_numBEdges

vertices_size_type KisLazyFillGraph::m_numBEdges

Definition at line 397 of file kis_lazy_fill_graph.h.

◆ m_numEdges

vertices_size_type KisLazyFillGraph::m_numEdges

Definition at line 392 of file kis_lazy_fill_graph.h.

◆ m_numVertices

vertices_size_type KisLazyFillGraph::m_numVertices

Definition at line 391 of file kis_lazy_fill_graph.h.

◆ m_width

vertices_size_type KisLazyFillGraph::m_width

Definition at line 388 of file kis_lazy_fill_graph.h.

◆ m_x

vertices_size_type KisLazyFillGraph::m_x

Definition at line 385 of file kis_lazy_fill_graph.h.

◆ m_y

vertices_size_type KisLazyFillGraph::m_y

Definition at line 386 of file kis_lazy_fill_graph.h.

The documentation for this class was generated from the following file:

libs/image/lazybrush/kis_lazy_fill_graph.h

Classes

Public Types

Public Member Functions

Static Public Member Functions

Public Attributes

Static Private Member Functions

Friends

Detailed Description

Member Typedef Documentation

◆ adjacency_iterator

◆ adjacent_vertex_function

◆ degree_iterator

◆ degree_size_type

◆ directed_category

◆ edge_descriptor

◆ edge_function

◆ edge_index_iterator

◆ edge_iterator

◆ edge_parallel_category

◆ EdgeIndex

◆ edges_size_type

◆ out_edge_function

◆ out_edge_iterator

◆ type

◆ vertex_descriptor

◆ vertex_function

◆ vertex_index_iterator

◆ vertex_iterator

◆ VertexIndex

◆ vertices_size_type

Member Enumeration Documentation

◆ EdgeIndexBinId

Constructor & Destructor Documentation

◆ KisLazyFillGraph() [1/2]

◆ KisLazyFillGraph() [2/2]

◆ ~KisLazyFillGraph()

Member Function Documentation

◆ edge_at()

◆ findInRects()

◆ index_of() [1/2]

◆ index_of() [2/2]

◆ null_vertex()

◆ num_edges()

◆ num_vertices()

◆ numVacantEdges()

◆ out_degree()

◆ out_edge_at()

◆ rect()

◆ size()

◆ vertex_at()

Friends And Related Symbol Documentation

◆ adjacent_vertices

◆ edge

◆ edge_at

◆ edges

◆ get [1/5]

◆ get [2/5]

◆ get [3/5]

◆ get [4/5]

◆ get [5/5]

◆ lazy_fill_graph_index_map

◆ lazy_fill_graph_reverse_edge_map

◆ num_edges

◆ num_vertices

◆ operator<< [1/2]

◆ operator<< [2/2]

◆ out_degree

◆ out_edge_at

◆ out_edges

◆ vertex

◆ vertices

Member Data Documentation

◆ m_aLabelArea

◆ m_aLabelRects

◆ m_aReversedEdgesStart

◆ m_bLabelArea

◆ m_bLabelRects

◆ m_bReversedEdgesStart

◆ m_edgeBins

◆ m_height