def print_node(node):
 s = ('%s: %s\n' % (node.__class__.__name__, str(node)))
 d = node._assumptions
 if (len(d) > 0):
  for a in sorted(d):
   v = d[a]
   if (v is None):
    continue
   s += ('%s: %s\n' % (a, v))
 return s

def print_node ( node ) : s = ( '%s: %s\n' % ( node . __class__ . __name__ , str ( node ) ) ) d = node . _assumptions if ( len ( d ) > 0 ) : for a in sorted ( d ) : v = d [ a ] if ( v is None ) : continue s += ( '%s: %s\n' % ( a , v ) ) return s
returns information about the "node" .