parameters: (iter_start, num_chars)
return_statement: return curr_state == 3
docstring: Returns True if the characters compose a camel case word
docstring_summary: Returns True if the characters compose a camel case word
docstring_tokens: Returns True if the characters compose a camel case word
function: def get_is_camel_case(iter_start, num_chars):
      """Returns True if the characters compose a camel case word"""
      text_iter = iter_start.copy()
      curr_state = 0
      for i in range(num_chars):
          curr_char = text_iter.get_char()
          alphanumeric = re.match('\w', curr_char, re.UNICODE)
          if not alphanumeric:
              curr_state = -1
              break
          if curr_state == 0:
              if curr_char.islower():
                  curr_state = 1
          elif curr_state == 1:
              if curr_char.isupper():
                  curr_state = 2
          elif curr_state == 2:
              if curr_char.islower():
                  curr_state = 3
          else:
              pass
          text_iter.forward_char()
      return curr_state == 3
function_tokens: def get_is_camel_case ( iter_start , num_chars ) : text_iter = iter_start . copy ( ) curr_state = 0 for i in range ( num_chars ) : curr_char = text_iter . get_char ( ) alphanumeric = re . match ( '\w' , curr_char , re . UNICODE ) if not alphanumeric : curr_state = - 1 break if curr_state == 0 : if curr_char . islower ( ) : curr_state = 1 elif curr_state == 1 : if curr_char . isupper ( ) : curr_state = 2 elif curr_state == 2 : if curr_char . islower ( ) : curr_state = 3 else : pass text_iter . forward_char ( ) return curr_state == 3