30 : m_bidirectional(false),
33 m_efficientMovePrevious(false),
34 m_efficientMoveBeforeFirst(false),
35 m_efficientMoveLast(false),
36 m_efficientMoveAfterLast(false),
37 m_efficientMove(false),
38 m_efficientSize(false)
48 return m_bidirectional;
53 m_bidirectional = support;
78 return m_efficientMovePrevious;
83 m_efficientMovePrevious = support;
88 return m_efficientMoveBeforeFirst;
93 m_efficientMoveBeforeFirst = support;
98 return m_efficientMoveLast;
103 m_efficientMoveLast = support;
108 return m_efficientMoveAfterLast;
113 m_efficientMoveAfterLast = support;
118 return m_efficientMove;
123 m_efficientMove = support;
128 return m_efficientSize;
133 m_efficientSize = support;
138 m_bidirectional =
true;
141 m_efficientMovePrevious =
true;
142 m_efficientMoveBeforeFirst =
true;
143 m_efficientMoveLast =
true;
144 m_efficientMoveAfterLast =
true;
145 m_efficientMove =
true;
146 m_efficientSize =
true;
bool supportsEfficientMovePrevious() const
void setSupportEfficientMoveAfterLast(const bool &support)
void setSupportEfficientMove(const bool &support)
void setSupportEfficientMovePrevious(const bool &support)
void setSupportEfficientMoveBeforeFirst(const bool &support)
bool supportsEfficientMove() const
~DataSetCapabilities()
Destructor.
bool supportsRandomTraversing() const
void setSupportEfficientMoveLast(const bool &support)
bool supportsEfficientDataSetSize() const
void setSupportIndexedTraversing(const bool &support)
void setSupportBidirectionalTraversing(const bool &support)
A class that informs what the dataset implementation of a given data source can perform.
bool supportsEfficientMoveAfterLast() const
bool supportsEfficientMoveLast() const
void setSupportRandomTraversing(const bool &support)
DataSetCapabilities()
Constructor.
bool supportsEfficientMoveBeforeFirst() const
bool supportsBidirectionalTraversing() const
bool supportsIndexedTraversing() const
void setSupportEfficientDataSetSize(const bool &support)