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
|
# You may distribute under the terms of either the GNU General Public License
# or the Artistic License (the same terms as Perl itself)
#
# (C) Paul Evans, 2006-2009 -- leonerd@leonerd.org.uk
package # hide from CPAN
IO::Async::Internals::TimeQueue;
use strict;
use warnings;
use Carp;
use Heap::Fibonacci;
use Time::HiRes qw( time );
sub new
{
my $class = shift;
my ( %params ) = @_;
my $self = bless {
heap => Heap::Fibonacci->new,
}, $class;
return $self;
}
sub next_time
{
my $self = shift;
my $heap = $self->{heap};
my $top = $heap->top;
return defined $top ? $top->time : undef;
}
sub enqueue
{
my $self = shift;
my ( %params ) = @_;
my $code = delete $params{code};
ref $code or croak "Expected 'code' to be a reference";
defined $params{time} or croak "Expected 'time'";
my $time = $params{time};
my $heap = $self->{heap};
my $elem = IO::Async::Internals::TimeQueue::Elem->new( $time, $code );
$heap->add( $elem );
return $elem;
}
sub cancel
{
my $self = shift;
my ( $id ) = @_;
my $heap = $self->{heap};
$heap->delete( $id );
}
sub requeue
{
my $self = shift;
my ( $id, %params ) = @_;
defined $params{time} or croak "Expected 'time'";
my $time = $params{time};
my $heap = $self->{heap};
my $elem = $heap->delete( $id );
defined $elem or croak "No such enqueued timer";
$elem->time( $time );
$heap->add( $elem );
return $elem;
}
sub fire
{
my $self = shift;
my ( %params ) = @_;
my $now = exists $params{now} ? $params{now} : time();
my $heap = $self->{heap};
my $count = 0;
while( defined( my $top = $heap->top ) ) {
last if( $top->time > $now );
$top->code->();
$count++;
$heap->extract_top;
}
return $count;
}
# Keep perl happy; keep Britain tidy
1;
package # hide from CPAN
IO::Async::Internals::TimeQueue::Elem;
use strict;
use base qw( Heap::Elem );
sub new
{
my $self = shift;
my $class = ref $self || $self;
my ( $time, $code ) = @_;
my $new = $class->SUPER::new(
time => $time,
code => $code,
);
return $new;
}
sub time
{
my $self = shift;
$self->val->{time} = $_[0] if @_;
return $self->val->{time};
}
sub code
{
my $self = shift;
return $self->val->{code};
}
# This only uses methods so is transparent to HASH or ARRAY
sub cmp
{
my $self = shift;
my $other = shift;
$self->time <=> $other->time;
}
# Keep perl happy; keep Britain tidy
1;
|
