,SrSSKJr SrSrSrSrg)z< Implementation of merge-base following the approach of git )dequec0^/n0nSnSnSmSnU4Sjn[5n XTU'U RU5 UHn XdU 'U RU 5 M U"X5(aU R5n XKn XU-:Xa'X-(dX-n XU 'URU 5 U T-n U"U 5n U (a-U H'nX;a XNU -XN'OXU'U RU5 M) U"X5(aM/nUH"n XKT-(aMURU 5 M$ U$)NcB>UHnX!;dM XT-(aM g g)NTF)wlstcstatescmt_DNCs lib/third_party/dulwich/graph.py_has_candidates#_find_lcas.._has_candidates's'C~ t++)rappendpopleft)lookup_parentsc1c2scandsr _ANC_OF_1 _ANC_OF_2_LCArr c2r flagsparentspcmtresultsrs @r _find_lcasr!s. EGII D D 7DBKKKO  B $ ( (lln  * +L $  S!  % ?$+ME$9GM$)DM D!   $ ( (,G t## NN3  NrcU(d/$USn[U5S:dU/$USSnX#;aU/$UR5n[URX#5$)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(Usb  AB z?Q t QR.C yt ,,. &22B <r5s$,5p=*4r