question: private Ease overlap ( int l ) { Ease a = new Ease ( ) ; for ( int noa = l ; noa < m_levelNum ; noa ++ ) { for ( int nob = m_levels [ noa ] . m_start ; nob < m_levels [ noa ] . m_end ; nob ++ ) { a . m_amount = m_groups [ nob ] . m_right - m_groups [ nob + 1 ] . m_left + 2 ; if ( a . m_amount >= 0 ) { a . m_amount ++ ; a . m_lev = noa ; a . m_place = nob ; return a ; } } } return null ; }
target:  This will find an overlap and then return information about that overlap