1 // Copyright (C) 2007-2008 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
23 * Check all methods of SALOMEDS_ChildIterator
24 * Use code of SALOMEDS_ChildIterator.cxx
26 void SALOMEDSTest::testChildIterator()
28 //Create or find the Study manager
29 _PTR(StudyManager) sm ( new SALOMEDS_StudyManager(_sm) );
34 _PTR(Study) study = sm->NewStudy("Test");
36 CPPUNIT_ASSERT(study);
38 //Create Study Builder
39 _PTR(StudyBuilder) studyBuilder = study->NewBuilder();
41 CPPUNIT_ASSERT(studyBuilder);
43 //Create a SObject with entry 0:1:1
44 _PTR(SObject) so = study->CreateObjectID("0:1:1");
48 _PTR(SObject) so1 = studyBuilder->NewObjectToTag(so, 1);
49 studyBuilder->NewObjectToTag(so1, 2);
51 _PTR(ChildIterator) ci = study->NewChildIterator(so);
53 //Check the creation of the ChildIterator
57 for(; ci->More(); ci->Next()) {
59 CPPUNIT_ASSERT(ci->Value()->Tag() == 1);
63 //Check that there is only one SObject on the first level of so
64 CPPUNIT_ASSERT(count == 1);
68 for(ci->InitEx(true); ci->More(); ci->Next(), i++) {
69 CPPUNIT_ASSERT(ci->Value()->Tag() == i);
73 //Check that there are two SObject under so
74 CPPUNIT_ASSERT(count == 2);