Okular::RegularAreaRect

Search for usage in LXR

Public Member Functions | List of all members
Okular::RegularAreaRect Class Reference

#include <area.h>

Inheritance diagram for Okular::RegularAreaRect:
Inheritance graph
[legend]

Public Member Functions

 RegularAreaRect (const RegularAreaRect &rar)
 
RegularAreaRect & operator= (const RegularAreaRect &rar)
 
- Public Member Functions inherited from Okular::RegularArea< NormalizedRect, QRect >
void appendArea (const RegularArea< NormalizedRect, QRect > *area)
 
void appendShape (const NormalizedRect &shape, MergeSide side=MergeAll)
 
bool contains (const NormalizedRect &shape) const
 
bool contains (double x, double y) const
 
QList< QRect > geometry (int xScale, int yScale, int dx=0, int dy=0) const
 
bool intersects (const NormalizedRect &shape) const
 
bool intersects (const RegularArea< NormalizedRect, QRect > *area) const
 
bool isNull () const
 
void simplify ()
 
void transform (const QTransform &matrix)
 
- Public Member Functions inherited from QList< NormalizedRect >
 QList (const QList< T > &other)
 
 QList (InputIterator first, InputIterator last)
 
 QList (QList< T > &&other)
 
 QList (std::initializer_list< T > args)
 
void append (const QList< T > &value)
 
void append (const T &value)
 
const T & at (int i) const const
 
T & back ()
 
const T & back () const const
 
QList::iterator begin ()
 
QList::const_iterator begin () const const
 
QList::const_iterator cbegin () const const
 
QList::const_iterator cend () const const
 
void clear ()
 
QList::const_iterator constBegin () const const
 
QList::const_iterator constEnd () const const
 
const T & constFirst () const const
 
const T & constLast () const const
 
bool contains (const T &value) const const
 
int count () const const
 
int count (const T &value) const const
 
QList::const_reverse_iterator crbegin () const const
 
QList::const_reverse_iterator crend () const const
 
bool empty () const const
 
QList::iterator end ()
 
QList::const_iterator end () const const
 
bool endsWith (const T &value) const const
 
QList::iterator erase (QList::iterator begin, QList::iterator end)
 
QList::iterator erase (QList::iterator pos)
 
T & first ()
 
const T & first () const const
 
T & front ()
 
const T & front () const const
 
int indexOf (const T &value, int from) const const
 
void insert (int i, const T &value)
 
QList::iterator insert (QList::iterator before, const T &value)
 
bool isEmpty () const const
 
T & last ()
 
const T & last () const const
 
int lastIndexOf (const T &value, int from) const const
 
int length () const const
 
QList< T > mid (int pos, int length) const const
 
void move (int from, int to)
 
bool operator!= (const QList< T > &other) const const
 
QList< T > operator+ (const QList< T > &other) const const
 
QList< T > & operator+= (const QList< T > &other)
 
QList< T > & operator+= (const T &value)
 
bool operator< (const QList< T > &lhs, const QList< T > &rhs)
 
QList< T > & operator<< (const QList< T > &other)
 
QList< T > & operator<< (const T &value)
 
QDataStream & operator<< (QDataStream &out, const QList< T > &list)
 
bool operator<= (const QList< T > &lhs, const QList< T > &rhs)
 
QList< T > & operator= (const QList< T > &other)
 
QList< T > & operator= (QList< T > &&other)
 
bool operator== (const QList< T > &other) const const
 
bool operator> (const QList< T > &lhs, const QList< T > &rhs)
 
bool operator>= (const QList< T > &lhs, const QList< T > &rhs)
 
QDataStream & operator>> (QDataStream &in, QList< T > &list)
 
T & operator[] (int i)
 
const T & operator[] (int i) const const
 
void pop_back ()
 
void pop_front ()
 
void prepend (const T &value)
 
void push_back (const T &value)
 
void push_front (const T &value)
 
uint qHash (const QList< T > &key, uint seed)
 
QList::reverse_iterator rbegin ()
 
QList::const_reverse_iterator rbegin () const const
 
int removeAll (const T &value)
 
void removeAt (int i)
 
void removeFirst ()
 
void removeLast ()
 
bool removeOne (const T &value)
 
QList::reverse_iterator rend ()
 
QList::const_reverse_iterator rend () const const
 
void replace (int i, const T &value)
 
void reserve (int alloc)
 
int size () const const
 
bool startsWith (const T &value) const const
 
void swap (int i, int j)
 
void swap (QList< T > &other)
 
void swapItemsAt (int i, int j)
 
T takeAt (int i)
 
T takeFirst ()
 
T takeLast ()
 
QSet< T > toSet () const const
 
std::list< T > toStdList () const const
 
QVector< T > toVector () const const
 
T value (int i) const const
 
T value (int i, const T &defaultValue) const const
 

Additional Inherited Members

- Static Public Member Functions inherited from QList< NormalizedRect >
QList< T > fromSet (const QSet< T > &set)
 
QList< T > fromStdList (const std::list< T > &list)
 
QList< T > fromVector (const QVector< T > &vector)
 
- Public Attributes inherited from QList< NormalizedRect >
typedef const_pointer
 
typedef const_reference
 
typedef const_reverse_iterator
 
typedef ConstIterator
 
typedef difference_type
 
typedef Iterator
 
typedef pointer
 
typedef reference
 
typedef reverse_iterator
 
typedef size_type
 
typedef value_type
 

Detailed Description

This is a list of NormalizedRect, to describe an area consisting of multiple rectangles using normalized coordinates.

This area can be mapped to a reference area, resulting in a list of QRects. For more information about the normalized coordinate system, see NormalizedPoint.

Okular uses this area e. g. to describe a text highlight area, which consists of multiple, intersecting or non-intersecting rectangles.

See also
NormalizedRect, NormalizedPoint

Definition at line 932 of file area.h.

The documentation for this class was generated from the following files:
This file is part of the KDE documentation.
Documentation copyright © 1996-2023 The KDE developers.
Generated on Mon May 8 2023 04:08:33 by doxygen 1.8.17 written by Dimitri van Heesch, © 1997-2006

KDE's Doxygen guidelines are available online.