intervals

Forgive me for this question, but I can't seem to find a good source of when to use which. Would be happy if you can explain it in simple terms. Furthermore, I am facing this dilemma: See, I am coding a simple application. I want it to show the elapsed time (hh:mm:ss format or something). But also, to be able to "speed up" or "slow down" its time intervals (i.e. speed up so that a minute in real time equals an hour in the app). For example, in Youtube videos ( * let's not consider the fact that we can jump to specific parts of the vid * ), we see the actual time spent in watching that video on

I have "2,5,7-9,12" string. I want to get [2, 5, 7, 8, 9, 12] list from it. Is there any built-in function for it in python? Thanks. UPD. I suppose, the straight answer is No . Anyway, thanks for your "snippets". Using one, suggested by Sven Marnach . This version handles arbitrary whitespace, overlapping ranges, out-of-order ranges, and negative integers: from itertools import chain def group_to_range(group): group = ''.join(group.split()) sign, g = ('-', group[1:]) if group.startswith('-') else ('', group) r = g.split('-', 1) r[0] = sign + r[0] r = sorted(int(__) for __ in r) return range(r

I am wondering whether a proper framework for interval manipulation and comparison does exist in R. After some search, I was only able to find the following: - function findInterval in base Package. (but I hardly understand it) - some answers here and there about union and intersection (notably: http://r.789695.n4.nabble.com/Union-Intersect-two-continuous-sets-td4224545.html ) Would you know of an initiative to implement a comprehensive set of tools to easily handles frequent tasks in interval manipulation, like inclusion/setdiff/union/intersection/etc. (eg see here for a list of

I am trying to get the all records which are 2 hours or more old using this query: $minutes = 60 * 2 SELECT COUNT(id) AS TOTAL, job_id from tlb_stats WHERE log_time >= DATE_SUB(CURRENT_DATE, INTERVAL $minutes MINUTE) GROUP BY job_id It only selects the recent records and skips the old. When I change log_time <= ... it only selects old and skips which are the new one. What am I doing wrong? mvds Try: $minutes = 60 * 2 SELECT COUNT(`id`) AS `TOTAL`, `job_id` FROM `tlb_stats` WHERE `log_time` < DATE_SUB(NOW(), INTERVAL $minutes MINUTE) GROUP BY `job_id` use backticks to quote fields (words like

I would like to plot a simple interval on the number line in Mathematica. How do I do this? Here's another attempt that draws number lines with the more conventional white and black circles, although any graphics element that you want can be easily swapped out. It relies on LogicalExpand[Simplify@Reduce[expr, x]] and Sort to get the expression into something resembling a canonical form that the replacement rules can work on. This is not extensively tested and probably a little fragile. For example if the given expr reduces to True or False , my code does not die gracefully. numLine[expr_, x

I've been struggling to solve a few tricky problems in SQL where I need to infer asset utilisation from event intervals, and have just learned about Allen's Interval Algebra , which seems to be the key to solving these problems. The algebra describes 13 kinds of relationships between intervals, and the image below shows the first seven, with the rest being the inverse (i.e. y before x, y meets x, etc) But I'm having trouble finding out how to implement the relevant operations. Given my sample data, how can I go about getting results from the following three types of operations in SQL or PLSQL?

I'm looking for an interval tree algorithm similar to the red-black interval tree in CLR but that supports merging of intervals by default so that there are never any overlapping intervals. In other words if you had a tree containing two intervals [2,3] and [5,6] and you added the interval [4,4], the result would be a tree containing just one interval [2,6]. Thanks Update: the use case I'm considering is calculating transitive closure. Interval sets are used to store the successor sets because they have been found to be quite compact . But if you represent interval sets just as a linked list I