# Fwd: DayRange (#92)

**URL:** <https://www.ruby-forum.com/t/fwd-dayrange-92/66826>\
**Category:** Ruby\
**Created:** [August 29, 2006, 5:19pm UTC](https://www.ruby-forum.com/t/fwd-dayrange-92/66826 "2006-08-29T17:19:30Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![bdeverea](https://www.ruby-forum.com/letter_avatar_proxy/v4/letter/b/f6c823/32.png) [@bdeverea](https://www.ruby-forum.com/u/bdeverea)\
**Post date:** [August 29, 2006, 5:19pm UTC](https://www.ruby-forum.com/t/fwd-dayrange-92/66826/1 "2006-08-29T17:19:30Z")

</div>

I thought I should post my original solution that got  
me wondering about better solutions and eventually got  
me to submit a quiz.

Someone named their class DaySet, and I agree that’s a  
better name. I’ll probably change mine to match.

My solution isn’t complete… some additional input  
formats requirements were added to make it a more  
interesting quiz. Mine only accepts an array of  
integers (since that’s what I will be using in my  
Rails app anyway). I also changed my argument check  
to be similar to James Edward G. II’s.

Also, if anyone is curious about the real-world  
application I’m using this for, just send me an email  
and I’ll send you the url.

Anyway, here’s my solution:

#DayRange

# 

#DayRange accepts an array of day IDs (Mon = 1, Tue =  
2, etc.)  
#and returns a formatted string of the days, using day  
ranges  
#where appropriate, e.g, “Mon-Wed, Fri”

# 

#author: Bryan D.

class DayRange

def day\_hash  
{ ‘1’=\>‘Mon’,  
‘2’=\>‘Tue’,  
‘3’=\>‘Wed’,  
‘4’=\>‘Thu’,  
‘5’=\>‘Fri’,  
‘6’=\>‘Sat’,  
‘7’=\>‘Sun’ }  
end

def initialize(day\_ids)  
@day\_ids = day\_ids.uniq.sort  
unless @day\_ids.all? { |d| d.between?(1,7) }  
raise ArgumentError “Days must be between 1 and 7”  
end

end

#Returns formatted string representing the day array  
def to\_s  
day\_abbrs = day\_hash  
i = 0  
#Array of consec\_days arrays  
consec\_day\_groups = []  
#Array of consecutive days. This gets  
#reset when we find a day that is not  
#part of a consecutive set of days.  
consec\_days = []

```
@day_ids.each do |day_id|
  if i == 0
    #add the day abbr for this day if this is the first
    #element of @day_ids.
    consec_days << day_abbrs[day_id.to_s]

  elsif @day_ids[i-1] == (day_id - 1)
    #if this is not the first day in @day_ids, check
    #if the previous day in the array is the real life
    #previous day of the week. If so, add it to the
    #consec_days array
    consec_days << day_abbrs[day_id.to_s]
  else
    #otherwise start a new consec_days array and
    #add the current consec_days array to the
    #consec_day_groups array.
    consec_day_groups << consec_days

    consec_days = []
    consec_days << day_abbrs[day_id.to_s]
  end
  #Always add the consec_days array when this is the
  #last day of the @day_ids array
  if day_id == @day_ids.last
    consec_day_groups << consec_days
  end
  i += 1
end

day_strings = []
consec_day_groups.each do |c|
  if c.length > 2
    day_strings << c.first.to_s + "-" + c.last.to_s
  else
    day_strings << c.join(", ")
  end
end
return day_strings.join(", ")

```

end

end