original_docstring: 
          Compute the state name associated with f and all the keys.
          Return a unique int n representing that state.
          
docstring: Compute the state name associated with f and all the keys.
  Return a unique int n representing that state.
docstring_tokens: Compute the state name associated with f and all the keys . Return a unique int n representing that state .
code: def computeState(self, f, keys):
          """
          Compute the state name associated with f and all the keys.
          Return a unique int n representing that state.
          """
          # Abbreviate arg names.
          d = {
              'delegate': '=>',
              'end': 'end',
              'at_line_start': 'start',
              'at_whitespace_end': 'ws-end',
              'exclude_match': '!match',
              'no_escape': '!esc',
              'no_line_break': '!lbrk',
              'no_word_break': '!wbrk',
          }
          result = [self.languageTag(self.language)]
          if not self.rulesetName.endswith('_main'):
              result.append(self.rulesetName)
          if f:
              result.append(f.__name__)
          for key in sorted(keys):
              keyVal = keys.get(key)
              val = d.get(key)
              if val is None:
                  val = keys.get(key)
                  result.append(f"{key}={val}")
              elif keyVal is True:
                  result.append(f"{val}")
              elif keyVal is False:
                  pass
              elif keyVal not in (None, ''):
                  result.append(f"{key}={keyVal}")
          state = ';'.join(result).lower()
          table = (
              ('kind=', ''),
              ('literal', 'lit'),
              ('restart', '@'),
          )
          for pattern, s in table:
              state = state.replace(pattern, s)
          n = self.stateNameToStateNumber(f, state)
          return n
code_tokens: def computeState ( self , f , keys ) : d = { 'delegate' : '=>' , 'end' : 'end' , 'at_line_start' : 'start' , 'at_whitespace_end' : 'ws-end' , 'exclude_match' : '!match' , 'no_escape' : '!esc' , 'no_line_break' : '!lbrk' , 'no_word_break' : '!wbrk' , } result = [ self . languageTag ( self . language ) ] if not self . rulesetName . endswith ( '_main' ) : result . append ( self . rulesetName ) if f : result . append ( f . __name__ ) for key in sorted ( keys ) : keyVal = keys . get ( key ) val = d . get ( key ) if val is None : val = keys . get ( key ) result . append ( f"{key}={val}" ) elif keyVal is True : result . append ( f"{val}" ) elif keyVal is False : pass elif keyVal not in ( None , '' ) : result . append ( f"{key}={keyVal}" ) state = ';' . join ( result ) . lower ( ) table = ( ( 'kind=' , '' ) , ( 'literal' , 'lit' ) , ( 'restart' , '@' ) , ) for pattern , s in table : state = state . replace ( pattern , s ) n = self . stateNameToStateNumber ( f , state ) return n
short_docstring: Compute the state name associated with f and all the keys.
short_docstring_tokens: Compute the state name associated with f and all the keys .
comment: """
          Compute the state name associated with f and all the keys.
          Return a unique int n representing that state.
          """$SEP$# Abbreviate arg names.