environment/lib/python2.7/site-packages/IPython/utils/data.py
def sort_compare(lst1, lst2, inplace=1):
    """Sort and compare two lists.

    By default it does it in place, thus modifying the lists. Use inplace = 0
    to avoid that (at the cost of temporary copy creation)."""
    if not inplace:
        lst1 = lst1[:]
        lst2 = lst2[:]
    lst1.sort(); lst2.sort()
    return lst1 == lst2
def sort_compare(lst1, lst2, inplace=1):
    if not inplace:
        lst1 = lst1[:]
        lst2 = lst2[:]
    lst1.sort(); lst2.sort()
    return lst1 == lst2
def sort_compare ( lst1 , lst2 , inplace = 1 ) : if not inplace : lst1 = lst1 [ : ] lst2 = lst2 [ : ] lst1 . sort ( ) lst2 . sort ( ) return lst1 == lst2
Sort and compare two lists.

    By default it does it in place, thus modifying the lists. Use inplace = 0
    to avoid that (at the cost of temporary copy creation).
Sort and compare two lists .