mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-06-05 11:24:17 +03:00
a5a7b3185b
Update empty method guards to new style with regex (see PR). Used clang-format 18.1.8. New actions to validate code formatting is added. Update .clang-format with disabling of include sorting. It is temporary changes, then include will be sorted. Apply formatting for /src and /tools folder. The files with .hxx,.cxx,.lxx,.h,.pxx,.hpp,*.cpp extensions.
81 lines
3.1 KiB
C++
81 lines
3.1 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; \
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
TDataStd_ChildNodeIterator::TDataStd_ChildNodeIterator()
|
|
: myFirstLevel(0)
|
|
{
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
TDataStd_ChildNodeIterator::TDataStd_ChildNodeIterator(const Handle(TDataStd_TreeNode)& aTreeNode,
|
|
const Standard_Boolean allLevels)
|
|
: myNode(aTreeNode->myFirst),
|
|
myFirstLevel(allLevels ? aTreeNode->Depth() : -1)
|
|
{
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
void TDataStd_ChildNodeIterator::Initialize(const Handle(TDataStd_TreeNode)& aTreeNode,
|
|
const Standard_Boolean allLevels)
|
|
{
|
|
myNode = aTreeNode->myFirst;
|
|
myFirstLevel = allLevels ? aTreeNode->Depth() : -1;
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
void TDataStd_ChildNodeIterator::Next()
|
|
{
|
|
if (myFirstLevel == -1)
|
|
{
|
|
myNode = myNode->myNext;
|
|
}
|
|
else
|
|
{
|
|
if (myNode->myFirst != NULL)
|
|
myNode = myNode->myFirst;
|
|
else
|
|
ChildNodeIterator_UpToBrother;
|
|
}
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
void TDataStd_ChildNodeIterator::NextBrother()
|
|
{
|
|
if (myNode->myNext != NULL)
|
|
myNode = myNode->myNext;
|
|
else
|
|
ChildNodeIterator_UpToBrother;
|
|
}
|