def missing
			missing, array = [], self.rangify
			i, length = 0, array.size - 1

			while i < length 
				current = comparison_value(array[i], :last)
				nextt = comparison_value(array[i+1], :first)
				missing << (current + 2 == nextt ? current + 1 : (current + 1)..(nextt - 1))
				i += 1
			end
			missing
		end
def missing
			missing, array = [], self.rangify
			i, length = 0, array.size - 1

			while i < length 
				current = comparison_value(array[i], :last)
				nextt = comparison_value(array[i+1], :first)
				missing << (current + 2 == nextt ? current + 1 : (current + 1)..(nextt - 1))
				i += 1
			end
			missing
		end
Returns the missing elements in an array set