parameters: (self, nodes)
return_statement: return count, r
docstring: Special optimized matcher for bare_name.
docstring_summary: Special optimized matcher for bare_name.
docstring_tokens: Special optimized matcher for bare_name .
function: def _bare_name_matches(self, nodes):
          """Special optimized matcher for bare_name."""
          count = 0
          r = {}
          done = False
          max = len(nodes)
          while not done and count < max:
              done = True
              for leaf in self.content:
                  if leaf[0].match(nodes[count], r):
                      count += 1
                      done = False
                      break
          r[self.name] = nodes[:count]
          return count, r
function_tokens: def _bare_name_matches ( self , nodes ) : count = 0 r = { } done = False max = len ( nodes ) while not done and count < max : done = True for leaf in self . content : if leaf [ 0 ] . match ( nodes [ count ] , r ) : count += 1 done = False break r [ self . name ] = nodes [ : count ] return count , r