libev-perl 4.21-1build1 source package in Ubuntu
Changelog
libev-perl (4.21-1build1) xenial; urgency=medium * Rebuild for Perl 5.22.1. -- Colin Watson <email address hidden> Fri, 18 Dec 2015 12:04:37 +0000
Upload details
- Uploaded by:
- Colin Watson
- Uploaded to:
- Xenial
- Original maintainer:
- Debian Perl Group
- Architectures:
- any
- Section:
- perl
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| libev-perl_4.21.orig.tar.gz | 187.4 KiB | 48ddccedbd0b8b44894df04db92f0d1148e4bcf8a219847125e70263552a2185 |
| libev-perl_4.21-1build1.debian.tar.xz | 4.2 KiB | d8cb6e40ac0266eee78dcf982751af9c365c916bf72bb749b8929a01ae923781 |
| libev-perl_4.21-1build1.dsc | 2.1 KiB | 7430ce480b2b04b4ad0372622bd0eede863121ca5b739a561a09c3c880ef9030 |
Available diffs
- diff from 4.21-1 (in Debian) to 4.21-1build1 (295 bytes)
Binary packages built by this source
- libev-perl: Perl interface to libev, the high performance event loop
EV provides a Perl interface to libev, a high performance and full-featured
event loop that is loosely modelled after libevent.
.
It includes relative timers, absolute timers with customized rescheduling,
synchronous signals, process status change events, event watchers dealing
with the event loop itself, file watchers, and even limited support for
fork events.
.
It uses a priority queue to manage timers and uses arrays as fundamental
data structure. It has no artificial limitations on the number of watchers
waiting for the same event.
- libev-perl-dbgsym: debug symbols for package libev-perl
EV provides a Perl interface to libev, a high performance and full-featured
event loop that is loosely modelled after libevent.
.
It includes relative timers, absolute timers with customized rescheduling,
synchronous signals, process status change events, event watchers dealing
with the event loop itself, file watchers, and even limited support for
fork events.
.
It uses a priority queue to manage timers and uses arrays as fundamental
data structure. It has no artificial limitations on the number of watchers
waiting for the same event.
