3 ## time for some monkeypatching!
7 'host' => "#{ Socket.gethostname }",
8 'pid' => "#{ Process.pid }",
9 'ppid' => "#{ Process.ppid }",
16 def dump_lock_id lock_id = @lock_id
17 "host: %s\npid: %s\nppid: %s\ntime: %s\nuser: %s\npname: %s\n" %
18 lock_id.values_at('host','pid','ppid','time','user', 'pname')
22 h = load_lock_id IO.read(path)
23 h['mtime'] = File.mtime path
27 def touch_yourself; touch path end
31 ## only valid for integer ranges (unless I guess it's exclusive)
33 last - first + (exclude_end? ? 0 : 1)
39 args.each { |sym| class_eval %{ def #{sym}?; @#{sym}; end } }
41 def bool_writer *args; attr_writer(*args); end
42 def bool_accessor *args
47 def defer_all_other_method_calls_to obj
49 def method_missing meth, *a, &b; @#{obj}.send meth, *a, &b; end
50 def respond_to? meth; @#{obj}.respond_to?(meth); end
62 klass = klass.superclass
67 ## takes a value which it yields and then returns, so that code
70 ## x = expensive_operation
76 ## with(expensive_operation) { |x| log "got #{x}" }
78 ## i'm sure there's pithy comment i could make here about the
79 ## superiority of lisp, but fuck lisp.
80 def returning x; yield x; x; end
82 ## clone of java-style whole-method synchronization
83 ## assumes a @mutex variable
84 def synchronized *meth
87 alias unsynchronized_#{meth} #{meth}
89 @mutex.synchronize { unsynchronized_#{meth}(*a, &b) }
98 self.gsub(/([a-z])([A-Z0-9])/, '\1-\2').downcase
101 def find_all_positions x
114 self[0 .. 0].upcase + self[1 .. -1]
117 ## a very complicated regex found on teh internets to split on
118 ## commas, unless they occurr within double quotes.
120 split(/,\s*(?=(?:[^"]*"[^"]*")*(?![^"]*"))/)
127 cut = s[0 ... len].rindex(/\s/)
130 s = s[(cut + 1) .. -1]
139 def normalize_whitespace
140 gsub(/\t/, " ").gsub(/\r/, "")
155 def in? range; range.member? self; end
159 def num_digits base=10
160 return 1 if self == 0
161 1 + (Math.log(self) / Math.log(10)).floor
165 if self < 128 && self >= 0
175 Hash[*self.map { |k, v| [k, v] unless o.include? k }.compact.flatten_one_level]
178 def select_by_value v=true
179 select { |k, vv| vv == v }.map { |x| x.first }
186 each_with_index { |x, i| ret << yield(x, i) }
190 def sum; inject(0) { |x, y| x + y }; end
194 each { |x| ret[x] = yield(x) }
198 # like find, except returns the value of the block rather than the
202 find { |e| ret ||= yield(e) }
207 best, bestval = nil, nil
210 if bestval.nil? || val < bestval
211 best, bestval = e, val
219 def flatten_one_level
220 inject([]) { |a, e| a + e }
223 def to_h; Hash[*flatten]; end
224 def rest; self[1..-1]; end
226 def to_boolean_h; Hash[*map { |x| [x, true] }.flatten]; end
231 sprintf "%012d", self
238 self + (60 - min) * 60
242 def midnight # within a second
243 self - (hour * 60 * 60) - (min * 60) - sec
246 def is_the_same_day? other
247 (midnight - other.midnight).abs < 1
250 def is_the_day_before? other
251 other.midnight - midnight <= 24 * 60 * 60 + 1
254 def to_nice_distance_s from=Time.now
255 later_than = (self < from)
256 diff = (self.to_i - from.to_i).abs.to_f
262 ["week", 4.345], # heh heh
265 ].argfind do |unit, size|
268 elsif size.nil? || diff.round < size
269 "#{diff.round} #{unit}s"
282 TO_NICE_S_MAX_LEN = 9 # e.g. "Yest.10am"
283 def to_nice_s from=Time.now
286 elsif month != from.month
289 if is_the_same_day? from
291 elsif is_the_day_before? from
292 "Yest." + nearest_hour.strftime("%l%P")
300 ## simple singleton module. far less complete and insane than the ruby
301 ## standard library one, but automatically forwards methods calls and
302 ## allows for constructors that take arguments.
304 ## You must have #initialize call "self.class.i_am_the_instance self"
305 ## at some point or everything will fail horribly.
308 def instance; @instance; end
309 def instantiated?; defined?(@instance) && !@instance.nil?; end
310 def deinstantiate!; @instance = nil; end
311 def method_missing meth, *a, &b
312 raise "no instance defined!" unless defined? @instance
314 ## if we've been deinstantiated, just drop all calls. this is
315 ## useful because threads that might be active during the
316 ## cleanup process (e.g. polling) would otherwise have to
317 ## special-case every call to a Singleton object
318 return nil if @instance.nil?
320 @instance.send meth, *a, &b
322 def i_am_the_instance o
323 raise "there can be only one! (instance)" if defined? @instance
328 def self.included klass
329 klass.extend ClassMethods
333 ## wraps an object. if it throws an exception, keeps a copy, and
334 ## rethrows it for any further method calls.
341 def clear_error!; @e = nil; end
342 def has_errors?; !@e.nil?; end
345 def method_missing m, *a, &b; __pass m, *a, &b; end
347 def id; __pass :id; end
348 def to_s; __pass :to_s; end
349 def to_yaml x; __pass :to_yaml, x; end
350 def is_a? c; @o.is_a? c; end
352 def respond_to? m; @o.respond_to? m end
357 rescue Exception => e
364 ## acts like a hash with an initialization block, but saves any
365 ## newly-created value even upon lookup.
370 ## attr_accessor :val
371 ## def initialize; @val = 0 end
374 ## h = Hash.new { C.new }
379 ## h2 = SavingHash.new { C.new }
384 ## important note: you REALLY want to use #member? to test existence,
385 ## because just checking h[anything] will always evaluate to true
386 ## (except for degenerate constructor blocks that return nil or false)
394 @hash[k] ||= @constructor.call(k)
397 defer_all_other_method_calls_to :hash