Class: SortedSet

Inherits:
Set
  • Object
show all
Defined in:
lib/set.rb

Overview

SortedSet implements a set which elements are sorted in order. See Set.

Constant Summary collapse

@@setup =
false

Constants inherited from Set

Set::InspectKey

Class Method Summary collapse

Instance Method Summary collapse

Methods inherited from Set

#&, #-, #==, #^, #add, #add?, #classify, #clear, #collect!, #delete, #delete?, #delete_if, #divide, #each, #empty?, #eql?, #flatten, #flatten!, #hash, #include?, #initialize_copy, #inspect, #merge, #pretty_print, #pretty_print_cycle, #proper_subset?, #proper_superset?, #reject!, #replace, #size, #subset?, #subtract, #superset?, #to_a, #|

Methods included from Enumerable

#to_set

Constructor Details

#initialize(*args, &block) ⇒ SortedSet

:nodoc:



515
516
517
518
# File 'lib/set.rb', line 515

def initialize(*args, &block)	# :nodoc:
  SortedSet.setup
  initialize(*args, &block)
end

Class Method Details

.[](*ary) ⇒ Object

:nodoc:



436
437
438
# File 'lib/set.rb', line 436

def [](*ary)	# :nodoc:
  new(ary)
end

.setupObject

:nodoc:



440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
# File 'lib/set.rb', line 440

def setup	# :nodoc:
  @@setup and return

  module_eval {
    # a hack to shut up warning
    alias old_init initialize
    remove_method :old_init
  }
  begin
	require 'rbtree'

	module_eval %{
	  def initialize(*args, &block)
 @hash = RBTree.new
 super
	  end
	}
  rescue LoadError
	module_eval %{
	  def initialize(*args, &block)
 @keys = nil
 super
	  end

	  def clear
 @keys = nil
 super
	  end

	  def replace(enum)
 @keys = nil
 super
	  end

	  def add(o)
 @keys = nil
 @hash[o] = true
 self
	  end
	  alias << add

	  def delete(o)
 @keys = nil
 @hash.delete(o)
 self
	  end

	  def delete_if
 n = @hash.size
 super
 @keys = nil if @hash.size != n
 self
	  end

	  def merge(enum)
 @keys = nil
 super
	  end

	  def each
 to_a.each { |o| yield(o) }
 self
	  end

	  def to_a
 (@keys = @hash.keys).sort! unless @keys
 @keys
	  end
	}
  end

  @@setup = true
end