PartitionTool.cpp File Reference

#include "PartitionTool.hpp"
#include "DLIList.hpp"
#include "GfxDebug.hpp"
#include "GMem.hpp"
#include "CastTo.hpp"
#include "Body.hpp"
#include "RefFace.hpp"
#include "RefEdge.hpp"
#include "RefVertex.hpp"
#include "Loop.hpp"
#include "Chain.hpp"
#include "Shell.hpp"
#include "CoEdge.hpp"
#include "CoVertex.hpp"
#include "CoFace.hpp"
#include "CoVolume.hpp"
#include "Point.hpp"
#include "Curve.hpp"
#include "IntersectionTool.hpp"
#include "ModelQueryEngine.hpp"
#include "PartitionLump.hpp"
#include "PartitionSurface.hpp"
#include "PartitionCurve.hpp"
#include "PartPTCurve.hpp"
#include "PartitionPoint.hpp"
#include "PartitionLoop.hpp"
#include "PartitionCoEdge.hpp"
#include "SegmentedCurve.hpp"
#include "CompositeTool.hpp"
#include "CompositeEngine.hpp"
#include "CompositePoint.hpp"
#include "GeometryUtil.hpp"
#include "RefEntityName.hpp"
#include "PartitionEngine.hpp"
#include "BodySM.hpp"
#include "SubCurve.hpp"
#include "RefEntityFactory.hpp"
#include "GeometryQueryTool.hpp"
#include "MergeTool.hpp"
#include "CubitUndo.hpp"
#include "TDUPtr.hpp"
#include <vector>
#include "AppUtil.hpp"
#include "GeometryEvent.hpp"

Go to the source code of this file.

Classes
struct	LoopIntersection
Functions
void	pt_print_bte_list (int debug_flag, DLIList< BasicTopologyEntity * > &edges, const char *trailing_string="\n")
void	pt_print_edge_list (int debug_flag, DLIList< RefEdge * > &edges, const char *trailing_string="\n")
void	pt_print_face_list (int debug_flag, DLIList< RefFace * > &faces, const char *trailing_string="\n")
void	pt_print_loop (int debug_flag, Loop *loop_ptr, const char *trailing_string="\n")
void	pt_print_shell (int debug_flag, Shell *shell_ptr, const char *trailing_string="\n")

---

Function Documentation

void pt_print_bte_list	(	int	debug_flag,
		DLIList< BasicTopologyEntity * > &	edges,
		const char *	trailing_string = "\n"
	)

Definition at line 1974 of file PartitionTool.cpp.

{
  if( DEBUG_FLAG( debug_flag ) )
  {
    PRINT_DEBUG(debug_flag, "{ ");
    edges.reset();
    for( int i = edges.size(); i > 1; i-- )
      PRINT_DEBUG(debug_flag, "%d, ",edges.get_and_step()->id() );
    if( edges.size() ) {
      PRINT_DEBUG(debug_flag, "%d",edges.get_and_step()->id() );
    }
    PRINT_DEBUG(debug_flag, " }%s",trailing_string ? trailing_string : "");
  }
}

void pt_print_edge_list	(	int	debug_flag,
		DLIList< RefEdge * > &	edges,
		const char *	trailing_string = "\n"
	)

Definition at line 1989 of file PartitionTool.cpp.

{
  if( DEBUG_FLAG( debug_flag ) )
  {
    DLIList<BasicTopologyEntity*> bte_list;
    bte_list.reset();
    CAST_LIST_TO_PARENT( edges, bte_list);
    pt_print_bte_list( debug_flag, bte_list, trailing_string );
  }
}

void pt_print_face_list	(	int	debug_flag,
		DLIList< RefFace * > &	faces,
		const char *	trailing_string = "\n"
	)

Definition at line 2000 of file PartitionTool.cpp.

{
  if( DEBUG_FLAG( debug_flag ) )
  {
    DLIList<BasicTopologyEntity*> bte_list;
    bte_list.reset();
    CAST_LIST_TO_PARENT( faces, bte_list);
    pt_print_bte_list( debug_flag, bte_list, trailing_string );
  }
}

void pt_print_loop	(	int	debug_flag,
		Loop *	loop_ptr,
		const char *	trailing_string = "\n"
	)

Definition at line 2011 of file PartitionTool.cpp.

{
  if( DEBUG_FLAG( debug_flag ) )
  {
    DLIList<RefEdge*> edges;
    loop_ptr->ordered_ref_edges( edges );
    pt_print_edge_list( debug_flag, edges, trailing_string );
  }
}

void pt_print_shell	(	int	debug_flag,
		Shell *	shell_ptr,
		const char *	trailing_string = "\n"
	)

Definition at line 2021 of file PartitionTool.cpp.

{
  if( DEBUG_FLAG( debug_flag ) )
  {
    DLIList<RefFace*> faces;
    shell_ptr->ref_faces( faces );
    pt_print_face_list( debug_flag, faces, trailing_string );
  }
}