blob: 7df7bae6b9f548dd583219493718f9b98deff09a (
plain)
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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include "RowSetCacheIterator.hxx"
#include "RowSetCache.hxx"
#include "RowSetBase.hxx"
using namespace dbaccess;
ORowSetCacheIterator::ORowSetCacheIterator(const ORowSetCacheIterator& _rRH)
: m_aIter(_rRH.m_aIter)
, m_pCache(_rRH.m_pCache)
,m_pRowSet(_rRH.m_pRowSet)
{
}
ORowSetCacheIterator::operator ORowSetMatrix::iterator const &()
{
return m_aIter->second.aIterator;
}
ORowSetCacheIterator& ORowSetCacheIterator::operator =(const ORowSetCacheIterator& _rRH)
{
if(this == &_rRH)
return *this;
m_pCache = _rRH.m_pCache;
m_aIter = _rRH.m_aIter;
m_pRowSet = _rRH.m_pRowSet;
return *this;
}
ORowSetCacheIterator& ORowSetCacheIterator::operator =(const ORowSetMatrix::iterator& _rIter)
{
m_aIter->second.aIterator = _rIter;
return *this;
}
ORowSetRow& ORowSetCacheIterator::operator *()
{
return *m_aIter->second.aIterator;
}
ORowSetMatrix::iterator& ORowSetCacheIterator::operator ->()
{
return m_aIter->second.aIterator;
}
bool ORowSetCacheIterator::operator <(const ORowSetMatrix::iterator& _rRH) const
{
return m_aIter->second.aIterator < _rRH;
}
bool ORowSetCacheIterator::operator !=(const ORowSetMatrix::iterator& _rRH) const
{
return m_aIter->second.aIterator != _rRH;
}
bool ORowSetCacheIterator::isNull() const
{
bool bRet = !m_pCache || !m_pRowSet || m_aIter == m_pCache->m_aCacheIterators.end();
if ( !bRet )
{
bRet = ( m_pRowSet->isInsertRow()
?
m_aIter->second.aIterator == m_pCache->m_pInsertMatrix->end()
:
m_aIter->second.aIterator == m_pCache->m_pMatrix->end()
);
}
return bRet;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
