@@ -334,13 +334,13 @@ def _set_pair_A2_or_S2_and_Dijk(self, t_s1, t_v1, t_s2, t_v2): # Current faile
334334 ab = list (map (int , list (pS2 .findall (t_s1 )[0 ])))
335335
336336 ab = list (map (int , ab ))
337- match_list = pDijk .findall (t_s2 )[0 ]
338- if match_list [ 0 ] == '' :
337+ match = pDijk .findall (t_s2 )[0 ]
338+ if "|" in match :
339339 adjacent = False
340- NonOverlappingLists = [list (map (int , corner )) for corner in match_list [ 1 :] ]
340+ NonOverlappingLists = [list (map (int , corner )) for corner in match . split ( "|" ) ]
341341 else :
342342 adjacent = True
343- NonOverlappingLists = self .ijk_to_3NonOverlappingLists (list (map (int , match_list [ 0 ] )))
343+ NonOverlappingLists = self .ijk_to_3NonOverlappingLists (list (map (int , match )))
344344
345345 both_in_List = - 1 # if both ab in a single List:
346346 for i , List in enumerate (NonOverlappingLists ):
@@ -707,13 +707,13 @@ def reverse_order(t_s):
707707
708708 def reorder_invariants (t_s1 , t_s2 ):
709709 l3B , l3Bs , l3Bm , l3Be , a_or_s , l3Bc = unpack (t_s1 )
710- match_list = pDijk .findall (t_s2 )[0 ]
711- if match_list [ 0 ] == '' :
710+ match = pDijk .findall (t_s2 )[0 ]
711+ if "|" in match :
712712 adjacent = False
713- NonOverlappingLists = [list (map (int , corner )) for corner in match_list [ 1 :] ]
713+ NonOverlappingLists = [list (map (int , corner )) for corner in match . split ( "|" ) ]
714714 else :
715715 adjacent = True
716- NonOverlappingLists = self .ijk_to_3NonOverlappingLists (list (map (int , match_list [ 0 ] )))
716+ NonOverlappingLists = self .ijk_to_3NonOverlappingLists (list (map (int , match )))
717717 if l3Bs == l3Be :
718718 for NonOverlappingList in NonOverlappingLists :
719719 if l3Bs in NonOverlappingList and [entry for entry in NonOverlappingList if entry != l3Bs ][0 ] in l3Bm :
@@ -765,11 +765,11 @@ def there_are_two_free_particles(*args):
765765 return "Not implemented."
766766
767767 l3B , l3Bs , l3Bm , l3Be , a_or_s , l3Bc = unpack (t_s1 )
768- match_list = pDijk .findall (t_s2 )[0 ]
769- if match_list [ 0 ] == '' :
770- NonOverlappingLists = [list (map (int , corner )) for corner in match_list [ 1 :] ]
768+ match = pDijk .findall (t_s2 )[0 ]
769+ if "|" in match :
770+ NonOverlappingLists = [list (map (int , corner )) for corner in match . split ( "|" ) ]
771771 else :
772- NonOverlappingLists = self .ijk_to_3NonOverlappingLists (list (map (int , match_list [ 0 ] )))
772+ NonOverlappingLists = self .ijk_to_3NonOverlappingLists (list (map (int , match )))
773773
774774 self ._set (t_s1 , t_v1 , fix_mom = False )
775775 if t_s1 [0 ] == "⟨" :
@@ -836,11 +836,11 @@ def _set_pair_Sijk_and_Dijk(self, t_s1, t_v1, t_s2, t_v2): # Current failed: 8/
836836 from .DoubleCollinearLimit_D_and_S_e import expression_for_e
837837
838838 Sijk = list (map (int , pSijk .findall (t_s1 )[0 ]))
839- match_list = pDijk .findall (t_s2 )[0 ]
840- if match_list [ 0 ] == '' :
841- NonOverlappingLists = [list (map (int , corner )) for corner in match_list [ 1 :] ]
839+ match = pDijk .findall (t_s2 )[0 ]
840+ if "|" in match :
841+ NonOverlappingLists = [list (map (int , corner )) for corner in match . split ( "|" ) ]
842842 else :
843- NonOverlappingLists = self .ijk_to_3NonOverlappingLists (list (map (int , match_list [ 0 ] )))
843+ NonOverlappingLists = self .ijk_to_3NonOverlappingLists (list (map (int , match )))
844844
845845 FirstNonOverlappingList = - 1
846846 SecondNonOverlappingList = - 1
0 commit comments