1
0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-04-26 10:19:45 +03:00
occt/src/DDataStd/DDataStd_TreeBrowser.cxx

223 lines
7.2 KiB
C++

// Created by: DAUTRY Philippe
// Copyright (c) 1997-1999 Matra Datavision
// Copyright (c) 1999-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.
// --------------------
// Version: 0.0
//Version Date Purpose
// 0.0 Nov 27 1997 Creation
#include <DDataStd.hxx>
#include <DDataStd_TreeBrowser.hxx>
#include <Draw_Display.hxx>
#include <Draw_Drawable3D.hxx>
#include <Standard_Type.hxx>
#include <TCollection_AsciiString.hxx>
#include <TDataStd_Name.hxx>
#include <TDataStd_TreeNode.hxx>
#include <TDF.hxx>
#include <TDF_Label.hxx>
#include <TDF_Tool.hxx>
IMPLEMENT_STANDARD_RTTIEXT(DDataStd_TreeBrowser,Draw_Drawable3D)
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
// Communication convention with tcl:
// tcl waits for a string of characters, being an information list.
// In this list, each item is separated from another by a separator: '\'.
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
#define TDF_BrowserSeparator1 '\\'
#define TDF_BrowserSeparator2 ' '
#define TDF_BrowserSeparator3 '#'
#define TDF_BrowserSeparator4 ','
//=======================================================================
//function : DDesign_TreeNodeBrowser
//purpose :
//=======================================================================
DDataStd_TreeBrowser::DDataStd_TreeBrowser(const TDF_Label& aLabel)
: myRoot(aLabel)
{}
//=======================================================================
//function : DrawOn
//purpose :
//=======================================================================
void DDataStd_TreeBrowser::DrawOn(Draw_Display& /*dis*/) const
{ std::cout<<"DDataStd_TreeBrowser"<<std::endl; }
//=======================================================================
//function : Copy
//purpose :
//=======================================================================
Handle(Draw_Drawable3D) DDataStd_TreeBrowser::Copy() const
{ return new DDataStd_TreeBrowser(myRoot); }
//=======================================================================
//function : Dump
//purpose :
//=======================================================================
void DDataStd_TreeBrowser::Dump(Standard_OStream& S) const
{
S<<"DDataStd_TreeBrowser on a label: "<<std::endl;
S<<myRoot;
}
//=======================================================================
//function : Whatis
//purpose :
//=======================================================================
void DDataStd_TreeBrowser::Whatis(Draw_Interpretor& I) const
{ I<<"function browser"; }
//=======================================================================
//function : Label
//purpose :
//=======================================================================
void DDataStd_TreeBrowser::Label(const TDF_Label& aLabel)
{ myRoot = aLabel; }
//=======================================================================
//function : Label
//purpose :
//=======================================================================
TDF_Label DDataStd_TreeBrowser::Label() const
{ return myRoot; }
//=======================================================================
//function : OpenRoot
//purpose :
//=======================================================================
TCollection_AsciiString DDataStd_TreeBrowser::OpenRoot() const
{
TCollection_AsciiString list;
Handle(TDataStd_TreeNode) TN;
if (myRoot.FindAttribute (TDataStd_TreeNode::GetDefaultTreeID(),TN)) {
OpenNode(TN,list);
}
return list;
}
//=======================================================================
//function : OpenNode
//purpose :
// the items are separated by "\\".
//=======================================================================
TCollection_AsciiString DDataStd_TreeBrowser::OpenNode(const TDF_Label& aLabel) const
{
TCollection_AsciiString list;
Handle(TDataStd_TreeNode) nodeToOpen;
if (aLabel.FindAttribute(TDataStd_TreeNode::GetDefaultTreeID(), nodeToOpen)) {
Standard_Boolean split = Standard_False;
Handle(TDataStd_TreeNode) current = nodeToOpen->First();
while (!current.IsNull()) {
if (split) list.AssignCat(TDF_BrowserSeparator1);
OpenNode(current,list);
split = Standard_True;
current = current->Next();
}
}
return list;
}
//=======================================================================
//function : OpenNode
//purpose :
// An item is composed as follows:
// "LabelEntry "Name" DynamicType Executable|Forgotten Failed|Success First|Null [ LabelFather]"
// First/Null : has/has not child
//=======================================================================
void DDataStd_TreeBrowser::OpenNode (const Handle(TDataStd_TreeNode)& aTreeNode,
TCollection_AsciiString& aList) const
{
// Label entry. -0
TCollection_AsciiString tmp;
TDF_Tool::Entry(aTreeNode->Label(),tmp);
aList.AssignCat(tmp);
// Name -1
aList.AssignCat(TDF_BrowserSeparator2);
Handle(TDataStd_Name) name;
aList.AssignCat("\"");
if (aTreeNode->Label().FindAttribute(TDataStd_Name::GetID(),name)) {
aList.AssignCat(name->Get());
}
aList.AssignCat("\"");
// Dynamic type. -2
aList.AssignCat(TDF_BrowserSeparator2);
TCollection_ExtendedString ext;
if (TDF::ProgIDFromGUID(aTreeNode->ID(), ext))
aList.AssignCat(ext);
else aList.AssignCat(aTreeNode->DynamicType()->Name());
// Executable or Forgotten? -3
// aList.AssignCat(TDF_BrowserSeparator2);
// if (aTreeNode->IsExecutable()) aList.AssignCat("Executable");
// else aList.AssignCat("Forgotten");
// Failed or Success? -4
// aList.AssignCat(TDF_BrowserSeparator2);
// if (aTreeNode->Failed()) aList.AssignCat("Failed");
// else aList.AssignCat("Success");
//Children? -3
aList.AssignCat(TDF_BrowserSeparator2);
if (aTreeNode->First().IsNull()) aList.AssignCat("Null");
else aList.AssignCat("First");
// Father? -4
aList.AssignCat(TDF_BrowserSeparator2);
if (!aTreeNode->HasFather()) aList.AssignCat("Null");
else {
TDF_Tool::Entry(aTreeNode->Father()->Label(),tmp);
aList.AssignCat(tmp);
}
// First? -5
aList.AssignCat(TDF_BrowserSeparator2);
if (!aTreeNode->HasFirst()) aList.AssignCat("Null");
else {
TDF_Tool::Entry(aTreeNode->First()->Label(),tmp);
aList.AssignCat(tmp);
}
// Next? -6
aList.AssignCat(TDF_BrowserSeparator2);
if (!aTreeNode->HasNext()) aList.AssignCat("Null");
else {
TDF_Tool::Entry(aTreeNode->Next()->Label(),tmp);
aList.AssignCat(tmp);
}
// Previous? -7
aList.AssignCat(TDF_BrowserSeparator2);
if (!aTreeNode->HasPrevious()) aList.AssignCat("Null");
else {
TDF_Tool::Entry(aTreeNode->Previous()->Label(),tmp);
aList.AssignCat(tmp);
}
}