蛋疼数学程序帝！散列算法

后知后觉

也不知道怎么的.
昨天晚上躺在床上准备睡觉的时候莫名其妙的就想到了这个帖子.
然后就莫名其妙的想到了这个方法.不知道可不可行.
除了 整数 类的对象在 RGSS 里是唯一的外.
符号 类的对象也是唯一的.
起初是用的数组的 pack("ll") 后 to_sym 弄成 符号
然后就改用 Marshal.dump 后再 to_sym

1. 
   
2. class Point < Array
   
3.   def initialize(x, y)
   
4.     super(2)
   
5.     self[0] = x
   
6.     self[1] = y
   
7.   end
   
8.   def x
   
9.     return self[0].nil? ? 0 : self[0]
   
10.   end
    
11.   def y
    
12.     return self[1].nil? ? 0 : self[1]
    
13.   end
    
14.   def hash
    
15.     if @hash.nil?
    
16.       @hash = Marshal.dump(self)
    
17.       @hash.gsub!("\0"){ "hzhj" }
    
18.       @hash = @hash.to_sym
    
19.     end
    
20.     return @hash
    
21.   end
    
22. end
    
23. h = {}
    
24. h[Point.new(1, 1).hash] = 1
    
25. h[Point.new(1, 1).hash] = 2
    
26. h[Point.new(1, 1).hash] = 3
    
27. h[Point.new(1, 1).hash] = 4
    
28. 
    
29. h[Point.new(1, 0).hash] = 11
    
30. h[Point.new(1, 0).hash] = 12
    
31. h[Point.new(0, 1).hash] = 13
    
32. h[Point.new(0, 1).hash] = 14
    
33. 
    
34. h[Point.new(2, 0).hash] = 15
    
35. h[Point.new(2, 0).hash] = 16
    
36. h[Point.new(0, 2).hash] = 17
    
37. h[Point.new(0, 2).hash] = 18
    
38. 
    
39. h[Point.new(0b10001000100010001000, 0b10011001100110011001).hash] = 19
    
40. h[Point.new(0b10001000100010001000, 0b10011001100110011001).hash] = 20
    
41. 
    
42. h[Point.new(0b10001000100010001000, 0b10011001100110011000).hash] = 21
    
43. h[Point.new(0b10001000100010001000, 0b10011001100110011000).hash] = 22
    
44. 
    
45. h[Point.new(0b10001000100010001000101010101010,
    
46.             0b10011001100110011001100110011001).hash] = 23
    
47. h[Point.new(0b10001000100010001000101010101010,
    
48.             0b10011001100110011001100110011001).hash] = 24
    
49. 
    
50. 
    
51. p h[Point.new(1, 1).hash],Point.new(1, 1).hash,
    
52.   h[Point.new(1, 0).hash],Point.new(1, 0).hash,
    
53.   h[Point.new(0, 1).hash],Point.new(0, 1).hash,
    
54.   h[Point.new(2, 0).hash],Point.new(2, 0).hash,
    
55.   h[Point.new(0, 2).hash],Point.new(0, 2).hash,
    
56.   h[Point.new(0b10001000100010001000, 0b10011001100110011001).hash],
    
57.   Point.new(0b10001000100010001000, 0b10011001100110011001).hash,
    
58.   h[Point.new(0b10001000100010001000, 0b10011001100110011000).hash],
    
59.   Point.new(0b10001000100010001000, 0b10011001100110011000).hash,
    
60.   h[Point.new(0b10001000100010001000101010101010,
    
61.             0b10011001100110011001100110011001).hash],
    
62.   Point.new(0b10001000100010001000101010101010,
    
63.             0b10011001100110011001100110011001).hash
    
64. 
    
65. exit
    

复制代码