|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 ** |
|
7 ** This file is part of the QtXmlPatterns module of the Qt Toolkit. |
|
8 ** |
|
9 ** $QT_BEGIN_LICENSE:LGPL$ |
|
10 ** No Commercial Usage |
|
11 ** This file contains pre-release code and may not be distributed. |
|
12 ** You may use this file in accordance with the terms and conditions |
|
13 ** contained in the Technology Preview License Agreement accompanying |
|
14 ** this package. |
|
15 ** |
|
16 ** GNU Lesser General Public License Usage |
|
17 ** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 ** General Public License version 2.1 as published by the Free Software |
|
19 ** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 ** packaging of this file. Please review the following information to |
|
21 ** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 ** |
|
24 ** In addition, as a special exception, Nokia gives you certain additional |
|
25 ** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 ** |
|
28 ** If you have questions regarding the use of this file, please contact |
|
29 ** Nokia at qt-info@nokia.com. |
|
30 ** |
|
31 ** |
|
32 ** |
|
33 ** |
|
34 ** |
|
35 ** |
|
36 ** |
|
37 ** |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 |
|
42 #include "qdaytimeduration_p.h" |
|
43 |
|
44 #include "qfocus_p.h" |
|
45 |
|
46 QT_BEGIN_NAMESPACE |
|
47 |
|
48 using namespace QPatternist; |
|
49 |
|
50 Focus::Focus(const DynamicContext::Ptr &prevContext) : DelegatingDynamicContext(prevContext), |
|
51 m_contextSizeCached(-1) |
|
52 { |
|
53 Q_ASSERT(prevContext); |
|
54 Q_ASSERT(prevContext != this); |
|
55 } |
|
56 |
|
57 xsInteger Focus::contextPosition() const |
|
58 { |
|
59 Q_ASSERT(m_focusIterator); |
|
60 return m_focusIterator->position(); |
|
61 } |
|
62 |
|
63 Item Focus::contextItem() const |
|
64 { |
|
65 Q_ASSERT(m_focusIterator); |
|
66 return m_focusIterator->current(); |
|
67 } |
|
68 |
|
69 xsInteger Focus::contextSize() |
|
70 { |
|
71 Q_ASSERT(m_focusIterator); |
|
72 if(m_contextSizeCached == -1) |
|
73 m_contextSizeCached = m_focusIterator->copy()->count(); |
|
74 |
|
75 Q_ASSERT_X(m_contextSizeCached == m_focusIterator->copy()->count(), Q_FUNC_INFO, |
|
76 "If our cache is not the same as the real count, something is wrong."); |
|
77 |
|
78 return m_contextSizeCached; |
|
79 } |
|
80 |
|
81 void Focus::setFocusIterator(const Item::Iterator::Ptr &it) |
|
82 { |
|
83 Q_ASSERT(it); |
|
84 m_focusIterator = it; |
|
85 } |
|
86 |
|
87 Item::Iterator::Ptr Focus::focusIterator() const |
|
88 { |
|
89 return m_focusIterator; |
|
90 } |
|
91 |
|
92 Item Focus::currentItem() const |
|
93 { |
|
94 /* In the case that there is no top level expression that creates a focus, |
|
95 * fn:current() should return the focus. This logic achieves this. |
|
96 * Effectively we traverse up our "context stack" through recursion, and |
|
97 * start returning when we've found the top most focus. */ |
|
98 |
|
99 const Item current(m_prevContext->currentItem()); |
|
100 |
|
101 if(current.isNull()) |
|
102 return m_focusIterator->current(); |
|
103 else |
|
104 return current; |
|
105 } |
|
106 |
|
107 QT_END_NAMESPACE |