blob: 6e2759fdea2b79ed1be9e97aeb2c1f1a194d6d81 (
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/****************************************************************************
**
** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qdaytimeduration_p.h"
#include "qfocus_p.h"
QT_BEGIN_NAMESPACE
using namespace QPatternist;
Focus::Focus(const DynamicContext::Ptr &prevContext) : DelegatingDynamicContext(prevContext),
m_contextSizeCached(-1)
{
Q_ASSERT(prevContext);
Q_ASSERT(prevContext != this);
}
xsInteger Focus::contextPosition() const
{
Q_ASSERT(m_focusIterator);
return m_focusIterator->position();
}
Item Focus::contextItem() const
{
Q_ASSERT(m_focusIterator);
return m_focusIterator->current();
}
xsInteger Focus::contextSize()
{
Q_ASSERT(m_focusIterator);
if(m_contextSizeCached == -1)
m_contextSizeCached = m_focusIterator->copy()->count();
Q_ASSERT_X(m_contextSizeCached == m_focusIterator->copy()->count(), Q_FUNC_INFO,
"If our cache is not the same as the real count, something is wrong.");
return m_contextSizeCached;
}
void Focus::setFocusIterator(const Item::Iterator::Ptr &it)
{
Q_ASSERT(it);
m_focusIterator = it;
}
Item::Iterator::Ptr Focus::focusIterator() const
{
return m_focusIterator;
}
Item Focus::currentItem() const
{
/* In the case that there is no top level expression that creates a focus,
* fn:current() should return the focus. This logic achieves this.
* Effectively we traverse up our "context stack" through recursion, and
* start returning when we've found the top most focus. */
const Item current(m_prevContext->currentItem());
if(current.isNull())
return m_focusIterator->current();
else
return current;
}
QT_END_NAMESPACE
|
