Class: Cassandra::OrderedHashInt

Inherits:
Hash
  • Object
show all
Defined in:
lib/cassandra/ordered_hash.rb

Overview

:nodoc:

Direct Known Subclasses

OrderedHash

Class Method Summary collapse

Instance Method Summary collapse

Constructor Details

#initialize(*args, &block) ⇒ OrderedHashInt

Returns a new instance of OrderedHashInt.


4
5
6
7
# File 'lib/cassandra/ordered_hash.rb', line 4

def initialize(*args, &block)
  super
  @keys = []
end

Class Method Details

.[](*args) ⇒ Object


9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
# File 'lib/cassandra/ordered_hash.rb', line 9

def self.[](*args)
  ordered_hash = new

  if (args.length == 1 && args.first.is_a?(Array))
    args.first.each do |key_value_pair|
      next unless (key_value_pair.is_a?(Array))
      ordered_hash[key_value_pair[0]] = key_value_pair[1]
    end

    return ordered_hash
  end

  unless (args.size % 2 == 0)
    raise ArgumentError.new("odd number of arguments for Hash")
  end

  args.each_with_index do |val, ind|
    next if (ind % 2 != 0)
    ordered_hash[val] = args[ind + 1]
  end

  ordered_hash
end

Instance Method Details

#[]=(key, value) ⇒ Object


39
40
41
42
# File 'lib/cassandra/ordered_hash.rb', line 39

def []=(key, value)
  @keys << key if !has_key?(key)
  super
end

#clearObject


101
102
103
104
105
# File 'lib/cassandra/ordered_hash.rb', line 101

def clear
  super
  @keys.clear
  self
end

#delete(key) ⇒ Object


44
45
46
47
48
49
50
# File 'lib/cassandra/ordered_hash.rb', line 44

def delete(key)
  if has_key? key
    index = @keys.index(key)
    @keys.delete_at index
  end
  super
end

#delete_ifObject


52
53
54
55
56
# File 'lib/cassandra/ordered_hash.rb', line 52

def delete_if
  super
  sync_keys!
  self
end

#eachObject Also known as: each_pair


94
95
96
97
# File 'lib/cassandra/ordered_hash.rb', line 94

def each
  @keys.each {|key| yield [key, self[key]]}
  self
end

#each_keyObject


84
85
86
87
# File 'lib/cassandra/ordered_hash.rb', line 84

def each_key
  @keys.each { |key| yield key }
  self
end

#each_valueObject


89
90
91
92
# File 'lib/cassandra/ordered_hash.rb', line 89

def each_value
  @keys.each { |key| yield self[key]}
  self
end

#initialize_copy(other) ⇒ Object


33
34
35
36
37
# File 'lib/cassandra/ordered_hash.rb', line 33

def initialize_copy(other)
  super
  # make a deep copy of keys
  @keys = other.keys
end

#keysObject


68
69
70
# File 'lib/cassandra/ordered_hash.rb', line 68

def keys
  @keys.dup
end

#merge(other_hash) ⇒ Object


118
119
120
# File 'lib/cassandra/ordered_hash.rb', line 118

def merge(other_hash)
  dup.merge!(other_hash)
end

#merge!(other_hash) ⇒ Object


113
114
115
116
# File 'lib/cassandra/ordered_hash.rb', line 113

def merge!(other_hash)
  other_hash.each {|k,v| self[k] = v }
  self
end

#reject(&block) ⇒ Object


64
65
66
# File 'lib/cassandra/ordered_hash.rb', line 64

def reject(&block)
  dup.reject!(&block)
end

#reject!Object


58
59
60
61
62
# File 'lib/cassandra/ordered_hash.rb', line 58

def reject!
  super
  sync_keys!
  self
end

#replace(other) ⇒ Object

When replacing with another hash, the initial order of our keys must come from the other hash -ordered or not.


123
124
125
126
127
# File 'lib/cassandra/ordered_hash.rb', line 123

def replace(other)
  super
  @keys = other.keys
  self
end

#reverseObject


129
130
131
# File 'lib/cassandra/ordered_hash.rb', line 129

def reverse
  OrderedHashInt[self.to_a.reverse]
end

#shiftObject


107
108
109
110
111
# File 'lib/cassandra/ordered_hash.rb', line 107

def shift
  k = @keys.first
  v = delete(k)
  [k, v]
end

#to_aObject


80
81
82
# File 'lib/cassandra/ordered_hash.rb', line 80

def to_a
  @keys.map { |key| [ key, self[key] ] }
end

#to_hashObject


76
77
78
# File 'lib/cassandra/ordered_hash.rb', line 76

def to_hash
  self
end

#valuesObject


72
73
74
# File 'lib/cassandra/ordered_hash.rb', line 72

def values
  @keys.collect { |key| self[key] }
end