Advertisement
Guest User

Untitled

a guest
Sep 25th, 2017
54
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Ruby 0.58 KB | None | 0 0
  1. releases = Array.new release_map.keys
  2. releases << cur_release unless releases.include?(cur_release)
  3. releases.map! { |rel| prep_peg_order(rel) }
  4. p releases.sort! do |rel1, rel2|
  5.   nums1 = rel1.split(".").map{ |chunk| chunk.gsub(/\D/, "").to_i }
  6.   nums2 = rel2.split(".").map{ |chunk| chunk.gsub(/\D/, "").to_i }
  7.      
  8.   longer = [nums1.length, nums2.length].max
  9.  
  10.   longer.times do |i|
  11.     -1 if i == nums1.length
  12.     1 if i == nums2.length
  13.     nums1[i] <=> nums2[i] if nums1[i] != nums2[i]
  14.   end
  15.   0
  16. end
  17.    
  18. lowerbound = release_map[releases[releases.index(cur_release) - 1]]
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement