,dZddlmZdZdZdZdZy)z< Implementation of merge-base following the approach of git )dequecg}i}d}d}dd}fd}t} |||<| j||D]} ||| <| j| || |r| j} || } | ||zk(r%| |zs | |z} | || <|j| | z} || } | r-| D](}||vr ||| z||<n| ||<| j|*|| |rg}|D]} || zr |j| |S)Nc2|D]}||vs||zryy)NTF)wlstcstatescmt_DNCs lib/third_party/dulwich/graph.py_has_candidatesz#_find_lcas.._has_candidates's(Cg~ t+)rappendpopleft)lookup_parentsc1c2scandsr _ANC_OF_1 _ANC_OF_2_LCArr c2r flagsparentspcmtresultsrs @r _find_lcasr sA EGII D D 7DGBKKKO  B $ (lln  Y* +DL $  S!  % 7?$+DME$9GDM$)GDM D!   $ (,G t# NN3  Nrc|sgS|d}t|dkDs|gS|dd}||vr|gS|j}t|j||S)zFind lowest common ancestors of commit_ids[0] and *any* of commits_ids[1:] Args: repo: Repository object commit_ids: list of commit ids Returns: list of lowest common ancestor commit_ids rrN)lenparents_providerr get_parents)repo commit_idsrrr#s rfind_merge_baser'Usf  AB z?Q t QR.C Syt ,,. &22B <r4s$,5p=*4r