How to "union" overlapping range to non-overlapping range?
how to draw
how to get
how to cook
how to make money online
how to b
how to guides
Question: Can anyone suggest a better or more pythonic approach, to reducing overlapping range pairs to non overlapping range pairs?
Background: I have a list of tuples representing start and end pairs. I am trying to essentially complete a union of all the start ends pairs. The input start end pairs have overlapping values and the output should represent the input start end pairs without any overlap.
The code below is close but wrong as it outputs an extra range that was not in the input (I also realize it is not very good, and why its wrong). Can anyone suggest a better approach, or some built in function I overlooked?
Apologies for the basic question. Thanks for the help!
##create example data pairA =[(0,5),(10,12)] pairB =[(1,2),(11,15)] pairC =[(1,4),(10,12),(15,17)] #combine the lists to one list #ultimately may have n number of lists and felt it would be easier to merged = pairA + pairB +pairC # produce union of list * unpacks the arguments of a list listUnion= sorted(set().union(*merged)) #this is the piece of code I am looking at improving #it creates new start end pairs based on the union lastElement =listUnion[-1] outList= for item in listUnion: #create start end pair from value i and i+1 if item != lastElement: outList.append((item,listUnion[listUnion.index(item)+1])) else: #last element of the list, becomes the last element of list pair #it can be ignored pass print outList """output: [(0, 1), (1, 2), (2,4), (4, 5), (5, 10), (10, 11), (11, 12), (12, 15), (15, 17)] correct output: would not have (5,10) as there is no overlap here in the input """
Edit: Added this visual representation of the problem
Here is a solution. It's probably not very pythonic, because my experience with Python is very limited, but it works.
pairs_a = [(0, 5), (10, 12)] pairs_b = [(1, 2), (11, 15)] pairs_c = [(1, 4), (10, 12), (15, 17)] merged = pairs_a + pairs_b + pairs_c merged.sort() set_list =  cur_set = set() cur_max = merged for pair in merged: p0, p1 = pair if cur_max < p0: set_list.append(cur_set) cur_set = set() cur_set.add(p0) cur_set.add(p1) if cur_max < p1: cur_max = p1 set_list.append(cur_set) out_list =  for my_set in set_list: my_list = sorted(my_set) p0 = my_list for p1 in my_list[1:]: out_list.append((p0, p1)) p0 = p1 # more pythonic but less readable in spite of indentation efforts: # out_list = [pair # for zipped in [zip(list[:-1], list[1:]) # for list in [sorted(set) # for set in set_list]] # for pair in zipped] # alternate ending: # out_list = [sorted(set) for set in set_list] print(out_list)
The idea is to sort all range pairs by the first item first. This is what
merged.sort() does (it uses successive tuple members to disambiguate, but this is unimportant here). Then we loop over the sorted range pairs, and as long as we are within a bunch of overlapping ranges, we add all starts and ends to the current set. In order to know when the bunch ends, we keep the max of all range ends. As soon as a range start arrives that is beyond this max, we store away the current set by appending it to a list, and begin a new one. The last set has to be added to the list after the loop. Now we have a list of sets, which we can easily translate to a list of lists or to a list of pairs.
How To - Tips, Tricks and Hacks for Doing Everything Better | Lifehacker. How To is your one-stop channel for navigating the rough patches in life. From relationships to finances, here is where you’ll find simple, practical help from those who have been there. Show less
Not sure of your environment constraints, but if you don't have any, you might wanna consider this: https://pypi.org/project/intervaltree/ particularly,
result_tree = tree.union(iterable)
Get more from your technology and gadgets with TechRadar's expert tips, tricks, hacks and advice. CNET editors and users share the top tech 'how to' tips and tricks with advice for getting the most out of all your gadgets.
Could you clarify the problem, please. I see that
[(0,5), (1,2)] produces
[(0, 1), (1, 2), (2, 5)]. What would
[(0,5), (1,5)] produce,
[(0, 1), (1, 5), (5, 5)], or just
[(0,1)], or something else?
CNET editors and users share the top tech 'how to' tips and tricks with advice for getting the most out of all your gadgets. How-to definition is - giving practical instruction and advice (as on a craft). How to use how-to in a sentence.
Hey guys! Welcome back to another video. Make sure you subscribe and turn your notifications on right away so you don't miss a upload from me. Hope you Calculate How Many Days You Have Been a Parent. Meghan Moravcik Walbert. How to Opt Out of the Most Popular People Search Sites. Video Lifehacker Originals 11/18/19. Video Lifehacker Originals
How To is your one-stop channel for navigating the rough patches in life. From relationships to finances, here is where you'll find simple, practical help from Protect Your PC: How to Work From Home Securely. Working from home opens you up to all sorts of security risks you don't face in the office. When the IT staff isn't right down the hall, these
how-to. noun. Definition of how-to (Entry 2 of 2). : a practical method or instruction the how-tos of balancing a checkbook also : something (such as a book) that Learn how to do just about everything at eHow. Find expert advice along with How To videos and articles, including instructions on how to make, cook, grow, or do almost anything.
- Look up the
Intervalclass. The abstraction will likely free you from the work you're doing now, and lead directly to this solution and many more.
(0,5)is a superset of
(1,2). Why wouldn't you just discard
- Shouldn't it be [(0,1),(1,2),(2,4),(4,5)...]?
- @JohnGordon the "breakpoints" are required at a later point.
- @Acccumulation you are correct, and I updated the post
- Thanks Walter. I will tweak the code and see if I can get it right. It produces an extra overlap, (17, 10), but I appreciate the alternative approach. Code output (17, 10) which contains some of the other output pairs.
- oh, it does NOT on my python 3.7.0. What python do you have?
- I think I just fixed it, replacing
sorted(my_set). Apparently whether (some?) sets appear sorted when converted to lists or, possibly and more in general, when iterated over, depends on the python
- Wow thanks, I should have specified, this had to be in 2.7. You tweaked it before I could. If I ever figure out a pythonic way. I will send it your way.
- good. I also added an "alternative ending", a "list of lists" output, which you could find useful.
- I will look into intervaltree
- Sorry for the lack of clarity, 0,5 1,5 would produce (0,1),(1,5).