-
Notifications
You must be signed in to change notification settings - Fork 5
/
huffman.rb
150 lines (125 loc) · 2.74 KB
/
huffman.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
class HuffNode
attr_accessor :weight, :symbol, :left, :right, :parent
def initialize(params = {})
@weight = params[:weight] || 0
@symbol = params[:symbol] || ''
@left = params[:left] || nil
@right = params[:right] || nil
@parent = params[:parent] || nil
end
def walk(&block)
walk_node('', &block)
end
def walk_node(code, &block)
yield(self, code)
@left.walk_node(code + '0', &block) unless @left.nil?
@right.walk_node(code + '1', &block) unless @right.nil?
end
def leaf?
@symbol != ''
end
def internal?
@symbol == ''
end
def root?
internal? and @parent.nil?
end
end
class NodeQueue
attr_accessor :nodes, :huffman_root
def initialize(list)
frequencies = {}
list.each do |c|
frequencies[c] ||= 0
frequencies[c] += 1
end
@nodes = []
frequencies.each do |c, w|
@nodes << HuffNode.new(:symbol => c, :weight => w)
end
generate_tree
end
def find_smallest(not_this)
smallest = nil
for i in 0..@nodes.size - 1
if i == not_this
next
end
if smallest.nil? or @nodes[i].weight < @nodes[smallest].weight
smallest = i
end
end
smallest
end
def generate_tree
while @nodes.size > 1
node1 = self.find_smallest(-1)
node2 = self.find_smallest(node1)
new = merge_nodes(@nodes[node1], @nodes[node2])
if node1 > node2
@nodes.delete_at(node1)
@nodes.delete_at(node2)
else
@nodes.delete_at(node2)
@nodes.delete_at(node1)
end
@nodes << new
end
@huffman_root = @nodes.first
end
def merge_nodes(node1, node2)
left = node1
right = node2
node = HuffNode.new(:weight => left.weight + right.weight, :left => left, :right => right)
left.parent = right.parent = node
node
end
end
class HuffmanEncoding
attr_accessor :root, :lookup, :input, :output
def initialize(input)
@input = input
@root = NodeQueue.new(input).huffman_root
# @output = encode_list(input)
end
def lookup
return @lookup if @lookup
@lookup = {}
@root.walk do |node, code|
@lookup[code] = node.symbol if node.leaf?
end
@lookup
end
def encode(entry)
self.lookup.invert[entry] || ""
end
def decode(code)
self.lookup[code] || ""
end
def encode_list(list)
code = ''
list.each do |c|
code += encode(c)
end
code
end
def decode_string(code)
code = code.to_s
string = ''
subcode = ''
code.each_char do |bit|
subcode += bit
unless decode(subcode).nil?
string += decode(subcode)
subcode = ''
end
end
string
end
def to_s
@output
end
def [](char)
encode(char)
end
end