1 | /**************************************************************************** |
2 | ** |
3 | ** Copyright (C) 2016 The Qt Company Ltd. |
4 | ** Contact: https://www.qt.io/licensing/ |
5 | ** |
6 | ** This file is part of the QtXmlPatterns module of the Qt Toolkit. |
7 | ** |
8 | ** $QT_BEGIN_LICENSE:LGPL$ |
9 | ** Commercial License Usage |
10 | ** Licensees holding valid commercial Qt licenses may use this file in |
11 | ** accordance with the commercial license agreement provided with the |
12 | ** Software or, alternatively, in accordance with the terms contained in |
13 | ** a written agreement between you and The Qt Company. For licensing terms |
14 | ** and conditions see https://www.qt.io/terms-conditions. For further |
15 | ** information use the contact form at https://www.qt.io/contact-us. |
16 | ** |
17 | ** GNU Lesser General Public License Usage |
18 | ** Alternatively, this file may be used under the terms of the GNU Lesser |
19 | ** General Public License version 3 as published by the Free Software |
20 | ** Foundation and appearing in the file LICENSE.LGPL3 included in the |
21 | ** packaging of this file. Please review the following information to |
22 | ** ensure the GNU Lesser General Public License version 3 requirements |
23 | ** will be met: https://www.gnu.org/licenses/lgpl-3.0.html. |
24 | ** |
25 | ** GNU General Public License Usage |
26 | ** Alternatively, this file may be used under the terms of the GNU |
27 | ** General Public License version 2.0 or (at your option) the GNU General |
28 | ** Public license version 3 or any later version approved by the KDE Free |
29 | ** Qt Foundation. The licenses are as published by the Free Software |
30 | ** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3 |
31 | ** included in the packaging of this file. Please review the following |
32 | ** information to ensure the GNU General Public License requirements will |
33 | ** be met: https://www.gnu.org/licenses/gpl-2.0.html and |
34 | ** https://www.gnu.org/licenses/gpl-3.0.html. |
35 | ** |
36 | ** $QT_END_LICENSE$ |
37 | ** |
38 | ****************************************************************************/ |
39 | |
40 | #include "qdaytimeduration_p.h" |
41 | |
42 | #include "qfocus_p.h" |
43 | |
44 | QT_BEGIN_NAMESPACE |
45 | |
46 | using namespace QPatternist; |
47 | |
48 | Focus::Focus(const DynamicContext::Ptr &prevContext) : DelegatingDynamicContext(prevContext), |
49 | m_contextSizeCached(-1) |
50 | { |
51 | Q_ASSERT(prevContext); |
52 | Q_ASSERT(prevContext != this); |
53 | } |
54 | |
55 | xsInteger Focus::contextPosition() const |
56 | { |
57 | Q_ASSERT(m_focusIterator); |
58 | return m_focusIterator->position(); |
59 | } |
60 | |
61 | Item Focus::contextItem() const |
62 | { |
63 | Q_ASSERT(m_focusIterator); |
64 | return m_focusIterator->current(); |
65 | } |
66 | |
67 | xsInteger Focus::contextSize() |
68 | { |
69 | Q_ASSERT(m_focusIterator); |
70 | if(m_contextSizeCached == -1) |
71 | m_contextSizeCached = m_focusIterator->copy()->count(); |
72 | |
73 | Q_ASSERT_X(m_contextSizeCached == m_focusIterator->copy()->count(), Q_FUNC_INFO, |
74 | "If our cache is not the same as the real count, something is wrong." ); |
75 | |
76 | return m_contextSizeCached; |
77 | } |
78 | |
79 | void Focus::setFocusIterator(const Item::Iterator::Ptr &it) |
80 | { |
81 | Q_ASSERT(it); |
82 | m_focusIterator = it; |
83 | } |
84 | |
85 | Item::Iterator::Ptr Focus::focusIterator() const |
86 | { |
87 | return m_focusIterator; |
88 | } |
89 | |
90 | Item Focus::currentItem() const |
91 | { |
92 | /* In the case that there is no top level expression that creates a focus, |
93 | * fn:current() should return the focus. This logic achieves this. |
94 | * Effectively we traverse up our "context stack" through recursion, and |
95 | * start returning when we've found the top most focus. */ |
96 | |
97 | const Item current(m_prevContext->currentItem()); |
98 | |
99 | if(current.isNull()) |
100 | return m_focusIterator->current(); |
101 | else |
102 | return current; |
103 | } |
104 | |
105 | QT_END_NAMESPACE |
106 | |