original_docstring: 
              Processes string @querySet using pattern as regex expression. For
              each match matching string is replaced by @key, pair {@key,
              querySet|pattern} is stored in @pmap.
  
              Every match is replaced by key in original string. @key features
              parameter ${KEY}, which will be replaced with iterator, if
              different key is needed for every match
  
              @isUpper indicates if string that is going to stored has to be in
              upper case.
  
              Args:
                  pattern (str): regex expression to match against
                  querySet (str): string to search in
                  key (str): key for storing in map provided
                  pmap (dict<str, str>): map to store pairs {key, match}
  
              Returns:
                  str: modified string containing keys on match places
          
docstring: Processes string @querySet using pattern as regex expression. For
  each match matching string is replaced by @key, pair {@key,
  querySet|pattern} is stored in @pmap.
  
  Every match is replaced by key in original string. @key features
  parameter ${KEY}, which will be replaced with iterator, if
  different key is needed for every match
  
  @isUpper indicates if string that is going to stored has to be in
  upper case.
docstring_tokens: Processes string @querySet using pattern as regex expression . For each match matching string is replaced by @key pair { @key querySet|pattern } is stored in @pmap . Every match is replaced by key in original string . @key features parameter $ { KEY } which will be replaced with iterator if different key is needed for every match @isUpper indicates if string that is going to stored has to be in upper case .
code: def _queryStringParsingCycle(self, pattern, querySet, key, pmap, isUpper):
          """
              Processes string @querySet using pattern as regex expression. For
              each match matching string is replaced by @key, pair {@key,
              querySet|pattern} is stored in @pmap.
  
              Every match is replaced by key in original string. @key features
              parameter ${KEY}, which will be replaced with iterator, if
              different key is needed for every match
  
              @isUpper indicates if string that is going to stored has to be in
              upper case.
  
              Args:
                  pattern (str): regex expression to match against
                  querySet (str): string to search in
                  key (str): key for storing in map provided
                  pmap (dict<str, str>): map to store pairs {key, match}
  
              Returns:
                  str: modified string containing keys on match places
          """
          misc.checkTypeAgainst(type(pattern), StringType, __file__)
          misc.checkTypeAgainst(type(querySet), StringType, __file__)
          misc.checkTypeAgainst(type(key), StringType, __file__)
          misc.checkTypeAgainst(type(pmap), DictType, __file__)
          i = 0
          while True:
              group = re.search(pattern, querySet, re.I)
              if group is None or i>999:
                  break
              else:
                  value = group.group()
                  akey = key.replace(_KEY_PATTERN, str(i))
                  querySet = querySet.replace(value, akey, 1)
                  pmap[akey] = value.upper() if isUpper else value
                  i+=1
          # return updated / parameterized query string
          return querySet
code_tokens: def _queryStringParsingCycle ( self , pattern , querySet , key , pmap , isUpper ) : misc . checkTypeAgainst ( type ( pattern ) , StringType , __file__ ) misc . checkTypeAgainst ( type ( querySet ) , StringType , __file__ ) misc . checkTypeAgainst ( type ( key ) , StringType , __file__ ) misc . checkTypeAgainst ( type ( pmap ) , DictType , __file__ ) i = 0 while True : group = re . search ( pattern , querySet , re . I ) if group is None or i > 999 : break else : value = group . group ( ) akey = key . replace ( _KEY_PATTERN , str ( i ) ) querySet = querySet . replace ( value , akey , 1 ) pmap [ akey ] = value . upper ( ) if isUpper else value i += 1 return querySet
short_docstring: Processes string @querySet using pattern as regex expression.
short_docstring_tokens: Processes string @querySet using pattern as regex expression .
comment: """
              Processes string @querySet using pattern as regex expression. For
              each match matching string is replaced by @key, pair {@key,
              querySet|pattern} is stored in @pmap.
  
              Every match is replaced by key in original string. @key features
              parameter ${KEY}, which will be replaced with iterator, if
              different key is needed for every match
  
              @isUpper indicates if string that is going to stored has to be in
              upper case.
  
              Args:
                  pattern (str): regex expression to match against
                  querySet (str): string to search in
                  key (str): key for storing in map provided
                  pmap (dict<str, str>): map to store pairs {key, match}
  
              Returns:
                  str: modified string containing keys on match places
          """$SEP$# return updated / parameterized query string