Lines Matching refs:trim
581 const ON_BrepTrim& trim = m_T[ti]; in IsValidEdgeTopology() local
582 if ( trim.m_ei != edge_index ) in IsValidEdgeTopology()
588 text_log->Print("edge.m_ti[%d]=%d but brep.m_T[%d].m_ei=%d\n",eti,ti,ti,trim.m_ei); in IsValidEdgeTopology()
663 const ON_BrepTrim& trim = m_T[ti]; in IsValidLoopTopology() local
664 if ( trim.m_trim_index != ti ) in IsValidLoopTopology()
670 if ( trim.m_li != loop_index ) in IsValidLoopTopology()
676 text_log->Print("loop.m_ti[%d] = %d != %d =trim.m_li\n",lti,ti,trim.m_li); in IsValidLoopTopology()
690 const ON_BrepTrim& trim = m_T[loop.m_ti[lti]]; in IsValidLoopTopology() local
694 first_trim_vi0 = trim.m_vi[0]; in IsValidLoopTopology()
696 else if ( prev_trim_vi1 != trim.m_vi[0] ) in IsValidLoopTopology()
706 lti-1,prev_trim_ti,prev_trim_vi1,lti,loop.m_ti[lti],trim.m_vi[0]); in IsValidLoopTopology()
712 prev_trim_vi1 = trim.m_vi[1]; in IsValidLoopTopology()
745 const ON_BrepTrim& trim = m_T[trim_index]; in IsValidTrimTopology() local
746 if ( trim.m_trim_index != trim_index ) in IsValidTrimTopology()
753 trim.m_trim_index, trim_index ); in IsValidTrimTopology()
758 if ( trim.m_brep != this ) in IsValidTrimTopology()
770 if ( trim.m_vi[0] < 0 || trim.m_vi[0] >= m_V.Count() ) in IsValidTrimTopology()
773 text_log->Print("ON_Brep.m_T[%d].m_vi[0] = %d is not invalid.\n",trim_index,trim.m_vi[0]); in IsValidTrimTopology()
776 if ( trim.m_vi[1] < 0 || trim.m_vi[1] >= m_V.Count() ) in IsValidTrimTopology()
779 text_log->Print("ON_Brep.m_T[%d].m_vi[1] = %d is not invalid.\n",trim_index,trim.m_vi[1]); in IsValidTrimTopology()
783 if ( m_V[trim.m_vi[0]].m_vertex_index != trim.m_vi[0] ) in IsValidTrimTopology()
789 if ( m_V[trim.m_vi[1]].m_vertex_index != trim.m_vi[1] ) in IsValidTrimTopology()
796 if ( trim.m_c2i < 0 || trim.m_c2i >= m_C2.Count() ) in IsValidTrimTopology()
799 text_log->Print("ON_Brep.m_T[%d].m_c2i = %d is not valid.\n",trim_index,trim.m_c2i); in IsValidTrimTopology()
803 if ( 0 == m_C2[trim.m_c2i] ) in IsValidTrimTopology()
806 …log->Print("ON_Brep.m_T[%d].m_c2i = %d, but m_C2[%d] is NULL.\n",trim_index,trim.m_c2i,trim.m_c2i); in IsValidTrimTopology()
810 if ( 0 == trim.ProxyCurve() ) in IsValidTrimTopology()
813 …text_log->Print("brep.m_T[%d].m_c2i = %d, but trim.ProxyCurve() is NULL.\n",trim_index,trim.m_c2i); in IsValidTrimTopology()
817 if ( m_C2[trim.m_c2i] != trim.ProxyCurve() ) in IsValidTrimTopology()
824 trim_index, trim.m_c2i, trim.m_c2i, trim_index); in IsValidTrimTopology()
830 ON_Interval proxy_sub_dom = trim.ProxyCurveDomain(); in IsValidTrimTopology()
843 ON_Interval c2_dom = m_C2[trim.m_c2i]->Domain(); in IsValidTrimTopology()
851 trim.m_c2i,c2_dom[0],c2_dom[1], in IsValidTrimTopology()
858 ON_Interval trim_dom = trim.Domain(); in IsValidTrimTopology()
871 if ( trim.m_li < 0 || trim.m_li >= m_L.Count() ) in IsValidTrimTopology()
874 text_log->Print("ON_Brep.m_T[%d].m_li = %d is not valid.\n",trim_index,trim.m_li); in IsValidTrimTopology()
878 const ON_BrepLoop& loop = m_L[trim.m_li]; in IsValidTrimTopology()
880 if ( loop.m_loop_index != trim.m_li ) in IsValidTrimTopology()
883 text_log->Print("ON_Brep.m_T[%d].m_li = %d is a deleted loop.\n",trim_index,trim.m_li); in IsValidTrimTopology()
901 … text_log->Print("brep.m_T[%d] trim or brep.m_L[%d] loop is not valid.\n",trim_index,trim.m_li); in IsValidTrimTopology()
904 trim.m_li,trim_index); in IsValidTrimTopology()
910 if ( trim.m_type == ON_BrepTrim::singular ) in IsValidTrimTopology()
913 if ( trim.m_ei != -1 ) in IsValidTrimTopology()
916 …->Print("ON_Brep.m_T[%d].m_type = singular, but m_ei = %d (should be -1).\n",trim_index,trim.m_ei); in IsValidTrimTopology()
919 if ( trim.m_bRev3d ) in IsValidTrimTopology()
922 …("ON_Brep.m_T[%d].m_type = singular, but m_bRev3d = %d (should be 0).\n",trim_index,trim.m_bRev3d); in IsValidTrimTopology()
925 if ( trim.m_vi[0] != trim.m_vi[1] ) in IsValidTrimTopology()
929 trim_index,trim.m_vi[0],trim.m_vi[1]); in IsValidTrimTopology()
936 if ( trim.m_ei < 0 || trim.m_ei >= m_E.Count() ) in IsValidTrimTopology()
939 text_log->Print("ON_Brep.m_T[%d].m_ei = %d is not invalid.\n",trim_index,trim.m_ei); in IsValidTrimTopology()
943 const ON_BrepEdge& edge = m_E[trim.m_ei]; in IsValidTrimTopology()
944 if ( edge.m_edge_index != trim.m_ei ) in IsValidTrimTopology()
951 const int evi0 = trim.m_bRev3d ? 1 : 0; in IsValidTrimTopology()
952 const int evi1 = trim.m_bRev3d ? 0 : 1; in IsValidTrimTopology()
953 if ( trim.m_vi[0] != edge.m_vi[evi0] ) in IsValidTrimTopology()
956 …N_Brep.m_T[%d].m_bRev3d = %d, but m_vi[0] != m_E[m_ei].m_vi[%d].\n",trim_index,trim.m_bRev3d,evi0); in IsValidTrimTopology()
959 if ( trim.m_vi[1] != edge.m_vi[evi1] ) in IsValidTrimTopology()
962 …N_Brep.m_T[%d].m_bRev3d = %d, but m_vi[0] != m_E[m_ei].m_vi[%d].\n",trim_index,trim.m_bRev3d,evi1); in IsValidTrimTopology()
1118 const ON_BrepTrim& trim = m_T[ti]; in IsValidTopology() local
1119 if ( trim.m_ei != -1 ) in IsValidTopology()
1123 ti, trim.m_ei ); in IsValidTopology()
1126 if ( trim.m_li != -1 ) in IsValidTopology()
1130 ti, trim.m_li ); in IsValidTopology()
1133 if ( trim.m_c2i != -1 ) in IsValidTopology()
1137 ti, trim.m_c2i ); in IsValidTopology()
1140 if ( trim.m_vi[0] != -1 ) in IsValidTopology()
1144 ti, trim.m_vi[0] ); in IsValidTopology()
1147 if ( trim.m_vi[1] != -1 ) in IsValidTopology()
1151 ti, trim.m_vi[1] ); in IsValidTopology()
1273 const ON_BrepTrim& trim = m_T[ti]; in IsValidTopology() local
1274 if ( trim.m_trim_index == -1 ) in IsValidTopology()
1463 const ON_BrepTrim& trim = m_T[trim_index]; in IsValidTrimGeometry() local
1464 if ( trim.m_trim_index != trim_index ) in IsValidTrimGeometry()
1471 trim.m_trim_index, trim_index ); in IsValidTrimGeometry()
1765 const ON_BrepTrim& trim = m_T[trim_index]; in IsValidTrimTolerancesAndFlags() local
1766 if ( trim.m_trim_index != trim_index ) in IsValidTrimTolerancesAndFlags()
1773 trim.m_trim_index, trim_index ); in IsValidTrimTolerancesAndFlags()