parameters: (*sequences)
return_statement: return sequences[0]
docstring: Returns longest common prefix occuring in given sequences
      Reference: http://boredzo.org/blog/archives/2007-01-06/longest-common-prefix-in-python-2
  
      >>> longestCommonPrefix('foobar', 'fobar')
      'fo'
docstring_summary: Returns longest common prefix occuring in given sequences
      Reference: http://boredzo.org/blog/archives/2007-01-06/longest-common-prefix-in-python-2
docstring_tokens: Returns longest common prefix occuring in given sequences Reference : http : // boredzo . org / blog / archives / 2007 - 01 - 06 / longest - common - prefix - in - python - 2
function: def longestCommonPrefix(*sequences):
      """
      Returns longest common prefix occuring in given sequences
      Reference: http://boredzo.org/blog/archives/2007-01-06/longest-common-prefix-in-python-2
  
      >>> longestCommonPrefix('foobar', 'fobar')
      'fo'
      """
  
      if len(sequences) == 1:
          return sequences[0]
  
      sequences = [pair[1] for pair in sorted((len(fi), fi) for fi in sequences)]
  
      if not sequences:
          return None
  
      for i, comparison_ch in enumerate(sequences[0]):
          for fi in sequences[1:]:
              ch = fi[i]
  
              if ch != comparison_ch:
                  return fi[:i]
  
      return sequences[0]
function_tokens: def longestCommonPrefix ( * sequences ) : if len ( sequences ) == 1 : return sequences [ 0 ] sequences = [ pair [ 1 ] for pair in sorted ( ( len ( fi ) , fi ) for fi in sequences ) ] if not sequences : return None for i , comparison_ch in enumerate ( sequences [ 0 ] ) : for fi in sequences [ 1 : ] : ch = fi [ i ] if ch != comparison_ch : return fi [ : i ] return sequences [ 0 ]