| 1 | /****************************************************************************
|
|---|
| 2 | **
|
|---|
| 3 | ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
|---|
| 4 | ** Contact: Qt Software Information (qt-info@nokia.com)
|
|---|
| 5 | **
|
|---|
| 6 | ** This file is part of the QtXmlPatterns module of the Qt Toolkit.
|
|---|
| 7 | **
|
|---|
| 8 | ** $QT_BEGIN_LICENSE:LGPL$
|
|---|
| 9 | ** Commercial Usage
|
|---|
| 10 | ** Licensees holding valid Qt Commercial licenses may use this file in
|
|---|
| 11 | ** accordance with the Qt Commercial License Agreement provided with the
|
|---|
| 12 | ** Software or, alternatively, in accordance with the terms contained in
|
|---|
| 13 | ** a written agreement between you and Nokia.
|
|---|
| 14 | **
|
|---|
| 15 | ** GNU Lesser General Public License Usage
|
|---|
| 16 | ** Alternatively, this file may be used under the terms of the GNU Lesser
|
|---|
| 17 | ** General Public License version 2.1 as published by the Free Software
|
|---|
| 18 | ** Foundation and appearing in the file LICENSE.LGPL included in the
|
|---|
| 19 | ** packaging of this file. Please review the following information to
|
|---|
| 20 | ** ensure the GNU Lesser General Public License version 2.1 requirements
|
|---|
| 21 | ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
|---|
| 22 | **
|
|---|
| 23 | ** In addition, as a special exception, Nokia gives you certain
|
|---|
| 24 | ** additional rights. These rights are described in the Nokia Qt LGPL
|
|---|
| 25 | ** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
|
|---|
| 26 | ** package.
|
|---|
| 27 | **
|
|---|
| 28 | ** GNU General Public License Usage
|
|---|
| 29 | ** Alternatively, this file may be used under the terms of the GNU
|
|---|
| 30 | ** General Public License version 3.0 as published by the Free Software
|
|---|
| 31 | ** Foundation and appearing in the file LICENSE.GPL included in the
|
|---|
| 32 | ** packaging of this file. Please review the following information to
|
|---|
| 33 | ** ensure the GNU General Public License version 3.0 requirements will be
|
|---|
| 34 | ** met: http://www.gnu.org/copyleft/gpl.html.
|
|---|
| 35 | **
|
|---|
| 36 | ** If you are unsure which license is appropriate for your use, please
|
|---|
| 37 | ** contact the sales department at qt-sales@nokia.com.
|
|---|
| 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
|
|---|