overlap

NO SETS! I can't use Sets because: The ranges will be too long. They will take up too much memory The creation of the sets themselves will take too long. Using only the endpoints of the of the ranges, is there an optimal way to subtract two lists of ranges? Example: r1 = (1, 1000), (1100, 1200) r2 = (30, 50), (60, 200), (1150, 1300) r1 - r2 = (1, 29), (51, 59), (201, 1000), (1100, 1149) Other info: r2 does not have to overlap r1 r1 and r2 will not have pairs that overlap other pairs. For instance, r1 will not have both (0,30) and (10, 25) Thanks. The interval package may provide all that you

I have a container of regular expressions. I'd like to analyze them to determine if it's possible to generate a string that matches more than 1 of them. Short of writing my own regex engine with this use case in mind, is there an easy way in C++ or Python to solve this problem? There's no easy way. As long as your regular expressions use only standard features (Perl lets you embed arbitrary code in matching, I think), you can produce from each one a nondeterministic finite-state automaton (NFA) that compactly encodes all the strings that the RE matches. Given any pair of NFA, it's decidable

I have a graph I've created in graphviz, but the problem is that edges overlap each other (I have 5-7 nodes in each row), so it is hard to tell for each node which are the nodes it connects. How can I make the edges not to overlap each other? Have them cross each other is OK. I'm assuming you have a directed graph which you layout with dot. I don't think there's a magic switch to prevent overlapping edges. Graphviz tries to do that out of the box. Some suggestions that may help, depending on the graph: edge concentrators (concentrate=true): Merge multiple edges with a common endpoint into

I have a large nested list and each list within the nested list contains a list of numbers that are formatted as floats. However every individual list in the nested list is the same except for a few exceptions. I want to extract the numbers that are common to all of the lists in the nested list. A simple example of my problem is shown below: nested_list = [[1.0,2.0,3.0,4.0,5.0,6.0,7.0,8.0,9.0,10.0,11.0,12.0,13.0,14.0,15.0], [2.0,3.0,4.0,5.0,6.0,7.0,8.0,9.0,10.0,11.0,12.0,13.0,14.0], [1.0,2.0,3.0,4.0,5.0,6.0,7.0,8.0,9.0,10.0,11.0,12.0,13.0,14.0], [2.0,3.0,4.0,5.0,6.0,7.0,8.0,9.0,10.0,11.0,12.0

Say I have the following data and plot: require(reshape2) require(ggplot2) data <- data.frame(id=seq(1,9,1), var1=c(10,3,5,7,8,9,4,6,5), var2=c(9,3,5,7,8,9,4,6,5)) data_graph <- melt(data, id="id") ggplot(data=data_graph, aes(y=value, x=id, group=variable, col=variable)) + geom_line(size=2) + geom_point() + geom_text(aes(label=value), size=5, hjust=-.6, vjust=1.5) For almost the entirety of both lines, there is overlap. Is there any way to somehow jitter the lines so that they are close to each other, but don't overlap. Or to do something to know that there are two lines? There is a function