#NEWLINE# def get_node_from_level( self , level , uid ) : #NEWLINE# #INDENT# '\n        Gets the node which is a certain level away from another uid\n        ' #NEWLINE# for i in xrange ( int ( ( level - self . _uid_2_level ( level ) ) ) , int ( ( level + self . _uid_2_level ( uid ) ) ) ) : #NEWLINE# #INDENT# if ( ( i < len ( self . table ) ) and ( i >= 0 ) ) : #NEWLINE# #INDENT# for node in self . table [ i ] : #NEWLINE# #INDENT# if ( self . _uid_2_level ( node . uid , uid ) == level ) : #NEWLINE# #INDENT# return node #NEWLINE# #UNINDENT# #UNINDENT# #UNINDENT# #UNINDENT# return None