27 #include <math/vector2d.h>
30 #include "pns_segment.h"
31 #include "pns_itemset.h"
46 typedef ITEM_SET::ENTRIES LINKED_ITEMS;
64 return ( (hash<int>()( aP.pos.x )
65 ^ (hash<int>()( aP.pos.y ) << 1) ) >> 1 )
66 ^ (hash<int>()( aP.net ) << 1);
71 ITEM( JOINT_T ), m_locked( false ) {}
82 JOINT(
const JOINT& aB ) :
85 m_layers = aB.m_layers;
86 m_tag.pos = aB.m_tag.pos;
87 m_tag.net = aB.m_tag.net;
88 m_linkedItems = aB.m_linkedItems;
89 m_layers = aB.m_layers;
90 m_locked = aB.m_locked;
103 if( m_linkedItems.Size() != 2 || m_linkedItems.Count( SEGMENT_T ) != 2 )
110 return seg1->Width() == seg2->Width();
113 bool IsNonFanoutVia()
const
115 int vias = m_linkedItems.Count( VIA_T );
116 int segs = m_linkedItems.Count( SEGMENT_T );
118 return ( m_linkedItems.Size() == 3 && vias == 1 && segs == 2 );
121 bool IsStitchingVia()
const
123 return ( m_linkedItems.Size() == 1 && m_linkedItems.Count( VIA_T ) == 1 );
126 bool IsTraceWidthChange()
const
128 if( m_linkedItems.Size() != 2 )
131 if( m_linkedItems.Count( SEGMENT_T ) != 2)
134 SEGMENT* seg1 =
static_cast<SEGMENT*
>( m_linkedItems[0] );
135 SEGMENT* seg2 =
static_cast<SEGMENT*
>( m_linkedItems[1] );
137 return seg1->Width() != seg2->Width();
143 if( m_linkedItems.Contains( aItem ) )
146 m_linkedItems.Add( aItem );
153 m_linkedItems.Erase( aItem );
154 return m_linkedItems.Size() == 0;
164 return static_cast<SEGMENT*
>( m_linkedItems[m_linkedItems[0] == aCurrent ? 1 : 0] );
169 for(
ITEM* item : m_linkedItems.Items() )
171 if( item->OfKind( VIA_T ) )
172 return static_cast<VIA*
>( item );
195 const LINKED_ITEMS& LinkList()
const
197 return m_linkedItems.CItems();
200 const ITEM_SET& CLinks()
const
202 return m_linkedItems;
207 return m_linkedItems;
210 int LinkCount(
int aMask = -1 )
const
212 return m_linkedItems.Count( aMask );
217 bool operator==(
const JOINT& rhs )
const
219 return m_tag.pos == rhs.m_tag.pos && m_tag.net == rhs.m_tag.net;
222 void Merge(
const JOINT& aJoint )
224 if( !Overlaps( aJoint ) )
227 m_layers.Merge( aJoint.m_layers );
229 if( aJoint.IsLocked() )
232 for( ITEM* item : aJoint.LinkList() )
234 m_linkedItems.Add( item );
238 bool Overlaps(
const JOINT& rhs )
const
240 return m_tag.pos == rhs.m_tag.pos &&
241 m_tag.net == rhs.m_tag.net && m_layers.Overlaps( rhs.m_layers );
244 void Lock(
bool aLock =
true )
249 bool IsLocked()
const
259 ITEM_SET m_linkedItems;
265 inline bool operator==( JOINT::HASH_TAG
const& aP1, JOINT::HASH_TAG
const& aP2 )
267 return aP1.pos == aP2.pos && aP1.net == aP2.net;
272 #endif // __PNS_JOINT_H