1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: TSkipDeletedSet.hxx,v $
* $Revision: 1.7 $
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef CONNECTIVITY_SKIPDELETEDSSET_HXX
#define CONNECTIVITY_SKIPDELETEDSSET_HXX
#include "TResultSetHelper.hxx"
#include <rtl/alloc.h>
#include <map>
#include <vector>
namespace connectivity
{
/**
the class OSkipDeletedSet supports a general method to skip deleted rows
*/
class OSkipDeletedSet
{
typedef ::std::map<sal_Int32,sal_Int32> TInt2IntMap;
TInt2IntMap m_aBookmarks; // map from postion to logical position
::std::vector<TInt2IntMap::iterator> m_aBookmarksPositions;// vector of iterators to position map, the order is the logical position
IResultSetHelper* m_pHelper; // used for moving in the resultset
sal_Bool moveAbsolute(sal_Int32 _nOffset,sal_Bool _bRetrieveData);
public:
OSkipDeletedSet(IResultSetHelper* _pHelper);
~OSkipDeletedSet();
inline static void * SAL_CALL operator new( size_t nSize ) SAL_THROW( () )
{ return ::rtl_allocateMemory( nSize ); }
inline static void * SAL_CALL operator new( size_t,void* _pHint ) SAL_THROW( () )
{ return _pHint; }
inline static void SAL_CALL operator delete( void * pMem ) SAL_THROW( () )
{ ::rtl_freeMemory( pMem ); }
inline static void SAL_CALL operator delete( void *,void* ) SAL_THROW( () )
{ }
/**
skipDeleted moves the resultset to the position defined by the parameters
it garantees that the row isn't deleted
@param
IResultSetHelper::Movement _eCursorPosition in which direction the resultset should be moved
sal_Int32 _nOffset the position relativ to the movement
sal_Bool _bRetrieveData is true when the current row should be filled which data
@return
true when the movement was successful otherwise false
*/
sal_Bool skipDeleted(IResultSetHelper::Movement _eCursorPosition, sal_Int32 _nOffset, sal_Bool _bRetrieveData);
/**
clear the map and the vector used in this class
*/
void clear();
/**
getMappedPosition returns the mapped position of a logical position
@param
sal_Int32 _nPos the logical position
@return the mapped position
*/
sal_Int32 getMappedPosition(sal_Int32 _nPos) const;
/**
insertNewPosition adds a new position to the map
@param
sal_Int32 _nPos the logical position
*/
void insertNewPosition(sal_Int32 _nPos);
/**
deletePosition deletes this position from the map and decrement all following positions
@param
sal_Int32 _nPos the logical position
*/
void deletePosition(sal_Int32 _nPos);
/**
getLastPosition returns the last position
@return the last position
*/
sal_Int32 getLastPosition() const { return m_aBookmarksPositions.size(); }
};
}
#endif // CONNECTIVITY_SKIPDELETEDSSET_HXX
|
