github
Advanced Search
  • Home
  • Pricing and Signup
  • Explore GitHub
  • Blog
  • Login

shvets / design_patterns_in_ruby

  • Admin
  • Watch Unwatch
  • Fork
  • Your Fork
  • Pull Request
  • Download Source
    • 165
    • 5
  • Source
  • Commits
  • Network (5)
  • Issues (0)
  • Downloads (0)
  • Wiki (1)
  • Graphs
  • Branch: master

click here to add a description

click here to add a homepage

  • Branches (1)
    • master ✓
  • Tags (0)
Sending Request…
Enable Donations

Pledgie Donations

Once activated, we'll place the following badge in your repository's detail box:
Pledgie_example
This service is courtesy of Pledgie.

Implementation of Design Patterns in Ruby — Read more

  cancel

  cancel
  • Private
  • Read-Only
  • HTTP Read-Only

This URL has Read+Write access

added act_as_observable to make dynamic code generation for observables Comment
shvets (author)
Sun Mar 22 08:28:29 -0700 2009
commit  698dcfab8a2d89909d49f8b6207beb7df4563bf1
tree    e63925a79d07d54eb8612e034e06f535a6768960
parent  b739593f4346a72e183c0b2ec95ea3ac5d6baace
design_patterns_in_ruby / behavioral / iterator.rb behavioral/iterator.rb
100644 125 lines (85 sloc) 1.823 kb
edit raw blame history
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
# iterator.rb
 
# Provides a way to access the elements of an aggregate object sequentially without exposing
# its underlying representation.
 
# 1. external iteator
 
class ExternalIterator
  def initialize(array)
    @array = Array.new(array)
    @index = 0
  end
 
  def has_next?
    @index < @array.length
  end
 
  def next
    value = @array[@index]
 
    @index += 1
 
    value
  end
 
  def current_element
    @array[@index]
  end
end
 
# 2. internal iteator
 
module InternalIterator
  def initialize()
    @array = []
  end
 
  def each()
    copy = Array.new(@array)
 
    i = 0
 
    while i < copy.length
      if block_given?
        yield(copy[i])
      end
 
      i += 1
    end
  end
end
 
class TestInternalIterator
  include InternalIterator
 
  def initialize
    super
 
    @array = ['i1', 'i2', 'i3', 'i4']
  end
end
 
# 3. Iterator with help of Enumerable
 
class Element
  attr_accessor :name, :value
 
  def initialize(name, value)
    @name = name
    @value = value
  end
 
  # this method is important for Enumerable
  def <=>(other)
    value <=> other.value
  end
end
 
class TestEnumerable
  include Enumerable
 
  def initialize
    @array = []
  end
 
  def each(&block)
    @array.each(&block)
  end
 
  def <<(element)
    @array << element
  end
end
 
# test
 
array = ['e1', 'e2', 'e3', 'e4']
 
e_it = ExternalIterator.new(array)
 
while e_it.has_next?
  puts e_it.next.to_s
end
 
 
i_it = TestInternalIterator.new()
 
i_it.each {|e| puts e.to_s}
 
 
test = TestEnumerable.new
 
el = Element.new("n2", 2001)
 
test << Element.new("n1", 1)
test << el
test << Element.new("n3", 22)
test << Element.new("n4", 64)
 
puts "Has n2: " + test.include?(el).to_s
 
puts "All elements have value >= 10: " + (test.all? {|e| e.value >= 10}).to_s
 
puts "Has any element with value >= 2000: " + (test.any? {|e| e.value > 2000}).to_s
 
Blog | Support | Training | Contact | API | Status | Twitter | Help | Security
© 2010 GitHub Inc. All rights reserved. | Terms of Service | Privacy Policy
Powered by the Dedicated Servers and
Cloud Computing of Rackspace Hosting®
Dedicated Server