1
0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-07-15 12:35:51 +03:00
occt/src/TDataStd/TDataStd_ChildNodeIterator.cxx
nds bc73b00672 0031313: Foundation Classes - Dump improvement for classes
- Provide DumpJson for geometrical, ocaf and visualization classes;
- Change depth parameter of DumpJson (constant is not obligate here)
- Introduce a new macro for transient objects to be called as the first row in DumpJson: OCCT_DUMP_TRANSIENT_CLASS_BEGIN. We need not put the class name in the macro, using get_type_name of Standard_Transient for it.
- change implementation of OCCT_DUMP_CLASS_BEGIN and OCCT_DUMP_TRANSIENT_CLASS_BEGIN. It is not an sentry more and it does not create a new hierarchy level. It appends a new row into the output stream: "className": <className>
- OCCT_DUMP_* does not require semicolon
- class header is included first in source files of TDataStd, TDocStd, TCAFDoc
2020-01-31 17:13:40 +03:00

88 lines
2.9 KiB
C++

// Created on: 2000-01-26
// Created by: Denis PASCAL
// Copyright (c) 2000-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.1 as published
// by the Free Software Foundation, with special exception defined in the file
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
// distribution for complete text of the license and disclaimer of any warranty.
//
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
#include <TDataStd_ChildNodeIterator.hxx>
#include <TDataStd_TreeNode.hxx>
#define ChildNodeIterator_UpToBrother \
{ \
while (!myNode.IsNull() && (myNode->Depth() > myFirstLevel) && myNode->myNext == NULL) \
myNode = myNode->myFather; \
if (!myNode.IsNull() && (myNode->Depth() > myFirstLevel) && myNode->myFather != NULL) \
myNode = myNode->myNext; \
else \
myNode = NULL; \
}
//=======================================================================
//function : TDataStd_ChildNodeIterator
//purpose :
//=======================================================================
TDataStd_ChildNodeIterator::TDataStd_ChildNodeIterator()
: myFirstLevel(0)
{}
//=======================================================================
//function : TDataStd_ChildNodeIterator
//purpose :
//=======================================================================
TDataStd_ChildNodeIterator::TDataStd_ChildNodeIterator (const Handle(TDataStd_TreeNode)& aTreeNode,
const Standard_Boolean allLevels)
: myNode(aTreeNode->myFirst),
myFirstLevel(allLevels ? aTreeNode->Depth() : -1)
{}
//=======================================================================
//function : Initialize
//purpose :
//=======================================================================
void TDataStd_ChildNodeIterator::Initialize(const Handle(TDataStd_TreeNode)& aTreeNode,
const Standard_Boolean allLevels)
{
myNode = aTreeNode->myFirst;
myFirstLevel = allLevels ? aTreeNode->Depth() : -1;
}
//=======================================================================
//function : Next
//purpose :
//=======================================================================
void TDataStd_ChildNodeIterator::Next()
{
if (myFirstLevel == -1) {
myNode = myNode->myNext;
}
else {
if (myNode->myFirst != NULL) myNode = myNode->myFirst;
else ChildNodeIterator_UpToBrother;
}
}
//=======================================================================
//function : NextBrother
//purpose :
//=======================================================================
void TDataStd_ChildNodeIterator::NextBrother()
{
if (myNode->myNext != NULL) myNode = myNode->myNext;
else ChildNodeIterator_UpToBrother;
}