1*b1cdbd2cSJim Jagielski /**************************************************************
2*b1cdbd2cSJim Jagielski *
3*b1cdbd2cSJim Jagielski * Licensed to the Apache Software Foundation (ASF) under one
4*b1cdbd2cSJim Jagielski * or more contributor license agreements. See the NOTICE file
5*b1cdbd2cSJim Jagielski * distributed with this work for additional information
6*b1cdbd2cSJim Jagielski * regarding copyright ownership. The ASF licenses this file
7*b1cdbd2cSJim Jagielski * to you under the Apache License, Version 2.0 (the
8*b1cdbd2cSJim Jagielski * "License"); you may not use this file except in compliance
9*b1cdbd2cSJim Jagielski * with the License. You may obtain a copy of the License at
10*b1cdbd2cSJim Jagielski *
11*b1cdbd2cSJim Jagielski * http://www.apache.org/licenses/LICENSE-2.0
12*b1cdbd2cSJim Jagielski *
13*b1cdbd2cSJim Jagielski * Unless required by applicable law or agreed to in writing,
14*b1cdbd2cSJim Jagielski * software distributed under the License is distributed on an
15*b1cdbd2cSJim Jagielski * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
16*b1cdbd2cSJim Jagielski * KIND, either express or implied. See the License for the
17*b1cdbd2cSJim Jagielski * specific language governing permissions and limitations
18*b1cdbd2cSJim Jagielski * under the License.
19*b1cdbd2cSJim Jagielski *
20*b1cdbd2cSJim Jagielski *************************************************************/
21*b1cdbd2cSJim Jagielski
22*b1cdbd2cSJim Jagielski
23*b1cdbd2cSJim Jagielski
24*b1cdbd2cSJim Jagielski // MARKER(update_precomp.py): autogen include statement, do not remove
25*b1cdbd2cSJim Jagielski #include "precompiled_comphelper.hxx"
26*b1cdbd2cSJim Jagielski #include <com/sun/star/uno/XInterface.hpp>
27*b1cdbd2cSJim Jagielski #include <com/sun/star/container/XIndexAccess.hpp>
28*b1cdbd2cSJim Jagielski #include <com/sun/star/container/XChild.hpp>
29*b1cdbd2cSJim Jagielski #include <comphelper/container.hxx>
30*b1cdbd2cSJim Jagielski #include <osl/diagnose.h>
31*b1cdbd2cSJim Jagielski
32*b1cdbd2cSJim Jagielski //.........................................................................
33*b1cdbd2cSJim Jagielski namespace comphelper
34*b1cdbd2cSJim Jagielski {
35*b1cdbd2cSJim Jagielski //.........................................................................
36*b1cdbd2cSJim Jagielski
37*b1cdbd2cSJim Jagielski //==============================================================================
IndexAccessIterator(::com::sun::star::uno::Reference<::com::sun::star::uno::XInterface> xStartingPoint)38*b1cdbd2cSJim Jagielski IndexAccessIterator::IndexAccessIterator(::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface> xStartingPoint)
39*b1cdbd2cSJim Jagielski :m_xStartingPoint(xStartingPoint)
40*b1cdbd2cSJim Jagielski ,m_xCurrentObject(NULL)
41*b1cdbd2cSJim Jagielski {
42*b1cdbd2cSJim Jagielski OSL_ENSURE(m_xStartingPoint.is(), "IndexAccessIterator::IndexAccessIterator : no starting point !");
43*b1cdbd2cSJim Jagielski }
44*b1cdbd2cSJim Jagielski
~IndexAccessIterator()45*b1cdbd2cSJim Jagielski IndexAccessIterator::~IndexAccessIterator() {}
46*b1cdbd2cSJim Jagielski
47*b1cdbd2cSJim Jagielski //------------------------------------------------------------------------------
Next()48*b1cdbd2cSJim Jagielski ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface> IndexAccessIterator::Next()
49*b1cdbd2cSJim Jagielski {
50*b1cdbd2cSJim Jagielski sal_Bool bCheckingStartingPoint = !m_xCurrentObject.is();
51*b1cdbd2cSJim Jagielski // ist die aktuelle Node der Anfangspunkt ?
52*b1cdbd2cSJim Jagielski sal_Bool bAlreadyCheckedCurrent = m_xCurrentObject.is();
53*b1cdbd2cSJim Jagielski // habe ich die aktuelle Node schon mal mittels ShouldHandleElement testen ?
54*b1cdbd2cSJim Jagielski if (!m_xCurrentObject.is())
55*b1cdbd2cSJim Jagielski m_xCurrentObject = m_xStartingPoint;
56*b1cdbd2cSJim Jagielski
57*b1cdbd2cSJim Jagielski ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface> xSearchLoop( m_xCurrentObject);
58*b1cdbd2cSJim Jagielski sal_Bool bHasMoreToSearch = sal_True;
59*b1cdbd2cSJim Jagielski sal_Bool bFoundSomething = sal_False;
60*b1cdbd2cSJim Jagielski while (!bFoundSomething && bHasMoreToSearch)
61*b1cdbd2cSJim Jagielski {
62*b1cdbd2cSJim Jagielski // pre-order-traversierung
63*b1cdbd2cSJim Jagielski if (!bAlreadyCheckedCurrent && ShouldHandleElement(xSearchLoop))
64*b1cdbd2cSJim Jagielski {
65*b1cdbd2cSJim Jagielski m_xCurrentObject = xSearchLoop;
66*b1cdbd2cSJim Jagielski bFoundSomething = sal_True;
67*b1cdbd2cSJim Jagielski }
68*b1cdbd2cSJim Jagielski else
69*b1cdbd2cSJim Jagielski {
70*b1cdbd2cSJim Jagielski // zuerst absteigen, wenn moeglich
71*b1cdbd2cSJim Jagielski ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess> xContainerAccess(xSearchLoop, ::com::sun::star::uno::UNO_QUERY);
72*b1cdbd2cSJim Jagielski if (xContainerAccess.is() && xContainerAccess->getCount() && ShouldStepInto(xContainerAccess))
73*b1cdbd2cSJim Jagielski { // zum ersten Child
74*b1cdbd2cSJim Jagielski ::com::sun::star::uno::Any aElement(xContainerAccess->getByIndex(0));
75*b1cdbd2cSJim Jagielski xSearchLoop = *(::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface>*)aElement.getValue();
76*b1cdbd2cSJim Jagielski bCheckingStartingPoint = sal_False;
77*b1cdbd2cSJim Jagielski
78*b1cdbd2cSJim Jagielski m_arrChildIndizies.push_back((sal_Int32)0);
79*b1cdbd2cSJim Jagielski }
80*b1cdbd2cSJim Jagielski else
81*b1cdbd2cSJim Jagielski {
82*b1cdbd2cSJim Jagielski // dann nach oben und nach rechts, wenn moeglich
83*b1cdbd2cSJim Jagielski while (m_arrChildIndizies.size() > 0)
84*b1cdbd2cSJim Jagielski { // (mein Stack ist nich leer, also kann ich noch nach oben gehen)
85*b1cdbd2cSJim Jagielski ::com::sun::star::uno::Reference< ::com::sun::star::container::XChild> xChild(xSearchLoop, ::com::sun::star::uno::UNO_QUERY);
86*b1cdbd2cSJim Jagielski OSL_ENSURE(xChild.is(), "IndexAccessIterator::Next : a content has no approriate interface !");
87*b1cdbd2cSJim Jagielski
88*b1cdbd2cSJim Jagielski ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface> xParent( xChild->getParent());
89*b1cdbd2cSJim Jagielski xContainerAccess = ::com::sun::star::uno::Reference< ::com::sun::star::container::XIndexAccess>(xParent, ::com::sun::star::uno::UNO_QUERY);
90*b1cdbd2cSJim Jagielski OSL_ENSURE(xContainerAccess.is(), "IndexAccessIterator::Next : a content has an invalid parent !");
91*b1cdbd2cSJim Jagielski
92*b1cdbd2cSJim Jagielski // den Index, den SearchLoop in diesem Parent hatte, von meinem 'Stack'
93*b1cdbd2cSJim Jagielski sal_Int32 nOldSearchChildIndex = m_arrChildIndizies[m_arrChildIndizies.size() - 1];
94*b1cdbd2cSJim Jagielski m_arrChildIndizies.pop_back();
95*b1cdbd2cSJim Jagielski
96*b1cdbd2cSJim Jagielski if (nOldSearchChildIndex < xContainerAccess->getCount() - 1)
97*b1cdbd2cSJim Jagielski { // auf dieser Ebene geht es noch nach rechts
98*b1cdbd2cSJim Jagielski ++nOldSearchChildIndex;
99*b1cdbd2cSJim Jagielski // also das naechste Child
100*b1cdbd2cSJim Jagielski ::com::sun::star::uno::Any aElement(xContainerAccess->getByIndex(nOldSearchChildIndex));
101*b1cdbd2cSJim Jagielski xSearchLoop = *(::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface>*) aElement.getValue();
102*b1cdbd2cSJim Jagielski bCheckingStartingPoint = sal_False;
103*b1cdbd2cSJim Jagielski // und dessen Position auf den 'Stack'
104*b1cdbd2cSJim Jagielski m_arrChildIndizies.push_back((sal_Int32)nOldSearchChildIndex);
105*b1cdbd2cSJim Jagielski
106*b1cdbd2cSJim Jagielski break;
107*b1cdbd2cSJim Jagielski }
108*b1cdbd2cSJim Jagielski // hierher komme ich, wenn es auf der aktuellen Ebene nicht nach rechts geht, dann mache ich eine darueber weiter
109*b1cdbd2cSJim Jagielski xSearchLoop = xParent;
110*b1cdbd2cSJim Jagielski bCheckingStartingPoint = sal_False;
111*b1cdbd2cSJim Jagielski }
112*b1cdbd2cSJim Jagielski
113*b1cdbd2cSJim Jagielski if ((m_arrChildIndizies.size() == 0) && !bCheckingStartingPoint)
114*b1cdbd2cSJim Jagielski { // das ist genau dann der Fall, wenn ich keinen rechten Nachbarn fuer irgendeinen der direkten Vorfahren des
115*b1cdbd2cSJim Jagielski // urspruenglichen xSearchLoop gefunden habe
116*b1cdbd2cSJim Jagielski bHasMoreToSearch = sal_False;
117*b1cdbd2cSJim Jagielski }
118*b1cdbd2cSJim Jagielski }
119*b1cdbd2cSJim Jagielski
120*b1cdbd2cSJim Jagielski if (bHasMoreToSearch)
121*b1cdbd2cSJim Jagielski { // ich habe in xSearchLoop jetzt ein Interface eines 'Knotens' meines 'Baumes', den ich noch abtesten kann
122*b1cdbd2cSJim Jagielski if (ShouldHandleElement(xSearchLoop))
123*b1cdbd2cSJim Jagielski {
124*b1cdbd2cSJim Jagielski m_xCurrentObject = xSearchLoop;
125*b1cdbd2cSJim Jagielski bFoundSomething = sal_True;
126*b1cdbd2cSJim Jagielski }
127*b1cdbd2cSJim Jagielski else
128*b1cdbd2cSJim Jagielski if (bCheckingStartingPoint)
129*b1cdbd2cSJim Jagielski // ich bin noch am Anfang, konnte nicht absteigen, und habe an diesem Anfang nix gefunden -> nix mehr zu tun
130*b1cdbd2cSJim Jagielski bHasMoreToSearch = sal_False;
131*b1cdbd2cSJim Jagielski bAlreadyCheckedCurrent = sal_True;
132*b1cdbd2cSJim Jagielski }
133*b1cdbd2cSJim Jagielski }
134*b1cdbd2cSJim Jagielski }
135*b1cdbd2cSJim Jagielski
136*b1cdbd2cSJim Jagielski if (!bFoundSomething)
137*b1cdbd2cSJim Jagielski {
138*b1cdbd2cSJim Jagielski OSL_ENSURE(m_arrChildIndizies.size() == 0, "IndexAccessIterator::Next : items left on stack ! how this ?");
139*b1cdbd2cSJim Jagielski Invalidate();
140*b1cdbd2cSJim Jagielski }
141*b1cdbd2cSJim Jagielski
142*b1cdbd2cSJim Jagielski return m_xCurrentObject;
143*b1cdbd2cSJim Jagielski }
144*b1cdbd2cSJim Jagielski
145*b1cdbd2cSJim Jagielski //.........................................................................
146*b1cdbd2cSJim Jagielski } // namespace comphelper
147*b1cdbd2cSJim Jagielski //.........................................................................
148*b1cdbd2cSJim Jagielski
149*b1cdbd2cSJim Jagielski
150