HTML-TableParser-0.42/ 0000755 0000407 0000036 00000000000 13076215166 012466 5 ustar dj head HTML-TableParser-0.42/META.yml 0000644 0000407 0000036 00000001420 13075416153 013732 0 ustar dj head ---
abstract: 'Extract data from an HTML table'
author:
- 'Diab Jerius (djerius@cpan.org)'
build_requires:
ExtUtils::MakeMaker: '6.59'
Test::More: '0.32'
configure_requires:
CPAN::Meta: '0'
ExtUtils::MakeMaker: '6.59'
dynamic_config: '0'
generated_by: 'Module::Install version 1.16, CPAN::Meta::Converter version 2.150005'
license: unknown
meta-spec:
url: http://module-build.sourceforge.net/META-spec-v1.4.html
version: '1.4'
name: HTML-TableParser
no_index:
directory:
- inc
- t
- xt
requires:
HTML::Entities: '0'
HTML::Parser: '3.26'
perl: v5.8.1
resources:
license: http://opensource.org/licenses/gpl-3.0.html
repository: http://bitbucket.org/djerius/html-tableparser
version: '0.41'
x_serialization_backend: 'CPAN::Meta::YAML version 0.012'
HTML-TableParser-0.42/xt/ 0000755 0000407 0000036 00000000000 13076215166 013121 5 ustar dj head HTML-TableParser-0.42/xt/nobreakpoints.t 0000644 0000407 0000036 00000000254 13075413113 016154 0 ustar dj head
use Test::More;
eval "use Test::NoBreakpoints 0.10";
plan skip_all => "Test::NoBreakpoints 0.10 required for testing" if $@;
all_files_no_breakpoints_ok();
done_testing;
HTML-TableParser-0.42/xt/changes.t 0000644 0000407 0000036 00000000067 13075413113 014710 0 ustar dj head use Test::More;
use Test::CPAN::Changes;
changes_ok();
HTML-TableParser-0.42/xt/00-compile.t 0000644 0000407 0000036 00000000206 13075413113 015140 0 ustar dj head #!perl
use strict;
use warnings;
use Test::Compile;
my $test = Test::Compile->new();
$test->all_files_ok();
$test->done_testing();
HTML-TableParser-0.42/xt/pod.t 0000644 0000407 0000036 00000000214 13075413113 014054 0 ustar dj head #!perl -T
use Test::More;
eval "use Test::Pod 1.14";
plan skip_all => "Test::Pod 1.14 required for testing POD" if $@;
all_pod_files_ok();
HTML-TableParser-0.42/xt/pod-coverage.t 0000644 0000407 0000036 00000000255 13075413113 015652 0 ustar dj head #!perl -T
use Test::More;
eval "use Test::Pod::Coverage 1.04";
plan skip_all => "Test::Pod::Coverage 1.04 required for testing POD coverage" if $@;
all_pod_coverage_ok();
HTML-TableParser-0.42/xt/perlcritic.t 0000644 0000407 0000036 00000000327 13075413113 015437 0 ustar dj head #!perl
use Test::More;
if (! eval{ require Test::Perl::Critic }) {
Test::More::plan(
skip_all => "Test::Perl::Critic required for testing PBP compliance"
);
}
Test::Perl::Critic::all_critic_ok();
HTML-TableParser-0.42/META.json 0000644 0000407 0000036 00000003460 13075416153 014110 0 ustar dj head {
"abstract" : "Extract data from an HTML table",
"author" : [
"Diab Jerius (djerius@cpan.org)"
],
"dynamic_config" : "0",
"generated_by" : "Module::Install version 1.16, CPAN::Meta::Converter version 2.150005",
"license" : [
"unknown"
],
"meta-spec" : {
"url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec",
"version" : "2"
},
"name" : "HTML-TableParser",
"no_index" : {
"directory" : [
"inc",
"t",
"xt"
]
},
"prereqs" : {
"build" : {
"requires" : {
"ExtUtils::MakeMaker" : "6.59"
}
},
"configure" : {
"requires" : {
"CPAN::Meta" : "0",
"ExtUtils::MakeMaker" : "6.59"
}
},
"develop" : {
"requires" : {
"Module::Install" : "0",
"Module::Install::AuthorTests" : "0",
"Module::Install::AutoLicense" : "0",
"Module::Install::CPANfile" : "0",
"Test::CPAN::Changes" : "0",
"Test::Compile" : "0",
"Test::NoBreakpoints" : "0",
"Test::Perl::Critic" : "0",
"Test::Pod" : "0",
"Test::Pod::Coverage" : "0"
}
},
"runtime" : {
"requires" : {
"HTML::Entities" : "0",
"HTML::Parser" : "3.26",
"perl" : "v5.8.1"
}
},
"test" : {
"requires" : {
"Test::More" : "0.32"
}
}
},
"release_status" : "stable",
"resources" : {
"license" : [
"http://opensource.org/licenses/gpl-3.0.html"
],
"repository" : {
"url" : "http://bitbucket.org/djerius/html-tableparser"
}
},
"version" : "0.41",
"x_serialization_backend" : "JSON::PP version 2.27300"
}
HTML-TableParser-0.42/tdata/ 0000755 0000407 0000036 00000000000 13076215166 013563 5 ustar dj head HTML-TableParser-0.42/tdata/end_table.html 0000644 0000407 0000036 00000000277 13075413113 016363 0 ustar dj head
Too Many End Table Tags
Too Many End Table Tags
HTML-TableParser-0.42/t/ 0000755 0000407 0000036 00000000000 13076215166 012731 5 ustar dj head HTML-TableParser-0.42/t/00-load.t 0000644 0000407 0000036 00000000240 13075413113 014235 0 ustar dj head #!perl -T
use Test::More tests => 1;
BEGIN {
use_ok('HTML::TableParser');
}
diag( "Testing HTML::TableParser $HTML::TableParser::VERSION, Perl $], $^X" );
HTML-TableParser-0.42/t/req_order.t 0000644 0000407 0000036 00000001577 13076214662 015112 0 ustar dj head use Test::More tests => 3;
BEGIN { use_ok( 'HTML::TableParser' ); }
require './t/common.pl';
my $header = [];
my @parse_data;
sub start
{
@parse_data = ();
}
sub row
{
my ( $tbl_id, $line_no, $data, $udata ) = @_;
my $data_s = join("\t", @$data);
push @parse_data, $data_s;
}
sub header
{
my ( $tbl_id, $line_no, $col_names, $udata ) = @_;
$header = $col_names;
}
@reqs = (
{
colre => [ qr/NO MATCH POSSIBLE/ ],
},
{
id => 'DEFAULT',
start => \&start,
hdr => \&header,
row => \&row
},
) ;
my $html = 'data/ned.html';
my @data_t = ( 'Default' );
my ($columns, $data, $datafile ) = read_table_data( $html, \@data_t );
my $p = HTML::TableParser->new( \@reqs );
$p->parse_file( 'data/ned.html' ) || die;
ok( eq_array( $header, $columns ), "$html header" );
ok( eq_array( $data->{Default}, \@parse_data ), "$html data" );
HTML-TableParser-0.42/t/methods.t 0000644 0000407 0000036 00000000676 13076214662 014572 0 ustar dj head use Test::More tests => 6;
BEGIN { use_ok( 'HTML::TableParser' ); }
require './t/counts.pl';
{
package Foo;
sub new
{
my $this = shift;
my $class = ref($this) || $this;
my $self = {};
bless $self, $class;
}
sub start { shift; &::start }
sub end { shift; &::end }
sub hdr { shift; &::hdr }
sub row { shift; &::row }
}
my $foo = Foo->new();
our %req = ( id => 'DEFAULT', obj => $foo );
run( %req );
HTML-TableParser-0.42/t/funcs.t 0000644 0000407 0000036 00000000314 13076214662 014232 0 ustar dj head use Test::More tests => 6;
BEGIN { use_ok( 'HTML::TableParser' ); }
require './t/counts.pl';
%req = ( id => 'DEFAULT',
start => \&start,
end => \&end,
hdr => \&hdr,
row => \&row );
run(%req);
HTML-TableParser-0.42/t/contents.t 0000644 0000407 0000036 00000020762 13076214662 014762 0 ustar dj head use strict;
use warnings;
use Test::More tests => 131;
use IO::File;
use File::Basename;
BEGIN { use_ok( 'HTML::TableParser' ); }
require './t/common.pl';
our $verbose = 0;
our $create = 1;
our $header;
our $columns;
our @parse_data;
my $fh;
sub start
{
my ( $tbl_id, $line_no, $udata ) = @_;
print STDERR "start: $tbl_id\n" if $verbose;
die( "whoops! we're already in the middle of a table!\n" )
if @parse_data;
@parse_data = ();
}
sub start_create
{
@parse_data = ();
my ( $tbl_id, $line_no, $udata ) = @_;
print STDERR "start_create: $tbl_id\n" if $verbose;
$fh = IO::File->new( $udata->{data}, 'w' )
or die( "unable to create $udata->{data}\n" );
}
sub end_create
{
my ( $tbl_id, $line_no, $udata ) = @_;
print STDERR "end_create: $tbl_id\n" if $verbose;
$fh->close;
}
sub row
{
my ( $tbl_id, $line_no, $data, $udata ) = @_;
print STDERR "row: $tbl_id\n" if $verbose;
my $data_s = join("\t", @$data);
print $fh $data_s, $;
if $create;
push @parse_data, $data_s;
}
sub header
{
my ( $tbl_id, $line_no, $col_names, $udata ) = @_;
print STDERR "header: $tbl_id\n" if $verbose;
$header = $col_names;
if ( $create )
{
open FILE, ">$udata->{hdr}" or die;
print FILE "$_\n" foreach @$col_names;
close FILE;
@$columns = @$col_names;
}
}
our @data_t = qw( Default Chomp Trim Decode );
opendir( DDIR, 'data' ) or die( "error reading dir data\n" );
my @html = map { "data/$_" } grep { /.html$/ } readdir( DDIR );
closedir DDIR;
for my $html ( @html )
{
( my $hdrfile = $html ) =~ s/.html/.hdr/;
my %req = ( hdr => \&header, row => \&row,
udata => { hdr => $hdrfile }
);
my $data;
unless( $create )
{
($columns, $data ) = read_table_data( $html, \@data_t );
$req{start} = \&start;
}
else
{
$req{start} = \&start_create;
$req{end} = \&end_create;
}
foreach my $type ( @data_t )
{
my %attr = $type eq 'Default' ? () : ( $type => 1 );
( my $datafile = $html ) =~ s/.html/.$type.data/;
$req{udata}{data} = $datafile;
{
local $req{id} = 1;
my $p = HTML::TableParser->new( [ \%req ], \%attr );
undef @parse_data;
$header = undef;
$p->parse_file( $html ) || die;
ok( eq_array( $header, $columns ), "$html id" );
$data->{$type} = [@parse_data] if $create;
ok( eq_array( $data->{$type}, \@parse_data ), "$html($type) id data" );
}
{
local $req{cols} = [ $columns->[0] ];
my $p = HTML::TableParser->new( [ \%req ], \%attr );
undef @parse_data;
$header = undef;
$p->parse_file( $html ) || die;
ok( eq_array( $header, $columns ), "$html cols" );
ok( eq_array( $data->{$type}, \@parse_data ), "$html($type) cols data" );
}
{
my $re = $columns->[-1];
substr($re, -1, 1, '');
local $req{colre} = [ $re ];
undef @parse_data;
$header = undef;
my $p = HTML::TableParser->new( [ \%req ], \%attr );
$p->parse_file( $html ) || die;
ok( eq_array( $header, $columns ), "$html colre" );
ok( eq_array( $data->{$type}, \@parse_data ), "$html($type) colre data" );
}
{
$header = undef;
local $req{cols} = [ "this column doesn't exist" ];
undef @parse_data;
$header = undef;
my $p = HTML::TableParser->new( [ \%req ], \%attr );
$p->parse_file( $html ) || die;
ok( !defined $header, "$html($type) cols: no match" );
}
}
}
# table2.html has an embedded table. check that out now.
{
my $html = 'data/table2.html';
my $fakehtml = 'data/table2-1.html';
my $hdrfile = 'data/table2-1.hdr';
my %req = ( hdr => \&header, row => \&row,
udata => { hdr => $hdrfile }
);
my $data;
my $datafile;
unless( $create )
{
($columns, $data, $datafile ) = read_table_data( $fakehtml, \@data_t );
$req{start} = \&start;
}
else
{
$req{start} = \&start_create;
$req{end} = \&end_create;
}
foreach my $type ( @data_t )
{
my %attr = $type eq 'Default' ? () : ( $type => 1 );
( my $datafile = $fakehtml ) =~ s/.html/.$type.data/;
$req{udata}{data} = $datafile;
$header = undef;
{
local $req{id} = 1.1;
my $p = HTML::TableParser->new( [ \%req ], \%attr );
undef @parse_data;
$p->parse_file( $html ) || die;
ok( eq_array( $header, $columns ), "$fakehtml id" );
$data->{$type} = [@parse_data] if $create;
ok( eq_array( $data->{$type}, \@parse_data ), "$fakehtml($type) id data" );
}
}
}
# check id coderef mode. no need to do the create bit,
# as we're reusing stuff from just above here
{
local $create = 0;
my $html = 'data/table2.html';
my $fakehtml = 'data/table2-1.html';
my $hdrfile = 'data/table2-1.hdr';
my %req = ( hdr => \&header, row => \&row, start => \&start,
id => sub { $_[0] eq '1.1' },
udata => { hdr => $hdrfile,
data => 'data/table2-1.Default.data' }
);
my ( $data, $datafile );
($columns, $data, $datafile ) = read_table_data( $fakehtml, [ 'Default' ] );
$header = undef;
my $p = HTML::TableParser->new( [ \%req ] );
undef @parse_data;
$p->parse_file( $html ) || die;
ok( eq_array( $header, $columns ), "$fakehtml id = coderef" );
ok( eq_array( $data->{Default}, \@parse_data ),
"$fakehtml(Default) id = coderef data" );
}
# check id exclude mode. no need to do the create bit,
# as we're reusing stuff from just above here
{
local $create = 0;
my $html = 'data/table2.html';
my $fakehtml = 'data/table2-1.html';
my $hdrfile = 'data/table2-1.hdr';
my %req = ( hdr => \&header, row => \&row, start => \&start,
id => [ '-', sub { $_[0] eq '1' }, 'DEFAULT' ],
udata => { hdr => $hdrfile,
data => 'data/table2-1.Default.data' }
);
my ( $data, $datafile );
($columns, $data, $datafile ) = read_table_data( $fakehtml, [ 'Default' ] );
$header = undef;
my $p = HTML::TableParser->new( [ \%req ] );
undef @parse_data;
$p->parse_file( $html ) || die;
ok( eq_array( $header, $columns ), "$fakehtml id exclude" );
ok( eq_array( $data->{Default}, \@parse_data ),
"$fakehtml(Default) id exclude data" );
}
# check id skip mode.
# no need to do the create bit,
# as we're reusing stuff from just above here
{
local $create = 0;
my $html = 'data/table2.html';
my $fakehtml = 'data/table2-1.html';
my $hdrfile = 'data/table2-1.hdr';
my @reqs =
(
{ id => [ '--', '1' ] },
{
hdr => \&header, row => \&row, start => \&start,
id => 'DEFAULT',
udata => { hdr => $hdrfile,
data => 'data/table2-1.Default.data' }
}
);
my ( $data, $datafile );
($columns, $data, $datafile ) = read_table_data( $fakehtml, [ 'Default' ] );
$header = undef;
my $p = HTML::TableParser->new( \@reqs );
undef @parse_data;
$p->parse_file( $html ) || die;
ok( eq_array( $header, $columns ), "$fakehtml id skip" );
ok( eq_array( $data->{Default}, \@parse_data ),
"$fakehtml(Default) id skip data" );
}
# check id re mode. no need to do the create bit,
# as we're reusing stuff from just above here
{
local $create = 0;
my $html = 'data/table2.html';
my $fakehtml = 'data/table2-1.html';
my $hdrfile = 'data/table2-1.hdr';
my %req = ( hdr => \&header, row => \&row, start => \&start,
id => qr/\.1$/,
udata => { hdr => $hdrfile,
data => 'data/table2-1.Default.data' }
);
my ( $data, $datafile );
($columns, $data, $datafile ) = read_table_data( $fakehtml, [ 'Default' ] );
$header = undef;
my $p = HTML::TableParser->new( [ \%req ] );
undef @parse_data;
$p->parse_file( $html ) || die;
ok( eq_array( $header, $columns ), "$fakehtml idre" );
ok( eq_array( $data->{Default}, \@parse_data ),
"$fakehtml(Default) idre data" );
}
# check cols coderef mode. no need to do the create bit,
# as we're reusing stuff from just above here
{
use Data::Dumper;
local $create = 0;
my $html = 'data/screwy.html';
my $datafile = 'data/screwy.Default.data';
my $hdrfile = 'data/screwy.hdr';
my %req = ( hdr => \&header, row => \&row, start => \&start,
cols => sub { grep { /Widget A/ } @{$_[2]} },
udata => { hdr => $hdrfile,
data => $datafile }
);
my $data;
($columns, $data, $datafile ) = read_table_data( $html, [ 'Default' ] );
$header = undef;
my $p = HTML::TableParser->new( [ \%req ] );
undef @parse_data;
$p->parse_file( $html ) || die;
ok( eq_array( $header, $columns ), "$html cols = coderef" );
ok( eq_array( $data->{Default}, \@parse_data ),
"$html(Default) cols = coderef data" );
}
HTML-TableParser-0.42/t/end_table.t 0000644 0000407 0000036 00000000365 13075413113 015026 0 ustar dj head use Test::More tests => 2;
BEGIN { use_ok( 'HTML::TableParser' ); }
my $p = HTML::TableParser->new( [ { id => 'DEFAULT' } ] );
eval {
$p->parse_file( 'tdata/end_table.html' );
};
ok ( $@ && $@ =~ m{too many }, 'extra tags' );
HTML-TableParser-0.42/t/class-01.t 0000644 0000407 0000036 00000002565 13075413113 014440 0 ustar dj head use Test::More tests => 4;
BEGIN { use_ok( 'HTML::TableParser' ); }
our ( $start, $end, $hdr, $nrow, $ncols );
sub start
{
$hdr = 0;
$nrow = 0;
$ncols = 0;
$end = 0;
$start++;
};
sub end{ $end++ };
sub hdr
{
my( $tbl_id, $line_no, $col_names, $udata ) = @_;
$hdr++;
$ncols = @$col_names;
};
sub row
{
my( $tbl_id, $line_no, $data ) = @_;
$nrow++;
};
sub run
{
my ( %req ) = @_;
#------------------------------------------------------
}
{
package Foo;
sub new
{
my $this = shift;
my $class = ref($this) || $this;
my $self = {};
bless $self, $class;
}
sub start { shift; &::start }
sub end { shift; &::end }
sub hdr { shift; &::hdr }
sub row { shift; &::row }
}
{
my $p = HTML::TableParser->new( [ { id => 'DEFAULT',
class => 'Foo' } ]
) or die;
$p->parse_file( 'data/ned.html' ) || die;
ok( 1 == $end, "class method check" );
}
{
my $p = HTML::TableParser->new( [{ id => 'DEFAULT',
class => 'Foo',
end => undef
}]
) or die;
$p->parse_file( 'data/ned.html' ) || die;
ok( 0 == $end, "class method undef check" );
}
{
my $foo = Foo->new();
my $p = HTML::TableParser->new( [{ id => 'DEFAULT',
obj => $foo,
end => undef
}]
) or die;
$p->parse_file( 'data/ned.html' ) || die;
ok( 0 == $end, "object method undef check" );
}
HTML-TableParser-0.42/t/class.t 0000644 0000407 0000036 00000000701 13076214662 014221 0 ustar dj head use Test::More tests => 6;
BEGIN { use_ok( 'HTML::TableParser' ); }
require './t/counts.pl';
{
package Foo;
sub new
{
my $this = shift;
my $class = ref($this) || $this;
my $self = {};
bless $self, $class;
}
sub start { shift; &::start }
sub end { shift; &::end }
sub hdr { shift; &::hdr }
sub row { shift; &::row }
}
my $foo = Foo->new();
our %req = ( id => 'DEFAULT', class => 'Foo' );
run( %req );
HTML-TableParser-0.42/t/common.pl 0000644 0000407 0000036 00000000767 13075413113 014557 0 ustar dj head sub read_table_data
{
my ( $html, $data_t ) = @_;
( my $hdrfile = $html ) =~ s/.html/.hdr/;
open FILE, $hdrfile or die( "unable to open $hdrfile\n" );
@columns = ;
chomp(@columns);
my %data;
foreach my $type ( @$data_t )
{
( my $datafile = $html ) =~ s/.html/.$type.data/;
open FILE, $datafile
or die( "couldn't open datafile $datafile{$type}\n");
local $/ = $; ;
$data{$type} = [];
chomp(@{$data{$type}});
}
\@columns, \%data;
}
1;
HTML-TableParser-0.42/t/counts.pl 0000644 0000407 0000036 00000003504 13075413113 014572 0 ustar dj head our ( $start, $end, $hdr, $nrow, $ncols );
sub start
{
$hdr = 0;
$nrow = 0;
$ncols = 0;
$end = 0;
$start++;
};
sub end{ $end++ };
sub hdr
{
my( $tbl_id, $line_no, $col_names, $udata ) = @_;
$hdr++;
$ncols = @$col_names;
};
sub row
{
my( $tbl_id, $line_no, $data ) = @_;
$nrow++;
};
sub run
{
my ( %req ) = @_;
#------------------------------------------------------
{
my $p = HTML::TableParser->new( [ \%req ] ) or die;
$p->parse_file( 'data/ned.html' ) || die;
ok( 1 == $start &&
1 == $end &&
1 == $hdr &&
15 == $ncols &&
116 == $nrow,
"ned check" );
}
#------------------------------------------------------
$start = 0;
{
my $p = HTML::TableParser->new( [ \%req ] ) or die;
$p->parse_file( 'data/screwy.html' ) || die;
ok( 1 == $start &&
1 == $end &&
1 == $hdr &&
8 == $ncols &&
2 == $nrow,
"screwy check" );
}
#------------------------------------------------------
$start = 0;
{
my $p = HTML::TableParser->new( [ \%req ] ) or die;
$p->parse_file( 'data/table.html' ) || die;
ok( 1 == $start &&
1 == $end &&
1 == $hdr &&
16 == $ncols &&
8 == $nrow,
"table check" );
}
#------------------------------------------------------
$req{id} = 1;
$start = 0;
{
my $p = HTML::TableParser->new( [ \%req ] );
$p->parse_file( 'data/table2.html' ) || die;
ok( 1 == $start &&
1 == $end &&
1 == $hdr &&
16 == $ncols &&
9 == $nrow,
"table2 check1" );
}
#------------------------------------------------------
$req{id} = 1.1;
$start = 0;
{
my $p = HTML::TableParser->new( [ \%req ] ) or die;
$p->parse_file( 'data/table2.html' ) || die;
ok( 1 == $start &&
1 == $end &&
1 == $hdr &&
16 == $ncols &&
8 == $nrow,
"table2 check2" );
}
}
1;
HTML-TableParser-0.42/inc/ 0000755 0000407 0000036 00000000000 13076215166 013237 5 ustar dj head HTML-TableParser-0.42/inc/Module/ 0000755 0000407 0000036 00000000000 13076215166 014464 5 ustar dj head HTML-TableParser-0.42/inc/Module/Install/ 0000755 0000407 0000036 00000000000 13076215166 016072 5 ustar dj head HTML-TableParser-0.42/inc/Module/Install/WriteAll.pm 0000644 0000407 0000036 00000002376 13075416151 020157 0 ustar dj head #line 1
package Module::Install::WriteAll;
use strict;
use Module::Install::Base ();
use vars qw{$VERSION @ISA $ISCORE};
BEGIN {
$VERSION = '1.16';
@ISA = qw{Module::Install::Base};
$ISCORE = 1;
}
sub WriteAll {
my $self = shift;
my %args = (
meta => 1,
sign => 0,
inline => 0,
check_nmake => 1,
@_,
);
$self->sign(1) if $args{sign};
$self->admin->WriteAll(%args) if $self->is_admin;
$self->check_nmake if $args{check_nmake};
unless ( $self->makemaker_args->{PL_FILES} ) {
# XXX: This still may be a bit over-defensive...
unless ($self->makemaker(6.25)) {
$self->makemaker_args( PL_FILES => {} ) if -f 'Build.PL';
}
}
# Until ExtUtils::MakeMaker support MYMETA.yml, make sure
# we clean it up properly ourself.
$self->realclean_files('MYMETA.yml');
if ( $args{inline} ) {
$self->Inline->write;
} else {
$self->Makefile->write;
}
# The Makefile write process adds a couple of dependencies,
# so write the META.yml files after the Makefile.
if ( $args{meta} ) {
$self->Meta->write;
}
# Experimental support for MYMETA
if ( $ENV{X_MYMETA} ) {
if ( $ENV{X_MYMETA} eq 'JSON' ) {
$self->Meta->write_mymeta_json;
} else {
$self->Meta->write_mymeta_yaml;
}
}
return 1;
}
1;
HTML-TableParser-0.42/inc/Module/Install/AuthorTests.pm 0000644 0000407 0000036 00000002215 13075416144 020713 0 ustar dj head #line 1
package Module::Install::AuthorTests;
use 5.005;
use strict;
use Module::Install::Base;
use Carp ();
#line 16
use vars qw{$VERSION $ISCORE @ISA};
BEGIN {
$VERSION = '0.002';
$ISCORE = 1;
@ISA = qw{Module::Install::Base};
}
#line 42
sub author_tests {
my ($self, @dirs) = @_;
_add_author_tests($self, \@dirs, 0);
}
#line 56
sub recursive_author_tests {
my ($self, @dirs) = @_;
_add_author_tests($self, \@dirs, 1);
}
sub _wanted {
my $href = shift;
sub { /\.t$/ and -f $_ and $href->{$File::Find::dir} = 1 }
}
sub _add_author_tests {
my ($self, $dirs, $recurse) = @_;
return unless $Module::Install::AUTHOR;
my @tests = $self->tests ? (split / /, $self->tests) : 't/*.t';
# XXX: pick a default, later -- rjbs, 2008-02-24
my @dirs = @$dirs ? @$dirs : Carp::confess "no dirs given to author_tests";
@dirs = grep { -d } @dirs;
if ($recurse) {
require File::Find;
my %test_dir;
File::Find::find(_wanted(\%test_dir), @dirs);
$self->tests( join ' ', @tests, map { "$_/*.t" } sort keys %test_dir );
} else {
$self->tests( join ' ', @tests, map { "$_/*.t" } sort @dirs );
}
}
#line 107
1;
HTML-TableParser-0.42/inc/Module/Install/Win32.pm 0000644 0000407 0000036 00000003403 13075416151 017326 0 ustar dj head #line 1
package Module::Install::Win32;
use strict;
use Module::Install::Base ();
use vars qw{$VERSION @ISA $ISCORE};
BEGIN {
$VERSION = '1.16';
@ISA = 'Module::Install::Base';
$ISCORE = 1;
}
# determine if the user needs nmake, and download it if needed
sub check_nmake {
my $self = shift;
$self->load('can_run');
$self->load('get_file');
require Config;
return unless (
$^O eq 'MSWin32' and
$Config::Config{make} and
$Config::Config{make} =~ /^nmake\b/i and
! $self->can_run('nmake')
);
print "The required 'nmake' executable not found, fetching it...\n";
require File::Basename;
my $rv = $self->get_file(
url => 'http://download.microsoft.com/download/vc15/Patch/1.52/W95/EN-US/Nmake15.exe',
ftp_url => 'ftp://ftp.microsoft.com/Softlib/MSLFILES/Nmake15.exe',
local_dir => File::Basename::dirname($^X),
size => 51928,
run => 'Nmake15.exe /o > nul',
check_for => 'Nmake.exe',
remove => 1,
);
die <<'END_MESSAGE' unless $rv;
-------------------------------------------------------------------------------
Since you are using Microsoft Windows, you will need the 'nmake' utility
before installation. It's available at:
http://download.microsoft.com/download/vc15/Patch/1.52/W95/EN-US/Nmake15.exe
or
ftp://ftp.microsoft.com/Softlib/MSLFILES/Nmake15.exe
Please download the file manually, save it to a directory in %PATH% (e.g.
C:\WINDOWS\COMMAND\), then launch the MS-DOS command line shell, "cd" to
that directory, and run "Nmake15.exe" from there; that will create the
'nmake.exe' file needed by this module.
You may then resume the installation process described in README.
-------------------------------------------------------------------------------
END_MESSAGE
}
1;
HTML-TableParser-0.42/inc/Module/Install/Makefile.pm 0000644 0000407 0000036 00000027437 13075416144 020160 0 ustar dj head #line 1
package Module::Install::Makefile;
use strict 'vars';
use ExtUtils::MakeMaker ();
use Module::Install::Base ();
use Fcntl qw/:flock :seek/;
use vars qw{$VERSION @ISA $ISCORE};
BEGIN {
$VERSION = '1.16';
@ISA = 'Module::Install::Base';
$ISCORE = 1;
}
sub Makefile { $_[0] }
my %seen = ();
sub prompt {
shift;
# Infinite loop protection
my @c = caller();
if ( ++$seen{"$c[1]|$c[2]|$_[0]"} > 3 ) {
die "Caught an potential prompt infinite loop ($c[1]|$c[2]|$_[0])";
}
# In automated testing or non-interactive session, always use defaults
if ( ($ENV{AUTOMATED_TESTING} or -! -t STDIN) and ! $ENV{PERL_MM_USE_DEFAULT} ) {
local $ENV{PERL_MM_USE_DEFAULT} = 1;
goto &ExtUtils::MakeMaker::prompt;
} else {
goto &ExtUtils::MakeMaker::prompt;
}
}
# Store a cleaned up version of the MakeMaker version,
# since we need to behave differently in a variety of
# ways based on the MM version.
my $makemaker = eval $ExtUtils::MakeMaker::VERSION;
# If we are passed a param, do a "newer than" comparison.
# Otherwise, just return the MakeMaker version.
sub makemaker {
( @_ < 2 or $makemaker >= eval($_[1]) ) ? $makemaker : 0
}
# Ripped from ExtUtils::MakeMaker 6.56, and slightly modified
# as we only need to know here whether the attribute is an array
# or a hash or something else (which may or may not be appendable).
my %makemaker_argtype = (
C => 'ARRAY',
CONFIG => 'ARRAY',
# CONFIGURE => 'CODE', # ignore
DIR => 'ARRAY',
DL_FUNCS => 'HASH',
DL_VARS => 'ARRAY',
EXCLUDE_EXT => 'ARRAY',
EXE_FILES => 'ARRAY',
FUNCLIST => 'ARRAY',
H => 'ARRAY',
IMPORTS => 'HASH',
INCLUDE_EXT => 'ARRAY',
LIBS => 'ARRAY', # ignore ''
MAN1PODS => 'HASH',
MAN3PODS => 'HASH',
META_ADD => 'HASH',
META_MERGE => 'HASH',
PL_FILES => 'HASH',
PM => 'HASH',
PMLIBDIRS => 'ARRAY',
PMLIBPARENTDIRS => 'ARRAY',
PREREQ_PM => 'HASH',
CONFIGURE_REQUIRES => 'HASH',
SKIP => 'ARRAY',
TYPEMAPS => 'ARRAY',
XS => 'HASH',
# VERSION => ['version',''], # ignore
# _KEEP_AFTER_FLUSH => '',
clean => 'HASH',
depend => 'HASH',
dist => 'HASH',
dynamic_lib=> 'HASH',
linkext => 'HASH',
macro => 'HASH',
postamble => 'HASH',
realclean => 'HASH',
test => 'HASH',
tool_autosplit => 'HASH',
# special cases where you can use makemaker_append
CCFLAGS => 'APPENDABLE',
DEFINE => 'APPENDABLE',
INC => 'APPENDABLE',
LDDLFLAGS => 'APPENDABLE',
LDFROM => 'APPENDABLE',
);
sub makemaker_args {
my ($self, %new_args) = @_;
my $args = ( $self->{makemaker_args} ||= {} );
foreach my $key (keys %new_args) {
if ($makemaker_argtype{$key}) {
if ($makemaker_argtype{$key} eq 'ARRAY') {
$args->{$key} = [] unless defined $args->{$key};
unless (ref $args->{$key} eq 'ARRAY') {
$args->{$key} = [$args->{$key}]
}
push @{$args->{$key}},
ref $new_args{$key} eq 'ARRAY'
? @{$new_args{$key}}
: $new_args{$key};
}
elsif ($makemaker_argtype{$key} eq 'HASH') {
$args->{$key} = {} unless defined $args->{$key};
foreach my $skey (keys %{ $new_args{$key} }) {
$args->{$key}{$skey} = $new_args{$key}{$skey};
}
}
elsif ($makemaker_argtype{$key} eq 'APPENDABLE') {
$self->makemaker_append($key => $new_args{$key});
}
}
else {
if (defined $args->{$key}) {
warn qq{MakeMaker attribute "$key" is overriden; use "makemaker_append" to append values\n};
}
$args->{$key} = $new_args{$key};
}
}
return $args;
}
# For mm args that take multiple space-separated args,
# append an argument to the current list.
sub makemaker_append {
my $self = shift;
my $name = shift;
my $args = $self->makemaker_args;
$args->{$name} = defined $args->{$name}
? join( ' ', $args->{$name}, @_ )
: join( ' ', @_ );
}
sub build_subdirs {
my $self = shift;
my $subdirs = $self->makemaker_args->{DIR} ||= [];
for my $subdir (@_) {
push @$subdirs, $subdir;
}
}
sub clean_files {
my $self = shift;
my $clean = $self->makemaker_args->{clean} ||= {};
%$clean = (
%$clean,
FILES => join ' ', grep { length $_ } ($clean->{FILES} || (), @_),
);
}
sub realclean_files {
my $self = shift;
my $realclean = $self->makemaker_args->{realclean} ||= {};
%$realclean = (
%$realclean,
FILES => join ' ', grep { length $_ } ($realclean->{FILES} || (), @_),
);
}
sub libs {
my $self = shift;
my $libs = ref $_[0] ? shift : [ shift ];
$self->makemaker_args( LIBS => $libs );
}
sub inc {
my $self = shift;
$self->makemaker_args( INC => shift );
}
sub _wanted_t {
}
sub tests_recursive {
my $self = shift;
my $dir = shift || 't';
unless ( -d $dir ) {
die "tests_recursive dir '$dir' does not exist";
}
my %tests = map { $_ => 1 } split / /, ($self->tests || '');
require File::Find;
File::Find::find(
sub { /\.t$/ and -f $_ and $tests{"$File::Find::dir/*.t"} = 1 },
$dir
);
$self->tests( join ' ', sort keys %tests );
}
sub write {
my $self = shift;
die "&Makefile->write() takes no arguments\n" if @_;
# Check the current Perl version
my $perl_version = $self->perl_version;
if ( $perl_version ) {
eval "use $perl_version; 1"
or die "ERROR: perl: Version $] is installed, "
. "but we need version >= $perl_version";
}
# Make sure we have a new enough MakeMaker
require ExtUtils::MakeMaker;
if ( $perl_version and $self->_cmp($perl_version, '5.006') >= 0 ) {
# This previous attempted to inherit the version of
# ExtUtils::MakeMaker in use by the module author, but this
# was found to be untenable as some authors build releases
# using future dev versions of EU:MM that nobody else has.
# Instead, #toolchain suggests we use 6.59 which is the most
# stable version on CPAN at time of writing and is, to quote
# ribasushi, "not terminally fucked, > and tested enough".
# TODO: We will now need to maintain this over time to push
# the version up as new versions are released.
$self->build_requires( 'ExtUtils::MakeMaker' => 6.59 );
$self->configure_requires( 'ExtUtils::MakeMaker' => 6.59 );
} else {
# Allow legacy-compatibility with 5.005 by depending on the
# most recent EU:MM that supported 5.005.
$self->build_requires( 'ExtUtils::MakeMaker' => 6.36 );
$self->configure_requires( 'ExtUtils::MakeMaker' => 6.36 );
}
# Generate the MakeMaker params
my $args = $self->makemaker_args;
$args->{DISTNAME} = $self->name;
$args->{NAME} = $self->module_name || $self->name;
$args->{NAME} =~ s/-/::/g;
$args->{VERSION} = $self->version or die <<'EOT';
ERROR: Can't determine distribution version. Please specify it
explicitly via 'version' in Makefile.PL, or set a valid $VERSION
in a module, and provide its file path via 'version_from' (or
'all_from' if you prefer) in Makefile.PL.
EOT
if ( $self->tests ) {
my @tests = split ' ', $self->tests;
my %seen;
$args->{test} = {
TESTS => (join ' ', grep {!$seen{$_}++} @tests),
};
} elsif ( $Module::Install::ExtraTests::use_extratests ) {
# Module::Install::ExtraTests doesn't set $self->tests and does its own tests via harness.
# So, just ignore our xt tests here.
} elsif ( -d 'xt' and ($Module::Install::AUTHOR or $ENV{RELEASE_TESTING}) ) {
$args->{test} = {
TESTS => join( ' ', map { "$_/*.t" } grep { -d $_ } qw{ t xt } ),
};
}
if ( $] >= 5.005 ) {
$args->{ABSTRACT} = $self->abstract;
$args->{AUTHOR} = join ', ', @{$self->author || []};
}
if ( $self->makemaker(6.10) ) {
$args->{NO_META} = 1;
#$args->{NO_MYMETA} = 1;
}
if ( $self->makemaker(6.17) and $self->sign ) {
$args->{SIGN} = 1;
}
unless ( $self->is_admin ) {
delete $args->{SIGN};
}
if ( $self->makemaker(6.31) and $self->license ) {
$args->{LICENSE} = $self->license;
}
my $prereq = ($args->{PREREQ_PM} ||= {});
%$prereq = ( %$prereq,
map { @$_ } # flatten [module => version]
map { @$_ }
grep $_,
($self->requires)
);
# Remove any reference to perl, PREREQ_PM doesn't support it
delete $args->{PREREQ_PM}->{perl};
# Merge both kinds of requires into BUILD_REQUIRES
my $build_prereq = ($args->{BUILD_REQUIRES} ||= {});
%$build_prereq = ( %$build_prereq,
map { @$_ } # flatten [module => version]
map { @$_ }
grep $_,
($self->configure_requires, $self->build_requires)
);
# Remove any reference to perl, BUILD_REQUIRES doesn't support it
delete $args->{BUILD_REQUIRES}->{perl};
# Delete bundled dists from prereq_pm, add it to Makefile DIR
my $subdirs = ($args->{DIR} || []);
if ($self->bundles) {
my %processed;
foreach my $bundle (@{ $self->bundles }) {
my ($mod_name, $dist_dir) = @$bundle;
delete $prereq->{$mod_name};
$dist_dir = File::Basename::basename($dist_dir); # dir for building this module
if (not exists $processed{$dist_dir}) {
if (-d $dist_dir) {
# List as sub-directory to be processed by make
push @$subdirs, $dist_dir;
}
# Else do nothing: the module is already present on the system
$processed{$dist_dir} = undef;
}
}
}
unless ( $self->makemaker('6.55_03') ) {
%$prereq = (%$prereq,%$build_prereq);
delete $args->{BUILD_REQUIRES};
}
if ( my $perl_version = $self->perl_version ) {
eval "use $perl_version; 1"
or die "ERROR: perl: Version $] is installed, "
. "but we need version >= $perl_version";
if ( $self->makemaker(6.48) ) {
$args->{MIN_PERL_VERSION} = $perl_version;
}
}
if ($self->installdirs) {
warn qq{old INSTALLDIRS (probably set by makemaker_args) is overriden by installdirs\n} if $args->{INSTALLDIRS};
$args->{INSTALLDIRS} = $self->installdirs;
}
my %args = map {
( $_ => $args->{$_} ) } grep {defined($args->{$_} )
} keys %$args;
my $user_preop = delete $args{dist}->{PREOP};
if ( my $preop = $self->admin->preop($user_preop) ) {
foreach my $key ( keys %$preop ) {
$args{dist}->{$key} = $preop->{$key};
}
}
my $mm = ExtUtils::MakeMaker::WriteMakefile(%args);
$self->fix_up_makefile($mm->{FIRST_MAKEFILE} || 'Makefile');
}
sub fix_up_makefile {
my $self = shift;
my $makefile_name = shift;
my $top_class = ref($self->_top) || '';
my $top_version = $self->_top->VERSION || '';
my $preamble = $self->preamble
? "# Preamble by $top_class $top_version\n"
. $self->preamble
: '';
my $postamble = "# Postamble by $top_class $top_version\n"
. ($self->postamble || '');
local *MAKEFILE;
open MAKEFILE, "+< $makefile_name" or die "fix_up_makefile: Couldn't open $makefile_name: $!";
eval { flock MAKEFILE, LOCK_EX };
my $makefile = do { local $/; };
$makefile =~ s/\b(test_harness\(\$\(TEST_VERBOSE\), )/$1'inc', /;
$makefile =~ s/( -I\$\(INST_ARCHLIB\))/ -Iinc$1/g;
$makefile =~ s/( "-I\$\(INST_LIB\)")/ "-Iinc"$1/g;
$makefile =~ s/^(FULLPERL = .*)/$1 "-Iinc"/m;
$makefile =~ s/^(PERL = .*)/$1 "-Iinc"/m;
# Module::Install will never be used to build the Core Perl
# Sometimes PERL_LIB and PERL_ARCHLIB get written anyway, which breaks
# PREFIX/PERL5LIB, and thus, install_share. Blank them if they exist
$makefile =~ s/^PERL_LIB = .+/PERL_LIB =/m;
#$makefile =~ s/^PERL_ARCHLIB = .+/PERL_ARCHLIB =/m;
# Perl 5.005 mentions PERL_LIB explicitly, so we have to remove that as well.
$makefile =~ s/(\"?)-I\$\(PERL_LIB\)\1//g;
# XXX - This is currently unused; not sure if it breaks other MM-users
# $makefile =~ s/^pm_to_blib\s+:\s+/pm_to_blib :: /mg;
seek MAKEFILE, 0, SEEK_SET;
truncate MAKEFILE, 0;
print MAKEFILE "$preamble$makefile$postamble" or die $!;
close MAKEFILE or die $!;
1;
}
sub preamble {
my ($self, $text) = @_;
$self->{preamble} = $text . $self->{preamble} if defined $text;
$self->{preamble};
}
sub postamble {
my ($self, $text) = @_;
$self->{postamble} ||= $self->admin->postamble;
$self->{postamble} .= $text if defined $text;
$self->{postamble}
}
1;
__END__
#line 544
HTML-TableParser-0.42/inc/Module/Install/Can.pm 0000644 0000407 0000036 00000006157 13075416151 017136 0 ustar dj head #line 1
package Module::Install::Can;
use strict;
use Config ();
use ExtUtils::MakeMaker ();
use Module::Install::Base ();
use vars qw{$VERSION @ISA $ISCORE};
BEGIN {
$VERSION = '1.16';
@ISA = 'Module::Install::Base';
$ISCORE = 1;
}
# check if we can load some module
### Upgrade this to not have to load the module if possible
sub can_use {
my ($self, $mod, $ver) = @_;
$mod =~ s{::|\\}{/}g;
$mod .= '.pm' unless $mod =~ /\.pm$/i;
my $pkg = $mod;
$pkg =~ s{/}{::}g;
$pkg =~ s{\.pm$}{}i;
local $@;
eval { require $mod; $pkg->VERSION($ver || 0); 1 };
}
# Check if we can run some command
sub can_run {
my ($self, $cmd) = @_;
my $_cmd = $cmd;
return $_cmd if (-x $_cmd or $_cmd = MM->maybe_command($_cmd));
for my $dir ((split /$Config::Config{path_sep}/, $ENV{PATH}), '.') {
next if $dir eq '';
require File::Spec;
my $abs = File::Spec->catfile($dir, $cmd);
return $abs if (-x $abs or $abs = MM->maybe_command($abs));
}
return;
}
# Can our C compiler environment build XS files
sub can_xs {
my $self = shift;
# Ensure we have the CBuilder module
$self->configure_requires( 'ExtUtils::CBuilder' => 0.27 );
# Do we have the configure_requires checker?
local $@;
eval "require ExtUtils::CBuilder;";
if ( $@ ) {
# They don't obey configure_requires, so it is
# someone old and delicate. Try to avoid hurting
# them by falling back to an older simpler test.
return $self->can_cc();
}
# Do we have a working C compiler
my $builder = ExtUtils::CBuilder->new(
quiet => 1,
);
unless ( $builder->have_compiler ) {
# No working C compiler
return 0;
}
# Write a C file representative of what XS becomes
require File::Temp;
my ( $FH, $tmpfile ) = File::Temp::tempfile(
"compilexs-XXXXX",
SUFFIX => '.c',
);
binmode $FH;
print $FH <<'END_C';
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"
int main(int argc, char **argv) {
return 0;
}
int boot_sanexs() {
return 1;
}
END_C
close $FH;
# Can the C compiler access the same headers XS does
my @libs = ();
my $object = undef;
eval {
local $^W = 0;
$object = $builder->compile(
source => $tmpfile,
);
@libs = $builder->link(
objects => $object,
module_name => 'sanexs',
);
};
my $result = $@ ? 0 : 1;
# Clean up all the build files
foreach ( $tmpfile, $object, @libs ) {
next unless defined $_;
1 while unlink;
}
return $result;
}
# Can we locate a (the) C compiler
sub can_cc {
my $self = shift;
my @chunks = split(/ /, $Config::Config{cc}) or return;
# $Config{cc} may contain args; try to find out the program part
while (@chunks) {
return $self->can_run("@chunks") || (pop(@chunks), next);
}
return;
}
# Fix Cygwin bug on maybe_command();
if ( $^O eq 'cygwin' ) {
require ExtUtils::MM_Cygwin;
require ExtUtils::MM_Win32;
if ( ! defined(&ExtUtils::MM_Cygwin::maybe_command) ) {
*ExtUtils::MM_Cygwin::maybe_command = sub {
my ($self, $file) = @_;
if ($file =~ m{^/cygdrive/}i and ExtUtils::MM_Win32->can('maybe_command')) {
ExtUtils::MM_Win32->maybe_command($file);
} else {
ExtUtils::MM_Unix->maybe_command($file);
}
}
}
}
1;
__END__
#line 236
HTML-TableParser-0.42/inc/Module/Install/Base.pm 0000644 0000407 0000036 00000002147 13075416144 017304 0 ustar dj head #line 1
package Module::Install::Base;
use strict 'vars';
use vars qw{$VERSION};
BEGIN {
$VERSION = '1.16';
}
# Suspend handler for "redefined" warnings
BEGIN {
my $w = $SIG{__WARN__};
$SIG{__WARN__} = sub { $w };
}
#line 42
sub new {
my $class = shift;
unless ( defined &{"${class}::call"} ) {
*{"${class}::call"} = sub { shift->_top->call(@_) };
}
unless ( defined &{"${class}::load"} ) {
*{"${class}::load"} = sub { shift->_top->load(@_) };
}
bless { @_ }, $class;
}
#line 61
sub AUTOLOAD {
local $@;
my $func = eval { shift->_top->autoload } or return;
goto &$func;
}
#line 75
sub _top {
$_[0]->{_top};
}
#line 90
sub admin {
$_[0]->_top->{admin}
or
Module::Install::Base::FakeAdmin->new;
}
#line 106
sub is_admin {
! $_[0]->admin->isa('Module::Install::Base::FakeAdmin');
}
sub DESTROY {}
package Module::Install::Base::FakeAdmin;
use vars qw{$VERSION};
BEGIN {
$VERSION = $Module::Install::Base::VERSION;
}
my $fake;
sub new {
$fake ||= bless(\@_, $_[0]);
}
sub AUTOLOAD {}
sub DESTROY {}
# Restore warning handler
BEGIN {
$SIG{__WARN__} = $SIG{__WARN__}->();
}
1;
#line 159
HTML-TableParser-0.42/inc/Module/Install/Fetch.pm 0000644 0000407 0000036 00000004627 13075416151 017466 0 ustar dj head #line 1
package Module::Install::Fetch;
use strict;
use Module::Install::Base ();
use vars qw{$VERSION @ISA $ISCORE};
BEGIN {
$VERSION = '1.16';
@ISA = 'Module::Install::Base';
$ISCORE = 1;
}
sub get_file {
my ($self, %args) = @_;
my ($scheme, $host, $path, $file) =
$args{url} =~ m|^(\w+)://([^/]+)(.+)/(.+)| or return;
if ( $scheme eq 'http' and ! eval { require LWP::Simple; 1 } ) {
$args{url} = $args{ftp_url}
or (warn("LWP support unavailable!\n"), return);
($scheme, $host, $path, $file) =
$args{url} =~ m|^(\w+)://([^/]+)(.+)/(.+)| or return;
}
$|++;
print "Fetching '$file' from $host... ";
unless (eval { require Socket; Socket::inet_aton($host) }) {
warn "'$host' resolve failed!\n";
return;
}
return unless $scheme eq 'ftp' or $scheme eq 'http';
require Cwd;
my $dir = Cwd::getcwd();
chdir $args{local_dir} or return if exists $args{local_dir};
if (eval { require LWP::Simple; 1 }) {
LWP::Simple::mirror($args{url}, $file);
}
elsif (eval { require Net::FTP; 1 }) { eval {
# use Net::FTP to get past firewall
my $ftp = Net::FTP->new($host, Passive => 1, Timeout => 600);
$ftp->login("anonymous", 'anonymous@example.com');
$ftp->cwd($path);
$ftp->binary;
$ftp->get($file) or (warn("$!\n"), return);
$ftp->quit;
} }
elsif (my $ftp = $self->can_run('ftp')) { eval {
# no Net::FTP, fallback to ftp.exe
require FileHandle;
my $fh = FileHandle->new;
local $SIG{CHLD} = 'IGNORE';
unless ($fh->open("|$ftp -n")) {
warn "Couldn't open ftp: $!\n";
chdir $dir; return;
}
my @dialog = split(/\n/, <<"END_FTP");
open $host
user anonymous anonymous\@example.com
cd $path
binary
get $file $file
quit
END_FTP
foreach (@dialog) { $fh->print("$_\n") }
$fh->close;
} }
else {
warn "No working 'ftp' program available!\n";
chdir $dir; return;
}
unless (-f $file) {
warn "Fetching failed: $@\n";
chdir $dir; return;
}
return if exists $args{size} and -s $file != $args{size};
system($args{run}) if exists $args{run};
unlink($file) if $args{remove};
print(((!exists $args{check_for} or -e $args{check_for})
? "done!" : "failed! ($!)"), "\n");
chdir $dir; return !$?;
}
1;
HTML-TableParser-0.42/inc/Module/Install/AutoLicense.pm 0000644 0000407 0000036 00000003166 13075416144 020647 0 ustar dj head #line 1
package Module::Install::AutoLicense;
use strict;
use warnings;
use base qw(Module::Install::Base);
use vars qw($VERSION);
$VERSION = '0.08';
my %licenses = (
perl => 'Software::License::Perl_5',
apache => 'Software::License::Apache_2_0',
artistic => 'Software::License::Artistic_1_0',
artistic_2 => 'Software::License::Artistic_2_0',
lgpl2 => 'Software::License::LGPL_2_1',
lgpl3 => 'Software::License::LGPL_3_0',
bsd => 'Software::License::BSD',
gpl => 'Software::License::GPL_1',
gpl2 => 'Software::License::GPL_2',
gpl3 => 'Software::License::GPL_3',
mit => 'Software::License::MIT',
mozilla => 'Software::License::Mozilla_1_1',
);
sub auto_license {
my $self = shift;
return unless $Module::Install::AUTHOR;
my %opts = @_;
$opts{lc $_} = delete $opts{$_} for keys %opts;
my $holder = $opts{holder} || _get_authors( $self );
#my $holder = $opts{holder} || $self->author;
my $license = $self->license();
unless ( defined $licenses{ $license } ) {
warn "No license definition for '$license', aborting\n";
return 1;
}
my $class = $licenses{ $license };
eval "require $class";
my $sl = $class->new( { holder => $holder } );
open LICENSE, '>LICENSE' or die "$!\n";
print LICENSE $sl->fulltext;
close LICENSE;
$self->postamble(<<"END");
distclean :: license_clean
license_clean:
\t\$(RM_F) LICENSE
END
return 1;
}
sub _get_authors {
my $self = shift;
my $joined = join ', ', @{ $self->author() || [] };
return $joined;
}
'Licensed to auto';
__END__
#line 125
HTML-TableParser-0.42/inc/Module/Install/CPANfile.pm 0000644 0000407 0000036 00000003046 13075416144 020012 0 ustar dj head #line 1
package Module::Install::CPANfile;
use strict;
use 5.008_001;
our $VERSION = '0.12';
use Module::CPANfile;
use base qw(Module::Install::Base);
sub merge_meta_with_cpanfile {
my $self = shift;
require CPAN::Meta;
my $file = Module::CPANfile->load;
if ($self->is_admin) {
# force generate META.json
CPAN::Meta->load_file('META.yml')->save('META.json');
print "Regenerate META.json and META.yml using cpanfile\n";
$file->merge_meta('META.yml');
$file->merge_meta('META.json');
}
for my $metafile (grep -e, qw(MYMETA.yml MYMETA.json)) {
print "Merging cpanfile prereqs to $metafile\n";
$file->merge_meta($metafile);
}
}
sub cpanfile {
my($self, %options) = @_;
$self->dynamic_config(0) unless $options{dynamic};
my $write_all = \&::WriteAll;
*main::WriteAll = sub {
$write_all->(@_);
$self->merge_meta_with_cpanfile;
};
$self->configure_requires("CPAN::Meta");
if ($self->is_admin) {
$self->admin->include_one_dist("Module::CPANfile");
if (eval { require CPAN::Meta::Check; 1 }) {
my $prereqs = Module::CPANfile->load->prereqs;
my @err = CPAN::Meta::Check::verify_dependencies($prereqs, [qw/runtime build test develop/], 'requires');
for (@err) {
warn "Warning: $_\n";
}
} else {
warn "CPAN::Meta::Check is not installed. Skipping dependencies check for the author.\n";
}
}
}
1;
__END__
=encoding utf-8
#line 149
HTML-TableParser-0.42/inc/Module/Install/Metadata.pm 0000644 0000407 0000036 00000043302 13075416144 020150 0 ustar dj head #line 1
package Module::Install::Metadata;
use strict 'vars';
use Module::Install::Base ();
use vars qw{$VERSION @ISA $ISCORE};
BEGIN {
$VERSION = '1.16';
@ISA = 'Module::Install::Base';
$ISCORE = 1;
}
my @boolean_keys = qw{
sign
};
my @scalar_keys = qw{
name
module_name
abstract
version
distribution_type
tests
installdirs
};
my @tuple_keys = qw{
configure_requires
build_requires
requires
recommends
bundles
resources
};
my @resource_keys = qw{
homepage
bugtracker
repository
};
my @array_keys = qw{
keywords
author
};
*authors = \&author;
sub Meta { shift }
sub Meta_BooleanKeys { @boolean_keys }
sub Meta_ScalarKeys { @scalar_keys }
sub Meta_TupleKeys { @tuple_keys }
sub Meta_ResourceKeys { @resource_keys }
sub Meta_ArrayKeys { @array_keys }
foreach my $key ( @boolean_keys ) {
*$key = sub {
my $self = shift;
if ( defined wantarray and not @_ ) {
return $self->{values}->{$key};
}
$self->{values}->{$key} = ( @_ ? $_[0] : 1 );
return $self;
};
}
foreach my $key ( @scalar_keys ) {
*$key = sub {
my $self = shift;
return $self->{values}->{$key} if defined wantarray and !@_;
$self->{values}->{$key} = shift;
return $self;
};
}
foreach my $key ( @array_keys ) {
*$key = sub {
my $self = shift;
return $self->{values}->{$key} if defined wantarray and !@_;
$self->{values}->{$key} ||= [];
push @{$self->{values}->{$key}}, @_;
return $self;
};
}
foreach my $key ( @resource_keys ) {
*$key = sub {
my $self = shift;
unless ( @_ ) {
return () unless $self->{values}->{resources};
return map { $_->[1] }
grep { $_->[0] eq $key }
@{ $self->{values}->{resources} };
}
return $self->{values}->{resources}->{$key} unless @_;
my $uri = shift or die(
"Did not provide a value to $key()"
);
$self->resources( $key => $uri );
return 1;
};
}
foreach my $key ( grep { $_ ne "resources" } @tuple_keys) {
*$key = sub {
my $self = shift;
return $self->{values}->{$key} unless @_;
my @added;
while ( @_ ) {
my $module = shift or last;
my $version = shift || 0;
push @added, [ $module, $version ];
}
push @{ $self->{values}->{$key} }, @added;
return map {@$_} @added;
};
}
# Resource handling
my %lc_resource = map { $_ => 1 } qw{
homepage
license
bugtracker
repository
};
sub resources {
my $self = shift;
while ( @_ ) {
my $name = shift or last;
my $value = shift or next;
if ( $name eq lc $name and ! $lc_resource{$name} ) {
die("Unsupported reserved lowercase resource '$name'");
}
$self->{values}->{resources} ||= [];
push @{ $self->{values}->{resources} }, [ $name, $value ];
}
$self->{values}->{resources};
}
# Aliases for build_requires that will have alternative
# meanings in some future version of META.yml.
sub test_requires { shift->build_requires(@_) }
sub install_requires { shift->build_requires(@_) }
# Aliases for installdirs options
sub install_as_core { $_[0]->installdirs('perl') }
sub install_as_cpan { $_[0]->installdirs('site') }
sub install_as_site { $_[0]->installdirs('site') }
sub install_as_vendor { $_[0]->installdirs('vendor') }
sub dynamic_config {
my $self = shift;
my $value = @_ ? shift : 1;
if ( $self->{values}->{dynamic_config} ) {
# Once dynamic we never change to static, for safety
return 0;
}
$self->{values}->{dynamic_config} = $value ? 1 : 0;
return 1;
}
# Convenience command
sub static_config {
shift->dynamic_config(0);
}
sub perl_version {
my $self = shift;
return $self->{values}->{perl_version} unless @_;
my $version = shift or die(
"Did not provide a value to perl_version()"
);
# Normalize the version
$version = $self->_perl_version($version);
# We don't support the really old versions
unless ( $version >= 5.005 ) {
die "Module::Install only supports 5.005 or newer (use ExtUtils::MakeMaker)\n";
}
$self->{values}->{perl_version} = $version;
}
sub all_from {
my ( $self, $file ) = @_;
unless ( defined($file) ) {
my $name = $self->name or die(
"all_from called with no args without setting name() first"
);
$file = join('/', 'lib', split(/-/, $name)) . '.pm';
$file =~ s{.*/}{} unless -e $file;
unless ( -e $file ) {
die("all_from cannot find $file from $name");
}
}
unless ( -f $file ) {
die("The path '$file' does not exist, or is not a file");
}
$self->{values}{all_from} = $file;
# Some methods pull from POD instead of code.
# If there is a matching .pod, use that instead
my $pod = $file;
$pod =~ s/\.pm$/.pod/i;
$pod = $file unless -e $pod;
# Pull the different values
$self->name_from($file) unless $self->name;
$self->version_from($file) unless $self->version;
$self->perl_version_from($file) unless $self->perl_version;
$self->author_from($pod) unless @{$self->author || []};
$self->license_from($pod) unless $self->license;
$self->abstract_from($pod) unless $self->abstract;
return 1;
}
sub provides {
my $self = shift;
my $provides = ( $self->{values}->{provides} ||= {} );
%$provides = (%$provides, @_) if @_;
return $provides;
}
sub auto_provides {
my $self = shift;
return $self unless $self->is_admin;
unless (-e 'MANIFEST') {
warn "Cannot deduce auto_provides without a MANIFEST, skipping\n";
return $self;
}
# Avoid spurious warnings as we are not checking manifest here.
local $SIG{__WARN__} = sub {1};
require ExtUtils::Manifest;
local *ExtUtils::Manifest::manicheck = sub { return };
require Module::Build;
my $build = Module::Build->new(
dist_name => $self->name,
dist_version => $self->version,
license => $self->license,
);
$self->provides( %{ $build->find_dist_packages || {} } );
}
sub feature {
my $self = shift;
my $name = shift;
my $features = ( $self->{values}->{features} ||= [] );
my $mods;
if ( @_ == 1 and ref( $_[0] ) ) {
# The user used ->feature like ->features by passing in the second
# argument as a reference. Accomodate for that.
$mods = $_[0];
} else {
$mods = \@_;
}
my $count = 0;
push @$features, (
$name => [
map {
ref($_) ? ( ref($_) eq 'HASH' ) ? %$_ : @$_ : $_
} @$mods
]
);
return @$features;
}
sub features {
my $self = shift;
while ( my ( $name, $mods ) = splice( @_, 0, 2 ) ) {
$self->feature( $name, @$mods );
}
return $self->{values}->{features}
? @{ $self->{values}->{features} }
: ();
}
sub no_index {
my $self = shift;
my $type = shift;
push @{ $self->{values}->{no_index}->{$type} }, @_ if $type;
return $self->{values}->{no_index};
}
sub read {
my $self = shift;
$self->include_deps( 'YAML::Tiny', 0 );
require YAML::Tiny;
my $data = YAML::Tiny::LoadFile('META.yml');
# Call methods explicitly in case user has already set some values.
while ( my ( $key, $value ) = each %$data ) {
next unless $self->can($key);
if ( ref $value eq 'HASH' ) {
while ( my ( $module, $version ) = each %$value ) {
$self->can($key)->($self, $module => $version );
}
} else {
$self->can($key)->($self, $value);
}
}
return $self;
}
sub write {
my $self = shift;
return $self unless $self->is_admin;
$self->admin->write_meta;
return $self;
}
sub version_from {
require ExtUtils::MM_Unix;
my ( $self, $file ) = @_;
$self->version( ExtUtils::MM_Unix->parse_version($file) );
# for version integrity check
$self->makemaker_args( VERSION_FROM => $file );
}
sub abstract_from {
require ExtUtils::MM_Unix;
my ( $self, $file ) = @_;
$self->abstract(
bless(
{ DISTNAME => $self->name },
'ExtUtils::MM_Unix'
)->parse_abstract($file)
);
}
# Add both distribution and module name
sub name_from {
my ($self, $file) = @_;
if (
Module::Install::_read($file) =~ m/
^ \s*
package \s*
([\w:]+)
[\s|;]*
/ixms
) {
my ($name, $module_name) = ($1, $1);
$name =~ s{::}{-}g;
$self->name($name);
unless ( $self->module_name ) {
$self->module_name($module_name);
}
} else {
die("Cannot determine name from $file\n");
}
}
sub _extract_perl_version {
if (
$_[0] =~ m/
^\s*
(?:use|require) \s*
v?
([\d_\.]+)
\s* ;
/ixms
) {
my $perl_version = $1;
$perl_version =~ s{_}{}g;
return $perl_version;
} else {
return;
}
}
sub perl_version_from {
my $self = shift;
my $perl_version=_extract_perl_version(Module::Install::_read($_[0]));
if ($perl_version) {
$self->perl_version($perl_version);
} else {
warn "Cannot determine perl version info from $_[0]\n";
return;
}
}
sub author_from {
my $self = shift;
my $content = Module::Install::_read($_[0]);
if ($content =~ m/
=head \d \s+ (?:authors?)\b \s*
([^\n]*)
|
=head \d \s+ (?:licen[cs]e|licensing|copyright|legal)\b \s*
.*? copyright .*? \d\d\d[\d.]+ \s* (?:\bby\b)? \s*
([^\n]*)
/ixms) {
my $author = $1 || $2;
# XXX: ugly but should work anyway...
if (eval "require Pod::Escapes; 1") {
# Pod::Escapes has a mapping table.
# It's in core of perl >= 5.9.3, and should be installed
# as one of the Pod::Simple's prereqs, which is a prereq
# of Pod::Text 3.x (see also below).
$author =~ s{ E<( (\d+) | ([A-Za-z]+) )> }
{
defined $2
? chr($2)
: defined $Pod::Escapes::Name2character_number{$1}
? chr($Pod::Escapes::Name2character_number{$1})
: do {
warn "Unknown escape: E<$1>";
"E<$1>";
};
}gex;
}
elsif (eval "require Pod::Text; 1" && $Pod::Text::VERSION < 3) {
# Pod::Text < 3.0 has yet another mapping table,
# though the table name of 2.x and 1.x are different.
# (1.x is in core of Perl < 5.6, 2.x is in core of
# Perl < 5.9.3)
my $mapping = ($Pod::Text::VERSION < 2)
? \%Pod::Text::HTML_Escapes
: \%Pod::Text::ESCAPES;
$author =~ s{ E<( (\d+) | ([A-Za-z]+) )> }
{
defined $2
? chr($2)
: defined $mapping->{$1}
? $mapping->{$1}
: do {
warn "Unknown escape: E<$1>";
"E<$1>";
};
}gex;
}
else {
$author =~ s{E}{<}g;
$author =~ s{E}{>}g;
}
$self->author($author);
} else {
warn "Cannot determine author info from $_[0]\n";
}
}
#Stolen from M::B
my %license_urls = (
perl => 'http://dev.perl.org/licenses/',
apache => 'http://apache.org/licenses/LICENSE-2.0',
apache_1_1 => 'http://apache.org/licenses/LICENSE-1.1',
artistic => 'http://opensource.org/licenses/artistic-license.php',
artistic_2 => 'http://opensource.org/licenses/artistic-license-2.0.php',
lgpl => 'http://opensource.org/licenses/lgpl-license.php',
lgpl2 => 'http://opensource.org/licenses/lgpl-2.1.php',
lgpl3 => 'http://opensource.org/licenses/lgpl-3.0.html',
bsd => 'http://opensource.org/licenses/bsd-license.php',
gpl => 'http://opensource.org/licenses/gpl-license.php',
gpl2 => 'http://opensource.org/licenses/gpl-2.0.php',
gpl3 => 'http://opensource.org/licenses/gpl-3.0.html',
mit => 'http://opensource.org/licenses/mit-license.php',
mozilla => 'http://opensource.org/licenses/mozilla1.1.php',
open_source => undef,
unrestricted => undef,
restrictive => undef,
unknown => undef,
);
sub license {
my $self = shift;
return $self->{values}->{license} unless @_;
my $license = shift or die(
'Did not provide a value to license()'
);
$license = __extract_license($license) || lc $license;
$self->{values}->{license} = $license;
# Automatically fill in license URLs
if ( $license_urls{$license} ) {
$self->resources( license => $license_urls{$license} );
}
return 1;
}
sub _extract_license {
my $pod = shift;
my $matched;
return __extract_license(
($matched) = $pod =~ m/
(=head \d \s+ L(?i:ICEN[CS]E|ICENSING)\b.*?)
(=head \d.*|=cut.*|)\z
/xms
) || __extract_license(
($matched) = $pod =~ m/
(=head \d \s+ (?:C(?i:OPYRIGHTS?)|L(?i:EGAL))\b.*?)
(=head \d.*|=cut.*|)\z
/xms
);
}
sub __extract_license {
my $license_text = shift or return;
my @phrases = (
'(?:under )?the same (?:terms|license) as (?:perl|the perl (?:\d )?programming language)' => 'perl', 1,
'(?:under )?the terms of (?:perl|the perl programming language) itself' => 'perl', 1,
'Artistic and GPL' => 'perl', 1,
'GNU general public license' => 'gpl', 1,
'GNU public license' => 'gpl', 1,
'GNU lesser general public license' => 'lgpl', 1,
'GNU lesser public license' => 'lgpl', 1,
'GNU library general public license' => 'lgpl', 1,
'GNU library public license' => 'lgpl', 1,
'GNU Free Documentation license' => 'unrestricted', 1,
'GNU Affero General Public License' => 'open_source', 1,
'(?:Free)?BSD license' => 'bsd', 1,
'Artistic license 2\.0' => 'artistic_2', 1,
'Artistic license' => 'artistic', 1,
'Apache (?:Software )?license' => 'apache', 1,
'GPL' => 'gpl', 1,
'LGPL' => 'lgpl', 1,
'BSD' => 'bsd', 1,
'Artistic' => 'artistic', 1,
'MIT' => 'mit', 1,
'Mozilla Public License' => 'mozilla', 1,
'Q Public License' => 'open_source', 1,
'OpenSSL License' => 'unrestricted', 1,
'SSLeay License' => 'unrestricted', 1,
'zlib License' => 'open_source', 1,
'proprietary' => 'proprietary', 0,
);
while ( my ($pattern, $license, $osi) = splice(@phrases, 0, 3) ) {
$pattern =~ s#\s+#\\s+#gs;
if ( $license_text =~ /\b$pattern\b/i ) {
return $license;
}
}
return '';
}
sub license_from {
my $self = shift;
if (my $license=_extract_license(Module::Install::_read($_[0]))) {
$self->license($license);
} else {
warn "Cannot determine license info from $_[0]\n";
return 'unknown';
}
}
sub _extract_bugtracker {
my @links = $_[0] =~ m#L<(
https?\Q://rt.cpan.org/\E[^>]+|
https?\Q://github.com/\E[\w_]+/[\w_]+/issues|
https?\Q://code.google.com/p/\E[\w_\-]+/issues/list
)>#gx;
my %links;
@links{@links}=();
@links=keys %links;
return @links;
}
sub bugtracker_from {
my $self = shift;
my $content = Module::Install::_read($_[0]);
my @links = _extract_bugtracker($content);
unless ( @links ) {
warn "Cannot determine bugtracker info from $_[0]\n";
return 0;
}
if ( @links > 1 ) {
warn "Found more than one bugtracker link in $_[0]\n";
return 0;
}
# Set the bugtracker
bugtracker( $links[0] );
return 1;
}
sub requires_from {
my $self = shift;
my $content = Module::Install::_readperl($_[0]);
my @requires = $content =~ m/^use\s+([^\W\d]\w*(?:::\w+)*)\s+(v?[\d\.]+)/mg;
while ( @requires ) {
my $module = shift @requires;
my $version = shift @requires;
$self->requires( $module => $version );
}
}
sub test_requires_from {
my $self = shift;
my $content = Module::Install::_readperl($_[0]);
my @requires = $content =~ m/^use\s+([^\W\d]\w*(?:::\w+)*)\s+([\d\.]+)/mg;
while ( @requires ) {
my $module = shift @requires;
my $version = shift @requires;
$self->test_requires( $module => $version );
}
}
# Convert triple-part versions (eg, 5.6.1 or 5.8.9) to
# numbers (eg, 5.006001 or 5.008009).
# Also, convert double-part versions (eg, 5.8)
sub _perl_version {
my $v = $_[-1];
$v =~ s/^([1-9])\.([1-9]\d?\d?)$/sprintf("%d.%03d",$1,$2)/e;
$v =~ s/^([1-9])\.([1-9]\d?\d?)\.(0|[1-9]\d?\d?)$/sprintf("%d.%03d%03d",$1,$2,$3 || 0)/e;
$v =~ s/(\.\d\d\d)000$/$1/;
$v =~ s/_.+$//;
if ( ref($v) ) {
# Numify
$v = $v + 0;
}
return $v;
}
sub add_metadata {
my $self = shift;
my %hash = @_;
for my $key (keys %hash) {
warn "add_metadata: $key is not prefixed with 'x_'.\n" .
"Use appopriate function to add non-private metadata.\n" unless $key =~ /^x_/;
$self->{values}->{$key} = $hash{$key};
}
}
######################################################################
# MYMETA Support
sub WriteMyMeta {
die "WriteMyMeta has been deprecated";
}
sub write_mymeta_yaml {
my $self = shift;
# We need YAML::Tiny to write the MYMETA.yml file
unless ( eval { require YAML::Tiny; 1; } ) {
return 1;
}
# Generate the data
my $meta = $self->_write_mymeta_data or return 1;
# Save as the MYMETA.yml file
print "Writing MYMETA.yml\n";
YAML::Tiny::DumpFile('MYMETA.yml', $meta);
}
sub write_mymeta_json {
my $self = shift;
# We need JSON to write the MYMETA.json file
unless ( eval { require JSON; 1; } ) {
return 1;
}
# Generate the data
my $meta = $self->_write_mymeta_data or return 1;
# Save as the MYMETA.yml file
print "Writing MYMETA.json\n";
Module::Install::_write(
'MYMETA.json',
JSON->new->pretty(1)->canonical->encode($meta),
);
}
sub _write_mymeta_data {
my $self = shift;
# If there's no existing META.yml there is nothing we can do
return undef unless -f 'META.yml';
# We need Parse::CPAN::Meta to load the file
unless ( eval { require Parse::CPAN::Meta; 1; } ) {
return undef;
}
# Merge the perl version into the dependencies
my $val = $self->Meta->{values};
my $perl = delete $val->{perl_version};
if ( $perl ) {
$val->{requires} ||= [];
my $requires = $val->{requires};
# Canonize to three-dot version after Perl 5.6
if ( $perl >= 5.006 ) {
$perl =~ s{^(\d+)\.(\d\d\d)(\d*)}{join('.', $1, int($2||0), int($3||0))}e
}
unshift @$requires, [ perl => $perl ];
}
# Load the advisory META.yml file
my @yaml = Parse::CPAN::Meta::LoadFile('META.yml');
my $meta = $yaml[0];
# Overwrite the non-configure dependency hashes
delete $meta->{requires};
delete $meta->{build_requires};
delete $meta->{recommends};
if ( exists $val->{requires} ) {
$meta->{requires} = { map { @$_ } @{ $val->{requires} } };
}
if ( exists $val->{build_requires} ) {
$meta->{build_requires} = { map { @$_ } @{ $val->{build_requires} } };
}
return $meta;
}
1;
HTML-TableParser-0.42/inc/Module/Install.pm 0000644 0000407 0000036 00000030217 13075416142 016427 0 ustar dj head #line 1
package Module::Install;
# For any maintainers:
# The load order for Module::Install is a bit magic.
# It goes something like this...
#
# IF ( host has Module::Install installed, creating author mode ) {
# 1. Makefile.PL calls "use inc::Module::Install"
# 2. $INC{inc/Module/Install.pm} set to installed version of inc::Module::Install
# 3. The installed version of inc::Module::Install loads
# 4. inc::Module::Install calls "require Module::Install"
# 5. The ./inc/ version of Module::Install loads
# } ELSE {
# 1. Makefile.PL calls "use inc::Module::Install"
# 2. $INC{inc/Module/Install.pm} set to ./inc/ version of Module::Install
# 3. The ./inc/ version of Module::Install loads
# }
use 5.006;
use strict 'vars';
use Cwd ();
use File::Find ();
use File::Path ();
use vars qw{$VERSION $MAIN};
BEGIN {
# All Module::Install core packages now require synchronised versions.
# This will be used to ensure we don't accidentally load old or
# different versions of modules.
# This is not enforced yet, but will be some time in the next few
# releases once we can make sure it won't clash with custom
# Module::Install extensions.
$VERSION = '1.16';
# Storage for the pseudo-singleton
$MAIN = undef;
*inc::Module::Install::VERSION = *VERSION;
@inc::Module::Install::ISA = __PACKAGE__;
}
sub import {
my $class = shift;
my $self = $class->new(@_);
my $who = $self->_caller;
#-------------------------------------------------------------
# all of the following checks should be included in import(),
# to allow "eval 'require Module::Install; 1' to test
# installation of Module::Install. (RT #51267)
#-------------------------------------------------------------
# Whether or not inc::Module::Install is actually loaded, the
# $INC{inc/Module/Install.pm} is what will still get set as long as
# the caller loaded module this in the documented manner.
# If not set, the caller may NOT have loaded the bundled version, and thus
# they may not have a MI version that works with the Makefile.PL. This would
# result in false errors or unexpected behaviour. And we don't want that.
my $file = join( '/', 'inc', split /::/, __PACKAGE__ ) . '.pm';
unless ( $INC{$file} ) { die <<"END_DIE" }
Please invoke ${\__PACKAGE__} with:
use inc::${\__PACKAGE__};
not:
use ${\__PACKAGE__};
END_DIE
# This reportedly fixes a rare Win32 UTC file time issue, but
# as this is a non-cross-platform XS module not in the core,
# we shouldn't really depend on it. See RT #24194 for detail.
# (Also, this module only supports Perl 5.6 and above).
eval "use Win32::UTCFileTime" if $^O eq 'MSWin32' && $] >= 5.006;
# If the script that is loading Module::Install is from the future,
# then make will detect this and cause it to re-run over and over
# again. This is bad. Rather than taking action to touch it (which
# is unreliable on some platforms and requires write permissions)
# for now we should catch this and refuse to run.
if ( -f $0 ) {
my $s = (stat($0))[9];
# If the modification time is only slightly in the future,
# sleep briefly to remove the problem.
my $a = $s - time;
if ( $a > 0 and $a < 5 ) { sleep 5 }
# Too far in the future, throw an error.
my $t = time;
if ( $s > $t ) { die <<"END_DIE" }
Your installer $0 has a modification time in the future ($s > $t).
This is known to create infinite loops in make.
Please correct this, then run $0 again.
END_DIE
}
# Build.PL was formerly supported, but no longer is due to excessive
# difficulty in implementing every single feature twice.
if ( $0 =~ /Build.PL$/i ) { die <<"END_DIE" }
Module::Install no longer supports Build.PL.
It was impossible to maintain duel backends, and has been deprecated.
Please remove all Build.PL files and only use the Makefile.PL installer.
END_DIE
#-------------------------------------------------------------
# To save some more typing in Module::Install installers, every...
# use inc::Module::Install
# ...also acts as an implicit use strict.
$^H |= strict::bits(qw(refs subs vars));
#-------------------------------------------------------------
unless ( -f $self->{file} ) {
foreach my $key (keys %INC) {
delete $INC{$key} if $key =~ /Module\/Install/;
}
local $^W;
require "$self->{path}/$self->{dispatch}.pm";
File::Path::mkpath("$self->{prefix}/$self->{author}");
$self->{admin} = "$self->{name}::$self->{dispatch}"->new( _top => $self );
$self->{admin}->init;
@_ = ($class, _self => $self);
goto &{"$self->{name}::import"};
}
local $^W;
*{"${who}::AUTOLOAD"} = $self->autoload;
$self->preload;
# Unregister loader and worker packages so subdirs can use them again
delete $INC{'inc/Module/Install.pm'};
delete $INC{'Module/Install.pm'};
# Save to the singleton
$MAIN = $self;
return 1;
}
sub autoload {
my $self = shift;
my $who = $self->_caller;
my $cwd = Cwd::getcwd();
my $sym = "${who}::AUTOLOAD";
$sym->{$cwd} = sub {
my $pwd = Cwd::getcwd();
if ( my $code = $sym->{$pwd} ) {
# Delegate back to parent dirs
goto &$code unless $cwd eq $pwd;
}
unless ($$sym =~ s/([^:]+)$//) {
# XXX: it looks like we can't retrieve the missing function
# via $$sym (usually $main::AUTOLOAD) in this case.
# I'm still wondering if we should slurp Makefile.PL to
# get some context or not ...
my ($package, $file, $line) = caller;
die <<"EOT";
Unknown function is found at $file line $line.
Execution of $file aborted due to runtime errors.
If you're a contributor to a project, you may need to install
some Module::Install extensions from CPAN (or other repository).
If you're a user of a module, please contact the author.
EOT
}
my $method = $1;
if ( uc($method) eq $method ) {
# Do nothing
return;
} elsif ( $method =~ /^_/ and $self->can($method) ) {
# Dispatch to the root M:I class
return $self->$method(@_);
}
# Dispatch to the appropriate plugin
unshift @_, ( $self, $1 );
goto &{$self->can('call')};
};
}
sub preload {
my $self = shift;
unless ( $self->{extensions} ) {
$self->load_extensions(
"$self->{prefix}/$self->{path}", $self
);
}
my @exts = @{$self->{extensions}};
unless ( @exts ) {
@exts = $self->{admin}->load_all_extensions;
}
my %seen;
foreach my $obj ( @exts ) {
while (my ($method, $glob) = each %{ref($obj) . '::'}) {
next unless $obj->can($method);
next if $method =~ /^_/;
next if $method eq uc($method);
$seen{$method}++;
}
}
my $who = $self->_caller;
foreach my $name ( sort keys %seen ) {
local $^W;
*{"${who}::$name"} = sub {
${"${who}::AUTOLOAD"} = "${who}::$name";
goto &{"${who}::AUTOLOAD"};
};
}
}
sub new {
my ($class, %args) = @_;
delete $INC{'FindBin.pm'};
{
# to suppress the redefine warning
local $SIG{__WARN__} = sub {};
require FindBin;
}
# ignore the prefix on extension modules built from top level.
my $base_path = Cwd::abs_path($FindBin::Bin);
unless ( Cwd::abs_path(Cwd::getcwd()) eq $base_path ) {
delete $args{prefix};
}
return $args{_self} if $args{_self};
$args{dispatch} ||= 'Admin';
$args{prefix} ||= 'inc';
$args{author} ||= ($^O eq 'VMS' ? '_author' : '.author');
$args{bundle} ||= 'inc/BUNDLES';
$args{base} ||= $base_path;
$class =~ s/^\Q$args{prefix}\E:://;
$args{name} ||= $class;
$args{version} ||= $class->VERSION;
unless ( $args{path} ) {
$args{path} = $args{name};
$args{path} =~ s!::!/!g;
}
$args{file} ||= "$args{base}/$args{prefix}/$args{path}.pm";
$args{wrote} = 0;
bless( \%args, $class );
}
sub call {
my ($self, $method) = @_;
my $obj = $self->load($method) or return;
splice(@_, 0, 2, $obj);
goto &{$obj->can($method)};
}
sub load {
my ($self, $method) = @_;
$self->load_extensions(
"$self->{prefix}/$self->{path}", $self
) unless $self->{extensions};
foreach my $obj (@{$self->{extensions}}) {
return $obj if $obj->can($method);
}
my $admin = $self->{admin} or die <<"END_DIE";
The '$method' method does not exist in the '$self->{prefix}' path!
Please remove the '$self->{prefix}' directory and run $0 again to load it.
END_DIE
my $obj = $admin->load($method, 1);
push @{$self->{extensions}}, $obj;
$obj;
}
sub load_extensions {
my ($self, $path, $top) = @_;
my $should_reload = 0;
unless ( grep { ! ref $_ and lc $_ eq lc $self->{prefix} } @INC ) {
unshift @INC, $self->{prefix};
$should_reload = 1;
}
foreach my $rv ( $self->find_extensions($path) ) {
my ($file, $pkg) = @{$rv};
next if $self->{pathnames}{$pkg};
local $@;
my $new = eval { local $^W; require $file; $pkg->can('new') };
unless ( $new ) {
warn $@ if $@;
next;
}
$self->{pathnames}{$pkg} =
$should_reload ? delete $INC{$file} : $INC{$file};
push @{$self->{extensions}}, &{$new}($pkg, _top => $top );
}
$self->{extensions} ||= [];
}
sub find_extensions {
my ($self, $path) = @_;
my @found;
File::Find::find( sub {
my $file = $File::Find::name;
return unless $file =~ m!^\Q$path\E/(.+)\.pm\Z!is;
my $subpath = $1;
return if lc($subpath) eq lc($self->{dispatch});
$file = "$self->{path}/$subpath.pm";
my $pkg = "$self->{name}::$subpath";
$pkg =~ s!/!::!g;
# If we have a mixed-case package name, assume case has been preserved
# correctly. Otherwise, root through the file to locate the case-preserved
# version of the package name.
if ( $subpath eq lc($subpath) || $subpath eq uc($subpath) ) {
my $content = Module::Install::_read($subpath . '.pm');
my $in_pod = 0;
foreach ( split /\n/, $content ) {
$in_pod = 1 if /^=\w/;
$in_pod = 0 if /^=cut/;
next if ($in_pod || /^=cut/); # skip pod text
next if /^\s*#/; # and comments
if ( m/^\s*package\s+($pkg)\s*;/i ) {
$pkg = $1;
last;
}
}
}
push @found, [ $file, $pkg ];
}, $path ) if -d $path;
@found;
}
#####################################################################
# Common Utility Functions
sub _caller {
my $depth = 0;
my $call = caller($depth);
while ( $call eq __PACKAGE__ ) {
$depth++;
$call = caller($depth);
}
return $call;
}
# Done in evals to avoid confusing Perl::MinimumVersion
eval( $] >= 5.006 ? <<'END_NEW' : <<'END_OLD' ); die $@ if $@;
sub _read {
local *FH;
open( FH, '<', $_[0] ) or die "open($_[0]): $!";
binmode FH;
my $string = do { local $/; };
close FH or die "close($_[0]): $!";
return $string;
}
END_NEW
sub _read {
local *FH;
open( FH, "< $_[0]" ) or die "open($_[0]): $!";
binmode FH;
my $string = do { local $/; };
close FH or die "close($_[0]): $!";
return $string;
}
END_OLD
sub _readperl {
my $string = Module::Install::_read($_[0]);
$string =~ s/(?:\015{1,2}\012|\015|\012)/\n/sg;
$string =~ s/(\n)\n*__(?:DATA|END)__\b.*\z/$1/s;
$string =~ s/\n\n=\w+.+?\n\n=cut\b.+?\n+/\n\n/sg;
return $string;
}
sub _readpod {
my $string = Module::Install::_read($_[0]);
$string =~ s/(?:\015{1,2}\012|\015|\012)/\n/sg;
return $string if $_[0] =~ /\.pod\z/;
$string =~ s/(^|\n=cut\b.+?\n+)[^=\s].+?\n(\n=\w+|\z)/$1$2/sg;
$string =~ s/\n*=pod\b[^\n]*\n+/\n\n/sg;
$string =~ s/\n*=cut\b[^\n]*\n+/\n\n/sg;
$string =~ s/^\n+//s;
return $string;
}
# Done in evals to avoid confusing Perl::MinimumVersion
eval( $] >= 5.006 ? <<'END_NEW' : <<'END_OLD' ); die $@ if $@;
sub _write {
local *FH;
open( FH, '>', $_[0] ) or die "open($_[0]): $!";
binmode FH;
foreach ( 1 .. $#_ ) {
print FH $_[$_] or die "print($_[0]): $!";
}
close FH or die "close($_[0]): $!";
}
END_NEW
sub _write {
local *FH;
open( FH, "> $_[0]" ) or die "open($_[0]): $!";
binmode FH;
foreach ( 1 .. $#_ ) {
print FH $_[$_] or die "print($_[0]): $!";
}
close FH or die "close($_[0]): $!";
}
END_OLD
# _version is for processing module versions (eg, 1.03_05) not
# Perl versions (eg, 5.8.1).
sub _version {
my $s = shift || 0;
my $d =()= $s =~ /(\.)/g;
if ( $d >= 2 ) {
# Normalise multipart versions
$s =~ s/(\.)(\d{1,3})/sprintf("$1%03d",$2)/eg;
}
$s =~ s/^(\d+)\.?//;
my $l = $1 || 0;
my @v = map {
$_ . '0' x (3 - length $_)
} $s =~ /(\d{1,3})\D?/g;
$l = $l . '.' . join '', @v if @v;
return $l + 0;
}
sub _cmp {
_version($_[1]) <=> _version($_[2]);
}
# Cloned from Params::Util::_CLASS
sub _CLASS {
(
defined $_[0]
and
! ref $_[0]
and
$_[0] =~ m/^[^\W\d]\w*(?:::\w+)*\z/s
) ? $_[0] : undef;
}
1;
# Copyright 2008 - 2012 Adam Kennedy.
HTML-TableParser-0.42/inc/Module/CPANfile/ 0000755 0000407 0000036 00000000000 13076215166 016045 5 ustar dj head HTML-TableParser-0.42/inc/Module/CPANfile/Prereq.pm 0000644 0000407 0000036 00000000647 13075416151 017644 0 ustar dj head #line 1
package Module::CPANfile::Prereq;
use strict;
sub new {
my($class, %options) = @_;
bless \%options, $class;
}
sub feature { $_[0]->{feature} }
sub phase { $_[0]->{phase} }
sub type { $_[0]->{type} }
sub module { $_[0]->{module} }
sub requirement { $_[0]->{requirement} }
sub match_feature {
my($self, $identifier) = @_;
no warnings 'uninitialized';
$self->feature eq $identifier;
}
1;
HTML-TableParser-0.42/inc/Module/CPANfile/Environment.pm 0000644 0000407 0000036 00000006425 13075416151 020712 0 ustar dj head #line 1
package Module::CPANfile::Environment;
use strict;
use warnings;
use Module::CPANfile::Prereqs;
use Carp ();
my @bindings = qw(
on requires recommends suggests conflicts
feature
osname
mirror
configure_requires build_requires test_requires author_requires
);
my $file_id = 1;
sub new {
my($class, $file) = @_;
bless {
file => $file,
phase => 'runtime', # default phase
feature => undef,
features => {},
prereqs => Module::CPANfile::Prereqs->new,
mirrors => [],
}, $class;
}
sub bind {
my $self = shift;
my $pkg = caller;
for my $binding (@bindings) {
no strict 'refs';
*{"$pkg\::$binding"} = sub { $self->$binding(@_) };
}
}
sub parse {
my($self, $code) = @_;
my $err;
{
local $@;
$file_id++;
$self->_evaluate(<bind }
# line 1 "$self->{file}"
$code;
EVAL
$err = $@;
}
if ($err) { die "Parsing $self->{file} failed: $err" };
return 1;
}
sub _evaluate {
my $_environment = $_[0];
eval $_[1];
}
sub prereqs { $_[0]->{prereqs} }
sub mirrors { $_[0]->{mirrors} }
# DSL goes from here
sub on {
my($self, $phase, $code) = @_;
local $self->{phase} = $phase;
$code->();
}
sub feature {
my($self, $identifier, $description, $code) = @_;
# shortcut: feature identifier => sub { ... }
if (@_ == 3 && ref($description) eq 'CODE') {
$code = $description;
$description = $identifier;
}
unless (ref $description eq '' && ref $code eq 'CODE') {
Carp::croak("Usage: feature 'identifier', 'Description' => sub { ... }");
}
local $self->{feature} = $identifier;
$self->prereqs->add_feature($identifier, $description);
$code->();
}
sub osname { die "TODO" }
sub mirror {
my($self, $url) = @_;
push @{$self->{mirrors}}, $url;
}
sub requirement_for {
my($self, $module, @args) = @_;
my $requirement = 0;
$requirement = shift @args if @args % 2;
return Module::CPANfile::Requirement->new(
name => $module,
version => $requirement,
@args,
);
}
sub requires {
my $self = shift;
$self->add_prereq(requires => @_);
}
sub recommends {
my $self = shift;
$self->add_prereq(recommends => @_);
}
sub suggests {
my $self = shift;
$self->add_prereq(suggests => @_);
}
sub conflicts {
my $self = shift;
$self->add_prereq(conflicts => @_);
}
sub add_prereq {
my($self, $type, $module, @args) = @_;
$self->prereqs->add_prereq(
feature => $self->{feature},
phase => $self->{phase},
type => $type,
module => $module,
requirement => $self->requirement_for($module, @args),
);
}
# Module::Install compatible shortcuts
sub configure_requires {
my($self, @args) = @_;
$self->on(configure => sub { $self->requires(@args) });
}
sub build_requires {
my($self, @args) = @_;
$self->on(build => sub { $self->requires(@args) });
}
sub test_requires {
my($self, @args) = @_;
$self->on(test => sub { $self->requires(@args) });
}
sub author_requires {
my($self, @args) = @_;
$self->on(develop => sub { $self->requires(@args) });
}
1;
HTML-TableParser-0.42/inc/Module/CPANfile/Prereqs.pm 0000644 0000407 0000036 00000005015 13075416151 020021 0 ustar dj head #line 1
package Module::CPANfile::Prereqs;
use strict;
use Carp ();
use CPAN::Meta::Feature;
use Module::CPANfile::Prereq;
sub from_cpan_meta {
my($class, $prereqs) = @_;
my $self = $class->new;
for my $phase (keys %$prereqs) {
for my $type (keys %{ $prereqs->{$phase} }) {
while (my($module, $requirement) = each %{ $prereqs->{$phase}{$type} }) {
$self->add_prereq(
phase => $phase,
type => $type,
module => $module,
requirement => Module::CPANfile::Requirement->new(name => $module, version => $requirement),
);
}
}
}
$self;
}
sub new {
my $class = shift;
bless {
prereqs => [],
features => {},
}, $class;
}
sub add_feature {
my($self, $identifier, $description) = @_;
$self->{features}{$identifier} = { description => $description };
}
sub add_prereq {
my($self, %args) = @_;
$self->add( Module::CPANfile::Prereq->new(%args) );
}
sub add {
my($self, $prereq) = @_;
push @{$self->{prereqs}}, $prereq;
}
sub as_cpan_meta {
my $self = shift;
$self->{cpanmeta} ||= $self->build_cpan_meta;
}
sub build_cpan_meta {
my($self, $identifier) = @_;
my $prereq_spec = {};
$self->prereq_each($identifier, sub {
my $prereq = shift;
$prereq_spec->{$prereq->phase}{$prereq->type}{$prereq->module} = $prereq->requirement->version;
});
CPAN::Meta::Prereqs->new($prereq_spec);
}
sub prereq_each {
my($self, $identifier, $code) = @_;
for my $prereq (@{$self->{prereqs}}) {
next unless $prereq->match_feature($identifier);
$code->($prereq);
}
}
sub merged_requirements {
my $self = shift;
my $reqs = CPAN::Meta::Requirements->new;
for my $prereq (@{$self->{prereqs}}) {
$reqs->add_string_requirement($prereq->module, $prereq->requirement->version);
}
$reqs;
}
sub find {
my($self, $module) = @_;
for my $prereq (@{$self->{prereqs}}) {
return $prereq if $prereq->module eq $module;
}
return;
}
sub identifiers {
my $self = shift;
keys %{$self->{features}};
}
sub feature {
my($self, $identifier) = @_;
my $data = $self->{features}{$identifier}
or Carp::croak("Unknown feature '$identifier'");
my $prereqs = $self->build_cpan_meta($identifier);
CPAN::Meta::Feature->new($identifier, {
description => $data->{description},
prereqs => $prereqs->as_string_hash,
});
}
1;
HTML-TableParser-0.42/inc/Module/CPANfile/Requirement.pm 0000644 0000407 0000036 00000000646 13075416151 020705 0 ustar dj head #line 1
package Module::CPANfile::Requirement;
use strict;
sub new {
my ($class, %args) = @_;
$args{version} ||= 0;
bless +{
name => delete $args{name},
version => delete $args{version},
options => \%args,
}, $class;
}
sub name { $_[0]->{name} }
sub version { $_[0]->{version} }
sub options { $_[0]->{options} }
sub has_options {
keys %{$_[0]->{options}} > 0;
}
1;
HTML-TableParser-0.42/inc/Module/CPANfile.pm 0000644 0000407 0000036 00000010652 13075416151 016403 0 ustar dj head #line 1
package Module::CPANfile;
use strict;
use warnings;
use Cwd;
use Carp ();
use Module::CPANfile::Environment;
use Module::CPANfile::Requirement;
our $VERSION = '1.1001';
sub new {
my($class, $file) = @_;
bless {}, $class;
}
sub load {
my($proto, $file) = @_;
my $self = ref $proto ? $proto : $proto->new;
$self->parse($file || Cwd::abs_path('cpanfile'));
$self;
}
sub save {
my($self, $path) = @_;
open my $out, ">", $path or die "$path: $!";
print {$out} $self->to_string;
}
sub parse {
my($self, $file) = @_;
my $code = do {
open my $fh, "<", $file or die "$file: $!";
join '', <$fh>;
};
my $env = Module::CPANfile::Environment->new($file);
$env->parse($code) or die $@;
$self->{_mirrors} = $env->mirrors;
$self->{_prereqs} = $env->prereqs;
}
sub from_prereqs {
my($proto, $prereqs) = @_;
my $self = $proto->new;
$self->{_prereqs} = Module::CPANfile::Prereqs->from_cpan_meta($prereqs);
$self;
}
sub mirrors {
my $self = shift;
$self->{_mirrors} || [];
}
sub features {
my $self = shift;
map $self->feature($_), $self->{_prereqs}->identifiers;
}
sub feature {
my($self, $identifier) = @_;
$self->{_prereqs}->feature($identifier);
}
sub prereq { shift->prereqs }
sub prereqs {
my $self = shift;
$self->{_prereqs}->as_cpan_meta;
}
sub merged_requirements {
my $self = shift;
$self->{_prereqs}->merged_requirements;
}
sub effective_prereqs {
my($self, $features) = @_;
$self->prereqs_with(@{$features || []});
}
sub prereqs_with {
my($self, @feature_identifiers) = @_;
my $prereqs = $self->prereqs;
my @others = map { $self->feature($_)->prereqs } @feature_identifiers;
$prereqs->with_merged_prereqs(\@others);
}
sub prereq_specs {
my $self = shift;
$self->prereqs->as_string_hash;
}
sub prereq_for_module {
my($self, $module) = @_;
$self->{_prereqs}->find($module);
}
sub options_for_module {
my($self, $module) = @_;
my $prereq = $self->prereq_for_module($module) or return;
$prereq->requirement->options;
}
sub merge_meta {
my($self, $file, $version) = @_;
require CPAN::Meta;
$version ||= $file =~ /\.yml$/ ? '1.4' : '2';
my $prereq = $self->prereqs;
my $meta = CPAN::Meta->load_file($file);
my $prereqs_hash = $prereq->with_merged_prereqs($meta->effective_prereqs)->as_string_hash;
my $struct = { %{$meta->as_struct}, prereqs => $prereqs_hash };
CPAN::Meta->new($struct)->save($file, { version => $version });
}
sub _dump {
my $str = shift;
require Data::Dumper;
chomp(my $value = Data::Dumper->new([$str])->Terse(1)->Dump);
$value;
}
sub to_string {
my($self, $include_empty) = @_;
my $mirrors = $self->mirrors;
my $prereqs = $self->prereq_specs;
my $code = '';
$code .= $self->_dump_mirrors($mirrors);
$code .= $self->_dump_prereqs($prereqs, $include_empty);
for my $feature ($self->features) {
$code .= sprintf "feature %s, %s => sub {\n", _dump($feature->{identifier}), _dump($feature->{description});
$code .= $self->_dump_prereqs($feature->{spec}, $include_empty, 4);
$code .= "}\n\n";
}
$code =~ s/\n+$/\n/s;
$code;
}
sub _dump_mirrors {
my($self, $mirrors) = @_;
my $code = "";
for my $url (@$mirrors) {
$code .= "mirror '$url';\n";
}
$code =~ s/\n+$/\n/s;
$code;
}
sub _dump_prereqs {
my($self, $prereqs, $include_empty, $base_indent) = @_;
my $code = '';
for my $phase (qw(runtime configure build test develop)) {
my $indent = $phase eq 'runtime' ? '' : ' ';
$indent = (' ' x ($base_indent || 0)) . $indent;
my($phase_code, $requirements);
$phase_code .= "on $phase => sub {\n" unless $phase eq 'runtime';
for my $type (qw(requires recommends suggests conflicts)) {
for my $mod (sort keys %{$prereqs->{$phase}{$type}}) {
my $ver = $prereqs->{$phase}{$type}{$mod};
$phase_code .= $ver eq '0'
? "${indent}$type '$mod';\n"
: "${indent}$type '$mod', '$ver';\n";
$requirements++;
}
}
$phase_code .= "\n" unless $requirements;
$phase_code .= "};\n" unless $phase eq 'runtime';
$code .= $phase_code . "\n" if $requirements or $include_empty;
}
$code =~ s/\n+$/\n/s;
$code;
}
1;
__END__
#line 323
HTML-TableParser-0.42/lib/ 0000755 0000407 0000036 00000000000 13076215166 013234 5 ustar dj head HTML-TableParser-0.42/lib/HTML/ 0000755 0000407 0000036 00000000000 13076215166 014000 5 ustar dj head HTML-TableParser-0.42/lib/HTML/TableParser.pm 0000644 0000407 0000036 00000053273 13076215051 016545 0 ustar dj head # --8<--8<--8<--8<--
#
# Copyright (C) 2007 Smithsonian Astrophysical Observatory
#
# This file is part of HTML-TableParser
#
# HTML-TableParser is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or (at
# your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
#
# -->8-->8-->8-->8--
package HTML::TableParser;
require 5.8.1;
use strict;
use warnings;
use Carp;
use HTML::Parser;
use HTML::TableParser::Table;
## no critic ( ProhibitAccessOfPrivateData )
our @ISA = qw(HTML::Parser);
our $VERSION = '0.42';
# Preloaded methods go here.
our %Attr = ( Trim => 0,
Decode => 1,
Chomp => 0,
MultiMatch => 0,
DecodeNBSP => 0,
);
our @Attr = keys %Attr;
our $Verbose = 0;
sub new
{
my $class = shift;
my $reqs = shift;
my $self = $class->SUPER::new
(
api_version => 3,
unbroken_text => 1,
start_h => [ '_start', 'self, tagname, attr, line' ],
end_h => [ '_end', 'self, tagname, attr, line' ],
);
croak( __PACKAGE__, ": must specify a table request" )
unless defined $reqs and 'ARRAY' eq ref $reqs;
my $attr = shift || {};
my @notvalid = grep { ! exists $Attr{$_} } keys %$attr;
croak ( __PACKAGE__, ": Invalid attribute(s): '",
join(" ,'", @notvalid ), "'" )
if @notvalid;
my %attr = ( %Attr, %$attr );
$self->{reqs} = _tidy_reqs( $reqs, \%attr );
$self->{Tables} = [ HTML::TableParser::Table->new() ];
# by default we're not processing anything
$self->_process(0);
$self;
}
our @ReqAttr = ( qw( cols colre id idre class obj start end
hdr row warn udata ),
keys %Attr );
our %ReqAttr = map { $_ => 1 } @ReqAttr;
# convert table requests into something that HTML::TableParser::Table can
# handle
sub _tidy_reqs
{
my ( $reqs, $attr ) = @_;
my @reqs;
my $nreq = 0;
for my $req ( @$reqs )
{
my %req;
$nreq++;
my @notvalid = grep { ! exists $ReqAttr{$_} } keys %$req;
croak (__PACKAGE__, ": table request $nreq: invalid attribute(s): '",
join(" ,'", @notvalid ), "'" )
if @notvalid;
my $req_id = 0;
# parse cols and id the same way
for my $what ( qw( cols id ) )
{
$req{$what} = [];
if ( exists $req->{$what} && defined $req->{$what} )
{
my @reqs;
my $ref = ref $req->{$what};
if ( 'ARRAY' eq $ref )
{
@reqs = @{$req->{$what}};
}
elsif ( 'Regexp' eq $ref ||
'CODE' eq $ref ||
! $ref )
{
@reqs = ( $req->{$what} );
}
else
{
croak( __PACKAGE__,
": table request $nreq: $what must be a scalar, arrayref, or coderef" );
}
# now, check that we have legal things in there
my %attr = ();
for my $match ( @reqs )
{
my $ref = ref $match;
croak( __PACKAGE__,
": table request $nreq: illegal $what `$match': must be a scalar, regexp, or coderef" )
unless defined $match && ! $ref || 'Regexp' eq $ref
|| 'CODE' eq $ref ;
if ( ! $ref && $match eq '-' )
{
%attr = ( exclude => 1 );
next;
}
if ( ! $ref && $match eq '--' )
{
%attr = ( skip => 1 );
next;
}
if ( ! $ref && $match eq '+' )
{
%attr = ();
next;
}
push @{$req{$what}}, { %attr, match => $match };
%attr = ();
$req_id++;
}
}
}
# colre is now obsolete, but keep backwards compatibility
# column regular expression match?
if ( defined $req->{colre} )
{
my $colre;
if ( 'ARRAY' eq ref $req->{colre} )
{
$colre = $req->{colre};
}
elsif ( ! ref $req->{colre} )
{
$colre = [ $req->{colre} ];
}
else
{
croak( __PACKAGE__,
": table request $nreq: colre must be a scalar or arrayref" );
}
for my $re ( @$colre )
{
my $ref = ref $re;
croak( __PACKAGE__, ": table request $nreq: colre must be a scalar" )
unless ! $ref or 'Regexp' eq $ref;
push @{$req{cols}}, { include => 1,
match => 'Regexp' eq $ref ? $re : qr/$re/ };
$req_id++;
}
}
croak( __PACKAGE__,
": table request $nreq: must specify at least one id method" )
unless $req_id;
$req{obj} = $req->{obj}
if exists $req->{obj};
$req{class} = $req->{class}
if exists $req->{class};
for my $method ( qw( start end hdr row warn new ) )
{
if ( exists $req->{$method} && 'CODE' eq ref $req->{$method} )
{
$req{$method} = $req->{$method};
}
elsif ( exists $req{obj} || exists $req{class})
{
my $thing = exists $req{obj} ? $req{obj} : $req{class};
if ( exists $req->{$method} )
{
if ( defined $req->{$method} )
{
croak( __PACKAGE__,
": table request $nreq: can't have object & non-scalar $method" )
if ref $req->{$method};
my $call = $req->{$method};
croak( __PACKAGE__,
": table request $nreq: class doesn't have method $call" )
if ( exists $req->{obj} && ! $req->{obj}->can( $call ) )
|| !UNIVERSAL::can( $thing, $call );
}
# if $req->{$method} is undef, user must have explicitly
# set it so, which is a signal to NOT call that method.
}
else
{
$req{$method} = $method
if UNIVERSAL::can( $thing, $method );
}
}
elsif( exists $req->{$method} )
{
croak( __PACKAGE__, ": invalid callback for $method" );
}
}
# last minute cleanups for things that don't fit in the above loop
croak( __PACKAGE__, ": must specify valid constructor for class $req->{class}" )
if exists $req{class} && ! exists $req{new};
$req{udata} = undef;
$req{udata} = exists $req->{udata} ? $req->{udata} : undef;
$req{match} = 0;
@req{@Attr} = @Attr{@Attr};
$req{$_} = $attr->{$_}
foreach grep { defined $attr->{$_} } @Attr;
$req{$_} = $req->{$_}
foreach grep { defined $req->{$_} } @Attr;
push @reqs, \%req;
}
\@reqs;
}
sub _process
{
my ($self, $state) = @_;
my $ostate = $self->{process} || 0;
if ( $state )
{
$self->report_tags( qw( table th td tr ) );
$self->handler( 'text' => '_text', 'self, text, line' );
}
else
{
$self->report_tags( qw( table ) );
$self->handler( 'text' => '' );
}
$self->{process} = $state;
$ostate;
}
our %trans = ( tr => 'row',
th => 'header',
td => 'column' );
sub _start
{
my $self = shift;
my $tagname = shift;
print STDERR __PACKAGE__, "::start : $_[1] : $tagname \n"
if $HTML::TableParser::Verbose;
if ( 'table' eq $tagname )
{
$self->_start_table( @_ );
}
else
{
my $method = 'start_' . $trans{$tagname};
$self->{Tables}[-1]->$method(@_);
}
}
sub _end
{
my $self = shift;
my $tagname = shift;
print STDERR __PACKAGE__, "::_end : $_[1]: $tagname \n"
if $HTML::TableParser::Verbose;
if ( 'table' eq $tagname )
{
$self->_end_table( @_ );
}
else
{
my $method = 'end_' . $trans{$tagname};
$self->{Tables}[-1]->$method(@_);
}
}
sub _start_table
{
my ( $self, $attr, $line ) = @_;
my $otbl = $self->{Tables}[-1];
my $tbl = HTML::TableParser::Table->new( $self,
$self->{Tables}[-1]->ids,
$self->{reqs}, $line );
print STDERR __PACKAGE__, "::_start_table : $tbl->{id}\n"
if $HTML::TableParser::Verbose;
$self->_process( $tbl->process );
push @{$self->{Tables}}, $tbl;
}
sub _end_table
{
my ( $self, $attr, $line ) = @_;
my $tbl = pop @{$self->{Tables}};
print STDERR __PACKAGE__, "::_end_table : $tbl->{id}\n"
if $HTML::TableParser::Verbose;
# the first table in the list is our sentinel table. if we're about
# to delete it, it means that we've hit one too many tags
# we delay the croak until after the pop so that the verbose error
# message prints something nice. no harm anyway as we're about to
# keel over and croak.
croak( __PACKAGE__,
": $line: unbalanced tags; too many tags" )
if 0 == @{$self->{Tables}};
undef $tbl;
$self->_process( $self->{Tables}[-1]->process );
}
sub _text
{
my ( $self, $text, $line ) = @_;
$self->{Tables}[-1]->text( $text );
}
1;
__END__
=pod
=head1 NAME
HTML::TableParser - Extract data from an HTML table
=head1 SYNOPSIS
use HTML::TableParser;
@reqs = (
{
id => 1.1, # id for embedded table
hdr => \&header, # function callback
row => \&row, # function callback
start => \&start, # function callback
end => \&end, # function callback
udata => { Snack => 'Food' }, # arbitrary user data
},
{
id => 1, # table id
cols => [ 'Object Type',
qr/object/ ], # column name matches
obj => $obj, # method callbacks
},
);
# create parser object
$p = HTML::TableParser->new( \@reqs,
{ Decode => 1, Trim => 1, Chomp => 1 } );
$p->parse_file( 'foo.html' );
# function callbacks
sub start {
my ( $id, $line, $udata ) = @_;
#...
}
sub end {
my ( $id, $line, $udata ) = @_;
#...
}
sub header {
my ( $id, $line, $cols, $udata ) = @_;
#...
}
sub row {
my ( $id, $line, $cols, $udata ) = @_;
#...
}
=head1 DESCRIPTION
B uses B to extract data from an HTML
table. The data is returned via a series of user defined callback
functions or methods. Specific tables may be selected either by a
matching a unique table id or by matching against the column names.
Multiple (even nested) tables may be parsed in a document in one pass.
=head2 Table Identification
Each table is given a unique id, relative to its parent, based upon its
order and nesting. The first top level table has id C<1>, the second
C<2>, etc. The first table nested in table C<1> has id C<1.1>, the
second C<1.2>, etc. The first table nested in table C<1.1> has id
C<1.1.1>, etc. These, as well as the tables' column names, may
be used to identify which tables to parse.
=head2 Data Extraction
As the parser traverses a selected table, it will pass data to user
provided callback functions or methods after it has digested
particular structures in the table. All functions are passed the
table id (as described above), the line number in the HTML source
where the table was found, and a reference to any table specific user
provided data.
=over 8
=item Table Start
The B callback is invoked when a matched table has been found.
=item Table End
The B callback is invoked after a matched table has been parsed.
=item Header
The B callback is invoked after the table header has been read in.
Some tables do not use the BthE> tag to indicate a header, so this
function may not be called. It is passed the column names.
=item Row
The B callback is invoked after a row in the table has been read.
It is passed the column data.
=item Warn
The B callback is invoked when a non-fatal error occurs during
parsing. Fatal errors croak.
=item New
This is the class method to call to create a new object when
B is supposed to create new objects upon table
start.
=back
=head2 Callback API
Callbacks may be functions or methods or a mixture of both.
In the latter case, an object must be passed to the constructor.
(More on that later.)
The callbacks are invoked as follows:
start( $tbl_id, $line_no, $udata );
end( $tbl_id, $line_no, $udata );
hdr( $tbl_id, $line_no, \@col_names, $udata );
row( $tbl_id, $line_no, \@data, $udata );
warn( $tbl_id, $line_no, $message, $udata );
new( $tbl_id, $udata );
=head2 Data Cleanup
There are several cleanup operations that may be performed automatically:
=over 8
=item Chomp
B the data
=item Decode
Run the data through B.
=item DecodeNBSP
Normally B changes a non-breaking space into
a character which doesn't seem to be matched by Perl's whitespace
regexp. Setting this attribute changes the HTML C character to
a plain 'ol blank.
=item Trim
remove leading and trailing white space.
=back
=head2 Data Organization
Column names are derived from cells delimited by the BthE> and
B/thE> tags. Some tables have header cells which span one or
more columns or rows to make things look nice. B
determines the actual number of columns used and provides column
names for each column, repeating names for spanned columns and
concatenating spanned rows and columns. For example, if the
table header looks like this:
+----+--------+----------+-------------+-------------------+
| | | Eq J2000 | | Velocity/Redshift |
| No | Object |----------| Object Type |-------------------|
| | | RA | Dec | | km/s | z | Qual |
+----+--------+----------+-------------+-------------------+
The columns will be:
No
Object
Eq J2000 RA
Eq J2000 Dec
Object Type
Velocity/Redshift km/s
Velocity/Redshift z
Velocity/Redshift Qual
Row data are derived from cells delimited by the BtdE> and
B/tdE> tags. Cells which span more than one column or row are
handled correctly, i.e. the values are duplicated in the appropriate
places.
=head1 METHODS
=over 8
=item new
$p = HTML::TableParser->new( \@reqs, \%attr );
This is the class constructor. It is passed a list of table requests
as well as attributes which specify defaults for common operations.
Table requests are documented in L.
The C<%attr> hash provides default values for some of the table
request attributes, namely the data cleanup operations ( C,
C, C ), and the multi match attribute C,
i.e.,
$p = HTML::TableParser->new( \@reqs, { Chomp => 1 } );
will set B on for all of the table requests, unless overridden
by them. The data cleanup operations are documented above; C
is documented in L.
B defaults to on; all of the others default to off.
=item parse_file
This is the same function as in B.
=item parse
This is the same function as in B.
=back
=head1 Table Requests
A table request is a hash used by B to determine
which tables are to be parsed, the callbacks to be invoked, and any
data cleanup. There may be multiple requests processed by one call to
the parser; each table is associated with a single request (even if
several requests match the table).
A single request may match several tables, however unless the
B attribute is specified for that request, it will be used
for the first matching table only.
A table request which matches a table id of C will be used as
a catch-all request, and will match all tables not matched by other
requests. Please note that tables are compared to the requests in the
order that the latter are passed to the B method; place the
B method last for proper behavior.
=head2 Identifying tables to parse
B needs to be told which tables to parse. This can
be done by matching table ids or column names, or a combination of
both. The table request hash elements dedicated to this are:
=over 8
=item id
This indicates a match on table id. It can take one of these forms:
=over 8
=item exact match
id => $match
id => '1.2'
Here C<$match> is a scalar which is compared directly to the table id.
=item regular expression
id => $re
id => qr/1\.\d+\.2/
C<$re> is a regular expression, which must be constructed with the
C operator.
=item subroutine
id => \&my_match_subroutine
id => sub { my ( $id, $oids ) = @_ ;
$oids[0] > 3 && $oids[1] < 2 }
Here C is assigned a coderef to a subroutine which returns
true if the table matches, false if not. The subroutine is passed
two arguments: the table id as a scalar string ( e.g. C<1.2.3>) and the
table id as an arrayref (e.g. C<$oids = [ 1, 2, 3]>).
=back
C may be passed an array containing any combination of the
above:
id => [ '1.2', qr/1\.\d+\.2/, sub { ... } ]
Elements in the array may be preceded by a modifier indicating
the action to be taken if the table matches on that element.
The modifiers and their meanings are:
=over 8
=item C<->
If the id matches, it is explicitly excluded from being processed
by this request.
=item C<-->
If the id matches, it is skipped by B requests.
=item C<+>
If the id matches, it will be processed by this request. This
is the default action.
=back
An example:
id => [ '-', '1.2', 'DEFAULT' ]
indicates that this request should be used for all tables,
except for table 1.2.
id => [ '--', '1.2' ]
Table 2 is just plain skipped altogether.
=item cols
This indicates a match on column names. It can take one of these forms:
=over 8
=item exact match
cols => $match
cols => 'Snacks01'
Here C<$match> is a scalar which is compared directly to the column names.
If any column matches, the table is processed.
=item regular expression
cols => $re
cols => qr/Snacks\d+/
C<$re> is a regular expression, which must be constructed with the
C operator. Again, a successful match against any column name
causes the table to be processed.
=item subroutine
cols => \&my_match_subroutine
cols => sub { my ( $id, $oids, $cols ) = @_ ;
... }
Here C is assigned a coderef to a subroutine which returns
true if the table matches, false if not. The subroutine is passed
three arguments: the table id as a scalar string ( e.g. C<1.2.3>), the
table id as an arrayref (e.g. C<$oids = [ 1, 2, 3]>), and the column
names, as an arrayref (e.g. C<$cols = [ 'col1', 'col2' ]>). This
option gives the calling routine the ability to make arbitrary
selections based upon table id and columns.
=back
C may be passed an arrayref containing any combination of the
above:
cols => [ 'Snacks01', qr/Snacks\d+/, sub { ... } ]
Elements in the array may be preceded by a modifier indicating
the action to be taken if the table matches on that element.
They are the same as the table id modifiers mentioned above.
=item colre
B
An arrayref containing the regular expressions to match, or a scalar
containing a single reqular expression
=back
More than one of these may be used for a single table request. A
request may match more than one table. By default a request is used
only once (even the C id match!). Set the C
attribute to enable multiple matches per request.
When attempting to match a table, the following steps are taken:
=over 8
=item 1
The table id is compared to the requests which contain an id match.
The first such match is used (in the order given in the passed array).
=item 2
If no explicit id match is found, column name matches are attempted.
The first such match is used (in the order given in the passed array)
=item 3
If no column name match is found (or there were none requested),
the first request which matches an B of C is used.
=back
=head2 Specifying the data callbacks
Callback functions are specified with the callback attributes
C, C, C, C, and C. They should be set to
code references, i.e.
%table_req = ( ..., start => \&start_func, end => \&end_func )
To use methods, specify the object with the C key, and
the method names via the callback attributes, which should be set
to strings. If you don't specify method names they will default to (you
guessed it) C, C, C, C, and C.
$obj = SomeClass->new();
# ...
%table_req_1 = ( ..., obj => $obj );
%table_req_2 = ( ..., obj => $obj, start => 'start',
end => 'end' );
You can also have B create a new object for you
for each table by specifying the C attribute. By default
the constructor is assumed to be the class B method; if not,
specify it using the C attribute:
use MyClass;
%table_req = ( ..., class => 'MyClass', new => 'mynew' );
To use a function instead of a method for a particular callback,
set the callback attribute to a code reference:
%table_req = ( ..., obj => $obj, end => \&end_func );
You don't have to provide all the callbacks. You should not use both
C and C in the same table request.
B automatically determines if your object
or class has one of the required methods. If you wish it I
to use a particular method, set it equal to C. For example
%table_req = ( ..., obj => $obj, end => undef )
indicates the object's B method should not be called, even
if it exists.
You can specify arbitrary data to be passed to the callback functions
via the C attribute:
%table_req = ( ..., udata => \%hash_of_my_special_stuff )
=head2 Specifying Data cleanup operations
Data cleanup operations may be specified uniquely for each table. The
available keys are C, C, C. They should be
set to a non-zero value if the operation is to be performed.
=head2 Other Attributes
The C key is used when a request is capable of handling
multiple tables in the document. Ordinarily, a request will process
a single table only (even C requests).
Set it to a non-zero value to allow the request to handle more than
one table.
=head1 LICENSE
This software is released under the GNU General Public License. You
may find a copy at
http://www.fsf.org/copyleft/gpl.html
=head1 AUTHOR
Diab Jerius (djerius@cpan.org)
=head1 SEE ALSO
L, L.
=cut
HTML-TableParser-0.42/lib/HTML/TableParser/ 0000755 0000407 0000036 00000000000 13076215166 016204 5 ustar dj head HTML-TableParser-0.42/lib/HTML/TableParser/Table.pm 0000644 0000407 0000036 00000034051 13075413113 017563 0 ustar dj head package HTML::TableParser::Table;
use strict;
use warnings;
use HTML::Entities;
our $VERSION = '0.38';
## no critic ( ProhibitAccessOfPrivateData )
sub new
{
my $this = shift;
my $class = ref($this) || $this;
my $self = {
data => [[]], # row data (for overlapping rows)
row => undef, # row info
col => undef, # column info
hdr => undef, # accumulated header info
hdr_row => 0, # index of header row
hdr_line => undef, # line in file of header row
in_hdr => 0, # are we in a header row?
prev_hdr => 0, # was the previous row a header row?
line => undef, # line in file of current row
start_line => undef, # line in file of table start
req => undef, # the matching table request
exclreqs => {}, # the requests which exlude this table
};
bless $self, $class;
my ( $parser, $ids, $reqs, $line ) = @_;
$self->{parser} = $parser;
$self->{start_line} = $line;
# if called with no args, create an empty, placeholder object
unless ( defined $ids )
{
$self->{ids} = [ 0 ];
$self->{process} = 0;
$self->{id} = 'sentinel';
}
else
{
$ids->[-1]++;
$self->{oids} = [ @$ids ];
$self->{ids} = [ @$ids, 0 ];
$self->{id} = join( '.', grep { $_ != 0 } @{$ids} );
$self->{reqs} = $reqs;
# are we interested in this table?
$self->match_id();
# inform user of table start. note that if we're looking for
# for column name matches, we don't want to do the callback;
# in that case $self->{req} isn't set and callback() won't
# actually make the call.
$self->callback( 'start', $self->{start_line} )
if $self->{process};
}
$self;
}
sub match_id
{
my $self = shift;
$self->{process} = 0;
$self->{req} = undef;
# 1. look for explicit id matches
# 2. if no explicit id match, use header matches
# 3. if no header matches, use DEFAULT
# 4. if no DEFAULT, no match
# 1. explicit id.
my ( $skip, $req );
( $skip, $req ) =
req_match_id( $self->{reqs}, $self->{id}, $self->{oids},
$self->{exclreqs} );
# did we match a skip table request?
return if $skip;
if ( $req )
{
$self->match_req( $req );
return;
}
# 2. header match.
# don't set {req}, as that'll trigger callbacks and we're not sure
# this is a match yet
if ( grep { @{$_->{cols}} } @{$self->{reqs}})
{
$self->{process} = 1;
$self->{req} = undef;
return;
}
# 3. DEFAULT match
( $skip, $req ) =
req_match_id( $self->{reqs}, 'DEFAULT', $self->{oids}, $self->{exclreqs} );
# did we match a skip table request? Does this make sense for DEFAULT?
return if $skip;
if ( $req )
{
$self->match_req( $req );
return;
}
# 4. out of luck. no match.
}
# determine if a request matches an id. requests should
# be real objects, but until then...
sub req_match_id
{
my ( $reqs, $id, $oids, $excluded ) = @_;
for my $req ( @$reqs )
{
# if we've already excluded this request, don't bother again.
# this is needed for id = DEFAULT passes where we've previously
# excluded based on actual table id and should again.
next if exists $excluded->{$req};
# bail if this request has already matched and we're not
# multi-matching
next if $req->{match} && ! $req->{MultiMatch};
for my $cmp ( @{$req->{id}} )
{
# is this a subroutine to call?
if ( 'CODE' eq ref $cmp->{match} )
{
next unless $cmp->{match}->($id, $oids );
}
# regular expression
elsif( 'Regexp' eq ref $cmp->{match} )
{
next unless $id =~ /$cmp->{match}/;
}
# a direct match?
else
{
next unless $id eq $cmp->{match};
}
# we get here only if there was a match.
# move on to next request if this was an explicit exclude
# request.
if ( $cmp->{exclude} )
{
$excluded->{$req}++;
next;
}
# return match, plus whether this is a global skip request
return ( $cmp->{skip}, $req );
}
}
( 0, undef );
}
# determine if a request matches a column. requests should
# be real objects, but until then...
sub req_match_cols
{
my ( $reqs, $cols, $id, $oids ) = @_;
for my $req ( @$reqs )
{
# bail if this request has already matched and we're not
# multi-matching
next if $req->{match} && ! $req->{MultiMatch};
my @fix_cols = @$cols;
fix_texts($req, \@fix_cols);
for my $cmp ( @{$req->{cols}} )
{
# is this a subroutine to call?
if ( 'CODE' eq ref $cmp->{match} )
{
next unless $cmp->{match}->( $id, $oids, \@fix_cols );
}
# regular expression
elsif( 'Regexp' eq ref $cmp->{match} )
{
next unless grep { /$cmp->{match}/ } @fix_cols;
}
# a direct match?
else
{
next unless grep { $_ eq $cmp->{match} } @fix_cols;
}
# we get here only if there was a match
# move on to next request if this was an explicit exclude
# request.
next if $cmp->{exclude};
# return match, plus whether this is a global skip request
return ( $cmp->{skip}, $req );
}
}
(0, undef);
}
# we've pulled in a header; does it match against one of the requests?
sub match_hdr
{
my ( $self, @cols ) = @_;
# 1. check header matches
# 2. if no header matches, use DEFAULT id
# 3. if no DEFAULT, no match
# 1. check header matches
my ( $skip, $req ) = req_match_cols( $self->{reqs}, \@cols, $self->{id},
$self->{oids} );
# did we match a skip table request?
return 0 if $skip;
if ( $req )
{
$self->match_req( $req );
return 1;
}
# 2. DEFAULT match
( $skip, $req ) =
req_match_id( $self->{reqs}, 'DEFAULT', $self->{oids}, $self->{exclreqs} );
# did we match a skip table request? Does this make sense for DEFAULT?
return 0 if $skip;
if ( $req )
{
$self->match_req( $req );
return 1;
}
# 3. if no DEFAULT, no match
0;
}
sub match_req
{
my ( $self, $req ) = @_;
if ( $req->{class} )
{
# no strict 'refs';
my $new = $req->{new};
$self->{obj} = $req->{class}->$new( $req->{id}, $req->{udata} );
}
elsif ( $req->{obj} )
{
$self->{obj} = $req->{obj};
}
$self->{process} = 1;
$self->{req} = $req;
$self->{req}{match}++;
}
# generic call back interface. handle method calls as well as
# subroutine calls.
sub callback
{
my $self = shift;
my $method = shift;
return unless
defined $self->{req} && exists $self->{req}->{$method};
my $req = $self->{req};
my $call = $req->{$method};
if ( 'CODE' eq ref $call )
{
$call->( $self->{id}, @_, $req->{udata} );
}
else
{
# if the object was destroyed before we get here (if it
# was created by us and thus was destroyed before us if
# there was an error), we can't call a method
$self->{obj}->$call( $self->{id}, @_, $req->{udata} )
if defined $self->{obj};
}
}
# handle
sub start_header
{
my $self = shift;
my ( undef, $line ) = @_;
$self->{in_hdr}++;
$self->{prev_hdr}++;
$self->{hdr_line} = $line;
$self->start_column( @_ );
}
# handle |
sub end_header
{
my $self = shift;
$self->end_column();
}
# handle
sub start_column
{
my $self = shift;
my ( $attr, $line ) = @_;
# end last column if not explicitly ended. perform check here
# to avoid extra method call
$self->end_column() if defined $self->{col};
# we really shouldn't be here if a row hasn't been started
unless ( defined $self->{row} )
{
$self->callback( 'warn', $self->{id}, $line,
" | or | without | at line $line\n" );
$self->start_row( {}, $line );
}
# even weirder. if the last row was a header we have to process it now,
# rather than waiting until the end of this row, as there might be
# a table in one of the cells in this row and if the enclosing table
# was using a column match/re, we won't match it's header until after
# the enclosed table is completely parsed. this is bad, as it may
# grab a match (if there's no multimatch) meant for the enclosing table.
# if we're one row past the header, we're done with the header
$self->finish_header()
if ! $self->{in_hdr} && $self->{prev_hdr};
$self->{col} = { attr => { %$attr} };
$self->{col}{attr}{colspan} ||= 1;
$self->{col}{attr}{rowspan} ||= 1;
}
# handle
sub end_column
{
my $self = shift;
return unless defined $self->{col};
$self->{col}{text} = defined $self->{text} ? $self->{text} : '' ;
push @{$self->{row}}, $self->{col};
$self->{col} = undef;
$self->{text} = undef;
}
sub start_row
{
my $self = shift;
my ( $attr, $line ) = @_;
# end last row if not explicitly ended
$self->end_row();
$self->{row} = [];
$self->{line} = $line;
}
sub end_row
{
my $self = shift;
return unless defined $self->{row};
# perhaps an unfinished row. first finish column
$self->end_column();
# if we're in a header, deal with overlapping cells differently
# then if we're in the data section
if ( $self->{in_hdr} )
{
my $cn = 0;
my $rn = 0;
foreach my $col ( @{$self->{row}} )
{
# do this just in case there are newlines and we're concatenating
# column names later on. causes strange problems. besides,
# column names should be regular
$col->{text} =~ s/^\s+//;
$col->{text} =~ s/\s+$//;
# need to find the first undefined column
$cn++ while defined $self->{hdr}[$cn][$self->{hdr_row}];
# note that header is stored as one array per column, not row!
for ( my $cnn = 0 ; $cnn < $col->{attr}{colspan} ; $cnn++, $cn++ )
{
$self->{hdr}[$cn] ||= [];
$self->{hdr}[$cn][$self->{hdr_row}] = $col->{text};
# put empty placeholders in the rest of the rows
for ( my $rnn = 1 ; $rnn < $col->{attr}{rowspan} ; $rnn++ )
{
$self->{hdr}[$cn][$rnn + $self->{hdr_row}] = '';
}
}
}
$self->{hdr_row}++;
}
else
{
my $cn = 0;
my $rn = 0;
foreach my $col ( @{$self->{row}} )
{
# need to find the first undefined column
$cn++ while defined $self->{data}[0][$cn];
for ( my $cnn = 0 ; $cnn < $col->{attr}{colspan} ; $cnn++, $cn++ )
{
for ( my $rnn = 0 ; $rnn < $col->{attr}{rowspan} ; $rnn++ )
{
$self->{data}[$rnn] ||= [];
$self->{data}[$rnn][$cn] = $col->{text};
}
}
}
}
# if we're one row past the header, we're done with the header
$self->finish_header()
if ! $self->{in_hdr} && $self->{prev_hdr};
# output the data if we're not in a header
$self->callback( 'row', $self->{line},
fix_texts( $self->{req}, shift @{$self->{data}} ) )
unless $self->{in_hdr};
$self->{in_hdr} = 0;
$self->{row} = undef;
}
# collect the possible multiple header rows into one array and
# send it off
sub finish_header
{
my $self = shift;
return unless $self->{hdr};
my @header = map { join( ' ', grep { defined $_ && $_ ne '' } @{$_}) }
@{ $self->{hdr} };
# if we're trying to match header columns, check that here.
if ( defined $self->{req} )
{
fix_texts( $self->{req}, \@header );
$self->callback( 'hdr', $self->{hdr_line}, \@header );
}
else
{
if ( $self->match_hdr( @header ) )
{
# haven't done this callback yet...
$self->callback( 'start', $self->{start_line} );
fix_texts( $self->{req}, \@header );
$self->callback( 'hdr', $self->{hdr_line}, \@header );
}
# no match. reach up to the controlling parser and turn off
# processing of this table. this is kind of kludgy!
else
{
$self->{parser}->process(0);
}
}
$self->{hdr} = undef;
$self->{prev_hdr} = undef;
$self->{hdr_row} = 0;
}
DESTROY
{
my $self = shift;
# if we're actually parsing this table, do something.
if ( $self->{process} )
{
# just in case
$self->end_row();
# just in case there's no table body
$self->finish_header();
$self->callback( 'end', $self->{line} );
}
}
sub fix_texts
{
my ( $req, $texts ) = @_;
for ( @$texts )
{
local $HTML::Entities::entity2char{nbsp} =
$HTML::Entities::entity2char{nbsp};
$HTML::Entities::entity2char{nbsp} = ' '
if $req->{DecodeNBSP};
chomp $_
if $req->{Chomp};
decode_entities( $_ )
if $req->{Decode};
if ( $req->{Trim} )
{
s/^\s+//;
s/\s+$//;
}
}
$texts;
}
sub text
{
my $self = shift;
$self->{text} = shift;
}
sub id { $_[0]->{id} }
sub ids { $_[0]->{ids} }
sub process { $_[0]->{process} }
1;
__END__
=head1 NAME
HTML::TableParser::Table - support class for HTML::TableParser
=head1 DESCRIPTION
This class is used to keep track of information related to a table and
to create the information passed back to the user callbacks. It is in
charge of marshalling the massaged header and row data to the user
callbacks.
An instance is created when the controlling TableParser class finds a
C< tag. The object is given an id based upon which table it is
to work on. Its methods are invoked from the TableParser callbacks
when they run across an appropriate tag (C, C, C | ). The
object is destroyed when the matching C |
tag is found.
Since tables may be nested, multiple B
objects may exist simultaneously. B uses two
pieces of information held by this class -- ids and process. The
first is an array of table ids, one element per level of table
nesting. The second is a flag indicating whether this table is being
processed (i.e. it matches a requested table) or being ignored. Since
B uses the ids information from an existing table
to initialize a new table, it first creates an empty sentinel (place
holder) table (by calling the B constructor
with no arguments).
The class handles missing C
, C, and C tags. As such
(especially when handling multi-row headers) user callbacks may
be slightly delayed (and data cached). It also handles rows
with overlapping columns
=head1 LICENSE
This software is released under the GNU General Public License. You
may find a copy at
http://www.fsf.org/copyleft/gpl.html
=head1 AUTHOR
Diab Jerius (djerius@cpan.org)
=head1 SEE ALSO
L, L.
=cut
HTML-TableParser-0.42/README 0000644 0000407 0000036 00000002765 13075413113 013347 0 ustar dj head NAME
HTML::TableParser - Extract data from an HTML table
DESCRIPTION
HTML::TableParser uses HTML::Parser to extract data from an HTML
table. The data is returned via a series of user defined callback
functions or methods. Specific tables may be selected either by a
unique table id or by matching against the column names. Multiple
tables may be parsed simultaneously in the document.
The data are presented to the caller as the table is scanned,
on a row-by-row basis.
INSTALLATION
To install this module type the following:
perl Makefile.PL
make
make test
make install
DEPENDENCIES
This module requires these other modules and libraries:
HTML::Entities
HTML::Parser
Test::More
COPYRIGHT AND LICENCE
Copyright (C) 2001-2007 Smithsonian Astrophysical Observatory
This file is part of HTML::TableParser
HTML::TableParser is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or (at
your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
HTML-TableParser-0.42/MANIFEST 0000644 0000407 0000036 00000002675 13075416167 013634 0 ustar dj head Changes
cpanfile
data/ned.Chomp.data
data/ned.Decode.data
data/ned.Default.data
data/ned.hdr
data/ned.html
data/ned.Trim.data
data/screwy.Chomp.data
data/screwy.Decode.data
data/screwy.Default.data
data/screwy.hdr
data/screwy.html
data/screwy.Trim.data
data/table.Chomp.data
data/table.Decode.data
data/table.Default.data
data/table.hdr
data/table.html
data/table.Trim.data
data/table2-1.Chomp.data
data/table2-1.Decode.data
data/table2-1.Default.data
data/table2-1.hdr
data/table2-1.Trim.data
data/table2.Chomp.data
data/table2.Decode.data
data/table2.Default.data
data/table2.hdr
data/table2.html
data/table2.Trim.data
inc/Module/CPANfile.pm
inc/Module/CPANfile/Environment.pm
inc/Module/CPANfile/Prereq.pm
inc/Module/CPANfile/Prereqs.pm
inc/Module/CPANfile/Requirement.pm
inc/Module/Install.pm
inc/Module/Install/AuthorTests.pm
inc/Module/Install/AutoLicense.pm
inc/Module/Install/Base.pm
inc/Module/Install/Can.pm
inc/Module/Install/CPANfile.pm
inc/Module/Install/Fetch.pm
inc/Module/Install/Makefile.pm
inc/Module/Install/Metadata.pm
inc/Module/Install/Win32.pm
inc/Module/Install/WriteAll.pm
lib/HTML/TableParser.pm
lib/HTML/TableParser/Table.pm
LICENSE
Makefile.PL
MANIFEST This list of files
META.json
META.yml
README
t/00-load.t
t/class-01.t
t/class.t
t/common.pl
t/contents.t
t/counts.pl
t/end_table.t
t/funcs.t
t/methods.t
t/req_order.t
tdata/end_table.html
THANKS
xt/00-compile.t
xt/changes.t
xt/nobreakpoints.t
xt/perlcritic.t
xt/pod-coverage.t
xt/pod.t
HTML-TableParser-0.42/LICENSE 0000644 0000407 0000036 00000104772 13075416144 013504 0 ustar dj head This software is Copyright (c) 2017 by Smithsonian Astrophysical Observatory.
This is free software, licensed under:
The GNU General Public License, Version 3, June 2007
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc.
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
Copyright (C)
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
Copyright (C)
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
.
HTML-TableParser-0.42/THANKS 0000644 0000407 0000036 00000000101 13075413113 013360 0 ustar dj head Thanks to these folks for their assistance:
G. Allen Morris III
HTML-TableParser-0.42/Makefile.PL 0000644 0000407 0000036 00000000500 13075414526 014433 0 ustar dj head use strict;
use warnings;
use lib '.';
use inc::Module::Install;
name 'HTML-TableParser';
license 'gpl3';
auto_license( holder => 'Smithsonian Astrophysical Observatory' );
all_from 'lib/HTML/TableParser.pm';
repository 'http://bitbucket.org/djerius/html-tableparser';
author_tests( 'xt' );
cpanfile;
WriteAll;
HTML-TableParser-0.42/data/ 0000755 0000407 0000036 00000000000 13076215166 013377 5 ustar dj head HTML-TableParser-0.42/data/screwy.Decode.data 0000644 0000407 0000036 00000000164 13076214665 016734 0 ustar dj head Both
Both
MM1
MB1
11.1
22.2
1-3.1.1
1-3.2.1
A
B
MM2
MB2
11.1
33.3
2-3.1.1
2-3.2.1
HTML-TableParser-0.42/data/screwy.Chomp.data 0000644 0000407 0000036 00000000144 13076214665 016615 0 ustar dj head Both Both MM1 MB1 11.1 22.2 1-3.1.1 1-3.2.1
A B MM2 MB2 11.1 33.3 2-3.1.1 2-3.2.1
HTML-TableParser-0.42/data/table2.Trim.data 0000644 0000407 0000036 00000002421 13076214665 016317 0 ustar dj head h1 -1.154e-01 -2.060e-01 481.0146 -1.7797716637950735E-03 -26.0506034413416841 579.89015840093919 0.000672059134040231 0.00123484664976509 842.1920 24.9555 59.9186 902.1106 598.5083 560.6541h3 -8.365e-02 -2.345e-01 480.9282 -1.1532395834759916E-03 -16.875942397594130 466.64379784205380 0.000515063949465614 0.00138731246068735 842.1970 24.9555 59.8297 902.0267 481.6319 451.1580h4 -8.386e-02 -2.065e-01 480.8279 -8.9864417477996457E-04 -13.150318066441841 411.91935912458604 0.000513002156880169 0.00123195192376053 842.2250 24.9555 59.7154 901.9404 425.1507 398.2487h6 -1.096e-01 -2.067e-01 479.2152 -4.9625995845653374E-04 -7.2620248152618760 306.09851668776219 0.000658904663372658 0.00124699759199671 842.2000 24.9555 58.1152 900.3152 315.9310 295.9396p1 1.239e-01 2.151e-01 -426.5761 0.0 -8.9333113530131421 606.86080963697918 842.2150 24.9555 -847.6836 -5.4686 613.0284 600.6299p3 8.675e-02 2.437e-01 -436.7098 0.0 -5.7939624154424676 488.46244215611011 842.2080 24.9555 -857.8138 -15.6058 493.4321 483.4417p4 8.634e-02 2.168e-01 -440.3572 0.0 -4.5165799273846270 431.26225933154404 842.2080 24.9555 -861.4612 -19.2532 435.6501 426.8293p6 8.625e-02 2.245e-01 -445.0821 0.0 -2.4957050467401789 320.56977725634789 842.2090 24.9555 -866.1866 -23.9776 323.8316 317.2745 HTML-TableParser-0.42/data/screwy.hdr 0000644 0000407 0000036 00000000126 13076214665 015414 0 ustar dj head Widget A
Widget B
Snacks Sn 1
Snacks Sn 2
Prices 1
Prices 2
Prices 3 3.1
Prices 3 3.2
HTML-TableParser-0.42/data/ned.hdr 0000644 0000407 0000036 00000000432 13076214665 014646 0 ustar dj head No.
Object Name (* => Essential Note)
Equatorial J2000.0 RA
Equatorial J2000.0 DEC
Object Type
Velocity/Redshift km/s
Velocity/Redshift z
Velocity/Redshift Qual
Distance from Central Posn. (arcmin)
Number of Refs
Number of Notes
Number of Phot
Number of Posn
Number of Vel/z
Images
HTML-TableParser-0.42/data/ned.Trim.data 0000644 0000407 0000036 00000024342 13076214665 015722 0 ustar dj head 1 PGC 056527 15h58m20.0s +27d14m02s G 27092 0.090369 1.0 9 0 0 0 2 Retrieve2 ABELL 2142:[HCW85] 2 15h58m18.8s +27d14m21s G 24247 0.080879 1.1 1 0 0 0 0 Retrieve3 PGC 056515 15h58m13.3s +27d14m55s G 28936 0.096520 1.6 3 0 0 0 1 Retrieve4 ABELL 2142:[OHF95] 216 15h58m23.1s +27d14m04s G 27658 0.092257 1.7 1 0 0 0 0 Retrieve5 ABELL 2142:[OHF95] 244 15h58m24.7s +27d13m47s G 26470 0.088294 1.9 1 0 0 0 0 Retrieve6 ABELL 2142:[OHF95] 246 15h58m07.6s +27d14m45s G 26817 0.089452 2.3 1 0 0 0 0 Retrieve7 ABELL 2142:[OHF95] 218 15h58m25.5s +27d14m46s G 27154 0.090576 2.5 1 0 0 0 0 Retrieve8 ABELL 2142:[HS79] 103 15h58m17.5s +27d16m10s G 25161 0.083928 2.7 1 0 0 0 0 Retrieve9 ABELL 2142:[OHF95] 214 15h58m28.4s +27d13m48s G 27403 0.091406 2.7 1 0 0 0 0 Retrieve10 ABELL 2142:[OHF95] 209 15h58m24.6s +27d11m26s G 27350 0.091230 2.8 1 0 0 0 0 Retrieve11 ABELL 2142:[OHF95] 208 15h58m08.0s +27d11m13s G >30000 0.102341 2.9 1 0 0 0 0 Retrieve12 PGC 056516 15h58m14.0s +27d16m22s G 28644 0.095546 2.9 16 0 4 3 1 Retrieve13 ABELL 2142:[OHF95] 211 15h58m04.8s +27d11m50s G 24764 0.082604 3.0 1 0 0 0 0 Retrieve14 ABELL 2142:[OHF95] 228 15h58m13.8s +27d16m46s G 27029 0.090159 3.3 1 0 0 0 0 Retrieve15 ABELL 2142:[OHF95] 207 15h58m09.0s +27d10m24s G 26209 0.087424 3.5 1 0 0 0 0 Retrieve16 ABELL 2142:[OHF95] 230 15h58m12.8s +27d17m00s G 25793 0.086036 3.6 1 0 0 0 0 Retrieve17 ABELL 2142:[OHF95] 221 15h58m01.3s +27d15m03s G 25561 0.085262 3.6 1 0 0 0 0 Retrieve18 ABELL 2142:[OHF95] 227 15h58m06.5s +27d16m28s G 26107 0.087083 3.7 1 0 0 0 0 Retrieve19 ABELL 2142:[OHF95] 205 15h58m20.2s +27d09m49s G 25289 0.084355 3.8 1 0 0 0 0 Retrieve20 ABELL 2142:[OHF95] 204 15h58m17.9s +27d09m38s G 20093 0.067023 3.9 1 0 0 0 0 Retrieve21 ABELL 2142:[OHF95] 213 15h57m56.2s +27d13m27s G 26695 0.089045 4.4 1 0 0 0 0 Retrieve22 ABELL 2142:[OHF95] 222 15h58m33.9s +27d15m38s G 25251 0.084228 4.5 1 0 0 0 0 Retrieve23 [HB91] 1556+274 15h58m29.2s +27d17m08s G 26981 0.090000 4.7 3 0 0 0 0 Retrieve24 ABELL 2142:[OHF95] 203 15h58m19.2s +27d08m49s G >30000 0.147802 4.7 1 0 0 0 0 Retrieve25 ABELL 2142:[OHF95] 206 15h57m58.6s +27d10m44s G 26779 0.089325 4.8 1 0 0 0 0 Retrieve26 ABELL 2142:[OHF95] 212 15h57m54.9s +27d11m52s G 25246 0.084211 5.0 1 0 0 0 0 Retrieve27 ABELL 2142:[OHF95] 243 15h58m39.1s +27d14m02s G 27034 0.090176 5.1 1 0 0 0 0 Retrieve28 ABELL 2142:[OHF95] 242 15h58m39.6s +27d13m53s G 26930 0.089829 5.2 1 0 0 0 0 Retrieve29 ABELL 2142:[OHF95] 224 15h58m39.3s +27d16m19s G 26769 0.089292 5.9 1 0 0 0 0 Retrieve30 ABELL 2142:[OHF95] 220 15h58m41.5s +27d15m11s G 26486 0.088348 5.9 1 0 0 0 0 Retrieve31 ABELL 2142:[OHF95] 225 15h57m51.7s +27d16m06s G 27356 0.091250 6.0 1 0 0 0 0 Retrieve32 ABELL 2142:[OHF95] 234 15h58m26.7s +27d19m13s G 27760 0.092597 6.2 1 0 0 0 0 Retrieve33 PGC 056530 15h58m21.0s +27d20m03s G 26178 0.087320 6.7 2 0 0 0 1 Retrieve34 ABELL 2142:[OHF95] 210 15h58m45.4s +27d11m53s G 26182 0.087334 6.7 1 0 0 0 0 Retrieve35 ABELL 2142:[OHF95] 202 15h58m37.2s +27d08m18s G 27117 0.090452 7.0 1 0 0 0 0 Retrieve36 ABELL 2142:[OHF95] 343 15h58m32.7s +27d07m26s G >30000 0.106904 7.1 1 0 0 0 0 Retrieve37 ABELL 2142:[OHF95] 342 15h58m29.6s +27d06m56s G 25466 0.084945 7.2 1 0 0 0 0 Retrieve38 ABELL 2142:[OHF95] 252 15h58m47.0s +27d15m53s G 24443 0.081533 7.3 1 0 0 0 0 Retrieve39 ABELL 2142:[OHF95] 215 15h57m43.2s +27d13m38s G 25977 0.086650 7.3 1 0 0 0 0 Retrieve40 ABELL 2142:[OHF95] 344 15h57m55.7s +27d07m41s G 29091 0.097037 7.4 1 0 0 0 0 Retrieve41 ABELL 2142:[OHF95] 238 15h58m16.8s +27d20m55s G 27102 0.090402 7.4 1 0 0 0 0 Retrieve42 ABELL 2142:[OHF95] 231 15h57m49.8s +27d18m14s G 28075 0.093648 7.5 1 0 0 0 0 Retrieve43 ABELL 2142:[OHF95] 229 15h57m43.7s +27d16m38s G 26615 0.088778 7.9 1 0 0 0 0 Retrieve44 ABELL 2142:[OHF95] 338 15h58m21.1s +27d05m27s G 25406 0.084745 8.1 1 0 0 0 0 Retrieve45 ABELL 2142:[OHF95] 232 15h58m43.7s +27d19m00s G 19311 0.064414 8.2 1 0 0 0 0 Retrieve46 ABELL 2142:[OHF95] 340 15h58m05.1s +27d05m32s G 27222 0.090803 8.3 1 0 0 0 0 Retrieve47 ABELL 2142:[OHF95] 266 15h57m40.4s +27d15m57s G 26628 0.088821 8.3 1 0 0 0 0 Retrieve48 IRAS F15566+2716 15h58m42.9s +27d07m38s G 26003 0.086737 8.3 1 0 4 1 0 Retrieve49 ABELL 2142:[OHF95] 233 15h57m47.1s +27d18m58s G >30000 0.100860 8.5 1 0 0 0 0 Retrieve50 ABELL 2142:[OHF95] 341 15h58m40.0s +27d06m21s G 27399 0.091393 8.9 1 0 0 0 0 Retrieve51 ABELL 2142:[OHF95] 240 15h58m31.6s +27d21m44s G >30000 0.100082 8.9 1 0 0 0 0 Retrieve52 ABELL 2142:[OHF95] 241 15h58m01.0s +27d21m49s G 28364 0.094612 9.0 1 0 0 0 0 Retrieve53 ABELL 2142:[OHF95] 235 15h58m43.6s +27d20m07s G 28324 0.094479 9.0 1 0 0 0 0 Retrieve54 ABELL 2142:[OHF95] 260 15h58m55.8s +27d16m41s G 28182 0.094005 9.4 1 0 0 0 0 Retrieve55 ABELL 2142:[OHF95] 264 15h57m32.9s +27d15m07s G 25805 0.086076 9.7 1 0 0 0 0 Retrieve56 ABELL 2142:[OHF95] 337 15h58m12.2s +27d03m37s G 20461 0.068250 9.9 1 0 0 0 0 Retrieve57 ABELL 2142:[OHF95] 255 15h58m56.6s +27d18m24s G 29279 0.097664 10.3 1 0 0 0 0 Retrieve58 ABELL 2142:[OHF95] 327 15h57m39.3s +27d06m58s G 28561 0.095269 10.5 1 0 0 0 0 Retrieve59 ABELL 2142:[OHF95] 326 15h57m40.3s +27d06m24s G >30000 0.111520 10.7 1 0 0 0 0 Retrieve60 ABELL 2142:[OHF95] 253 15h59m04.5s +27d16m08s G 27306 0.091083 11.1 1 0 0 0 0 Retrieve61 ABELL 2142:[OHF95] 309 15h58m49.6s +27d05m17s G 26241 0.087530 11.1 1 0 0 0 0 Retrieve62 ABELL 2142:[OHF95] 279 15h57m49.9s +27d23m01s G 27401 0.091400 11.2 1 0 0 0 0 Retrieve63 ABELL 2142:[OHF95] 277 15h57m37.5s +27d20m39s G 28339 0.094529 11.2 1 0 0 0 0 Retrieve64 ABELL 2142:[OHF95] 256 15h58m59.0s +27d19m23s G 24511 0.081760 11.2 1 0 0 0 0 Retrieve65 ABELL 2142:[OHF95] 281 15h57m56.5s +27d23m53s G 27214 0.090776 11.3 1 0 0 0 0 Retrieve66 ABELL 2142:[OHF95] 280 15h57m51.2s +27d23m33s G 29263 0.097611 11.5 1 0 0 0 0 Retrieve67 ABELL 2142:[OHF95] 275 15h57m30.2s +27d18m57s G 27585 0.092013 11.6 1 0 0 0 0 Retrieve68 ABELL 2142:[OHF95] 365 15h57m40.0s +27d22m50s G 27373 0.091306 12.3 1 0 0 0 0 Retrieve69 IRAS 15567+2731 15h58m50.5s +27d23m26s G 28237 0.094188 12.6 3 0 4 2 0 Retrieve70 ABELL 2142:[OHF95] 274 15h57m24.3s +27d18m49s G 27093 0.090372 12.7 1 0 0 0 0 Retrieve71 ABELL 2142:[OHF95] 269 15h57m19.4s +27d16m32s G 29438 0.098194 13.0 1 0 0 0 0 Retrieve72 ABELL 2142:[OHF95] 350 15h58m47.3s +27d24m29s G 28567 0.095289 13.0 1 0 0 0 0 Retrieve73 ABELL 2142:[OHF95] 248 15h59m14.9s +27d10m24s G 27189 0.090693 13.4 1 0 0 0 0 Retrieve74 ABELL 2142:[OHF95] 254 15h59m14.7s +27d17m25s G 27439 0.091526 13.6 1 0 0 0 0 Retrieve75 ABELL 2142:[OHF95] 317 15h57m42.0s +27d02m05s G 27226 0.090816 13.7 1 0 0 0 0 Retrieve76 ABELL 2142:[OHF95] 335 15h57m45.0s +27d01m22s G 29208 0.097427 14.0 1 0 0 0 0 Retrieve77 ABELL 2142:[OHF95] 282 15h57m49.7s +27d26m12s G 26655 0.088911 14.0 1 0 0 0 0 Retrieve78 ABELL 2142:[OHF95] 284 15h58m29.4s +27d27m35s G 28433 0.094842 14.4 1 0 0 0 0 Retrieve79 ABELL 2142:[OHF95] 310 15h59m12.4s +27d06m00s G 25884 0.086340 14.6 1 0 0 0 0 Retrieve80 ABELL 2142:[OHF95] 249 15h59m21.5s +27d11m49s G 27382 0.091336 14.6 1 0 0 0 0 Retrieve81 ABELL 2142:[OHF95] 320 15h57m26.5s +27d03m48s G 20745 0.069198 14.7 1 0 0 0 0 Retrieve82 PGC 056556 15h58m49.7s +27d26m40s G 25467 0.084949 15.2 2 0 0 0 1 Retrieve83 ABELL 2142:[HS79] 204 15h57m42.4s +27d00m18s G 25116 0.083778 15.2 1 0 0 0 0 Retrieve84 ABELL 2142:[OHF95] 251 15h59m24.0s +27d15m18s G 27308 0.091090 15.2 1 0 0 0 0 Retrieve85 ABELL 2142:[OHF95] 250 15h59m24.6s +27d13m01s G 27948 0.093224 15.2 1 0 0 0 0 Retrieve86 ABELL 2142:[OHF95] 304 15h58m54.6s +27d00m50s G 19322 0.064451 15.3 1 0 0 0 0 Retrieve87 KUG 1556+276 15h58m32.0s +27d28m24s G 9333 0.031131 15.3 4 0 0 2 1 Retrieve88 ABELL 2142:[OHF95] 258 15h59m18.8s +27d20m04s G 26885 0.089679 15.4 1 0 0 0 0 Retrieve89 CGCG 167-007 15h58m34.4s +26d58m30s GPair 19860 0.066246 15.5 9 0 0 2 0 Retrieve90 ABELL 2142:[OHF95] 334 15h58m43.1s +26d59m08s G 27078 0.090322 15.5 1 0 0 0 0 Retrieve91 ABELL 2142:[OHF95] 322 15h57m19.4s +27d04m18s G 20388 0.068007 15.6 1 0 0 0 0 Retrieve92 CGCG 167-007 NED01 15h58m39.0s +26d58m37s G 19839 0.066176 15.7 2 0 0 1 0 Retrieve93 ABELL 2142:[OHF95] 347 15h58m40.0s +26d58m41s G 19321 0.064448 15.7 1 0 0 0 0 Retrieve94 ABELL 2142:[OHF95] 351 15h58m55.9s +27d26m31s G 27042 0.090202 15.8 1 0 0 0 0 Retrieve95 IRAS 15556+2736 15h57m43.6s +27d27m55s G 9350 0.031188 16.1 4 0 4 2 0 Retrieve96 ABELL 2142:[OHF95] 367 15h57m28.9s +27d25m46s G 26229 0.087490 16.1 1 0 0 0 0 Retrieve97 ABELL 2142:[OHF95] 259 15h59m22.9s +27d20m49s G 27146 0.090549 16.6 1 0 0 0 0 Retrieve98 ABELL 2142:[OHF95] 328 15h57m06.6s +27d07m10s G 20277 0.067637 16.7 1 0 0 0 0 Retrieve99 ABELL 2142:[OHF95] 372 15h57m36.8s +27d27m51s G 26790 0.089362 16.8 1 0 0 0 0 Retrieve100 ABELL 2142:[OHF95] 273 15h57m03.4s +27d18m14s G 28220 0.094132 16.8 1 0 0 0 0 Retrieve101 ABELL 2142:[OHF95] 330 15h58m31.7s +26d56m33s G 25607 0.085416 17.3 1 0 0 0 0 Retrieve102 ABELL 2142:[OHF95] 287 15h57m44.6s +27d29m26s G 26298 0.087721 17.4 1 0 0 0 0 Retrieve103 [HB89] 1557+272 15h59m22.2s +27d03m40s G 19374 0.064625 17.7 17 1 3 0 1 Retrieve104 ABELL 2142:[OHF95] 366 15h57m08.9s +27d23m16s G 27985 0.093348 17.9 1 0 0 0 0 Retrieve105 ABELL 2142:[OHF95] 263 15h56m55.2s +27d12m52s G 27660 0.092264 18.0 1 0 0 0 0 Retrieve106 ABELL 2142:[OHF95] 267 15h56m53.9s +27d15m51s G >30000 0.152859 18.4 1 0 0 0 0 Retrieve107 ABELL 2142:[OHF95] 373 15h57m24.7s +27d28m19s G 29519 0.098465 18.7 1 0 0 0 0 Retrieve108 ABELL 2142:[OHF95] 292 15h58m01.1s +27d32m09s G 26880 0.089662 19.0 1 0 0 0 0 Retrieve109 PGC 056523 15h58m18.9s +27d32m42s G 9495 0.031672 19.2 2 0 0 0 1 Retrieve110 PGC 056565 15h58m56.6s +27d30m40s G 27097 0.090386 19.4 2 0 0 0 1 Retrieve111 ABELL 2142:[OHF95] 294 15h58m08.1s +27d32m59s G 27344 0.091210 19.6 1 0 0 0 0 Retrieve112 ABELL 2142:[OHF95] 270 15h56m49.0s +27d17m14s G 28589 0.095362 19.7 1 0 0 0 0 Retrieve113 ABELL 2142:[OHF95] 318 15h56m57.0s +27d03m00s G 27619 0.092127 20.5 1 0 0 0 0 Retrieve114 CGCG 167-008 15h58m34.8s +27d37m06s G 9379 0.031285 24.0 4 0 0 2 1 Retrieve115 ABELL 2142:[OHF95] 376 15h57m00.6s +27d31m04s G 24652 0.082230 24.3 1 0 0 0 0 Retrieve116 MRK 0492 15h58m43.7s +26d49m05s G 4267 0.014233 25.1 18 0 14 7 4 Retrieve HTML-TableParser-0.42/data/table2.hdr 0000644 0000407 0000036 00000000113 13076214665 015245 0 ustar dj head Snookums
x0
y0
z0
p
k
rho0
theta0
az_mis
el_mis
l
node
z_f
z_a
rho_f
rho_a
HTML-TableParser-0.42/data/table2-1.Trim.data 0000644 0000407 0000036 00000002421 13076214665 016455 0 ustar dj head h33 -1.154e-01 -2.060e-01 481.0146 -1.7797716637950735E-03 -26.0506034413416841 579.89015840093919 0.000672059134040231 0.00123484664976509 842.1920 24.9555 59.9186 902.1106 598.5083 560.6541h3 -8.365e-02 -2.345e-01 480.9282 -1.1532395834759916E-03 -16.875942397594130 466.64379784205380 0.000515063949465614 0.00138731246068735 842.1970 24.9555 59.8297 902.0267 481.6319 451.1580h4 -8.386e-02 -2.065e-01 480.8279 -8.9864417477996457E-04 -13.150318066441841 411.91935912458604 0.000513002156880169 0.00123195192376053 842.2250 24.9555 59.7154 901.9404 425.1507 398.2487h6 -1.096e-01 -2.067e-01 479.2152 -4.9625995845653374E-04 -7.2620248152618760 306.09851668776219 0.000658904663372658 0.00124699759199671 842.2000 24.9555 58.1152 900.3152 315.9310 295.9396p1 1.239e-01 2.151e-01 -426.5761 0.0 -8.9333113530131421 606.86080963697918 842.2150 24.9555 -847.6836 -5.4686 613.0284 600.6299p3 8.675e-02 2.437e-01 -436.7098 0.0 -5.7939624154424676 488.46244215611011 842.2080 24.9555 -857.8138 -15.6058 493.4321 483.4417p4 8.634e-02 2.168e-01 -440.3572 0.0 -4.5165799273846270 431.26225933154404 842.2080 24.9555 -861.4612 -19.2532 435.6501 426.8293p6 8.625e-02 2.245e-01 -445.0821 0.0 -2.4957050467401789 320.56977725634789 842.2090 24.9555 -866.1866 -23.9776 323.8316 317.2745 HTML-TableParser-0.42/data/table2.Chomp.data 0000644 0000407 0000036 00000002542 13076214665 016456 0 ustar dj head
h1 -1.154e-01 -2.060e-01 481.0146 -1.7797716637950735E-03 -26.0506034413416841 579.89015840093919
0.000672059134040231 0.00123484664976509 842.1920 24.9555 59.9186 902.1106 598.5083 560.6541h3 -8.365e-02 -2.345e-01 480.9282 -1.1532395834759916E-03 -16.875942397594130 466.64379784205380
0.000515063949465614 0.00138731246068735 842.1970 24.9555 59.8297 902.0267 481.6319 451.1580h4 -8.386e-02 -2.065e-01 480.8279 -8.9864417477996457E-04 -13.150318066441841 411.91935912458604
0.000513002156880169 0.00123195192376053 842.2250 24.9555 59.7154 901.9404 425.1507 398.2487h6 -1.096e-01 -2.067e-01 479.2152 -4.9625995845653374E-04 -7.2620248152618760 306.09851668776219
0.000658904663372658 0.00124699759199671 842.2000 24.9555 58.1152 900.3152 315.9310 295.9396p1 1.239e-01 2.151e-01 -426.5761 0.0 -8.9333113530131421 606.86080963697918
842.2150 24.9555 -847.6836 -5.4686 613.0284 600.6299p3 8.675e-02 2.437e-01 -436.7098 0.0 -5.7939624154424676 488.46244215611011
842.2080 24.9555 -857.8138 -15.6058 493.4321 483.4417p4 8.634e-02 2.168e-01 -440.3572 0.0 -4.5165799273846270 431.26225933154404
842.2080 24.9555 -861.4612 -19.2532 435.6501 426.8293p6 8.625e-02 2.245e-01 -445.0821 0.0 -2.4957050467401789 320.56977725634789
842.2090 24.9555 -866.1866 -23.9776 323.8316 317.2745 HTML-TableParser-0.42/data/screwy.html 0000644 0000407 0000036 00000001540 13075413113 015570 0 ustar dj head
screwy table
screwy table
Widget
| Snacks
| Prices
|
A
| B
| 1
| 2
| 3
|
Sn 1
| Sn 2
| 3.1
| 3.2
|
Both
| MM1
| MB1
| 11.1
| 22.2
| 1-3.1.1
| 1-3.2.1
|
A
| B
| MM2
| MB2
| 33.3
| 2-3.1.1
| 2-3.2.1
|
Diab Jerius
Last modified: Fri Dec 10 10:31:57 EST 1999
HTML-TableParser-0.42/data/table2.Default.data 0000644 0000407 0000036 00000002543 13076214665 016775 0 ustar dj head
h1 -1.154e-01 -2.060e-01 481.0146 -1.7797716637950735E-03 -26.0506034413416841 579.89015840093919
0.000672059134040231 0.00123484664976509 842.1920 24.9555 59.9186 902.1106 598.5083 560.6541h3 -8.365e-02 -2.345e-01 480.9282 -1.1532395834759916E-03 -16.875942397594130 466.64379784205380
0.000515063949465614 0.00138731246068735 842.1970 24.9555 59.8297 902.0267 481.6319 451.1580h4 -8.386e-02 -2.065e-01 480.8279 -8.9864417477996457E-04 -13.150318066441841 411.91935912458604
0.000513002156880169 0.00123195192376053 842.2250 24.9555 59.7154 901.9404 425.1507 398.2487h6 -1.096e-01 -2.067e-01 479.2152 -4.9625995845653374E-04 -7.2620248152618760 306.09851668776219
0.000658904663372658 0.00124699759199671 842.2000 24.9555 58.1152 900.3152 315.9310 295.9396p1 1.239e-01 2.151e-01 -426.5761 0.0 -8.9333113530131421 606.86080963697918
842.2150 24.9555 -847.6836 -5.4686 613.0284 600.6299p3 8.675e-02 2.437e-01 -436.7098 0.0 -5.7939624154424676 488.46244215611011
842.2080 24.9555 -857.8138 -15.6058 493.4321 483.4417p4 8.634e-02 2.168e-01 -440.3572 0.0 -4.5165799273846270 431.26225933154404
842.2080 24.9555 -861.4612 -19.2532 435.6501 426.8293p6 8.625e-02 2.245e-01 -445.0821 0.0 -2.4957050467401789 320.56977725634789
842.2090 24.9555 -866.1866 -23.9776 323.8316 317.2745 HTML-TableParser-0.42/data/table.Decode.data 0000644 0000407 0000036 00000002540 13076214665 016507 0 ustar dj head h1 -1.154e-01 -2.060e-01 481.0146 -1.7797716637950735E-03 -26.0506034413416841 579.89015840093919
0.000672059134040231 0.00123484664976509 842.1920 24.9555 59.9186 902.1106 598.5083 560.6541h3 -8.365e-02 -2.345e-01 480.9282 -1.1532395834759916E-03 -16.875942397594130 466.64379784205380
0.000515063949465614 0.00138731246068735 842.1970 24.9555 59.8297 902.0267 481.6319 451.1580h4 -8.386e-02 -2.065e-01 480.8279 -8.9864417477996457E-04 -13.150318066441841 411.91935912458604
0.000513002156880169 0.00123195192376053 842.2250 24.9555 59.7154 901.9404 425.1507 398.2487h6 -1.096e-01 -2.067e-01 479.2152 -4.9625995845653374E-04 -7.2620248152618760 306.09851668776219
0.000658904663372658 0.00124699759199671 842.2000 24.9555 58.1152 900.3152 315.9310 295.9396p1 1.239e-01 2.151e-01 -426.5761 0.0 -8.9333113530131421 606.86080963697918
842.2150 24.9555 -847.6836 -5.4686 613.0284 600.6299p3 8.675e-02 2.437e-01 -436.7098 0.0 -5.7939624154424676 488.46244215611011
842.2080 24.9555 -857.8138 -15.6058 493.4321 483.4417p4 8.634e-02 2.168e-01 -440.3572 0.0 -4.5165799273846270 431.26225933154404
842.2080 24.9555 -861.4612 -19.2532 435.6501 426.8293p6 8.625e-02 2.245e-01 -445.0821 0.0 -2.4957050467401789 320.56977725634789
842.2090 24.9555 -866.1866 -23.9776 323.8316 317.2745 HTML-TableParser-0.42/data/table2.Decode.data 0000644 0000407 0000036 00000002543 13076214665 016574 0 ustar dj head
h1 -1.154e-01 -2.060e-01 481.0146 -1.7797716637950735E-03 -26.0506034413416841 579.89015840093919
0.000672059134040231 0.00123484664976509 842.1920 24.9555 59.9186 902.1106 598.5083 560.6541h3 -8.365e-02 -2.345e-01 480.9282 -1.1532395834759916E-03 -16.875942397594130 466.64379784205380
0.000515063949465614 0.00138731246068735 842.1970 24.9555 59.8297 902.0267 481.6319 451.1580h4 -8.386e-02 -2.065e-01 480.8279 -8.9864417477996457E-04 -13.150318066441841 411.91935912458604
0.000513002156880169 0.00123195192376053 842.2250 24.9555 59.7154 901.9404 425.1507 398.2487h6 -1.096e-01 -2.067e-01 479.2152 -4.9625995845653374E-04 -7.2620248152618760 306.09851668776219
0.000658904663372658 0.00124699759199671 842.2000 24.9555 58.1152 900.3152 315.9310 295.9396p1 1.239e-01 2.151e-01 -426.5761 0.0 -8.9333113530131421 606.86080963697918
842.2150 24.9555 -847.6836 -5.4686 613.0284 600.6299p3 8.675e-02 2.437e-01 -436.7098 0.0 -5.7939624154424676 488.46244215611011
842.2080 24.9555 -857.8138 -15.6058 493.4321 483.4417p4 8.634e-02 2.168e-01 -440.3572 0.0 -4.5165799273846270 431.26225933154404
842.2080 24.9555 -861.4612 -19.2532 435.6501 426.8293p6 8.625e-02 2.245e-01 -445.0821 0.0 -2.4957050467401789 320.56977725634789
842.2090 24.9555 -866.1866 -23.9776 323.8316 317.2745 HTML-TableParser-0.42/data/table2-1.Default.data 0000644 0000407 0000036 00000002541 13076214665 017131 0 ustar dj head h33 -1.154e-01 -2.060e-01 481.0146 -1.7797716637950735E-03 -26.0506034413416841 579.89015840093919
0.000672059134040231 0.00123484664976509 842.1920 24.9555 59.9186 902.1106 598.5083 560.6541h3 -8.365e-02 -2.345e-01 480.9282 -1.1532395834759916E-03 -16.875942397594130 466.64379784205380
0.000515063949465614 0.00138731246068735 842.1970 24.9555 59.8297 902.0267 481.6319 451.1580h4 -8.386e-02 -2.065e-01 480.8279 -8.9864417477996457E-04 -13.150318066441841 411.91935912458604
0.000513002156880169 0.00123195192376053 842.2250 24.9555 59.7154 901.9404 425.1507 398.2487h6 -1.096e-01 -2.067e-01 479.2152 -4.9625995845653374E-04 -7.2620248152618760 306.09851668776219
0.000658904663372658 0.00124699759199671 842.2000 24.9555 58.1152 900.3152 315.9310 295.9396p1 1.239e-01 2.151e-01 -426.5761 0.0 -8.9333113530131421 606.86080963697918
842.2150 24.9555 -847.6836 -5.4686 613.0284 600.6299p3 8.675e-02 2.437e-01 -436.7098 0.0 -5.7939624154424676 488.46244215611011
842.2080 24.9555 -857.8138 -15.6058 493.4321 483.4417p4 8.634e-02 2.168e-01 -440.3572 0.0 -4.5165799273846270 431.26225933154404
842.2080 24.9555 -861.4612 -19.2532 435.6501 426.8293p6 8.625e-02 2.245e-01 -445.0821 0.0 -2.4957050467401789 320.56977725634789
842.2090 24.9555 -866.1866 -23.9776 323.8316 317.2745 HTML-TableParser-0.42/data/table.Trim.data 0000644 0000407 0000036 00000002420 13076214665 016234 0 ustar dj head h1 -1.154e-01 -2.060e-01 481.0146 -1.7797716637950735E-03 -26.0506034413416841 579.89015840093919 0.000672059134040231 0.00123484664976509 842.1920 24.9555 59.9186 902.1106 598.5083 560.6541h3 -8.365e-02 -2.345e-01 480.9282 -1.1532395834759916E-03 -16.875942397594130 466.64379784205380 0.000515063949465614 0.00138731246068735 842.1970 24.9555 59.8297 902.0267 481.6319 451.1580h4 -8.386e-02 -2.065e-01 480.8279 -8.9864417477996457E-04 -13.150318066441841 411.91935912458604 0.000513002156880169 0.00123195192376053 842.2250 24.9555 59.7154 901.9404 425.1507 398.2487h6 -1.096e-01 -2.067e-01 479.2152 -4.9625995845653374E-04 -7.2620248152618760 306.09851668776219 0.000658904663372658 0.00124699759199671 842.2000 24.9555 58.1152 900.3152 315.9310 295.9396p1 1.239e-01 2.151e-01 -426.5761 0.0 -8.9333113530131421 606.86080963697918 842.2150 24.9555 -847.6836 -5.4686 613.0284 600.6299p3 8.675e-02 2.437e-01 -436.7098 0.0 -5.7939624154424676 488.46244215611011 842.2080 24.9555 -857.8138 -15.6058 493.4321 483.4417p4 8.634e-02 2.168e-01 -440.3572 0.0 -4.5165799273846270 431.26225933154404 842.2080 24.9555 -861.4612 -19.2532 435.6501 426.8293p6 8.625e-02 2.245e-01 -445.0821 0.0 -2.4957050467401789 320.56977725634789 842.2090 24.9555 -866.1866 -23.9776 323.8316 317.2745 HTML-TableParser-0.42/data/table2-1.hdr 0000644 0000407 0000036 00000000111 13076214665 015401 0 ustar dj head mirror
x0
y0
z0
p
k
rho0
theta0
az_mis
el_mis
l
node
z_f
z_a
rho_f
rho_a
HTML-TableParser-0.42/data/table.hdr 0000644 0000407 0000036 00000000111 13076214665 015161 0 ustar dj head mirror
x0
y0
z0
p
k
rho0
theta0
az_mis
el_mis
l
node
z_f
z_a
rho_f
rho_a
HTML-TableParser-0.42/data/ned.Decode.data 0000644 0000407 0000036 00000044014 13076214665 016170 0 ustar dj head 1
PGC 056527
15h58m20.0s
+27d14m02s
G
27092
0.090369
1.0
9
0
0
0
2
Retrieve
2
ABELL 2142:[HCW85] 2
15h58m18.8s
+27d14m21s
G
24247
0.080879
1.1
1
0
0
0
0
Retrieve
3
PGC 056515
15h58m13.3s
+27d14m55s
G
28936
0.096520
1.6
3
0
0
0
1
Retrieve
4
ABELL 2142:[OHF95] 216
15h58m23.1s
+27d14m04s
G
27658
0.092257
1.7
1
0
0
0
0
Retrieve
5
ABELL 2142:[OHF95] 244
15h58m24.7s
+27d13m47s
G
26470
0.088294
1.9
1
0
0
0
0
Retrieve
6
ABELL 2142:[OHF95] 246
15h58m07.6s
+27d14m45s
G
26817
0.089452
2.3
1
0
0
0
0
Retrieve
7
ABELL 2142:[OHF95] 218
15h58m25.5s
+27d14m46s
G
27154
0.090576
2.5
1
0
0
0
0
Retrieve
8
ABELL 2142:[HS79] 103
15h58m17.5s
+27d16m10s
G
25161
0.083928
2.7
1
0
0
0
0
Retrieve
9
ABELL 2142:[OHF95] 214
15h58m28.4s
+27d13m48s
G
27403
0.091406
2.7
1
0
0
0
0
Retrieve
10
ABELL 2142:[OHF95] 209
15h58m24.6s
+27d11m26s
G
27350
0.091230
2.8
1
0
0
0
0
Retrieve
11
ABELL 2142:[OHF95] 208
15h58m08.0s
+27d11m13s
G
>30000
0.102341
2.9
1
0
0
0
0
Retrieve
12
PGC 056516
15h58m14.0s
+27d16m22s
G
28644
0.095546
2.9
16
0
4
3
1
Retrieve
13
ABELL 2142:[OHF95] 211
15h58m04.8s
+27d11m50s
G
24764
0.082604
3.0
1
0
0
0
0
Retrieve
14
ABELL 2142:[OHF95] 228
15h58m13.8s
+27d16m46s
G
27029
0.090159
3.3
1
0
0
0
0
Retrieve
15
ABELL 2142:[OHF95] 207
15h58m09.0s
+27d10m24s
G
26209
0.087424
3.5
1
0
0
0
0
Retrieve
16
ABELL 2142:[OHF95] 230
15h58m12.8s
+27d17m00s
G
25793
0.086036
3.6
1
0
0
0
0
Retrieve
17
ABELL 2142:[OHF95] 221
15h58m01.3s
+27d15m03s
G
25561
0.085262
3.6
1
0
0
0
0
Retrieve
18
ABELL 2142:[OHF95] 227
15h58m06.5s
+27d16m28s
G
26107
0.087083
3.7
1
0
0
0
0
Retrieve
19
ABELL 2142:[OHF95] 205
15h58m20.2s
+27d09m49s
G
25289
0.084355
3.8
1
0
0
0
0
Retrieve
20
ABELL 2142:[OHF95] 204
15h58m17.9s
+27d09m38s
G
20093
0.067023
3.9
1
0
0
0
0
Retrieve
21
ABELL 2142:[OHF95] 213
15h57m56.2s
+27d13m27s
G
26695
0.089045
4.4
1
0
0
0
0
Retrieve
22
ABELL 2142:[OHF95] 222
15h58m33.9s
+27d15m38s
G
25251
0.084228
4.5
1
0
0
0
0
Retrieve
23
[HB91] 1556+274
15h58m29.2s
+27d17m08s
G
26981
0.090000
4.7
3
0
0
0
0
Retrieve
24
ABELL 2142:[OHF95] 203
15h58m19.2s
+27d08m49s
G
>30000
0.147802
4.7
1
0
0
0
0
Retrieve
25
ABELL 2142:[OHF95] 206
15h57m58.6s
+27d10m44s
G
26779
0.089325
4.8
1
0
0
0
0
Retrieve
26
ABELL 2142:[OHF95] 212
15h57m54.9s
+27d11m52s
G
25246
0.084211
5.0
1
0
0
0
0
Retrieve
27
ABELL 2142:[OHF95] 243
15h58m39.1s
+27d14m02s
G
27034
0.090176
5.1
1
0
0
0
0
Retrieve
28
ABELL 2142:[OHF95] 242
15h58m39.6s
+27d13m53s
G
26930
0.089829
5.2
1
0
0
0
0
Retrieve
29
ABELL 2142:[OHF95] 224
15h58m39.3s
+27d16m19s
G
26769
0.089292
5.9
1
0
0
0
0
Retrieve
30
ABELL 2142:[OHF95] 220
15h58m41.5s
+27d15m11s
G
26486
0.088348
5.9
1
0
0
0
0
Retrieve
31
ABELL 2142:[OHF95] 225
15h57m51.7s
+27d16m06s
G
27356
0.091250
6.0
1
0
0
0
0
Retrieve
32
ABELL 2142:[OHF95] 234
15h58m26.7s
+27d19m13s
G
27760
0.092597
6.2
1
0
0
0
0
Retrieve
33
PGC 056530
15h58m21.0s
+27d20m03s
G
26178
0.087320
6.7
2
0
0
0
1
Retrieve
34
ABELL 2142:[OHF95] 210
15h58m45.4s
+27d11m53s
G
26182
0.087334
6.7
1
0
0
0
0
Retrieve
35
ABELL 2142:[OHF95] 202
15h58m37.2s
+27d08m18s
G
27117
0.090452
7.0
1
0
0
0
0
Retrieve
36
ABELL 2142:[OHF95] 343
15h58m32.7s
+27d07m26s
G
>30000
0.106904
7.1
1
0
0
0
0
Retrieve
37
ABELL 2142:[OHF95] 342
15h58m29.6s
+27d06m56s
G
25466
0.084945
7.2
1
0
0
0
0
Retrieve
38
ABELL 2142:[OHF95] 252
15h58m47.0s
+27d15m53s
G
24443
0.081533
7.3
1
0
0
0
0
Retrieve
39
ABELL 2142:[OHF95] 215
15h57m43.2s
+27d13m38s
G
25977
0.086650
7.3
1
0
0
0
0
Retrieve
40
ABELL 2142:[OHF95] 344
15h57m55.7s
+27d07m41s
G
29091
0.097037
7.4
1
0
0
0
0
Retrieve
41
ABELL 2142:[OHF95] 238
15h58m16.8s
+27d20m55s
G
27102
0.090402
7.4
1
0
0
0
0
Retrieve
42
ABELL 2142:[OHF95] 231
15h57m49.8s
+27d18m14s
G
28075
0.093648
7.5
1
0
0
0
0
Retrieve
43
ABELL 2142:[OHF95] 229
15h57m43.7s
+27d16m38s
G
26615
0.088778
7.9
1
0
0
0
0
Retrieve
44
ABELL 2142:[OHF95] 338
15h58m21.1s
+27d05m27s
G
25406
0.084745
8.1
1
0
0
0
0
Retrieve
45
ABELL 2142:[OHF95] 232
15h58m43.7s
+27d19m00s
G
19311
0.064414
8.2
1
0
0
0
0
Retrieve
46
ABELL 2142:[OHF95] 340
15h58m05.1s
+27d05m32s
G
27222
0.090803
8.3
1
0
0
0
0
Retrieve
47
ABELL 2142:[OHF95] 266
15h57m40.4s
+27d15m57s
G
26628
0.088821
8.3
1
0
0
0
0
Retrieve
48
IRAS F15566+2716
15h58m42.9s
+27d07m38s
G
26003
0.086737
8.3
1
0
4
1
0
Retrieve
49
ABELL 2142:[OHF95] 233
15h57m47.1s
+27d18m58s
G
>30000
0.100860
8.5
1
0
0
0
0
Retrieve
50
ABELL 2142:[OHF95] 341
15h58m40.0s
+27d06m21s
G
27399
0.091393
8.9
1
0
0
0
0
Retrieve
51
ABELL 2142:[OHF95] 240
15h58m31.6s
+27d21m44s
G
>30000
0.100082
8.9
1
0
0
0
0
Retrieve
52
ABELL 2142:[OHF95] 241
15h58m01.0s
+27d21m49s
G
28364
0.094612
9.0
1
0
0
0
0
Retrieve
53
ABELL 2142:[OHF95] 235
15h58m43.6s
+27d20m07s
G
28324
0.094479
9.0
1
0
0
0
0
Retrieve
54
ABELL 2142:[OHF95] 260
15h58m55.8s
+27d16m41s
G
28182
0.094005
9.4
1
0
0
0
0
Retrieve
55
ABELL 2142:[OHF95] 264
15h57m32.9s
+27d15m07s
G
25805
0.086076
9.7
1
0
0
0
0
Retrieve
56
ABELL 2142:[OHF95] 337
15h58m12.2s
+27d03m37s
G
20461
0.068250
9.9
1
0
0
0
0
Retrieve
57
ABELL 2142:[OHF95] 255
15h58m56.6s
+27d18m24s
G
29279
0.097664
10.3
1
0
0
0
0
Retrieve
58
ABELL 2142:[OHF95] 327
15h57m39.3s
+27d06m58s
G
28561
0.095269
10.5
1
0
0
0
0
Retrieve
59
ABELL 2142:[OHF95] 326
15h57m40.3s
+27d06m24s
G
>30000
0.111520
10.7
1
0
0
0
0
Retrieve
60
ABELL 2142:[OHF95] 253
15h59m04.5s
+27d16m08s
G
27306
0.091083
11.1
1
0
0
0
0
Retrieve
61
ABELL 2142:[OHF95] 309
15h58m49.6s
+27d05m17s
G
26241
0.087530
11.1
1
0
0
0
0
Retrieve
62
ABELL 2142:[OHF95] 279
15h57m49.9s
+27d23m01s
G
27401
0.091400
11.2
1
0
0
0
0
Retrieve
63
ABELL 2142:[OHF95] 277
15h57m37.5s
+27d20m39s
G
28339
0.094529
11.2
1
0
0
0
0
Retrieve
64
ABELL 2142:[OHF95] 256
15h58m59.0s
+27d19m23s
G
24511
0.081760
11.2
1
0
0
0
0
Retrieve
65
ABELL 2142:[OHF95] 281
15h57m56.5s
+27d23m53s
G
27214
0.090776
11.3
1
0
0
0
0
Retrieve
66
ABELL 2142:[OHF95] 280
15h57m51.2s
+27d23m33s
G
29263
0.097611
11.5
1
0
0
0
0
Retrieve
67
ABELL 2142:[OHF95] 275
15h57m30.2s
+27d18m57s
G
27585
0.092013
11.6
1
0
0
0
0
Retrieve
68
ABELL 2142:[OHF95] 365
15h57m40.0s
+27d22m50s
G
27373
0.091306
12.3
1
0
0
0
0
Retrieve
69
IRAS 15567+2731
15h58m50.5s
+27d23m26s
G
28237
0.094188
12.6
3
0
4
2
0
Retrieve
70
ABELL 2142:[OHF95] 274
15h57m24.3s
+27d18m49s
G
27093
0.090372
12.7
1
0
0
0
0
Retrieve
71
ABELL 2142:[OHF95] 269
15h57m19.4s
+27d16m32s
G
29438
0.098194
13.0
1
0
0
0
0
Retrieve
72
ABELL 2142:[OHF95] 350
15h58m47.3s
+27d24m29s
G
28567
0.095289
13.0
1
0
0
0
0
Retrieve
73
ABELL 2142:[OHF95] 248
15h59m14.9s
+27d10m24s
G
27189
0.090693
13.4
1
0
0
0
0
Retrieve
74
ABELL 2142:[OHF95] 254
15h59m14.7s
+27d17m25s
G
27439
0.091526
13.6
1
0
0
0
0
Retrieve
75
ABELL 2142:[OHF95] 317
15h57m42.0s
+27d02m05s
G
27226
0.090816
13.7
1
0
0
0
0
Retrieve
76
ABELL 2142:[OHF95] 335
15h57m45.0s
+27d01m22s
G
29208
0.097427
14.0
1
0
0
0
0
Retrieve
77
ABELL 2142:[OHF95] 282
15h57m49.7s
+27d26m12s
G
26655
0.088911
14.0
1
0
0
0
0
Retrieve
78
ABELL 2142:[OHF95] 284
15h58m29.4s
+27d27m35s
G
28433
0.094842
14.4
1
0
0
0
0
Retrieve
79
ABELL 2142:[OHF95] 310
15h59m12.4s
+27d06m00s
G
25884
0.086340
14.6
1
0
0
0
0
Retrieve
80
ABELL 2142:[OHF95] 249
15h59m21.5s
+27d11m49s
G
27382
0.091336
14.6
1
0
0
0
0
Retrieve
81
ABELL 2142:[OHF95] 320
15h57m26.5s
+27d03m48s
G
20745
0.069198
14.7
1
0
0
0
0
Retrieve
82
PGC 056556
15h58m49.7s
+27d26m40s
G
25467
0.084949
15.2
2
0
0
0
1
Retrieve
83
ABELL 2142:[HS79] 204
15h57m42.4s
+27d00m18s
G
25116
0.083778
15.2
1
0
0
0
0
Retrieve
84
ABELL 2142:[OHF95] 251
15h59m24.0s
+27d15m18s
G
27308
0.091090
15.2
1
0
0
0
0
Retrieve
85
ABELL 2142:[OHF95] 250
15h59m24.6s
+27d13m01s
G
27948
0.093224
15.2
1
0
0
0
0
Retrieve
86
ABELL 2142:[OHF95] 304
15h58m54.6s
+27d00m50s
G
19322
0.064451
15.3
1
0
0
0
0
Retrieve
87
KUG 1556+276
15h58m32.0s
+27d28m24s
G
9333
0.031131
15.3
4
0
0
2
1
Retrieve
88
ABELL 2142:[OHF95] 258
15h59m18.8s
+27d20m04s
G
26885
0.089679
15.4
1
0
0
0
0
Retrieve
89
CGCG 167-007
15h58m34.4s
+26d58m30s
GPair
19860
0.066246
15.5
9
0
0
2
0
Retrieve
90
ABELL 2142:[OHF95] 334
15h58m43.1s
+26d59m08s
G
27078
0.090322
15.5
1
0
0
0
0
Retrieve
91
ABELL 2142:[OHF95] 322
15h57m19.4s
+27d04m18s
G
20388
0.068007
15.6
1
0
0
0
0
Retrieve
92
CGCG 167-007 NED01
15h58m39.0s
+26d58m37s
G
19839
0.066176
15.7
2
0
0
1
0
Retrieve
93
ABELL 2142:[OHF95] 347
15h58m40.0s
+26d58m41s
G
19321
0.064448
15.7
1
0
0
0
0
Retrieve
94
ABELL 2142:[OHF95] 351
15h58m55.9s
+27d26m31s
G
27042
0.090202
15.8
1
0
0
0
0
Retrieve
95
IRAS 15556+2736
15h57m43.6s
+27d27m55s
G
9350
0.031188
16.1
4
0
4
2
0
Retrieve
96
ABELL 2142:[OHF95] 367
15h57m28.9s
+27d25m46s
G
26229
0.087490
16.1
1
0
0
0
0
Retrieve
97
ABELL 2142:[OHF95] 259
15h59m22.9s
+27d20m49s
G
27146
0.090549
16.6
1
0
0
0
0
Retrieve
98
ABELL 2142:[OHF95] 328
15h57m06.6s
+27d07m10s
G
20277
0.067637
16.7
1
0
0
0
0
Retrieve
99
ABELL 2142:[OHF95] 372
15h57m36.8s
+27d27m51s
G
26790
0.089362
16.8
1
0
0
0
0
Retrieve
100
ABELL 2142:[OHF95] 273
15h57m03.4s
+27d18m14s
G
28220
0.094132
16.8
1
0
0
0
0
Retrieve
101
ABELL 2142:[OHF95] 330
15h58m31.7s
+26d56m33s
G
25607
0.085416
17.3
1
0
0
0
0
Retrieve
102
ABELL 2142:[OHF95] 287
15h57m44.6s
+27d29m26s
G
26298
0.087721
17.4
1
0
0
0
0
Retrieve
103
[HB89] 1557+272
15h59m22.2s
+27d03m40s
G
19374
0.064625
17.7
17
1
3
0
1
Retrieve
104
ABELL 2142:[OHF95] 366
15h57m08.9s
+27d23m16s
G
27985
0.093348
17.9
1
0
0
0
0
Retrieve
105
ABELL 2142:[OHF95] 263
15h56m55.2s
+27d12m52s
G
27660
0.092264
18.0
1
0
0
0
0
Retrieve
106
ABELL 2142:[OHF95] 267
15h56m53.9s
+27d15m51s
G
>30000
0.152859
18.4
1
0
0
0
0
Retrieve
107
ABELL 2142:[OHF95] 373
15h57m24.7s
+27d28m19s
G
29519
0.098465
18.7
1
0
0
0
0
Retrieve
108
ABELL 2142:[OHF95] 292
15h58m01.1s
+27d32m09s
G
26880
0.089662
19.0
1
0
0
0
0
Retrieve
109
PGC 056523
15h58m18.9s
+27d32m42s
G
9495
0.031672
19.2
2
0
0
0
1
Retrieve
110
PGC 056565
15h58m56.6s
+27d30m40s
G
27097
0.090386
19.4
2
0
0
0
1
Retrieve
111
ABELL 2142:[OHF95] 294
15h58m08.1s
+27d32m59s
G
27344
0.091210
19.6
1
0
0
0
0
Retrieve
112
ABELL 2142:[OHF95] 270
15h56m49.0s
+27d17m14s
G
28589
0.095362
19.7
1
0
0
0
0
Retrieve
113
ABELL 2142:[OHF95] 318
15h56m57.0s
+27d03m00s
G
27619
0.092127
20.5
1
0
0
0
0
Retrieve
114
CGCG 167-008
15h58m34.8s
+27d37m06s
G
9379
0.031285
24.0
4
0
0
2
1
Retrieve
115
ABELL 2142:[OHF95] 376
15h57m00.6s
+27d31m04s
G
24652
0.082230
24.3
1
0
0
0
0
Retrieve
116
MRK 0492
15h58m43.7s
+26d49m05s
G
4267
0.014233
25.1
18
0
14
7
4
Retrieve
HTML-TableParser-0.42/data/table.html 0000644 0000407 0000036 00000007274 13075413113 015355 0 ustar dj head
mirror |
x0 |
y0 |
z0 |
p |
k |
rho0 |
theta0 |
az_mis |
el_mis |
l |
node |
z_f |
z_a |
rho_f |
rho_a |
h1 |
-1.154e-01 |
-2.060e-01 |
481.0146 |
-1.7797716637950735E-03 |
-26.0506034413416841 |
579.89015840093919 |
|
0.000672059134040231 |
0.00123484664976509 |
842.1920 |
24.9555 |
59.9186 |
902.1106 |
598.5083 |
560.6541 |
h3 |
-8.365e-02 |
-2.345e-01 |
480.9282 |
-1.1532395834759916E-03 |
-16.875942397594130 |
466.64379784205380 |
|
0.000515063949465614 |
0.00138731246068735 |
842.1970 |
24.9555 |
59.8297 |
902.0267 |
481.6319 |
451.1580 |
h4 |
-8.386e-02 |
-2.065e-01 |
480.8279 |
-8.9864417477996457E-04 |
-13.150318066441841 |
411.91935912458604 |
|
0.000513002156880169 |
0.00123195192376053 |
842.2250 |
24.9555 |
59.7154 |
901.9404 |
425.1507 |
398.2487 |
h6 |
-1.096e-01 |
-2.067e-01 |
479.2152 |
-4.9625995845653374E-04 |
-7.2620248152618760 |
306.09851668776219 |
|
0.000658904663372658 |
0.00124699759199671 |
842.2000 |
24.9555 |
58.1152 |
900.3152 |
315.9310 |
295.9396 |
p1 |
1.239e-01 |
2.151e-01 |
-426.5761 |
0.0 |
-8.9333113530131421 |
606.86080963697918 |
|
|
|
842.2150 |
24.9555 |
-847.6836 |
-5.4686 |
613.0284 |
600.6299 |
p3 |
8.675e-02 |
2.437e-01 |
-436.7098 |
0.0 |
-5.7939624154424676 |
488.46244215611011 |
|
|
|
842.2080 |
24.9555 |
-857.8138 |
-15.6058 |
493.4321 |
483.4417 |
p4 |
8.634e-02 |
2.168e-01 |
-440.3572 |
0.0 |
-4.5165799273846270 |
431.26225933154404 |
|
|
|
842.2080 |
24.9555 |
-861.4612 |
-19.2532 |
435.6501 |
426.8293 |
p6 |
8.625e-02 |
2.245e-01 |
-445.0821 |
0.0 |
-2.4957050467401789 |
320.56977725634789 |
|
|
|
842.2090 |
24.9555 |
-866.1866 |
-23.9776 |
323.8316 |
317.2745 |
HTML-TableParser-0.42/data/ned.Default.data 0000644 0000407 0000036 00000044014 13076214665 016371 0 ustar dj head 1
PGC 056527
15h58m20.0s
+27d14m02s
G
27092
0.090369
1.0
9
0
0
0
2
Retrieve
2
ABELL 2142:[HCW85] 2
15h58m18.8s
+27d14m21s
G
24247
0.080879
1.1
1
0
0
0
0
Retrieve
3
PGC 056515
15h58m13.3s
+27d14m55s
G
28936
0.096520
1.6
3
0
0
0
1
Retrieve
4
ABELL 2142:[OHF95] 216
15h58m23.1s
+27d14m04s
G
27658
0.092257
1.7
1
0
0
0
0
Retrieve
5
ABELL 2142:[OHF95] 244
15h58m24.7s
+27d13m47s
G
26470
0.088294
1.9
1
0
0
0
0
Retrieve
6
ABELL 2142:[OHF95] 246
15h58m07.6s
+27d14m45s
G
26817
0.089452
2.3
1
0
0
0
0
Retrieve
7
ABELL 2142:[OHF95] 218
15h58m25.5s
+27d14m46s
G
27154
0.090576
2.5
1
0
0
0
0
Retrieve
8
ABELL 2142:[HS79] 103
15h58m17.5s
+27d16m10s
G
25161
0.083928
2.7
1
0
0
0
0
Retrieve
9
ABELL 2142:[OHF95] 214
15h58m28.4s
+27d13m48s
G
27403
0.091406
2.7
1
0
0
0
0
Retrieve
10
ABELL 2142:[OHF95] 209
15h58m24.6s
+27d11m26s
G
27350
0.091230
2.8
1
0
0
0
0
Retrieve
11
ABELL 2142:[OHF95] 208
15h58m08.0s
+27d11m13s
G
>30000
0.102341
2.9
1
0
0
0
0
Retrieve
12
PGC 056516
15h58m14.0s
+27d16m22s
G
28644
0.095546
2.9
16
0
4
3
1
Retrieve
13
ABELL 2142:[OHF95] 211
15h58m04.8s
+27d11m50s
G
24764
0.082604
3.0
1
0
0
0
0
Retrieve
14
ABELL 2142:[OHF95] 228
15h58m13.8s
+27d16m46s
G
27029
0.090159
3.3
1
0
0
0
0
Retrieve
15
ABELL 2142:[OHF95] 207
15h58m09.0s
+27d10m24s
G
26209
0.087424
3.5
1
0
0
0
0
Retrieve
16
ABELL 2142:[OHF95] 230
15h58m12.8s
+27d17m00s
G
25793
0.086036
3.6
1
0
0
0
0
Retrieve
17
ABELL 2142:[OHF95] 221
15h58m01.3s
+27d15m03s
G
25561
0.085262
3.6
1
0
0
0
0
Retrieve
18
ABELL 2142:[OHF95] 227
15h58m06.5s
+27d16m28s
G
26107
0.087083
3.7
1
0
0
0
0
Retrieve
19
ABELL 2142:[OHF95] 205
15h58m20.2s
+27d09m49s
G
25289
0.084355
3.8
1
0
0
0
0
Retrieve
20
ABELL 2142:[OHF95] 204
15h58m17.9s
+27d09m38s
G
20093
0.067023
3.9
1
0
0
0
0
Retrieve
21
ABELL 2142:[OHF95] 213
15h57m56.2s
+27d13m27s
G
26695
0.089045
4.4
1
0
0
0
0
Retrieve
22
ABELL 2142:[OHF95] 222
15h58m33.9s
+27d15m38s
G
25251
0.084228
4.5
1
0
0
0
0
Retrieve
23
[HB91] 1556+274
15h58m29.2s
+27d17m08s
G
26981
0.090000
4.7
3
0
0
0
0
Retrieve
24
ABELL 2142:[OHF95] 203
15h58m19.2s
+27d08m49s
G
>30000
0.147802
4.7
1
0
0
0
0
Retrieve
25
ABELL 2142:[OHF95] 206
15h57m58.6s
+27d10m44s
G
26779
0.089325
4.8
1
0
0
0
0
Retrieve
26
ABELL 2142:[OHF95] 212
15h57m54.9s
+27d11m52s
G
25246
0.084211
5.0
1
0
0
0
0
Retrieve
27
ABELL 2142:[OHF95] 243
15h58m39.1s
+27d14m02s
G
27034
0.090176
5.1
1
0
0
0
0
Retrieve
28
ABELL 2142:[OHF95] 242
15h58m39.6s
+27d13m53s
G
26930
0.089829
5.2
1
0
0
0
0
Retrieve
29
ABELL 2142:[OHF95] 224
15h58m39.3s
+27d16m19s
G
26769
0.089292
5.9
1
0
0
0
0
Retrieve
30
ABELL 2142:[OHF95] 220
15h58m41.5s
+27d15m11s
G
26486
0.088348
5.9
1
0
0
0
0
Retrieve
31
ABELL 2142:[OHF95] 225
15h57m51.7s
+27d16m06s
G
27356
0.091250
6.0
1
0
0
0
0
Retrieve
32
ABELL 2142:[OHF95] 234
15h58m26.7s
+27d19m13s
G
27760
0.092597
6.2
1
0
0
0
0
Retrieve
33
PGC 056530
15h58m21.0s
+27d20m03s
G
26178
0.087320
6.7
2
0
0
0
1
Retrieve
34
ABELL 2142:[OHF95] 210
15h58m45.4s
+27d11m53s
G
26182
0.087334
6.7
1
0
0
0
0
Retrieve
35
ABELL 2142:[OHF95] 202
15h58m37.2s
+27d08m18s
G
27117
0.090452
7.0
1
0
0
0
0
Retrieve
36
ABELL 2142:[OHF95] 343
15h58m32.7s
+27d07m26s
G
>30000
0.106904
7.1
1
0
0
0
0
Retrieve
37
ABELL 2142:[OHF95] 342
15h58m29.6s
+27d06m56s
G
25466
0.084945
7.2
1
0
0
0
0
Retrieve
38
ABELL 2142:[OHF95] 252
15h58m47.0s
+27d15m53s
G
24443
0.081533
7.3
1
0
0
0
0
Retrieve
39
ABELL 2142:[OHF95] 215
15h57m43.2s
+27d13m38s
G
25977
0.086650
7.3
1
0
0
0
0
Retrieve
40
ABELL 2142:[OHF95] 344
15h57m55.7s
+27d07m41s
G
29091
0.097037
7.4
1
0
0
0
0
Retrieve
41
ABELL 2142:[OHF95] 238
15h58m16.8s
+27d20m55s
G
27102
0.090402
7.4
1
0
0
0
0
Retrieve
42
ABELL 2142:[OHF95] 231
15h57m49.8s
+27d18m14s
G
28075
0.093648
7.5
1
0
0
0
0
Retrieve
43
ABELL 2142:[OHF95] 229
15h57m43.7s
+27d16m38s
G
26615
0.088778
7.9
1
0
0
0
0
Retrieve
44
ABELL 2142:[OHF95] 338
15h58m21.1s
+27d05m27s
G
25406
0.084745
8.1
1
0
0
0
0
Retrieve
45
ABELL 2142:[OHF95] 232
15h58m43.7s
+27d19m00s
G
19311
0.064414
8.2
1
0
0
0
0
Retrieve
46
ABELL 2142:[OHF95] 340
15h58m05.1s
+27d05m32s
G
27222
0.090803
8.3
1
0
0
0
0
Retrieve
47
ABELL 2142:[OHF95] 266
15h57m40.4s
+27d15m57s
G
26628
0.088821
8.3
1
0
0
0
0
Retrieve
48
IRAS F15566+2716
15h58m42.9s
+27d07m38s
G
26003
0.086737
8.3
1
0
4
1
0
Retrieve
49
ABELL 2142:[OHF95] 233
15h57m47.1s
+27d18m58s
G
>30000
0.100860
8.5
1
0
0
0
0
Retrieve
50
ABELL 2142:[OHF95] 341
15h58m40.0s
+27d06m21s
G
27399
0.091393
8.9
1
0
0
0
0
Retrieve
51
ABELL 2142:[OHF95] 240
15h58m31.6s
+27d21m44s
G
>30000
0.100082
8.9
1
0
0
0
0
Retrieve
52
ABELL 2142:[OHF95] 241
15h58m01.0s
+27d21m49s
G
28364
0.094612
9.0
1
0
0
0
0
Retrieve
53
ABELL 2142:[OHF95] 235
15h58m43.6s
+27d20m07s
G
28324
0.094479
9.0
1
0
0
0
0
Retrieve
54
ABELL 2142:[OHF95] 260
15h58m55.8s
+27d16m41s
G
28182
0.094005
9.4
1
0
0
0
0
Retrieve
55
ABELL 2142:[OHF95] 264
15h57m32.9s
+27d15m07s
G
25805
0.086076
9.7
1
0
0
0
0
Retrieve
56
ABELL 2142:[OHF95] 337
15h58m12.2s
+27d03m37s
G
20461
0.068250
9.9
1
0
0
0
0
Retrieve
57
ABELL 2142:[OHF95] 255
15h58m56.6s
+27d18m24s
G
29279
0.097664
10.3
1
0
0
0
0
Retrieve
58
ABELL 2142:[OHF95] 327
15h57m39.3s
+27d06m58s
G
28561
0.095269
10.5
1
0
0
0
0
Retrieve
59
ABELL 2142:[OHF95] 326
15h57m40.3s
+27d06m24s
G
>30000
0.111520
10.7
1
0
0
0
0
Retrieve
60
ABELL 2142:[OHF95] 253
15h59m04.5s
+27d16m08s
G
27306
0.091083
11.1
1
0
0
0
0
Retrieve
61
ABELL 2142:[OHF95] 309
15h58m49.6s
+27d05m17s
G
26241
0.087530
11.1
1
0
0
0
0
Retrieve
62
ABELL 2142:[OHF95] 279
15h57m49.9s
+27d23m01s
G
27401
0.091400
11.2
1
0
0
0
0
Retrieve
63
ABELL 2142:[OHF95] 277
15h57m37.5s
+27d20m39s
G
28339
0.094529
11.2
1
0
0
0
0
Retrieve
64
ABELL 2142:[OHF95] 256
15h58m59.0s
+27d19m23s
G
24511
0.081760
11.2
1
0
0
0
0
Retrieve
65
ABELL 2142:[OHF95] 281
15h57m56.5s
+27d23m53s
G
27214
0.090776
11.3
1
0
0
0
0
Retrieve
66
ABELL 2142:[OHF95] 280
15h57m51.2s
+27d23m33s
G
29263
0.097611
11.5
1
0
0
0
0
Retrieve
67
ABELL 2142:[OHF95] 275
15h57m30.2s
+27d18m57s
G
27585
0.092013
11.6
1
0
0
0
0
Retrieve
68
ABELL 2142:[OHF95] 365
15h57m40.0s
+27d22m50s
G
27373
0.091306
12.3
1
0
0
0
0
Retrieve
69
IRAS 15567+2731
15h58m50.5s
+27d23m26s
G
28237
0.094188
12.6
3
0
4
2
0
Retrieve
70
ABELL 2142:[OHF95] 274
15h57m24.3s
+27d18m49s
G
27093
0.090372
12.7
1
0
0
0
0
Retrieve
71
ABELL 2142:[OHF95] 269
15h57m19.4s
+27d16m32s
G
29438
0.098194
13.0
1
0
0
0
0
Retrieve
72
ABELL 2142:[OHF95] 350
15h58m47.3s
+27d24m29s
G
28567
0.095289
13.0
1
0
0
0
0
Retrieve
73
ABELL 2142:[OHF95] 248
15h59m14.9s
+27d10m24s
G
27189
0.090693
13.4
1
0
0
0
0
Retrieve
74
ABELL 2142:[OHF95] 254
15h59m14.7s
+27d17m25s
G
27439
0.091526
13.6
1
0
0
0
0
Retrieve
75
ABELL 2142:[OHF95] 317
15h57m42.0s
+27d02m05s
G
27226
0.090816
13.7
1
0
0
0
0
Retrieve
76
ABELL 2142:[OHF95] 335
15h57m45.0s
+27d01m22s
G
29208
0.097427
14.0
1
0
0
0
0
Retrieve
77
ABELL 2142:[OHF95] 282
15h57m49.7s
+27d26m12s
G
26655
0.088911
14.0
1
0
0
0
0
Retrieve
78
ABELL 2142:[OHF95] 284
15h58m29.4s
+27d27m35s
G
28433
0.094842
14.4
1
0
0
0
0
Retrieve
79
ABELL 2142:[OHF95] 310
15h59m12.4s
+27d06m00s
G
25884
0.086340
14.6
1
0
0
0
0
Retrieve
80
ABELL 2142:[OHF95] 249
15h59m21.5s
+27d11m49s
G
27382
0.091336
14.6
1
0
0
0
0
Retrieve
81
ABELL 2142:[OHF95] 320
15h57m26.5s
+27d03m48s
G
20745
0.069198
14.7
1
0
0
0
0
Retrieve
82
PGC 056556
15h58m49.7s
+27d26m40s
G
25467
0.084949
15.2
2
0
0
0
1
Retrieve
83
ABELL 2142:[HS79] 204
15h57m42.4s
+27d00m18s
G
25116
0.083778
15.2
1
0
0
0
0
Retrieve
84
ABELL 2142:[OHF95] 251
15h59m24.0s
+27d15m18s
G
27308
0.091090
15.2
1
0
0
0
0
Retrieve
85
ABELL 2142:[OHF95] 250
15h59m24.6s
+27d13m01s
G
27948
0.093224
15.2
1
0
0
0
0
Retrieve
86
ABELL 2142:[OHF95] 304
15h58m54.6s
+27d00m50s
G
19322
0.064451
15.3
1
0
0
0
0
Retrieve
87
KUG 1556+276
15h58m32.0s
+27d28m24s
G
9333
0.031131
15.3
4
0
0
2
1
Retrieve
88
ABELL 2142:[OHF95] 258
15h59m18.8s
+27d20m04s
G
26885
0.089679
15.4
1
0
0
0
0
Retrieve
89
CGCG 167-007
15h58m34.4s
+26d58m30s
GPair
19860
0.066246
15.5
9
0
0
2
0
Retrieve
90
ABELL 2142:[OHF95] 334
15h58m43.1s
+26d59m08s
G
27078
0.090322
15.5
1
0
0
0
0
Retrieve
91
ABELL 2142:[OHF95] 322
15h57m19.4s
+27d04m18s
G
20388
0.068007
15.6
1
0
0
0
0
Retrieve
92
CGCG 167-007 NED01
15h58m39.0s
+26d58m37s
G
19839
0.066176
15.7
2
0
0
1
0
Retrieve
93
ABELL 2142:[OHF95] 347
15h58m40.0s
+26d58m41s
G
19321
0.064448
15.7
1
0
0
0
0
Retrieve
94
ABELL 2142:[OHF95] 351
15h58m55.9s
+27d26m31s
G
27042
0.090202
15.8
1
0
0
0
0
Retrieve
95
IRAS 15556+2736
15h57m43.6s
+27d27m55s
G
9350
0.031188
16.1
4
0
4
2
0
Retrieve
96
ABELL 2142:[OHF95] 367
15h57m28.9s
+27d25m46s
G
26229
0.087490
16.1
1
0
0
0
0
Retrieve
97
ABELL 2142:[OHF95] 259
15h59m22.9s
+27d20m49s
G
27146
0.090549
16.6
1
0
0
0
0
Retrieve
98
ABELL 2142:[OHF95] 328
15h57m06.6s
+27d07m10s
G
20277
0.067637
16.7
1
0
0
0
0
Retrieve
99
ABELL 2142:[OHF95] 372
15h57m36.8s
+27d27m51s
G
26790
0.089362
16.8
1
0
0
0
0
Retrieve
100
ABELL 2142:[OHF95] 273
15h57m03.4s
+27d18m14s
G
28220
0.094132
16.8
1
0
0
0
0
Retrieve
101
ABELL 2142:[OHF95] 330
15h58m31.7s
+26d56m33s
G
25607
0.085416
17.3
1
0
0
0
0
Retrieve
102
ABELL 2142:[OHF95] 287
15h57m44.6s
+27d29m26s
G
26298
0.087721
17.4
1
0
0
0
0
Retrieve
103
[HB89] 1557+272
15h59m22.2s
+27d03m40s
G
19374
0.064625
17.7
17
1
3
0
1
Retrieve
104
ABELL 2142:[OHF95] 366
15h57m08.9s
+27d23m16s
G
27985
0.093348
17.9
1
0
0
0
0
Retrieve
105
ABELL 2142:[OHF95] 263
15h56m55.2s
+27d12m52s
G
27660
0.092264
18.0
1
0
0
0
0
Retrieve
106
ABELL 2142:[OHF95] 267
15h56m53.9s
+27d15m51s
G
>30000
0.152859
18.4
1
0
0
0
0
Retrieve
107
ABELL 2142:[OHF95] 373
15h57m24.7s
+27d28m19s
G
29519
0.098465
18.7
1
0
0
0
0
Retrieve
108
ABELL 2142:[OHF95] 292
15h58m01.1s
+27d32m09s
G
26880
0.089662
19.0
1
0
0
0
0
Retrieve
109
PGC 056523
15h58m18.9s
+27d32m42s
G
9495
0.031672
19.2
2
0
0
0
1
Retrieve
110
PGC 056565
15h58m56.6s
+27d30m40s
G
27097
0.090386
19.4
2
0
0
0
1
Retrieve
111
ABELL 2142:[OHF95] 294
15h58m08.1s
+27d32m59s
G
27344
0.091210
19.6
1
0
0
0
0
Retrieve
112
ABELL 2142:[OHF95] 270
15h56m49.0s
+27d17m14s
G
28589
0.095362
19.7
1
0
0
0
0
Retrieve
113
ABELL 2142:[OHF95] 318
15h56m57.0s
+27d03m00s
G
27619
0.092127
20.5
1
0
0
0
0
Retrieve
114
CGCG 167-008
15h58m34.8s
+27d37m06s
G
9379
0.031285
24.0
4
0
0
2
1
Retrieve
115
ABELL 2142:[OHF95] 376
15h57m00.6s
+27d31m04s
G
24652
0.082230
24.3
1
0
0
0
0
Retrieve
116
MRK 0492
15h58m43.7s
+26d49m05s
G
4267
0.014233
25.1
18
0
14
7
4
Retrieve
HTML-TableParser-0.42/data/screwy.Trim.data 0000644 0000407 0000036 00000000122 13076214665 016456 0 ustar dj head Both Both MM1 MB1 11.1 22.2 1-3.1.1 1-3.2.1A B MM2 MB2 11.1 33.3 2-3.1.1 2-3.2.1 HTML-TableParser-0.42/data/table2-1.Chomp.data 0000644 0000407 0000036 00000002541 13076214665 016613 0 ustar dj head h33 -1.154e-01 -2.060e-01 481.0146 -1.7797716637950735E-03 -26.0506034413416841 579.89015840093919
0.000672059134040231 0.00123484664976509 842.1920 24.9555 59.9186 902.1106 598.5083 560.6541h3 -8.365e-02 -2.345e-01 480.9282 -1.1532395834759916E-03 -16.875942397594130 466.64379784205380
0.000515063949465614 0.00138731246068735 842.1970 24.9555 59.8297 902.0267 481.6319 451.1580h4 -8.386e-02 -2.065e-01 480.8279 -8.9864417477996457E-04 -13.150318066441841 411.91935912458604
0.000513002156880169 0.00123195192376053 842.2250 24.9555 59.7154 901.9404 425.1507 398.2487h6 -1.096e-01 -2.067e-01 479.2152 -4.9625995845653374E-04 -7.2620248152618760 306.09851668776219
0.000658904663372658 0.00124699759199671 842.2000 24.9555 58.1152 900.3152 315.9310 295.9396p1 1.239e-01 2.151e-01 -426.5761 0.0 -8.9333113530131421 606.86080963697918
842.2150 24.9555 -847.6836 -5.4686 613.0284 600.6299p3 8.675e-02 2.437e-01 -436.7098 0.0 -5.7939624154424676 488.46244215611011
842.2080 24.9555 -857.8138 -15.6058 493.4321 483.4417p4 8.634e-02 2.168e-01 -440.3572 0.0 -4.5165799273846270 431.26225933154404
842.2080 24.9555 -861.4612 -19.2532 435.6501 426.8293p6 8.625e-02 2.245e-01 -445.0821 0.0 -2.4957050467401789 320.56977725634789
842.2090 24.9555 -866.1866 -23.9776 323.8316 317.2745 HTML-TableParser-0.42/data/ned.Chomp.data 0000644 0000407 0000036 00000040500 13076214665 016047 0 ustar dj head 1 PGC 056527 15h58m20.0s +27d14m02s G 27092 0.090369 1.0 9 0 0 0 2 Retrieve2 ABELL 2142:[HCW85] 2 15h58m18.8s +27d14m21s G 24247 0.080879 1.1 1 0 0 0 0 Retrieve3 PGC 056515 15h58m13.3s +27d14m55s G 28936 0.096520 1.6 3 0 0 0 1 Retrieve4 ABELL 2142:[OHF95] 216 15h58m23.1s +27d14m04s G 27658 0.092257 1.7 1 0 0 0 0 Retrieve5 ABELL 2142:[OHF95] 244 15h58m24.7s +27d13m47s G 26470 0.088294 1.9 1 0 0 0 0 Retrieve6 ABELL 2142:[OHF95] 246 15h58m07.6s +27d14m45s G 26817 0.089452 2.3 1 0 0 0 0 Retrieve7 ABELL 2142:[OHF95] 218 15h58m25.5s +27d14m46s G 27154 0.090576 2.5 1 0 0 0 0 Retrieve8 ABELL 2142:[HS79] 103 15h58m17.5s +27d16m10s G 25161 0.083928 2.7 1 0 0 0 0 Retrieve9 ABELL 2142:[OHF95] 214 15h58m28.4s +27d13m48s G 27403 0.091406 2.7 1 0 0 0 0 Retrieve10 ABELL 2142:[OHF95] 209 15h58m24.6s +27d11m26s G 27350 0.091230 2.8 1 0 0 0 0 Retrieve11 ABELL 2142:[OHF95] 208 15h58m08.0s +27d11m13s G >30000 0.102341 2.9 1 0 0 0 0 Retrieve12 PGC 056516 15h58m14.0s +27d16m22s G 28644 0.095546 2.9 16 0 4 3 1 Retrieve13 ABELL 2142:[OHF95] 211 15h58m04.8s +27d11m50s G 24764 0.082604 3.0 1 0 0 0 0 Retrieve14 ABELL 2142:[OHF95] 228 15h58m13.8s +27d16m46s G 27029 0.090159 3.3 1 0 0 0 0 Retrieve15 ABELL 2142:[OHF95] 207 15h58m09.0s +27d10m24s G 26209 0.087424 3.5 1 0 0 0 0 Retrieve16 ABELL 2142:[OHF95] 230 15h58m12.8s +27d17m00s G 25793 0.086036 3.6 1 0 0 0 0 Retrieve17 ABELL 2142:[OHF95] 221 15h58m01.3s +27d15m03s G 25561 0.085262 3.6 1 0 0 0 0 Retrieve18 ABELL 2142:[OHF95] 227 15h58m06.5s +27d16m28s G 26107 0.087083 3.7 1 0 0 0 0 Retrieve19 ABELL 2142:[OHF95] 205 15h58m20.2s +27d09m49s G 25289 0.084355 3.8 1 0 0 0 0 Retrieve20 ABELL 2142:[OHF95] 204 15h58m17.9s +27d09m38s G 20093 0.067023 3.9 1 0 0 0 0 Retrieve21 ABELL 2142:[OHF95] 213 15h57m56.2s +27d13m27s G 26695 0.089045 4.4 1 0 0 0 0 Retrieve22 ABELL 2142:[OHF95] 222 15h58m33.9s +27d15m38s G 25251 0.084228 4.5 1 0 0 0 0 Retrieve23 [HB91] 1556+274 15h58m29.2s +27d17m08s G 26981 0.090000 4.7 3 0 0 0 0 Retrieve24 ABELL 2142:[OHF95] 203 15h58m19.2s +27d08m49s G >30000 0.147802 4.7 1 0 0 0 0 Retrieve25 ABELL 2142:[OHF95] 206 15h57m58.6s +27d10m44s G 26779 0.089325 4.8 1 0 0 0 0 Retrieve26 ABELL 2142:[OHF95] 212 15h57m54.9s +27d11m52s G 25246 0.084211 5.0 1 0 0 0 0 Retrieve27 ABELL 2142:[OHF95] 243 15h58m39.1s +27d14m02s G 27034 0.090176 5.1 1 0 0 0 0 Retrieve28 ABELL 2142:[OHF95] 242 15h58m39.6s +27d13m53s G 26930 0.089829 5.2 1 0 0 0 0 Retrieve29 ABELL 2142:[OHF95] 224 15h58m39.3s +27d16m19s G 26769 0.089292 5.9 1 0 0 0 0 Retrieve30 ABELL 2142:[OHF95] 220 15h58m41.5s +27d15m11s G 26486 0.088348 5.9 1 0 0 0 0 Retrieve31 ABELL 2142:[OHF95] 225 15h57m51.7s +27d16m06s G 27356 0.091250 6.0 1 0 0 0 0 Retrieve32 ABELL 2142:[OHF95] 234 15h58m26.7s +27d19m13s G 27760 0.092597 6.2 1 0 0 0 0 Retrieve33 PGC 056530 15h58m21.0s +27d20m03s G 26178 0.087320 6.7 2 0 0 0 1 Retrieve34 ABELL 2142:[OHF95] 210 15h58m45.4s +27d11m53s G 26182 0.087334 6.7 1 0 0 0 0 Retrieve35 ABELL 2142:[OHF95] 202 15h58m37.2s +27d08m18s G 27117 0.090452 7.0 1 0 0 0 0 Retrieve36 ABELL 2142:[OHF95] 343 15h58m32.7s +27d07m26s G >30000 0.106904 7.1 1 0 0 0 0 Retrieve37 ABELL 2142:[OHF95] 342 15h58m29.6s +27d06m56s G 25466 0.084945 7.2 1 0 0 0 0 Retrieve38 ABELL 2142:[OHF95] 252 15h58m47.0s +27d15m53s G 24443 0.081533 7.3 1 0 0 0 0 Retrieve39 ABELL 2142:[OHF95] 215 15h57m43.2s +27d13m38s G 25977 0.086650 7.3 1 0 0 0 0 Retrieve40 ABELL 2142:[OHF95] 344 15h57m55.7s +27d07m41s G 29091 0.097037 7.4 1 0 0 0 0 Retrieve41 ABELL 2142:[OHF95] 238 15h58m16.8s +27d20m55s G 27102 0.090402 7.4 1 0 0 0 0 Retrieve42 ABELL 2142:[OHF95] 231 15h57m49.8s +27d18m14s G 28075 0.093648 7.5 1 0 0 0 0 Retrieve43 ABELL 2142:[OHF95] 229 15h57m43.7s +27d16m38s G 26615 0.088778 7.9 1 0 0 0 0 Retrieve44 ABELL 2142:[OHF95] 338 15h58m21.1s +27d05m27s G 25406 0.084745 8.1 1 0 0 0 0 Retrieve45 ABELL 2142:[OHF95] 232 15h58m43.7s +27d19m00s G 19311 0.064414 8.2 1 0 0 0 0 Retrieve46 ABELL 2142:[OHF95] 340 15h58m05.1s +27d05m32s G 27222 0.090803 8.3 1 0 0 0 0 Retrieve47 ABELL 2142:[OHF95] 266 15h57m40.4s +27d15m57s G 26628 0.088821 8.3 1 0 0 0 0 Retrieve48 IRAS F15566+2716 15h58m42.9s +27d07m38s G 26003 0.086737 8.3 1 0 4 1 0 Retrieve49 ABELL 2142:[OHF95] 233 15h57m47.1s +27d18m58s G >30000 0.100860 8.5 1 0 0 0 0 Retrieve50 ABELL 2142:[OHF95] 341 15h58m40.0s +27d06m21s G 27399 0.091393 8.9 1 0 0 0 0 Retrieve51 ABELL 2142:[OHF95] 240 15h58m31.6s +27d21m44s G >30000 0.100082 8.9 1 0 0 0 0 Retrieve52 ABELL 2142:[OHF95] 241 15h58m01.0s +27d21m49s G 28364 0.094612 9.0 1 0 0 0 0 Retrieve53 ABELL 2142:[OHF95] 235 15h58m43.6s +27d20m07s G 28324 0.094479 9.0 1 0 0 0 0 Retrieve54 ABELL 2142:[OHF95] 260 15h58m55.8s +27d16m41s G 28182 0.094005 9.4 1 0 0 0 0 Retrieve55 ABELL 2142:[OHF95] 264 15h57m32.9s +27d15m07s G 25805 0.086076 9.7 1 0 0 0 0 Retrieve56 ABELL 2142:[OHF95] 337 15h58m12.2s +27d03m37s G 20461 0.068250 9.9 1 0 0 0 0 Retrieve57 ABELL 2142:[OHF95] 255 15h58m56.6s +27d18m24s G 29279 0.097664 10.3 1 0 0 0 0 Retrieve58 ABELL 2142:[OHF95] 327 15h57m39.3s +27d06m58s G 28561 0.095269 10.5 1 0 0 0 0 Retrieve59 ABELL 2142:[OHF95] 326 15h57m40.3s +27d06m24s G >30000 0.111520 10.7 1 0 0 0 0 Retrieve60 ABELL 2142:[OHF95] 253 15h59m04.5s +27d16m08s G 27306 0.091083 11.1 1 0 0 0 0 Retrieve61 ABELL 2142:[OHF95] 309 15h58m49.6s +27d05m17s G 26241 0.087530 11.1 1 0 0 0 0 Retrieve62 ABELL 2142:[OHF95] 279 15h57m49.9s +27d23m01s G 27401 0.091400 11.2 1 0 0 0 0 Retrieve63 ABELL 2142:[OHF95] 277 15h57m37.5s +27d20m39s G 28339 0.094529 11.2 1 0 0 0 0 Retrieve64 ABELL 2142:[OHF95] 256 15h58m59.0s +27d19m23s G 24511 0.081760 11.2 1 0 0 0 0 Retrieve65 ABELL 2142:[OHF95] 281 15h57m56.5s +27d23m53s G 27214 0.090776 11.3 1 0 0 0 0 Retrieve66 ABELL 2142:[OHF95] 280 15h57m51.2s +27d23m33s G 29263 0.097611 11.5 1 0 0 0 0 Retrieve67 ABELL 2142:[OHF95] 275 15h57m30.2s +27d18m57s G 27585 0.092013 11.6 1 0 0 0 0 Retrieve68 ABELL 2142:[OHF95] 365 15h57m40.0s +27d22m50s G 27373 0.091306 12.3 1 0 0 0 0 Retrieve69 IRAS 15567+2731 15h58m50.5s +27d23m26s G 28237 0.094188 12.6 3 0 4 2 0 Retrieve70 ABELL 2142:[OHF95] 274 15h57m24.3s +27d18m49s G 27093 0.090372 12.7 1 0 0 0 0 Retrieve71 ABELL 2142:[OHF95] 269 15h57m19.4s +27d16m32s G 29438 0.098194 13.0 1 0 0 0 0 Retrieve72 ABELL 2142:[OHF95] 350 15h58m47.3s +27d24m29s G 28567 0.095289 13.0 1 0 0 0 0 Retrieve73 ABELL 2142:[OHF95] 248 15h59m14.9s +27d10m24s G 27189 0.090693 13.4 1 0 0 0 0 Retrieve74 ABELL 2142:[OHF95] 254 15h59m14.7s +27d17m25s G 27439 0.091526 13.6 1 0 0 0 0 Retrieve75 ABELL 2142:[OHF95] 317 15h57m42.0s +27d02m05s G 27226 0.090816 13.7 1 0 0 0 0 Retrieve76 ABELL 2142:[OHF95] 335 15h57m45.0s +27d01m22s G 29208 0.097427 14.0 1 0 0 0 0 Retrieve77 ABELL 2142:[OHF95] 282 15h57m49.7s +27d26m12s G 26655 0.088911 14.0 1 0 0 0 0 Retrieve78 ABELL 2142:[OHF95] 284 15h58m29.4s +27d27m35s G 28433 0.094842 14.4 1 0 0 0 0 Retrieve79 ABELL 2142:[OHF95] 310 15h59m12.4s +27d06m00s G 25884 0.086340 14.6 1 0 0 0 0 Retrieve80 ABELL 2142:[OHF95] 249 15h59m21.5s +27d11m49s G 27382 0.091336 14.6 1 0 0 0 0 Retrieve81 ABELL 2142:[OHF95] 320 15h57m26.5s +27d03m48s G 20745 0.069198 14.7 1 0 0 0 0 Retrieve82 PGC 056556 15h58m49.7s +27d26m40s G 25467 0.084949 15.2 2 0 0 0 1 Retrieve83 ABELL 2142:[HS79] 204 15h57m42.4s +27d00m18s G 25116 0.083778 15.2 1 0 0 0 0 Retrieve84 ABELL 2142:[OHF95] 251 15h59m24.0s +27d15m18s G 27308 0.091090 15.2 1 0 0 0 0 Retrieve85 ABELL 2142:[OHF95] 250 15h59m24.6s +27d13m01s G 27948 0.093224 15.2 1 0 0 0 0 Retrieve86 ABELL 2142:[OHF95] 304 15h58m54.6s +27d00m50s G 19322 0.064451 15.3 1 0 0 0 0 Retrieve87 KUG 1556+276 15h58m32.0s +27d28m24s G 9333 0.031131 15.3 4 0 0 2 1 Retrieve88 ABELL 2142:[OHF95] 258 15h59m18.8s +27d20m04s G 26885 0.089679 15.4 1 0 0 0 0 Retrieve89 CGCG 167-007 15h58m34.4s +26d58m30s GPair 19860 0.066246 15.5 9 0 0 2 0 Retrieve90 ABELL 2142:[OHF95] 334 15h58m43.1s +26d59m08s G 27078 0.090322 15.5 1 0 0 0 0 Retrieve91 ABELL 2142:[OHF95] 322 15h57m19.4s +27d04m18s G 20388 0.068007 15.6 1 0 0 0 0 Retrieve92 CGCG 167-007 NED01 15h58m39.0s +26d58m37s G 19839 0.066176 15.7 2 0 0 1 0 Retrieve93 ABELL 2142:[OHF95] 347 15h58m40.0s +26d58m41s G 19321 0.064448 15.7 1 0 0 0 0 Retrieve94 ABELL 2142:[OHF95] 351 15h58m55.9s +27d26m31s G 27042 0.090202 15.8 1 0 0 0 0 Retrieve95 IRAS 15556+2736 15h57m43.6s +27d27m55s G 9350 0.031188 16.1 4 0 4 2 0 Retrieve96 ABELL 2142:[OHF95] 367 15h57m28.9s +27d25m46s G 26229 0.087490 16.1 1 0 0 0 0 Retrieve97 ABELL 2142:[OHF95] 259 15h59m22.9s +27d20m49s G 27146 0.090549 16.6 1 0 0 0 0 Retrieve98 ABELL 2142:[OHF95] 328 15h57m06.6s +27d07m10s G 20277 0.067637 16.7 1 0 0 0 0 Retrieve99 ABELL 2142:[OHF95] 372 15h57m36.8s +27d27m51s G 26790 0.089362 16.8 1 0 0 0 0 Retrieve100 ABELL 2142:[OHF95] 273 15h57m03.4s +27d18m14s G 28220 0.094132 16.8 1 0 0 0 0 Retrieve101 ABELL 2142:[OHF95] 330 15h58m31.7s +26d56m33s G 25607 0.085416 17.3 1 0 0 0 0 Retrieve102 ABELL 2142:[OHF95] 287 15h57m44.6s +27d29m26s G 26298 0.087721 17.4 1 0 0 0 0 Retrieve103 [HB89] 1557+272 15h59m22.2s +27d03m40s G 19374 0.064625 17.7 17 1 3 0 1 Retrieve104 ABELL 2142:[OHF95] 366 15h57m08.9s +27d23m16s G 27985 0.093348 17.9 1 0 0 0 0 Retrieve105 ABELL 2142:[OHF95] 263 15h56m55.2s +27d12m52s G 27660 0.092264 18.0 1 0 0 0 0 Retrieve106 ABELL 2142:[OHF95] 267 15h56m53.9s +27d15m51s G >30000 0.152859 18.4 1 0 0 0 0 Retrieve107 ABELL 2142:[OHF95] 373 15h57m24.7s +27d28m19s G 29519 0.098465 18.7 1 0 0 0 0 Retrieve108 ABELL 2142:[OHF95] 292 15h58m01.1s +27d32m09s G 26880 0.089662 19.0 1 0 0 0 0 Retrieve109 PGC 056523 15h58m18.9s +27d32m42s G 9495 0.031672 19.2 2 0 0 0 1 Retrieve110 PGC 056565 15h58m56.6s +27d30m40s G 27097 0.090386 19.4 2 0 0 0 1 Retrieve111 ABELL 2142:[OHF95] 294 15h58m08.1s +27d32m59s G 27344 0.091210 19.6 1 0 0 0 0 Retrieve112 ABELL 2142:[OHF95] 270 15h56m49.0s +27d17m14s G 28589 0.095362 19.7 1 0 0 0 0 Retrieve113 ABELL 2142:[OHF95] 318 15h56m57.0s +27d03m00s G 27619 0.092127 20.5 1 0 0 0 0 Retrieve114 CGCG 167-008 15h58m34.8s +27d37m06s G 9379 0.031285 24.0 4 0 0 2 1 Retrieve115 ABELL 2142:[OHF95] 376 15h57m00.6s +27d31m04s G 24652 0.082230 24.3 1 0 0 0 0 Retrieve116 MRK 0492 15h58m43.7s +26d49m05s G 4267 0.014233 25.1 18 0 14 7 4 Retrieve HTML-TableParser-0.42/data/table.Default.data 0000644 0000407 0000036 00000002540 13076214665 016710 0 ustar dj head h1 -1.154e-01 -2.060e-01 481.0146 -1.7797716637950735E-03 -26.0506034413416841 579.89015840093919
0.000672059134040231 0.00123484664976509 842.1920 24.9555 59.9186 902.1106 598.5083 560.6541h3 -8.365e-02 -2.345e-01 480.9282 -1.1532395834759916E-03 -16.875942397594130 466.64379784205380
0.000515063949465614 0.00138731246068735 842.1970 24.9555 59.8297 902.0267 481.6319 451.1580h4 -8.386e-02 -2.065e-01 480.8279 -8.9864417477996457E-04 -13.150318066441841 411.91935912458604
0.000513002156880169 0.00123195192376053 842.2250 24.9555 59.7154 901.9404 425.1507 398.2487h6 -1.096e-01 -2.067e-01 479.2152 -4.9625995845653374E-04 -7.2620248152618760 306.09851668776219
0.000658904663372658 0.00124699759199671 842.2000 24.9555 58.1152 900.3152 315.9310 295.9396p1 1.239e-01 2.151e-01 -426.5761 0.0 -8.9333113530131421 606.86080963697918
842.2150 24.9555 -847.6836 -5.4686 613.0284 600.6299p3 8.675e-02 2.437e-01 -436.7098 0.0 -5.7939624154424676 488.46244215611011
842.2080 24.9555 -857.8138 -15.6058 493.4321 483.4417p4 8.634e-02 2.168e-01 -440.3572 0.0 -4.5165799273846270 431.26225933154404
842.2080 24.9555 -861.4612 -19.2532 435.6501 426.8293p6 8.625e-02 2.245e-01 -445.0821 0.0 -2.4957050467401789 320.56977725634789
842.2090 24.9555 -866.1866 -23.9776 323.8316 317.2745 HTML-TableParser-0.42/data/table2-1.Decode.data 0000644 0000407 0000036 00000002541 13076214665 016730 0 ustar dj head h33 -1.154e-01 -2.060e-01 481.0146 -1.7797716637950735E-03 -26.0506034413416841 579.89015840093919
0.000672059134040231 0.00123484664976509 842.1920 24.9555 59.9186 902.1106 598.5083 560.6541h3 -8.365e-02 -2.345e-01 480.9282 -1.1532395834759916E-03 -16.875942397594130 466.64379784205380
0.000515063949465614 0.00138731246068735 842.1970 24.9555 59.8297 902.0267 481.6319 451.1580h4 -8.386e-02 -2.065e-01 480.8279 -8.9864417477996457E-04 -13.150318066441841 411.91935912458604
0.000513002156880169 0.00123195192376053 842.2250 24.9555 59.7154 901.9404 425.1507 398.2487h6 -1.096e-01 -2.067e-01 479.2152 -4.9625995845653374E-04 -7.2620248152618760 306.09851668776219
0.000658904663372658 0.00124699759199671 842.2000 24.9555 58.1152 900.3152 315.9310 295.9396p1 1.239e-01 2.151e-01 -426.5761 0.0 -8.9333113530131421 606.86080963697918
842.2150 24.9555 -847.6836 -5.4686 613.0284 600.6299p3 8.675e-02 2.437e-01 -436.7098 0.0 -5.7939624154424676 488.46244215611011
842.2080 24.9555 -857.8138 -15.6058 493.4321 483.4417p4 8.634e-02 2.168e-01 -440.3572 0.0 -4.5165799273846270 431.26225933154404
842.2080 24.9555 -861.4612 -19.2532 435.6501 426.8293p6 8.625e-02 2.245e-01 -445.0821 0.0 -2.4957050467401789 320.56977725634789
842.2090 24.9555 -866.1866 -23.9776 323.8316 317.2745 HTML-TableParser-0.42/data/ned.html 0000644 0000407 0000036 00000301252 13075413113 015025 0 ustar dj head
Your NED Search Results
Help | Comment | NED home
Searching NED within 30.0 arcmin of object "ABELL 2142"
Object list is sorted on Distance to search center
No. |
Object Name (* => Essential Note) |
Equatorial J2000.0 |
Object Type |
Velocity/Redshift |
Distance from Central Posn. (arcmin) |
Number of |
Images |
RA |
DEC |
km/s |
z |
Qual |
Refs |
Notes |
Phot |
Posn |
Vel/z |
1
| PGC 056527
| 15h58m20.0s
| +27d14m02s
| G
| 27092
| 0.090369
|
| 1.0
| 9
| 0
| 0
| 0
| 2
| Retrieve
|
2
| ABELL 2142:[HCW85] 2
| 15h58m18.8s
| +27d14m21s
| G
| 24247
| 0.080879
|
| 1.1
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
3
| PGC 056515
| 15h58m13.3s
| +27d14m55s
| G
| 28936
| 0.096520
|
| 1.6
| 3
| 0
| 0
| 0
| 1
| Retrieve
|
4
| ABELL 2142:[OHF95] 216
| 15h58m23.1s
| +27d14m04s
| G
| 27658
| 0.092257
|
| 1.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
5
| ABELL 2142:[OHF95] 244
| 15h58m24.7s
| +27d13m47s
| G
| 26470
| 0.088294
|
| 1.9
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
6
| ABELL 2142:[OHF95] 246
| 15h58m07.6s
| +27d14m45s
| G
| 26817
| 0.089452
|
| 2.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
7
| ABELL 2142:[OHF95] 218
| 15h58m25.5s
| +27d14m46s
| G
| 27154
| 0.090576
|
| 2.5
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
8
| ABELL 2142:[HS79] 103
| 15h58m17.5s
| +27d16m10s
| G
| 25161
| 0.083928
|
| 2.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
9
| ABELL 2142:[OHF95] 214
| 15h58m28.4s
| +27d13m48s
| G
| 27403
| 0.091406
|
| 2.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
10
| ABELL 2142:[OHF95] 209
| 15h58m24.6s
| +27d11m26s
| G
| 27350
| 0.091230
|
| 2.8
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
11
| ABELL 2142:[OHF95] 208
| 15h58m08.0s
| +27d11m13s
| G
| >30000
| 0.102341
|
| 2.9
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
12
| PGC 056516
| 15h58m14.0s
| +27d16m22s
| G
| 28644
| 0.095546
|
| 2.9
| 16
| 0
| 4
| 3
| 1
| Retrieve
|
13
| ABELL 2142:[OHF95] 211
| 15h58m04.8s
| +27d11m50s
| G
| 24764
| 0.082604
|
| 3.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
14
| ABELL 2142:[OHF95] 228
| 15h58m13.8s
| +27d16m46s
| G
| 27029
| 0.090159
|
| 3.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
15
| ABELL 2142:[OHF95] 207
| 15h58m09.0s
| +27d10m24s
| G
| 26209
| 0.087424
|
| 3.5
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
16
| ABELL 2142:[OHF95] 230
| 15h58m12.8s
| +27d17m00s
| G
| 25793
| 0.086036
|
| 3.6
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
17
| ABELL 2142:[OHF95] 221
| 15h58m01.3s
| +27d15m03s
| G
| 25561
| 0.085262
|
| 3.6
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
18
| ABELL 2142:[OHF95] 227
| 15h58m06.5s
| +27d16m28s
| G
| 26107
| 0.087083
|
| 3.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
19
| ABELL 2142:[OHF95] 205
| 15h58m20.2s
| +27d09m49s
| G
| 25289
| 0.084355
|
| 3.8
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
20
| ABELL 2142:[OHF95] 204
| 15h58m17.9s
| +27d09m38s
| G
| 20093
| 0.067023
|
| 3.9
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
21
| ABELL 2142:[OHF95] 213
| 15h57m56.2s
| +27d13m27s
| G
| 26695
| 0.089045
|
| 4.4
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
22
| ABELL 2142:[OHF95] 222
| 15h58m33.9s
| +27d15m38s
| G
| 25251
| 0.084228
|
| 4.5
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
23
| [HB91] 1556+274
| 15h58m29.2s
| +27d17m08s
| G
| 26981
| 0.090000
|
| 4.7
| 3
| 0
| 0
| 0
| 0
| Retrieve
|
24
| ABELL 2142:[OHF95] 203
| 15h58m19.2s
| +27d08m49s
| G
| >30000
| 0.147802
|
| 4.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
25
| ABELL 2142:[OHF95] 206
| 15h57m58.6s
| +27d10m44s
| G
| 26779
| 0.089325
|
| 4.8
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
26
| ABELL 2142:[OHF95] 212
| 15h57m54.9s
| +27d11m52s
| G
| 25246
| 0.084211
|
| 5.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
27
| ABELL 2142:[OHF95] 243
| 15h58m39.1s
| +27d14m02s
| G
| 27034
| 0.090176
|
| 5.1
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
28
| ABELL 2142:[OHF95] 242
| 15h58m39.6s
| +27d13m53s
| G
| 26930
| 0.089829
|
| 5.2
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
29
| ABELL 2142:[OHF95] 224
| 15h58m39.3s
| +27d16m19s
| G
| 26769
| 0.089292
|
| 5.9
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
30
| ABELL 2142:[OHF95] 220
| 15h58m41.5s
| +27d15m11s
| G
| 26486
| 0.088348
|
| 5.9
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
31
| ABELL 2142:[OHF95] 225
| 15h57m51.7s
| +27d16m06s
| G
| 27356
| 0.091250
|
| 6.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
32
| ABELL 2142:[OHF95] 234
| 15h58m26.7s
| +27d19m13s
| G
| 27760
| 0.092597
|
| 6.2
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
33
| PGC 056530
| 15h58m21.0s
| +27d20m03s
| G
| 26178
| 0.087320
|
| 6.7
| 2
| 0
| 0
| 0
| 1
| Retrieve
|
34
| ABELL 2142:[OHF95] 210
| 15h58m45.4s
| +27d11m53s
| G
| 26182
| 0.087334
|
| 6.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
35
| ABELL 2142:[OHF95] 202
| 15h58m37.2s
| +27d08m18s
| G
| 27117
| 0.090452
|
| 7.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
36
| ABELL 2142:[OHF95] 343
| 15h58m32.7s
| +27d07m26s
| G
| >30000
| 0.106904
|
| 7.1
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
37
| ABELL 2142:[OHF95] 342
| 15h58m29.6s
| +27d06m56s
| G
| 25466
| 0.084945
|
| 7.2
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
38
| ABELL 2142:[OHF95] 252
| 15h58m47.0s
| +27d15m53s
| G
| 24443
| 0.081533
|
| 7.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
39
| ABELL 2142:[OHF95] 215
| 15h57m43.2s
| +27d13m38s
| G
| 25977
| 0.086650
|
| 7.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
40
| ABELL 2142:[OHF95] 344
| 15h57m55.7s
| +27d07m41s
| G
| 29091
| 0.097037
|
| 7.4
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
41
| ABELL 2142:[OHF95] 238
| 15h58m16.8s
| +27d20m55s
| G
| 27102
| 0.090402
|
| 7.4
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
42
| ABELL 2142:[OHF95] 231
| 15h57m49.8s
| +27d18m14s
| G
| 28075
| 0.093648
|
| 7.5
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
43
| ABELL 2142:[OHF95] 229
| 15h57m43.7s
| +27d16m38s
| G
| 26615
| 0.088778
|
| 7.9
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
44
| ABELL 2142:[OHF95] 338
| 15h58m21.1s
| +27d05m27s
| G
| 25406
| 0.084745
|
| 8.1
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
45
| ABELL 2142:[OHF95] 232
| 15h58m43.7s
| +27d19m00s
| G
| 19311
| 0.064414
|
| 8.2
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
46
| ABELL 2142:[OHF95] 340
| 15h58m05.1s
| +27d05m32s
| G
| 27222
| 0.090803
|
| 8.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
47
| ABELL 2142:[OHF95] 266
| 15h57m40.4s
| +27d15m57s
| G
| 26628
| 0.088821
|
| 8.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
48
| IRAS F15566+2716
| 15h58m42.9s
| +27d07m38s
| G
| 26003
| 0.086737
|
| 8.3
| 1
| 0
| 4
| 1
| 0
| Retrieve
|
49
| ABELL 2142:[OHF95] 233
| 15h57m47.1s
| +27d18m58s
| G
| >30000
| 0.100860
|
| 8.5
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
50
| ABELL 2142:[OHF95] 341
| 15h58m40.0s
| +27d06m21s
| G
| 27399
| 0.091393
|
| 8.9
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
51
| ABELL 2142:[OHF95] 240
| 15h58m31.6s
| +27d21m44s
| G
| >30000
| 0.100082
|
| 8.9
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
52
| ABELL 2142:[OHF95] 241
| 15h58m01.0s
| +27d21m49s
| G
| 28364
| 0.094612
|
| 9.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
53
| ABELL 2142:[OHF95] 235
| 15h58m43.6s
| +27d20m07s
| G
| 28324
| 0.094479
|
| 9.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
54
| ABELL 2142:[OHF95] 260
| 15h58m55.8s
| +27d16m41s
| G
| 28182
| 0.094005
|
| 9.4
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
55
| ABELL 2142:[OHF95] 264
| 15h57m32.9s
| +27d15m07s
| G
| 25805
| 0.086076
|
| 9.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
56
| ABELL 2142:[OHF95] 337
| 15h58m12.2s
| +27d03m37s
| G
| 20461
| 0.068250
|
| 9.9
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
57
| ABELL 2142:[OHF95] 255
| 15h58m56.6s
| +27d18m24s
| G
| 29279
| 0.097664
|
| 10.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
58
| ABELL 2142:[OHF95] 327
| 15h57m39.3s
| +27d06m58s
| G
| 28561
| 0.095269
|
| 10.5
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
59
| ABELL 2142:[OHF95] 326
| 15h57m40.3s
| +27d06m24s
| G
| >30000
| 0.111520
|
| 10.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
60
| ABELL 2142:[OHF95] 253
| 15h59m04.5s
| +27d16m08s
| G
| 27306
| 0.091083
|
| 11.1
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
61
| ABELL 2142:[OHF95] 309
| 15h58m49.6s
| +27d05m17s
| G
| 26241
| 0.087530
|
| 11.1
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
62
| ABELL 2142:[OHF95] 279
| 15h57m49.9s
| +27d23m01s
| G
| 27401
| 0.091400
|
| 11.2
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
63
| ABELL 2142:[OHF95] 277
| 15h57m37.5s
| +27d20m39s
| G
| 28339
| 0.094529
|
| 11.2
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
64
| ABELL 2142:[OHF95] 256
| 15h58m59.0s
| +27d19m23s
| G
| 24511
| 0.081760
|
| 11.2
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
65
| ABELL 2142:[OHF95] 281
| 15h57m56.5s
| +27d23m53s
| G
| 27214
| 0.090776
|
| 11.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
66
| ABELL 2142:[OHF95] 280
| 15h57m51.2s
| +27d23m33s
| G
| 29263
| 0.097611
|
| 11.5
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
67
| ABELL 2142:[OHF95] 275
| 15h57m30.2s
| +27d18m57s
| G
| 27585
| 0.092013
|
| 11.6
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
68
| ABELL 2142:[OHF95] 365
| 15h57m40.0s
| +27d22m50s
| G
| 27373
| 0.091306
|
| 12.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
69
| IRAS 15567+2731
| 15h58m50.5s
| +27d23m26s
| G
| 28237
| 0.094188
|
| 12.6
| 3
| 0
| 4
| 2
| 0
| Retrieve
|
70
| ABELL 2142:[OHF95] 274
| 15h57m24.3s
| +27d18m49s
| G
| 27093
| 0.090372
|
| 12.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
71
| ABELL 2142:[OHF95] 269
| 15h57m19.4s
| +27d16m32s
| G
| 29438
| 0.098194
|
| 13.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
72
| ABELL 2142:[OHF95] 350
| 15h58m47.3s
| +27d24m29s
| G
| 28567
| 0.095289
|
| 13.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
73
| ABELL 2142:[OHF95] 248
| 15h59m14.9s
| +27d10m24s
| G
| 27189
| 0.090693
|
| 13.4
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
74
| ABELL 2142:[OHF95] 254
| 15h59m14.7s
| +27d17m25s
| G
| 27439
| 0.091526
|
| 13.6
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
75
| ABELL 2142:[OHF95] 317
| 15h57m42.0s
| +27d02m05s
| G
| 27226
| 0.090816
|
| 13.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
76
| ABELL 2142:[OHF95] 335
| 15h57m45.0s
| +27d01m22s
| G
| 29208
| 0.097427
|
| 14.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
77
| ABELL 2142:[OHF95] 282
| 15h57m49.7s
| +27d26m12s
| G
| 26655
| 0.088911
|
| 14.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
78
| ABELL 2142:[OHF95] 284
| 15h58m29.4s
| +27d27m35s
| G
| 28433
| 0.094842
|
| 14.4
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
79
| ABELL 2142:[OHF95] 310
| 15h59m12.4s
| +27d06m00s
| G
| 25884
| 0.086340
|
| 14.6
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
80
| ABELL 2142:[OHF95] 249
| 15h59m21.5s
| +27d11m49s
| G
| 27382
| 0.091336
|
| 14.6
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
81
| ABELL 2142:[OHF95] 320
| 15h57m26.5s
| +27d03m48s
| G
| 20745
| 0.069198
|
| 14.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
82
| PGC 056556
| 15h58m49.7s
| +27d26m40s
| G
| 25467
| 0.084949
|
| 15.2
| 2
| 0
| 0
| 0
| 1
| Retrieve
|
83
| ABELL 2142:[HS79] 204
| 15h57m42.4s
| +27d00m18s
| G
| 25116
| 0.083778
|
| 15.2
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
84
| ABELL 2142:[OHF95] 251
| 15h59m24.0s
| +27d15m18s
| G
| 27308
| 0.091090
|
| 15.2
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
85
| ABELL 2142:[OHF95] 250
| 15h59m24.6s
| +27d13m01s
| G
| 27948
| 0.093224
|
| 15.2
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
86
| ABELL 2142:[OHF95] 304
| 15h58m54.6s
| +27d00m50s
| G
| 19322
| 0.064451
|
| 15.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
87
| KUG 1556+276
| 15h58m32.0s
| +27d28m24s
| G
| 9333
| 0.031131
|
| 15.3
| 4
| 0
| 0
| 2
| 1
| Retrieve
|
88
| ABELL 2142:[OHF95] 258
| 15h59m18.8s
| +27d20m04s
| G
| 26885
| 0.089679
|
| 15.4
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
89
| CGCG 167-007
| 15h58m34.4s
| +26d58m30s
| GPair
| 19860
| 0.066246
|
| 15.5
| 9
| 0
| 0
| 2
| 0
| Retrieve
|
90
| ABELL 2142:[OHF95] 334
| 15h58m43.1s
| +26d59m08s
| G
| 27078
| 0.090322
|
| 15.5
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
91
| ABELL 2142:[OHF95] 322
| 15h57m19.4s
| +27d04m18s
| G
| 20388
| 0.068007
|
| 15.6
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
92
| CGCG 167-007 NED01
| 15h58m39.0s
| +26d58m37s
| G
| 19839
| 0.066176
|
| 15.7
| 2
| 0
| 0
| 1
| 0
| Retrieve
|
93
| ABELL 2142:[OHF95] 347
| 15h58m40.0s
| +26d58m41s
| G
| 19321
| 0.064448
|
| 15.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
94
| ABELL 2142:[OHF95] 351
| 15h58m55.9s
| +27d26m31s
| G
| 27042
| 0.090202
|
| 15.8
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
95
| IRAS 15556+2736
| 15h57m43.6s
| +27d27m55s
| G
| 9350
| 0.031188
|
| 16.1
| 4
| 0
| 4
| 2
| 0
| Retrieve
|
96
| ABELL 2142:[OHF95] 367
| 15h57m28.9s
| +27d25m46s
| G
| 26229
| 0.087490
|
| 16.1
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
97
| ABELL 2142:[OHF95] 259
| 15h59m22.9s
| +27d20m49s
| G
| 27146
| 0.090549
|
| 16.6
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
98
| ABELL 2142:[OHF95] 328
| 15h57m06.6s
| +27d07m10s
| G
| 20277
| 0.067637
|
| 16.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
99
| ABELL 2142:[OHF95] 372
| 15h57m36.8s
| +27d27m51s
| G
| 26790
| 0.089362
|
| 16.8
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
100
| ABELL 2142:[OHF95] 273
| 15h57m03.4s
| +27d18m14s
| G
| 28220
| 0.094132
|
| 16.8
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
101
| ABELL 2142:[OHF95] 330
| 15h58m31.7s
| +26d56m33s
| G
| 25607
| 0.085416
|
| 17.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
102
| ABELL 2142:[OHF95] 287
| 15h57m44.6s
| +27d29m26s
| G
| 26298
| 0.087721
|
| 17.4
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
103
| [HB89] 1557+272
| 15h59m22.2s
| +27d03m40s
| G
| 19374
| 0.064625
|
| 17.7
| 17
| 1
| 3
| 0
| 1
| Retrieve
|
104
| ABELL 2142:[OHF95] 366
| 15h57m08.9s
| +27d23m16s
| G
| 27985
| 0.093348
|
| 17.9
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
105
| ABELL 2142:[OHF95] 263
| 15h56m55.2s
| +27d12m52s
| G
| 27660
| 0.092264
|
| 18.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
106
| ABELL 2142:[OHF95] 267
| 15h56m53.9s
| +27d15m51s
| G
| >30000
| 0.152859
|
| 18.4
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
107
| ABELL 2142:[OHF95] 373
| 15h57m24.7s
| +27d28m19s
| G
| 29519
| 0.098465
|
| 18.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
108
| ABELL 2142:[OHF95] 292
| 15h58m01.1s
| +27d32m09s
| G
| 26880
| 0.089662
|
| 19.0
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
109
| PGC 056523
| 15h58m18.9s
| +27d32m42s
| G
| 9495
| 0.031672
|
| 19.2
| 2
| 0
| 0
| 0
| 1
| Retrieve
|
110
| PGC 056565
| 15h58m56.6s
| +27d30m40s
| G
| 27097
| 0.090386
|
| 19.4
| 2
| 0
| 0
| 0
| 1
| Retrieve
|
111
| ABELL 2142:[OHF95] 294
| 15h58m08.1s
| +27d32m59s
| G
| 27344
| 0.091210
|
| 19.6
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
112
| ABELL 2142:[OHF95] 270
| 15h56m49.0s
| +27d17m14s
| G
| 28589
| 0.095362
|
| 19.7
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
113
| ABELL 2142:[OHF95] 318
| 15h56m57.0s
| +27d03m00s
| G
| 27619
| 0.092127
|
| 20.5
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
114
| CGCG 167-008
| 15h58m34.8s
| +27d37m06s
| G
| 9379
| 0.031285
|
| 24.0
| 4
| 0
| 0
| 2
| 1
| Retrieve
|
115
| ABELL 2142:[OHF95] 376
| 15h57m00.6s
| +27d31m04s
| G
| 24652
| 0.082230
|
| 24.3
| 1
| 0
| 0
| 0
| 0
| Retrieve
|
116
| MRK 0492
| 15h58m43.7s
| +26d49m05s
| G
| 4267
| 0.014233
|
| 25.1
| 18
| 0
| 14
| 7
| 4
| Retrieve
|
Back to NED home