/usr/include/opencascade/TDataStd_ChildNodeIterator.hxx is in libopencascade-ocaf-lite-dev 6.5.0.dfsg-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 | // This file is generated by WOK (CPPExt).
// Please do not edit this file; modify original file instead.
// The copyright and license terms as defined for the original file apply to
// this header file considered to be the "object code" form of the original source.
#ifndef _TDataStd_ChildNodeIterator_HeaderFile
#define _TDataStd_ChildNodeIterator_HeaderFile
#ifndef _Standard_HeaderFile
#include <Standard.hxx>
#endif
#ifndef _Standard_Macro_HeaderFile
#include <Standard_Macro.hxx>
#endif
#ifndef _Handle_TDataStd_TreeNode_HeaderFile
#include <Handle_TDataStd_TreeNode.hxx>
#endif
#ifndef _Standard_Integer_HeaderFile
#include <Standard_Integer.hxx>
#endif
#ifndef _Standard_Boolean_HeaderFile
#include <Standard_Boolean.hxx>
#endif
class TDataStd_TreeNode;
//! Iterates on the ChildStepren step of a step, at the <br>
//! first level only. It is possible to ask the <br>
//! iterator to explore all the sub step levels of the <br>
//! given one, with the option "allLevels". <br>
class TDataStd_ChildNodeIterator {
public:
void* operator new(size_t,void* anAddress)
{
return anAddress;
}
void* operator new(size_t size)
{
return Standard::Allocate(size);
}
void operator delete(void *anAddress)
{
if (anAddress) Standard::Free((Standard_Address&)anAddress);
}
//! Creates an empty iterator. <br>
Standard_EXPORT TDataStd_ChildNodeIterator();
//! Iterates on the ChildStepren of the given Step. If <br>
//! <allLevels> option is set to true, it explores not <br>
//! only the first, but all the sub Step levels. <br>
Standard_EXPORT TDataStd_ChildNodeIterator(const Handle(TDataStd_TreeNode)& aTreeNode,const Standard_Boolean allLevels = Standard_False);
//! Initializes the iteration on the Children Step of <br>
//! the given Step. If <allLevels> option is set to <br>
//! true, it explores not only the first, but all the <br>
//! sub Step levels. <br>
Standard_EXPORT void Initialize(const Handle(TDataStd_TreeNode)& aTreeNode,const Standard_Boolean allLevels = Standard_False) ;
//! Returns True if there is a current Item in the <br>
//! iteration. <br>
Standard_Boolean More() const;
//! Move to the next Item <br>
Standard_EXPORT void Next() ;
//! Move to the next Brother. If there is none, go up <br>
//! etc. This method is interesting only with <br>
//! "allLevels" behavior, because it avoids to explore <br>
//! the current Step ChildStepren. <br>
Standard_EXPORT void NextBrother() ;
//! Returns the current item; a null Step if there is <br>
//! no one. <br>
Handle_TDataStd_TreeNode Value() const;
protected:
private:
Handle_TDataStd_TreeNode myNode;
Standard_Integer myFirstLevel;
};
#include <TDataStd_ChildNodeIterator.lxx>
// other Inline functions and methods (like "C++: function call" methods)
#endif
|