DataSetCapabilities.h
Go to the documentation of this file.
1 /* Copyright (C) 2008 National Institute For Space Research (INPE) - Brazil.
2 
3  This file is part of the TerraLib - a Framework for building GIS enabled applications.
4 
5  TerraLib is free software: you can redistribute it and/or modify
6  it under the terms of the GNU Lesser General Public License as published by
7  the Free Software Foundation, either version 3 of the License,
8  or (at your option) any later version.
9 
10  TerraLib is distributed in the hope that it will be useful,
11  but WITHOUT ANY WARRANTY; without even the implied warranty of
12  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13  GNU Lesser General Public License for more details.
14 
15  You should have received a copy of the GNU Lesser General Public License
16  along with TerraLib. See COPYING. If not, write to
17  TerraLib Team at <terralib-team@terralib.org>.
18  */
19 
20 /*!
21  \file terralib/dataaccess/dataset/DataSetCapabilities.h
22 
23  \brief A class that informs what the dataset implementation of a given data source can perform.
24 */
25 
26 #ifndef __TERRALIB_DATAACCESS_INTERNAL_DATASETCAPABILITIES_H
27 #define __TERRALIB_DATAACCESS_INTERNAL_DATASETCAPABILITIES_H
28 
29 // TerraLib
30 #include "../Config.h"
31 
32 namespace te
33 {
34  namespace da
35  {
36  /*!
37  \class DataSetCapabilities
38 
39  \brief A class that informs what the dataset implementation of a given data source can perform.
40 
41  \ingroup dataaccess
42  */
44  {
45  public:
46 
47  /*! \brief Constructor. */
49 
50  /*! \brief Destructor. */
52 
53  public:
54 
56 
57  void setSupportBidirectionalTraversing(const bool& support);
58 
60 
61  void setSupportRandomTraversing(const bool& support);
62 
64 
65  void setSupportIndexedTraversing(const bool& support);
66 
68 
69  void setSupportEfficientMovePrevious(const bool& support);
70 
72 
73  void setSupportEfficientMoveBeforeFirst(const bool& support);
74 
76 
77  void setSupportEfficientMoveLast(const bool& support);
78 
80 
81  void setSupportEfficientMoveAfterLast(const bool& support);
82 
83  bool supportsEfficientMove() const;
84 
85  void setSupportEfficientMove(const bool& support);
86 
88 
89  void setSupportEfficientDataSetSize(const bool& support);
90 
91  void setSupportAll();
92 
93  bool isConnected() const;
94 
95  void setAsConnected(const bool& connected);
96 
97  private:
98 
99  bool m_bidirectional; //!< A flag that indicates if the data set supports traversing in a bidirectional way.
100  bool m_random; //!< A flag that indicates if the data set supports traversing in a random way.
101  bool m_indexed; //!< A flag that indicates if the data set supports traversing using a given key.
102  bool m_efficientMovePrevious; //!< A flag that indicates if the performance of move previous operation has no penality.
103  bool m_efficientMoveBeforeFirst; //!< A flag that indicates if the performance of move before first operation has no penality.
104  bool m_efficientMoveLast; //!< A flag that indicates if the performance of move last operation has no penality.
105  bool m_efficientMoveAfterLast; //!< A flag that indicates if the performance of move after last operation has no penality.
106  bool m_efficientMove; //!< A flag that indicates if the performance of move operation has no penality.
107  bool m_efficientSize; //!< A flag that indicates if the performance of getting data set size operation has no penality.
108  bool m_isConnected; //!< A flag that indicates if the data set is conneted.
109  };
110 
111  } // end namespace da
112 } // end namespace te
113 
114 #endif // __TERRALIB_DATAACCESS_INTERNAL_DATASETCAPABILITIES_H
A class that informs what the dataset implementation of a given data source can perform.
bool supportsRandomTraversing() const
bool m_random
A flag that indicates if the data set supports traversing in a random way.
bool supportsIndexedTraversing() const
void setSupportEfficientMoveAfterLast(const bool &support)
bool m_efficientSize
A flag that indicates if the performance of getting data set size operation has no penality.
~DataSetCapabilities()
Destructor.
void setSupportEfficientDataSetSize(const bool &support)
bool supportsEfficientMoveBeforeFirst() const
bool m_efficientMove
A flag that indicates if the performance of move operation has no penality.
bool supportsEfficientMoveAfterLast() const
DataSetCapabilities()
Constructor.
bool supportsEfficientMovePrevious() const
void setSupportRandomTraversing(const bool &support)
void setSupportIndexedTraversing(const bool &support)
void setSupportEfficientMoveBeforeFirst(const bool &support)
bool supportsBidirectionalTraversing() const
void setSupportBidirectionalTraversing(const bool &support)
void setSupportEfficientMovePrevious(const bool &support)
bool m_efficientMoveAfterLast
A flag that indicates if the performance of move after last operation has no penality.
bool m_efficientMoveLast
A flag that indicates if the performance of move last operation has no penality.
bool m_efficientMoveBeforeFirst
A flag that indicates if the performance of move before first operation has no penality.
bool m_isConnected
A flag that indicates if the data set is conneted.
bool supportsEfficientMoveLast() const
bool supportsEfficientDataSetSize() const
bool supportsEfficientMove() const
void setSupportEfficientMoveLast(const bool &support)
void setSupportEfficientMove(const bool &support)
bool m_efficientMovePrevious
A flag that indicates if the performance of move previous operation has no penality.
bool m_bidirectional
A flag that indicates if the data set supports traversing in a bidirectional way.
bool m_indexed
A flag that indicates if the data set supports traversing using a given key.
void setAsConnected(const bool &connected)
TerraLib.
#define TEDATAACCESSEXPORT
You can use this macro in order to export/import classes and functions from this module.
Definition: Config.h:97