//
// 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 version 2.1 as published
+// 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.
}
if (Father()->HasFirst()) {
- if (Handle(TDataStd_TreeNode)::DownCast(this) == Father()->First()) {
+ if (this == Father()->First().operator->()) {
if (HasNext()) {
Father()->SetFirst(Next());
}
}
if(Father()->HasLast()) {
- if (Handle(TDataStd_TreeNode)::DownCast(this) == Father()->Last()) {
- if(HasPrevious()) {
- Father()->SetLast(Previous());
- }
- else Father()->SetLast(bid);
- }
+ Father()->SetLast(bid);
}
SetFather(bid);
anOS<<" First=";
if (!myFirst->Label().IsNull()) myFirst->Label().EntryDump(anOS);
}
+ if (myLast) {
+ anOS<<" Last=";
+ if (!myLast->Label().IsNull()) myLast->Label().EntryDump(anOS);
+ }
anOS<<endl;
return anOS;
}