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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
package Class::MOP::Method::Wrapped;
use strict;
use warnings;
use Carp 'confess';
use Scalar::Util 'reftype', 'blessed';
use Sub::Name 'subname';
our $VERSION = '0.02';
our $AUTHORITY = 'cpan:STEVAN';
use base 'Class::MOP::Method';
# NOTE:
# this ugly beast is the result of trying
# to micro optimize this as much as possible
# while not completely loosing maintainability.
# At this point it's "fast enough", after all
# you can't get something for nothing :)
my $_build_wrapped_method = sub {
my $modifier_table = shift;
my ($before, $after, $around) = (
$modifier_table->{before},
$modifier_table->{after},
$modifier_table->{around},
);
if (@$before && @$after) {
$modifier_table->{cache} = sub {
$_->(@_) for @{$before};
my @rval;
((defined wantarray) ?
((wantarray) ?
(@rval = $around->{cache}->(@_))
:
($rval[0] = $around->{cache}->(@_)))
:
$around->{cache}->(@_));
$_->(@_) for @{$after};
return unless defined wantarray;
return wantarray ? @rval : $rval[0];
}
}
elsif (@$before && !@$after) {
$modifier_table->{cache} = sub {
$_->(@_) for @{$before};
return $around->{cache}->(@_);
}
}
elsif (@$after && !@$before) {
$modifier_table->{cache} = sub {
my @rval;
((defined wantarray) ?
((wantarray) ?
(@rval = $around->{cache}->(@_))
:
($rval[0] = $around->{cache}->(@_)))
:
$around->{cache}->(@_));
$_->(@_) for @{$after};
return unless defined wantarray;
return wantarray ? @rval : $rval[0];
}
}
else {
$modifier_table->{cache} = $around->{cache};
}
};
sub wrap {
my $class = shift;
my $code = shift;
(blessed($code) && $code->isa('Class::MOP::Method'))
|| confess "Can only wrap blessed CODE";
my $modifier_table = {
cache => undef,
orig => $code,
before => [],
after => [],
around => {
cache => $code->body,
methods => [],
},
};
$_build_wrapped_method->($modifier_table);
my $method = $class->SUPER::wrap(sub { $modifier_table->{cache}->(@_) });
$method->{modifier_table} = $modifier_table;
$method;
}
sub get_original_method {
my $code = shift;
$code->{modifier_table}->{orig};
}
sub add_before_modifier {
my $code = shift;
my $modifier = shift;
unshift @{$code->{modifier_table}->{before}} => $modifier;
$_build_wrapped_method->($code->{modifier_table});
}
sub add_after_modifier {
my $code = shift;
my $modifier = shift;
push @{$code->{modifier_table}->{after}} => $modifier;
$_build_wrapped_method->($code->{modifier_table});
}
{
# NOTE:
# this is another possible canidate for
# optimization as well. There is an overhead
# associated with the currying that, if
# eliminated might make around modifiers
# more manageable.
my $compile_around_method = sub {{
my $f1 = pop;
return $f1 unless @_;
my $f2 = pop;
push @_, sub { $f2->( $f1, @_ ) };
redo;
}};
sub add_around_modifier {
my $code = shift;
my $modifier = shift;
unshift @{$code->{modifier_table}->{around}->{methods}} => $modifier;
$code->{modifier_table}->{around}->{cache} = $compile_around_method->(
@{$code->{modifier_table}->{around}->{methods}},
$code->{modifier_table}->{orig}->body
);
$_build_wrapped_method->($code->{modifier_table});
}
}
1;
__END__
=pod
=head1 NAME
Class::MOP::Method::Wrapped - Method Meta Object to handle before/around/after modifiers
=head1 SYNOPSIS
# ... more to come later maybe
=head1 DESCRIPTION
=head1 METHODS
=head2 Construction
=over 4
=item B<wrap (&code)>
=item B<get_original_method>
=back
=head2 Modifiers
=over 4
=item B<add_before_modifier ($code)>
=item B<add_after_modifier ($code)>
=item B<add_around_modifier ($code)>
=back
=head1 AUTHORS
Stevan Little E<lt>stevan@iinteractive.comE<gt>
Yuval Kogman E<lt>nothingmuch@woobling.comE<gt>
=head1 COPYRIGHT AND LICENSE
Copyright 2006 by Infinity Interactive, Inc.
L<http://www.iinteractive.com>
This library is free software; you can redistribute it and/or modify
it under the same terms as Perl itself.
=cut
|
