range

How can I create Price Ranges from price array? Let's say I have this array which holds prices: Array ( [0] => 500 [1] => 500 [2] => 520 [3] => 540 [4] => 551 [5] => 599 [6] => 601 [7] => 601 [8] => 650 [9] => 681 [10] => 750 [11] => 750 [12] => 851 [13] => 871 [14] => 871 [15] => 900 [16] => 990 [17] => 999 [18] => 1101 [19] => 1130 [20] => 1149 [21] => 1151 [22] => 1278 [23] => 1300 [24] => 1460 ) Minimum value is = 500 and maximum value is 1460. I need to show users like this : [x] 500-750 (11) [x] 750-1000 (8) [x] 1000+ (7) the tricky part is if values are reached 1500 or there are more

I can subscript a range object: >>> r = range(4) >>> r range(0, 4) >>> r[3] 3 >>> for i in r: print(i) 0 1 2 3 >>> list(r) [0, 1, 2, 3] But, if I call reversed on the same range object: >>> r = reversed(range(4)) >>> r <range_iterator object at memaddr> >>> for i in r: print(i) 3 2 1 0 >>> r[3] TypeError: 'range_iterator' object is not subscriptable # ? >>> range(r) TypeError: 'range_iterator' cannot be interpreted as an integer # ? >>> list(r) [] # ? uhmm Hmm... Acting kinda like a generator but less useful. Is there a reason a reversed range object isn't like a normal generator / iterator in

If you have a set of ranges, such as the following simple example... [ [12, 25], #1 [14, 27], #2 [15, 22], #3 [17, 21], #4 [20, 65], #5 [62, 70], #6 [64, 80] #7 ] ... how do you compute the maximally intersecting subset (not sure quite how to phrase it, but I mean "the subset of ranges which intersects and has the highest cardinality") and determine the degree of intersection (cardinality of ranges in that subset)? Logically I can work it out, and might be able to translate that to a naive algorithm. Going down the list, we see that 1-5 intersect, and 5-7 intersect, and that #5 intersects both

I need to implement booking functionality and ensure that bookings don't overlap in a Rails app. The cover? and between? methods aren't quite what I need. I have to ensure uniqueness of a time range when compared to other potential ranges on the same model, and do it efficiently. I THINK it can be done using overlaps? . The problem is that this returns TRUE for something like this: (1..5).overlaps?(5..9) => true If I compared a booking that ended right when another started ( 3:30 - 4:00 versus 4:00 - 4:30 ), it would say they do overlap, but they technically don't. That would be a problem

People work from 10:00AM to 21:00PM except Sundays and public holidays. Jobs for them are reserved at 15 minute intervals. Job duration is from 15 minutes to 4 hours. Whole job must fit to single day. How to find first nearest free start times which are not reserved for given duration in Postgres 9.3 starting from current date and time ? For example, Mary has already reservation at 12:30 .. 16:00 and John has already reservation at 12:00 to 13:00 Reservat table contains reservations, yksus2 table contains workes and pyha table contains public holidays. Table structures are below. Reservat