parameters: (sources, splitter=".")
return_statement: return common_prefix
docstring: Given a list of sources (where each source is a list itself),
      returns a list corresponding to the longest common prefix of source
      components.
  
      Each component in each source is filtered through a split on the string
      specified in splitter to 'clean up' source names. If splitter is set to
      a false-y value, no cleaning occurs.
docstring_summary: Given a list of sources (where each source is a list itself),
      returns a list corresponding to the longest common prefix of source
      components.
docstring_tokens: Given a list of sources ( where each source is a list itself ) returns a list corresponding to the longest common prefix of source components .
function: def common_source_prefix(sources, splitter="."):
      """Given a list of sources (where each source is a list itself),
      returns a list corresponding to the longest common prefix of source
      components.
  
      Each component in each source is filtered through a split on the string
      specified in splitter to 'clean up' source names. If splitter is set to
      a false-y value, no cleaning occurs.
      """
      common_prefix = []
  
      for source_step in zip(*sources):
          # For each component in each source at the same position,
          # make sure the components are the same.
          # If they are, add it to the common prefix.
          # If not, we're done.
          source_step = map(lambda x: _maybe_right_split(x, splitter), source_step)
          if len(set(source_step)) == 1:
              common_prefix.append(source_step[0])
          else:
              break
  
      return common_prefix
function_tokens: def common_source_prefix ( sources , splitter = "." ) : common_prefix = [ ] for source_step in zip ( * sources ) : # For each component in each source at the same position, # make sure the components are the same. # If they are, add it to the common prefix. # If not, we're done. source_step = map ( lambda x : _maybe_right_split ( x , splitter ) , source_step ) if len ( set ( source_step ) ) == 1 : common_prefix . append ( source_step [ 0 ] ) else : break return common_prefix