HTML-TableParser-0.38/0000755000040700000360000000000011012452157012462 5ustar djheadHTML-TableParser-0.38/Makefile.PL0000644000040700000360000000036010674762377014460 0ustar djheaduse strict; use warnings; use inc::Module::Install; name 'HTML-TableParser'; all_from 'lib/HTML/TableParser.pm'; requires 'HTML::Entities'; requires 'HTML::Parser' => 3.26; build_requires 'Test::More' => 0.32; auto_install; WriteAll; HTML-TableParser-0.38/README0000644000040700000360000000276510674762377013401 0ustar djheadNAME 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.38/META.yml0000644000040700000360000000065711012452125013736 0ustar djhead--- abstract: Extract data from an HTML table author: - Diab Jerius (djerius@cpan.org) build_requires: Test::More: 0.32 distribution_type: module generated_by: Module::Install version 0.68 license: gpl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.3.html version: 1.3 name: HTML-TableParser no_index: directory: - inc - t requires: HTML::Entities: 0 HTML::Parser: 3.26 version: 0.38 HTML-TableParser-0.38/Changes0000644000040700000360000000635411012447165013770 0ustar djheadRevision history for Perl extension HTML::TableParser. 0.38 Tue May 13 22:28:38 EDT 2008 - no code changes -- CPAN distribution had bad META.yml file 0.37 Fri Sep 21 11:52:34 EDT 2007 - incorrect setting of plans if Test::Pod::Coverage wasn't available - quiet inappropriate perlcritic warning 0.36 Thu Sep 20 09:30:35 EDT 2007 - add version to Table.pm to fix PAUSE indexer error 0.35 Wed Sep 19 21:22:22 EDT 2007 - fix test to work with Test::More 0.71 - reorganize to a more modern layout - new pod & perlcritic tests 0.34 Sat Sep 7 01:25:01 EDT 2002 - HTML::Parser v. 3.25 didn't handle croaks in callbacks correctly. 3.26 does; Makefile.PL was updated to require it. 0.33 Tue Sep 3 14:15:13 EDT 2002 - MANIFEST was out of date. oops. 0.32 Tue Sep 3 11:32:20 EDT 2002 - extra tags were not handled properly. it now croaks if it hits an extra tag. 0.31 Sat Apr 20 01:56:28 EDT 2002 - was using features of Test::More v0.32 and didn't specify a version in Makefile.PL, causing problems with earlier versions. Ooops. 0.3 Wed Apr 17 11:26:31 EDT 2002 - specification of ids and column names in matches has been extended and simplified. id and cols now may take arrayrefs of things to match. colre is deprecated. - matches can be made using literals, subroutines and qr// created regexps. the latter two are automatically recognized. - explicit exclusions and skipping of tables is now possible - improved docs (a bit) - decode_entitites was being called too late in fix_texts, so Trim was less than effectual. - added DecodeNBSP attribute to fix nbsp decoding issues. - callbacks for methods and classes can be turned off by assigning an undef value to the appropriate key in the table request. - the warn callback is also passed the line number now. this is an incompatible change in the API. 0.2 Wed Jan 30 19:54:14 EST 2002 - one could not use id=DEFAULT as a fall through if a column name match didn't work. in fact, one couldn't intersperse id's in a request list; they all had to be at the beginning. there's now a well defined order in how requests are processed. - fixing this uncovered another subtle bug. a header line was originally recognized only after finishing the first non-header line. this lead to the situation that if an embedded table was in the first non-header row, it would be matched against column name match requests before the enclosing table, because it would be completely parsed before the enclosing table's header was even recognized. to fix this, we finish off a header in the first non-header column if the previous row was a header and the current row isn't a header. - added an embedded table test in t/contents.t - format of comparison data was wrong. wanted embedded tab between columns, got character sequence '\t' - checking whether a request had been used was 99% foobared. 0.1 Wed Dec 12 17:12:22 EST 2001 - total rewrite. the only thing left of the old code is probably the header/row column&row spanning code. 0.01 Fri Dec 10 14:36:39 1999 - original version; created by h2xs 1.18 HTML-TableParser-0.38/THANKS0000644000040700000360000000010110674762377013412 0ustar djheadThanks to these folks for their assistance: G. Allen Morris III HTML-TableParser-0.38/MANIFEST0000644000040700000360000000233611012452132013610 0ustar djheadChangeLog Changes 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/AutoInstall.pm inc/Module/Install.pm inc/Module/Install/AutoInstall.pm inc/Module/Install/Base.pm inc/Module/Install/Can.pm inc/Module/Install/Fetch.pm inc/Module/Install/Include.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.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/perlcritic.t t/pod-coverage.t t/pod.t t/req_order.t tdata/end_table.html THANKS HTML-TableParser-0.38/t/0000755000040700000360000000000011012452157012725 5ustar djheadHTML-TableParser-0.38/t/contents.t0000644000040700000360000002077010674762377015002 0ustar djheaduse 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 defined @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.38/t/req_order.t0000644000040700000360000000157510674762377015131 0ustar djheaduse 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.38/t/class-01.t0000644000040700000360000000256510674762377014472 0ustar djheaduse 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.38/t/class.t0000644000040700000360000000067710674762377014256 0ustar djheaduse 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.38/t/end_table.t0000644000040700000360000000036510674762377015060 0ustar djheaduse 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.38/t/pod.t0000644000040700000360000000021410674762377013716 0ustar djhead#!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.38/t/counts.pl0000644000040700000360000000350410674762377014624 0ustar djheadour ( $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.38/t/00-load.t0000644000040700000360000000024010674762377014267 0ustar djhead#!perl -T use Test::More tests => 1; BEGIN { use_ok('HTML::TableParser'); } diag( "Testing HTML::TableParser $HTML::TableParser::VERSION, Perl $], $^X" ); HTML-TableParser-0.38/t/common.pl0000644000040700000360000000076710674762377014611 0ustar djheadsub 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.38/t/methods.t0000644000040700000360000000067410674762377014611 0ustar djheaduse 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.38/t/perlcritic.t0000644000040700000360000000032710674762377015301 0ustar djhead#!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.38/t/funcs.t0000644000040700000360000000031210674762377014251 0ustar djheaduse 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.38/t/pod-coverage.t0000644000040700000360000000034410674763755015514 0ustar djhead#!perl -T use Test::More; eval "use Test::Pod::Coverage 1.04"; if ( $@ ) { plan skip_all => "Test::Pod::Coverage 1.04 required for testing POD coverage"; } else { plan tests => 1; } pod_coverage_ok('HTML::TableParser'); HTML-TableParser-0.38/LICENSE0000644000040700000360000010451310674762377013520 0ustar djhead 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.38/lib/0000755000040700000360000000000011012452157013230 5ustar djheadHTML-TableParser-0.38/lib/HTML/0000755000040700000360000000000011012452157013774 5ustar djheadHTML-TableParser-0.38/lib/HTML/TableParser/0000755000040700000360000000000011012452157016200 5ustar djheadHTML-TableParser-0.38/lib/HTML/TableParser/Table.pm0000644000040700000360000003405111012452010017554 0ustar djheadpackage 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.38/lib/HTML/TableParser.pm0000644000040700000360000005325311012447200016537 0ustar djhead# --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; use strict; use warnings; use Carp; use HTML::Parser; use HTML::TableParser::Table; ## no critic ( ProhibitAccessOfPrivateData ) our @ISA = qw(HTML::Parser); our $VERSION = '0.38'; # 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 and
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 overriden 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.38/tdata/0000755000040700000360000000000011012452157013557 5ustar djheadHTML-TableParser-0.38/tdata/end_table.html0000644000040700000360000000027710674762377016415 0ustar djhead Too Many End Table Tags

Too Many End Table Tags

HTML-TableParser-0.38/data/0000755000040700000360000000000011012452157013373 5ustar djheadHTML-TableParser-0.38/data/ned.Chomp.data0000644000040700000360000004050011012452146016036 0ustar djhead1 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 RetrieveHTML-TableParser-0.38/data/table.Decode.data0000644000040700000360000000254011012452146016476 0ustar djheadh1 -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.2745HTML-TableParser-0.38/data/table2-1.Default.data0000644000040700000360000000254111012452147017121 0ustar djheadh33 -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.2745HTML-TableParser-0.38/data/table.Chomp.data0000644000040700000360000000254011012452146016361 0ustar djheadh1 -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.2745HTML-TableParser-0.38/data/table2.Chomp.data0000644000040700000360000000254211012452145016444 0ustar djhead 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.2745HTML-TableParser-0.38/data/screwy.html0000644000040700000360000000154010674762377015622 0ustar djhead 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.38/data/table2-1.hdr0000644000040700000360000000011111012452147015371 0ustar djheadmirror x0 y0 z0 p k rho0 theta0 az_mis el_mis l node z_f z_a rho_f rho_a HTML-TableParser-0.38/data/table2.hdr0000644000040700000360000000011311012452145015233 0ustar djheadSnookums x0 y0 z0 p k rho0 theta0 az_mis el_mis l node z_f z_a rho_f rho_a HTML-TableParser-0.38/data/table2.html0000644000040700000360000001663710674762377015474 0ustar djhead
Snookums x0 y0 z0 p k rho0 theta0 az_mis el_mis l node z_f z_a rho_f rho_a
mirror x0 y0 z0 p k rho0 theta0 az_mis el_mis l node z_f z_a rho_f rho_a
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.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
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.38/data/table.html0000644000040700000360000000727410674762377015407 0ustar djhead
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.38/data/table.Trim.data0000644000040700000360000000242011012452146016223 0ustar djheadh1 -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.2745HTML-TableParser-0.38/data/ned.Trim.data0000644000040700000360000002434211012452147015712 0ustar djhead1 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 RetrieveHTML-TableParser-0.38/data/ned.Decode.data0000644000040700000360000004401411012452147016160 0ustar djhead1 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.38/data/screwy.hdr0000644000040700000360000000012611012452145015402 0ustar djheadWidget A Widget B Snacks Sn 1 Snacks Sn 2 Prices 1 Prices 2 Prices 3 3.1 Prices 3 3.2 HTML-TableParser-0.38/data/screwy.Default.data0000644000040700000360000000016411012452145017123 0ustar djhead 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.38/data/ned.html0000644000040700000360000030125210674762377015057 0ustar djhead Your NED Search Results
Help | Comment | NED home

Searching NED within 30.0 arcmin of object "ABELL 2142"


116 object(s) found in NED.    Skyplot(first 100)

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 HTML-TableParser-0.38/data/table2.Trim.data0000644000040700000360000000242111012452145016305 0ustar djheadh1 -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.2745HTML-TableParser-0.38/data/table2.Decode.data0000644000040700000360000000254311012452145016562 0ustar djhead 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.2745HTML-TableParser-0.38/data/table2-1.Chomp.data0000644000040700000360000000254111012452147016603 0ustar djheadh33 -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.2745HTML-TableParser-0.38/data/ned.hdr0000644000040700000360000000043211012452147014636 0ustar djheadNo. 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.38/data/screwy.Chomp.data0000644000040700000360000000014411012452145016603 0ustar djhead 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.38/data/table2-1.Decode.data0000644000040700000360000000254111012452147016720 0ustar djheadh33 -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.2745HTML-TableParser-0.38/data/ned.Default.data0000644000040700000360000004401411012452146016360 0ustar djhead1 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.38/data/screwy.Decode.data0000644000040700000360000000016411012452145016722 0ustar djhead 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.38/data/table2-1.Trim.data0000644000040700000360000000242111012452147016445 0ustar djheadh33 -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.2745HTML-TableParser-0.38/data/table.Default.data0000644000040700000360000000254011012452146016677 0ustar djheadh1 -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.2745HTML-TableParser-0.38/data/table2.Default.data0000644000040700000360000000254311012452145016763 0ustar djhead 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.2745HTML-TableParser-0.38/data/screwy.Trim.data0000644000040700000360000000012211012452145016444 0ustar djheadBoth 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.1HTML-TableParser-0.38/data/table.hdr0000644000040700000360000000011111012452146015150 0ustar djheadmirror x0 y0 z0 p k rho0 theta0 az_mis el_mis l node z_f z_a rho_f rho_a HTML-TableParser-0.38/inc/0000755000040700000360000000000011012452157013233 5ustar djheadHTML-TableParser-0.38/inc/Module/0000755000040700000360000000000011012452157014460 5ustar djheadHTML-TableParser-0.38/inc/Module/Install.pm0000644000040700000360000001761111012452125016425 0ustar djhead#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.004; use strict 'vars'; use vars qw{$VERSION}; 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 = '0.68'; } # 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 } # 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 and (stat($0))[9] > time ) { die << "END_DIE"; Your installer $0 has a modification time in the future. This is known to create infinite loops in make. Please correct this, then run $0 again. END_DIE } use Cwd (); use File::Find (); use File::Path (); use FindBin; *inc::Module::Install::VERSION = *VERSION; @inc::Module::Install::ISA = __PACKAGE__; sub autoload { my $self = shift; my $who = $self->_caller; my $cwd = Cwd::cwd(); my $sym = "${who}::AUTOLOAD"; $sym->{$cwd} = sub { my $pwd = Cwd::cwd(); if ( my $code = $sym->{$pwd} ) { # delegate back to parent dirs goto &$code unless $cwd eq $pwd; } $$sym =~ /([^:]+)$/ or die "Cannot autoload $who - $sym"; unshift @_, ($self, $1); goto &{$self->can('call')} unless uc($1) eq $1; }; } sub import { my $class = shift; my $self = $class->new(@_); my $who = $self->_caller; unless ( -f $self->{file} ) { 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"}; } *{"${who}::AUTOLOAD"} = $self->autoload; $self->preload; # Unregister loader and worker packages so subdirs can use them again delete $INC{"$self->{file}"}; delete $INC{"$self->{path}.pm"}; } sub preload { my ($self) = @_; unless ( $self->{extensions} ) { $self->load_extensions( "$self->{prefix}/$self->{path}", $self ); } my @exts = @{$self->{extensions}}; unless ( @exts ) { my $admin = $self->{admin}; @exts = $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 ) { *{"${who}::$name"} = sub { ${"${who}::AUTOLOAD"} = "${who}::$name"; goto &{"${who}::AUTOLOAD"}; }; } } sub new { my ($class, %args) = @_; # ignore the prefix on extension modules built from top level. my $base_path = Cwd::abs_path($FindBin::Bin); unless ( Cwd::abs_path(Cwd::cwd()) 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"; 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) = @_; unless ( grep { lc $_ eq lc $self->{prefix} } @INC ) { unshift @INC, $self->{prefix}; } foreach my $rv ( $self->find_extensions($path) ) { my ($file, $pkg) = @{$rv}; next if $self->{pathnames}{$pkg}; local $@; my $new = eval { require $file; $pkg->can('new') }; unless ( $new ) { warn $@ if $@; next; } $self->{pathnames}{$pkg} = delete $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) ) { open PKGFILE, "<$subpath.pm" or die "find_extensions: Can't open $subpath.pm: $!"; my $in_pod = 0; while ( ) { $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; } } close PKGFILE; } push @found, [ $file, $pkg ]; }, $path ) if -d $path; @found; } sub _caller { my $depth = 0; my $call = caller($depth); while ( $call eq __PACKAGE__ ) { $depth++; $call = caller($depth); } return $call; } 1; HTML-TableParser-0.38/inc/Module/Install/0000755000040700000360000000000011012452157016066 5ustar djheadHTML-TableParser-0.38/inc/Module/Install/Include.pm0000644000040700000360000000101411012452125017776 0ustar djhead#line 1 package Module::Install::Include; use strict; use Module::Install::Base; use vars qw{$VERSION $ISCORE @ISA}; BEGIN { $VERSION = '0.68'; $ISCORE = 1; @ISA = qw{Module::Install::Base}; } sub include { shift()->admin->include(@_); } sub include_deps { shift()->admin->include_deps(@_); } sub auto_include { shift()->admin->auto_include(@_); } sub auto_include_deps { shift()->admin->auto_include_deps(@_); } sub auto_include_dependent_dists { shift()->admin->auto_include_dependent_dists(@_); } 1; HTML-TableParser-0.38/inc/Module/Install/Can.pm0000644000040700000360000000337411012452125017127 0ustar djhead#line 1 package Module::Install::Can; use strict; use Module::Install::Base; use Config (); ### This adds a 5.005 Perl version dependency. ### This is a bug and will be fixed. use File::Spec (); use ExtUtils::MakeMaker (); use vars qw{$VERSION $ISCORE @ISA}; BEGIN { $VERSION = '0.68'; $ISCORE = 1; @ISA = qw{Module::Install::Base}; } # 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}), '.') { my $abs = File::Spec->catfile($dir, $_[1]); return $abs if (-x $abs or $abs = MM->maybe_command($abs)); } return; } # 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 157 HTML-TableParser-0.38/inc/Module/Install/Base.pm0000644000040700000360000000203511012452125017271 0ustar djhead#line 1 package Module::Install::Base; $VERSION = '0.68'; # Suspend handler for "redefined" warnings BEGIN { my $w = $SIG{__WARN__}; $SIG{__WARN__} = sub { $w }; } ### This is the ONLY module that shouldn't have strict on # use strict; #line 41 sub new { my ($class, %args) = @_; foreach my $method ( qw(call load) ) { *{"$class\::$method"} = sub { shift()->_top->$method(@_); } unless defined &{"$class\::$method"}; } bless( \%args, $class ); } #line 61 sub AUTOLOAD { my $self = shift; local $@; my $autoload = eval { $self->_top->autoload } or return; goto &$autoload; } #line 76 sub _top { $_[0]->{_top} } #line 89 sub admin { $_[0]->_top->{admin} or Module::Install::Base::FakeAdmin->new; } sub is_admin { $_[0]->admin->VERSION; } sub DESTROY {} package Module::Install::Base::FakeAdmin; my $Fake; sub new { $Fake ||= bless(\@_, $_[0]) } sub AUTOLOAD {} sub DESTROY {} # Restore warning handler BEGIN { $SIG{__WARN__} = $SIG{__WARN__}->(); } 1; #line 138 HTML-TableParser-0.38/inc/Module/Install/Metadata.pm0000644000040700000360000002152711012452125020146 0ustar djhead#line 1 package Module::Install::Metadata; use strict 'vars'; use Module::Install::Base; use vars qw{$VERSION $ISCORE @ISA}; BEGIN { $VERSION = '0.68'; $ISCORE = 1; @ISA = qw{Module::Install::Base}; } my @scalar_keys = qw{ name module_name abstract author version license distribution_type perl_version tests installdirs }; my @tuple_keys = qw{ build_requires requires recommends bundles }; sub Meta { shift } sub Meta_ScalarKeys { @scalar_keys } sub Meta_TupleKeys { @tuple_keys } 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 (@tuple_keys) { *$key = sub { my $self = shift; return $self->{values}{$key} unless @_; my @rv; while (@_) { my $module = shift or last; my $version = shift || 0; if ( $module eq 'perl' ) { $version =~ s{^(\d+)\.(\d+)\.(\d+)} {$1 + $2/1_000 + $3/1_000_000}e; $self->perl_version($version); next; } my $rv = [ $module, $version ]; push @rv, $rv; } push @{ $self->{values}{$key} }, @rv; @rv; }; } # configure_requires is currently a null-op sub configure_requires { 1 } # 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 sign { my $self = shift; return $self->{'values'}{'sign'} if defined wantarray and ! @_; $self->{'values'}{'sign'} = ( @_ ? $_[0] : 1 ); return $self; } sub dynamic_config { my $self = shift; unless ( @_ ) { warn "You MUST provide an explicit true/false value to dynamic_config, skipping\n"; return $self; } $self->{'values'}{'dynamic_config'} = $_[0] ? 1 : 0; return $self; } 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; die "all_from: cannot find $file from $name" unless -e $file; } $self->version_from($file) unless $self->version; $self->perl_version_from($file) unless $self->perl_version; # The remaining probes read from POD sections; if the file # has an accompanying .pod, use that instead my $pod = $file; if ( $pod =~ s/\.pm$/.pod/i and -e $pod ) { $file = $pod; } $self->author_from($file) unless $self->author; $self->license_from($file) unless $self->license; $self->abstract_from($file) unless $self->abstract; } 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', 0 ); require YAML; my $data = YAML::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 { my ( $self, $file ) = @_; require ExtUtils::MM_Unix; $self->version( ExtUtils::MM_Unix->parse_version($file) ); } sub abstract_from { my ( $self, $file ) = @_; require ExtUtils::MM_Unix; $self->abstract( bless( { DISTNAME => $self->name }, 'ExtUtils::MM_Unix' )->parse_abstract($file) ); } sub _slurp { my ( $self, $file ) = @_; local *FH; open FH, "< $file" or die "Cannot open $file.pod: $!"; do { local $/; }; } sub perl_version_from { my ( $self, $file ) = @_; if ( $self->_slurp($file) =~ m/ ^ use \s* v? ([\d_\.]+) \s* ; /ixms ) { my $v = $1; $v =~ s{_}{}g; $self->perl_version($1); } else { warn "Cannot determine perl version info from $file\n"; return; } } sub author_from { my ( $self, $file ) = @_; my $content = $self->_slurp($file); 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; $author =~ s{E}{<}g; $author =~ s{E}{>}g; $self->author($author); } else { warn "Cannot determine author info from $file\n"; } } sub license_from { my ( $self, $file ) = @_; if ( $self->_slurp($file) =~ m/ ( =head \d \s+ (?:licen[cs]e|licensing|copyright|legal)\b .*? ) (=head\\d.*|=cut.*|) \z /ixms ) { my $license_text = $1; my @phrases = ( 'under the same (?:terms|license) as perl itself' => 'perl', 1, 'GNU public license' => 'gpl', 1, 'GNU lesser public license' => 'gpl', 1, 'BSD license' => 'bsd', 1, 'Artistic license' => 'artistic', 1, 'GPL' => 'gpl', 1, 'LGPL' => 'lgpl', 1, 'BSD' => 'bsd', 1, 'Artistic' => 'artistic', 1, 'MIT' => 'mit', 1, 'proprietary' => 'proprietary', 0, ); while ( my ($pattern, $license, $osi) = splice(@phrases, 0, 3) ) { $pattern =~ s{\s+}{\\s+}g; if ( $license_text =~ /\b$pattern\b/i ) { if ( $osi and $license_text =~ /All rights reserved/i ) { warn "LEGAL WARNING: 'All rights reserved' may invalidate Open Source licenses. Consider removing it."; } $self->license($license); return 1; } } } warn "Cannot determine license info from $file\n"; return 'unknown'; } 1; HTML-TableParser-0.38/inc/Module/Install/Fetch.pm0000644000040700000360000000463011012452125017453 0ustar djhead#line 1 package Module::Install::Fetch; use strict; use Module::Install::Base; use vars qw{$VERSION $ISCORE @ISA}; BEGIN { $VERSION = '0.68'; $ISCORE = 1; @ISA = qw{Module::Install::Base}; } 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.38/inc/Module/Install/Makefile.pm0000644000040700000360000001351111012452125020135 0ustar djhead#line 1 package Module::Install::Makefile; use strict 'vars'; use Module::Install::Base; use ExtUtils::MakeMaker (); use vars qw{$VERSION $ISCORE @ISA}; BEGIN { $VERSION = '0.68'; $ISCORE = 1; @ISA = qw{Module::Install::Base}; } 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, always use defaults if ( $ENV{AUTOMATED_TESTING} and ! $ENV{PERL_MM_USE_DEFAULT} ) { local $ENV{PERL_MM_USE_DEFAULT} = 1; goto &ExtUtils::MakeMaker::prompt; } else { goto &ExtUtils::MakeMaker::prompt; } } sub makemaker_args { my $self = shift; my $args = ($self->{makemaker_args} ||= {}); %$args = ( %$args, @_ ) if @_; $args; } # For mm args that take multiple space-seperated args, # append an argument to the current list. sub makemaker_append { my $self = sShift; 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 ); } my %test_dir = (); sub _wanted_t { /\.t$/ and -f $_ and $test_dir{$File::Find::dir} = 1; } sub tests_recursive { my $self = shift; if ( $self->tests ) { die "tests_recursive will not work if tests are already defined"; } my $dir = shift || 't'; unless ( -d $dir ) { die "tests_recursive dir '$dir' does not exist"; } require File::Find; %test_dir = (); File::Find::find( \&_wanted_t, $dir ); $self->tests( join ' ', map { "$_/*.t" } sort keys %test_dir ); } sub write { my $self = shift; die "&Makefile->write() takes no arguments\n" if @_; my $args = $self->makemaker_args; $args->{DISTNAME} = $self->name; $args->{NAME} = $self->module_name || $self->name || $self->determine_NAME($args); $args->{VERSION} = $self->version || $self->determine_VERSION($args); $args->{NAME} =~ s/-/::/g; if ( $self->tests ) { $args->{test} = { TESTS => $self->tests }; } if ($] >= 5.005) { $args->{ABSTRACT} = $self->abstract; $args->{AUTHOR} = $self->author; } if ( eval($ExtUtils::MakeMaker::VERSION) >= 6.10 ) { $args->{NO_META} = 1; } if ( eval($ExtUtils::MakeMaker::VERSION) > 6.17 and $self->sign ) { $args->{SIGN} = 1; } unless ( $self->is_admin ) { delete $args->{SIGN}; } # merge both kinds of requires into prereq_pm my $prereq = ($args->{PREREQ_PM} ||= {}); %$prereq = ( %$prereq, map { @$_ } map { @$_ } grep $_, ($self->build_requires, $self->requires) ); # merge both kinds of requires into prereq_pm my $subdirs = ($args->{DIR} ||= []); if ($self->bundles) { foreach my $bundle (@{ $self->bundles }) { my ($file, $dir) = @$bundle; push @$subdirs, $dir if -d $dir; delete $prereq->{$file}; } } 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"; } $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)) { $args{dist} = $preop; } 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: $!"; my $makefile = do { local $/; }; close MAKEFILE or die $!; $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; open MAKEFILE, "> $makefile_name" or die "fix_up_makefile: Couldn't open $makefile_name: $!"; 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 363 HTML-TableParser-0.38/inc/Module/Install/AutoInstall.pm0000644000040700000360000000227211012452125020661 0ustar djhead#line 1 package Module::Install::AutoInstall; use strict; use Module::Install::Base; use vars qw{$VERSION $ISCORE @ISA}; BEGIN { $VERSION = '0.68'; $ISCORE = 1; @ISA = qw{Module::Install::Base}; } sub AutoInstall { $_[0] } sub run { my $self = shift; $self->auto_install_now(@_); } sub write { my $self = shift; $self->auto_install(@_); } sub auto_install { my $self = shift; return if $self->{done}++; # Flatten array of arrays into a single array my @core = map @$_, map @$_, grep ref, $self->build_requires, $self->requires; my @config = @_; # We'll need Module::AutoInstall $self->include('Module::AutoInstall'); require Module::AutoInstall; Module::AutoInstall->import( (@config ? (-config => \@config) : ()), (@core ? (-core => \@core) : ()), $self->features, ); $self->makemaker_args( Module::AutoInstall::_make_args() ); my $class = ref($self); $self->postamble( "# --- $class section:\n" . Module::AutoInstall::postamble() ); } sub auto_install_now { my $self = shift; $self->auto_install(@_); Module::AutoInstall::do_install(); } 1; HTML-TableParser-0.38/inc/Module/Install/Win32.pm0000644000040700000360000000341611012452125017325 0ustar djhead#line 1 package Module::Install::Win32; use strict; use Module::Install::Base; use vars qw{$VERSION $ISCORE @ISA}; BEGIN { $VERSION = '0.68'; $ISCORE = 1; @ISA = qw{Module::Install::Base}; } # 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, ); if (!$rv) { die <<'END_MESSAGE'; ------------------------------------------------------------------------------- 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.38/inc/Module/Install/WriteAll.pm0000644000040700000360000000162411012452125020145 0ustar djhead#line 1 package Module::Install::WriteAll; use strict; use Module::Install::Base; use vars qw{$VERSION $ISCORE @ISA}; BEGIN { $VERSION = '0.68'; $ISCORE = 1; @ISA = qw{Module::Install::Base}; } sub WriteAll { my $self = shift; my %args = ( meta => 1, sign => 0, inline => 0, check_nmake => 1, @_ ); $self->sign(1) if $args{sign}; $self->Meta->write if $args{meta}; $self->admin->WriteAll(%args) if $self->is_admin; if ( $0 =~ /Build.PL$/i ) { $self->Build->write; } else { $self->check_nmake if $args{check_nmake}; unless ( $self->makemaker_args->{'PL_FILES'} ) { $self->makemaker_args( PL_FILES => {} ); } if ($args{inline}) { $self->Inline->write; } else { $self->Makefile->write; } } } 1; HTML-TableParser-0.38/inc/Module/AutoInstall.pm0000644000040700000360000005077211012452125017263 0ustar djhead#line 1 package Module::AutoInstall; use strict; use Cwd (); use ExtUtils::MakeMaker (); use vars qw{$VERSION}; BEGIN { $VERSION = '1.03'; } # special map on pre-defined feature sets my %FeatureMap = ( '' => 'Core Features', # XXX: deprecated '-core' => 'Core Features', ); # various lexical flags my ( @Missing, @Existing, %DisabledTests, $UnderCPAN, $HasCPANPLUS ); my ( $Config, $CheckOnly, $SkipInstall, $AcceptDefault, $TestOnly ); my ( $PostambleActions, $PostambleUsed ); # See if it's a testing or non-interactive session _accept_default( $ENV{AUTOMATED_TESTING} or ! -t STDIN ); _init(); sub _accept_default { $AcceptDefault = shift; } sub missing_modules { return @Missing; } sub do_install { __PACKAGE__->install( [ $Config ? ( UNIVERSAL::isa( $Config, 'HASH' ) ? %{$Config} : @{$Config} ) : () ], @Missing, ); } # initialize various flags, and/or perform install sub _init { foreach my $arg ( @ARGV, split( /[\s\t]+/, $ENV{PERL_AUTOINSTALL} || $ENV{PERL_EXTUTILS_AUTOINSTALL} || '' ) ) { if ( $arg =~ /^--config=(.*)$/ ) { $Config = [ split( ',', $1 ) ]; } elsif ( $arg =~ /^--installdeps=(.*)$/ ) { __PACKAGE__->install( $Config, @Missing = split( /,/, $1 ) ); exit 0; } elsif ( $arg =~ /^--default(?:deps)?$/ ) { $AcceptDefault = 1; } elsif ( $arg =~ /^--check(?:deps)?$/ ) { $CheckOnly = 1; } elsif ( $arg =~ /^--skip(?:deps)?$/ ) { $SkipInstall = 1; } elsif ( $arg =~ /^--test(?:only)?$/ ) { $TestOnly = 1; } } } # overrides MakeMaker's prompt() to automatically accept the default choice sub _prompt { goto &ExtUtils::MakeMaker::prompt unless $AcceptDefault; my ( $prompt, $default ) = @_; my $y = ( $default =~ /^[Yy]/ ); print $prompt, ' [', ( $y ? 'Y' : 'y' ), '/', ( $y ? 'n' : 'N' ), '] '; print "$default\n"; return $default; } # the workhorse sub import { my $class = shift; my @args = @_ or return; my $core_all; print "*** $class version " . $class->VERSION . "\n"; print "*** Checking for Perl dependencies...\n"; my $cwd = Cwd::cwd(); $Config = []; my $maxlen = length( ( sort { length($b) <=> length($a) } grep { /^[^\-]/ } map { ref($_) ? ( ( ref($_) eq 'HASH' ) ? keys(%$_) : @{$_} ) : '' } map { +{@args}->{$_} } grep { /^[^\-]/ or /^-core$/i } keys %{ +{@args} } )[0] ); while ( my ( $feature, $modules ) = splice( @args, 0, 2 ) ) { my ( @required, @tests, @skiptests ); my $default = 1; my $conflict = 0; if ( $feature =~ m/^-(\w+)$/ ) { my $option = lc($1); # check for a newer version of myself _update_to( $modules, @_ ) and return if $option eq 'version'; # sets CPAN configuration options $Config = $modules if $option eq 'config'; # promote every features to core status $core_all = ( $modules =~ /^all$/i ) and next if $option eq 'core'; next unless $option eq 'core'; } print "[" . ( $FeatureMap{ lc($feature) } || $feature ) . "]\n"; $modules = [ %{$modules} ] if UNIVERSAL::isa( $modules, 'HASH' ); unshift @$modules, -default => &{ shift(@$modules) } if ( ref( $modules->[0] ) eq 'CODE' ); # XXX: bugward combatability while ( my ( $mod, $arg ) = splice( @$modules, 0, 2 ) ) { if ( $mod =~ m/^-(\w+)$/ ) { my $option = lc($1); $default = $arg if ( $option eq 'default' ); $conflict = $arg if ( $option eq 'conflict' ); @tests = @{$arg} if ( $option eq 'tests' ); @skiptests = @{$arg} if ( $option eq 'skiptests' ); next; } printf( "- %-${maxlen}s ...", $mod ); if ( $arg and $arg =~ /^\D/ ) { unshift @$modules, $arg; $arg = 0; } # XXX: check for conflicts and uninstalls(!) them. if ( defined( my $cur = _version_check( _load($mod), $arg ||= 0 ) ) ) { print "loaded. ($cur" . ( $arg ? " >= $arg" : '' ) . ")\n"; push @Existing, $mod => $arg; $DisabledTests{$_} = 1 for map { glob($_) } @skiptests; } else { print "missing." . ( $arg ? " (would need $arg)" : '' ) . "\n"; push @required, $mod => $arg; } } next unless @required; my $mandatory = ( $feature eq '-core' or $core_all ); if ( !$SkipInstall and ( $CheckOnly or _prompt( qq{==> Auto-install the } . ( @required / 2 ) . ( $mandatory ? ' mandatory' : ' optional' ) . qq{ module(s) from CPAN?}, $default ? 'y' : 'n', ) =~ /^[Yy]/ ) ) { push( @Missing, @required ); $DisabledTests{$_} = 1 for map { glob($_) } @skiptests; } elsif ( !$SkipInstall and $default and $mandatory and _prompt( qq{==> The module(s) are mandatory! Really skip?}, 'n', ) =~ /^[Nn]/ ) { push( @Missing, @required ); $DisabledTests{$_} = 1 for map { glob($_) } @skiptests; } else { $DisabledTests{$_} = 1 for map { glob($_) } @tests; } } $UnderCPAN = _check_lock(); # check for $UnderCPAN if ( @Missing and not( $CheckOnly or $UnderCPAN ) ) { require Config; print "*** Dependencies will be installed the next time you type '$Config::Config{make}'.\n"; # make an educated guess of whether we'll need root permission. print " (You may need to do that as the 'root' user.)\n" if eval '$>'; } print "*** $class configuration finished.\n"; chdir $cwd; # import to main:: no strict 'refs'; *{'main::WriteMakefile'} = \&Write if caller(0) eq 'main'; } # Check to see if we are currently running under CPAN.pm and/or CPANPLUS; # if we are, then we simply let it taking care of our dependencies sub _check_lock { return unless @Missing; if ($ENV{PERL5_CPANPLUS_IS_RUNNING}) { print <<'END_MESSAGE'; *** Since we're running under CPANPLUS, I'll just let it take care of the dependency's installation later. END_MESSAGE return 1; } _load_cpan(); # Find the CPAN lock-file my $lock = MM->catfile( $CPAN::Config->{cpan_home}, ".lock" ); return unless -f $lock; # Check the lock local *LOCK; return unless open(LOCK, $lock); if ( ( $^O eq 'MSWin32' ? _under_cpan() : == getppid() ) and ( $CPAN::Config->{prerequisites_policy} || '' ) ne 'ignore' ) { print <<'END_MESSAGE'; *** Since we're running under CPAN, I'll just let it take care of the dependency's installation later. END_MESSAGE return 1; } close LOCK; return; } sub install { my $class = shift; my $i; # used below to strip leading '-' from config keys my @config = ( map { s/^-// if ++$i; $_ } @{ +shift } ); my ( @modules, @installed ); while ( my ( $pkg, $ver ) = splice( @_, 0, 2 ) ) { # grep out those already installed if ( defined( _version_check( _load($pkg), $ver ) ) ) { push @installed, $pkg; } else { push @modules, $pkg, $ver; } } return @installed unless @modules; # nothing to do return @installed if _check_lock(); # defer to the CPAN shell print "*** Installing dependencies...\n"; return unless _connected_to('cpan.org'); my %args = @config; my %failed; local *FAILED; if ( $args{do_once} and open( FAILED, '.#autoinstall.failed' ) ) { while () { chomp; $failed{$_}++ } close FAILED; my @newmod; while ( my ( $k, $v ) = splice( @modules, 0, 2 ) ) { push @newmod, ( $k => $v ) unless $failed{$k}; } @modules = @newmod; } if ( _has_cpanplus() ) { _install_cpanplus( \@modules, \@config ); } else { _install_cpan( \@modules, \@config ); } print "*** $class installation finished.\n"; # see if we have successfully installed them while ( my ( $pkg, $ver ) = splice( @modules, 0, 2 ) ) { if ( defined( _version_check( _load($pkg), $ver ) ) ) { push @installed, $pkg; } elsif ( $args{do_once} and open( FAILED, '>> .#autoinstall.failed' ) ) { print FAILED "$pkg\n"; } } close FAILED if $args{do_once}; return @installed; } sub _install_cpanplus { my @modules = @{ +shift }; my @config = _cpanplus_config( @{ +shift } ); my $installed = 0; require CPANPLUS::Backend; my $cp = CPANPLUS::Backend->new; my $conf = $cp->configure_object; return unless $conf->can('conf') # 0.05x+ with "sudo" support or _can_write($conf->_get_build('base')); # 0.04x # if we're root, set UNINST=1 to avoid trouble unless user asked for it. my $makeflags = $conf->get_conf('makeflags') || ''; if ( UNIVERSAL::isa( $makeflags, 'HASH' ) ) { # 0.03+ uses a hashref here $makeflags->{UNINST} = 1 unless exists $makeflags->{UNINST}; } else { # 0.02 and below uses a scalar $makeflags = join( ' ', split( ' ', $makeflags ), 'UNINST=1' ) if ( $makeflags !~ /\bUNINST\b/ and eval qq{ $> eq '0' } ); } $conf->set_conf( makeflags => $makeflags ); $conf->set_conf( prereqs => 1 ); while ( my ( $key, $val ) = splice( @config, 0, 2 ) ) { $conf->set_conf( $key, $val ); } my $modtree = $cp->module_tree; while ( my ( $pkg, $ver ) = splice( @modules, 0, 2 ) ) { print "*** Installing $pkg...\n"; MY::preinstall( $pkg, $ver ) or next if defined &MY::preinstall; my $success; my $obj = $modtree->{$pkg}; if ( $obj and defined( _version_check( $obj->{version}, $ver ) ) ) { my $pathname = $pkg; $pathname =~ s/::/\\W/; foreach my $inc ( grep { m/$pathname.pm/i } keys(%INC) ) { delete $INC{$inc}; } my $rv = $cp->install( modules => [ $obj->{module} ] ); if ( $rv and ( $rv->{ $obj->{module} } or $rv->{ok} ) ) { print "*** $pkg successfully installed.\n"; $success = 1; } else { print "*** $pkg installation cancelled.\n"; $success = 0; } $installed += $success; } else { print << "."; *** Could not find a version $ver or above for $pkg; skipping. . } MY::postinstall( $pkg, $ver, $success ) if defined &MY::postinstall; } return $installed; } sub _cpanplus_config { my @config = (); while ( @_ ) { my ($key, $value) = (shift(), shift()); if ( $key eq 'prerequisites_policy' ) { if ( $value eq 'follow' ) { $value = CPANPLUS::Internals::Constants::PREREQ_INSTALL(); } elsif ( $value eq 'ask' ) { $value = CPANPLUS::Internals::Constants::PREREQ_ASK(); } elsif ( $value eq 'ignore' ) { $value = CPANPLUS::Internals::Constants::PREREQ_IGNORE(); } else { die "*** Cannot convert option $key = '$value' to CPANPLUS version.\n"; } } else { die "*** Cannot convert option $key to CPANPLUS version.\n"; } } return @config; } sub _install_cpan { my @modules = @{ +shift }; my @config = @{ +shift }; my $installed = 0; my %args; _load_cpan(); require Config; if (CPAN->VERSION < 1.80) { # no "sudo" support, probe for writableness return unless _can_write( MM->catfile( $CPAN::Config->{cpan_home}, 'sources' ) ) and _can_write( $Config::Config{sitelib} ); } # if we're root, set UNINST=1 to avoid trouble unless user asked for it. my $makeflags = $CPAN::Config->{make_install_arg} || ''; $CPAN::Config->{make_install_arg} = join( ' ', split( ' ', $makeflags ), 'UNINST=1' ) if ( $makeflags !~ /\bUNINST\b/ and eval qq{ $> eq '0' } ); # don't show start-up info $CPAN::Config->{inhibit_startup_message} = 1; # set additional options while ( my ( $opt, $arg ) = splice( @config, 0, 2 ) ) { ( $args{$opt} = $arg, next ) if $opt =~ /^force$/; # pseudo-option $CPAN::Config->{$opt} = $arg; } local $CPAN::Config->{prerequisites_policy} = 'follow'; while ( my ( $pkg, $ver ) = splice( @modules, 0, 2 ) ) { MY::preinstall( $pkg, $ver ) or next if defined &MY::preinstall; print "*** Installing $pkg...\n"; my $obj = CPAN::Shell->expand( Module => $pkg ); my $success = 0; if ( $obj and defined( _version_check( $obj->cpan_version, $ver ) ) ) { my $pathname = $pkg; $pathname =~ s/::/\\W/; foreach my $inc ( grep { m/$pathname.pm/i } keys(%INC) ) { delete $INC{$inc}; } my $rv = $args{force} ? CPAN::Shell->force( install => $pkg ) : CPAN::Shell->install($pkg); $rv ||= eval { $CPAN::META->instance( 'CPAN::Distribution', $obj->cpan_file, ) ->{install} if $CPAN::META; }; if ( $rv eq 'YES' ) { print "*** $pkg successfully installed.\n"; $success = 1; } else { print "*** $pkg installation failed.\n"; $success = 0; } $installed += $success; } else { print << "."; *** Could not find a version $ver or above for $pkg; skipping. . } MY::postinstall( $pkg, $ver, $success ) if defined &MY::postinstall; } return $installed; } sub _has_cpanplus { return ( $HasCPANPLUS = ( $INC{'CPANPLUS/Config.pm'} or _load('CPANPLUS::Shell::Default') ) ); } # make guesses on whether we're under the CPAN installation directory sub _under_cpan { require Cwd; require File::Spec; my $cwd = File::Spec->canonpath( Cwd::cwd() ); my $cpan = File::Spec->canonpath( $CPAN::Config->{cpan_home} ); return ( index( $cwd, $cpan ) > -1 ); } sub _update_to { my $class = __PACKAGE__; my $ver = shift; return if defined( _version_check( _load($class), $ver ) ); # no need to upgrade if ( _prompt( "==> A newer version of $class ($ver) is required. Install?", 'y' ) =~ /^[Nn]/ ) { die "*** Please install $class $ver manually.\n"; } print << "."; *** Trying to fetch it from CPAN... . # install ourselves _load($class) and return $class->import(@_) if $class->install( [], $class, $ver ); print << '.'; exit 1; *** Cannot bootstrap myself. :-( Installation terminated. . } # check if we're connected to some host, using inet_aton sub _connected_to { my $site = shift; return ( ( _load('Socket') and Socket::inet_aton($site) ) or _prompt( qq( *** Your host cannot resolve the domain name '$site', which probably means the Internet connections are unavailable. ==> Should we try to install the required module(s) anyway?), 'n' ) =~ /^[Yy]/ ); } # check if a directory is writable; may create it on demand sub _can_write { my $path = shift; mkdir( $path, 0755 ) unless -e $path; return 1 if -w $path; print << "."; *** You are not allowed to write to the directory '$path'; the installation may fail due to insufficient permissions. . if ( eval '$>' and lc(`sudo -V`) =~ /version/ and _prompt( qq( ==> Should we try to re-execute the autoinstall process with 'sudo'?), ((-t STDIN) ? 'y' : 'n') ) =~ /^[Yy]/ ) { # try to bootstrap ourselves from sudo print << "."; *** Trying to re-execute the autoinstall process with 'sudo'... . my $missing = join( ',', @Missing ); my $config = join( ',', UNIVERSAL::isa( $Config, 'HASH' ) ? %{$Config} : @{$Config} ) if $Config; return unless system( 'sudo', $^X, $0, "--config=$config", "--installdeps=$missing" ); print << "."; *** The 'sudo' command exited with error! Resuming... . } return _prompt( qq( ==> Should we try to install the required module(s) anyway?), 'n' ) =~ /^[Yy]/; } # load a module and return the version it reports sub _load { my $mod = pop; # class/instance doesn't matter my $file = $mod; $file =~ s|::|/|g; $file .= '.pm'; local $@; return eval { require $file; $mod->VERSION } || ( $@ ? undef: 0 ); } # Load CPAN.pm and it's configuration sub _load_cpan { return if $CPAN::VERSION; require CPAN; if ( $CPAN::HandleConfig::VERSION ) { # Newer versions of CPAN have a HandleConfig module CPAN::HandleConfig->load; } else { # Older versions had the load method in Config directly CPAN::Config->load; } } # compare two versions, either use Sort::Versions or plain comparison sub _version_check { my ( $cur, $min ) = @_; return unless defined $cur; $cur =~ s/\s+$//; # check for version numbers that are not in decimal format if ( ref($cur) or ref($min) or $cur =~ /v|\..*\./ or $min =~ /v|\..*\./ ) { if ( ( $version::VERSION or defined( _load('version') )) and version->can('new') ) { # use version.pm if it is installed. return ( ( version->new($cur) >= version->new($min) ) ? $cur : undef ); } elsif ( $Sort::Versions::VERSION or defined( _load('Sort::Versions') ) ) { # use Sort::Versions as the sorting algorithm for a.b.c versions return ( ( Sort::Versions::versioncmp( $cur, $min ) != -1 ) ? $cur : undef ); } warn "Cannot reliably compare non-decimal formatted versions.\n" . "Please install version.pm or Sort::Versions.\n"; } # plain comparison local $^W = 0; # shuts off 'not numeric' bugs return ( $cur >= $min ? $cur : undef ); } # nothing; this usage is deprecated. sub main::PREREQ_PM { return {}; } sub _make_args { my %args = @_; $args{PREREQ_PM} = { %{ $args{PREREQ_PM} || {} }, @Existing, @Missing } if $UnderCPAN or $TestOnly; if ( $args{EXE_FILES} and -e 'MANIFEST' ) { require ExtUtils::Manifest; my $manifest = ExtUtils::Manifest::maniread('MANIFEST'); $args{EXE_FILES} = [ grep { exists $manifest->{$_} } @{ $args{EXE_FILES} } ]; } $args{test}{TESTS} ||= 't/*.t'; $args{test}{TESTS} = join( ' ', grep { !exists( $DisabledTests{$_} ) } map { glob($_) } split( /\s+/, $args{test}{TESTS} ) ); my $missing = join( ',', @Missing ); my $config = join( ',', UNIVERSAL::isa( $Config, 'HASH' ) ? %{$Config} : @{$Config} ) if $Config; $PostambleActions = ( $missing ? "\$(PERL) $0 --config=$config --installdeps=$missing" : "\$(NOECHO) \$(NOOP)" ); return %args; } # a wrapper to ExtUtils::MakeMaker::WriteMakefile sub Write { require Carp; Carp::croak "WriteMakefile: Need even number of args" if @_ % 2; if ($CheckOnly) { print << "."; *** Makefile not written in check-only mode. . return; } my %args = _make_args(@_); no strict 'refs'; $PostambleUsed = 0; local *MY::postamble = \&postamble unless defined &MY::postamble; ExtUtils::MakeMaker::WriteMakefile(%args); print << "." unless $PostambleUsed; *** WARNING: Makefile written with customized MY::postamble() without including contents from Module::AutoInstall::postamble() -- auto installation features disabled. Please contact the author. . return 1; } sub postamble { $PostambleUsed = 1; return << "."; config :: installdeps \t\$(NOECHO) \$(NOOP) checkdeps :: \t\$(PERL) $0 --checkdeps installdeps :: \t$PostambleActions . } 1; __END__ #line 1003 HTML-TableParser-0.38/ChangeLog0000644000040700000360000002323210674764246014260 0ustar djhead2007-09-21 Diab Jerius Tag: 0.37 2007-09-21 11:50 -0400 djerius (3a78dd44540c [tip]) * t/pod-coverage.t: incorrect setting of plans if Test::Pod::Coverage wasn't available 2007-09-21 11:49 -0400 djerius (3783855a2529) * lib/HTML/TableParser.pm, lib/HTML/TableParser/Table.pm: quiet inappropriate perlcritic warning 2007-09-20 09:32 -0400 djerius (5319a84f952d) * .hgtags: Added tag 0.36 for changeset 41f15244f68e 2007-09-20 09:32 -0400 djerius (41f15244f68e [0.36]) * ChangeLog, Changes: update for release 2007-09-20 09:30 -0400 djerius (192398e71e2e) * lib/HTML/TableParser.pm, lib/HTML/TableParser/Table.pm: add version to Table.pm to fix PAUSE indexer error 2007-09-19 21:26 -0400 djerius (91a53eaf66e1) * .hgtags: Added tag 0.35 for changeset 2bdac628534b 2007-09-19 21:26 -0400 djerius (2bdac628534b [0.35]) * ChangeLog, Changes, lib/HTML/TableParser.pm: update for release 2007-09-19 21:21 -0400 djerius (2856b191708a) * Makefile.PL: switch to Module::Install 2007-09-19 21:21 -0400 djerius (eae5f8ad6b1c) * MANIFEST.SKIP: more cruft to ignore 2007-09-19 21:20 -0400 djerius (748e7437cd7a) * LICENSE: updated to GPL3 2007-09-19 21:20 -0400 djerius (97709599c2ee) * MANIFEST: no longer necessary 2007-09-19 21:19 -0400 djerius (628bc9e0d4a1) * README: updated to GPL3 2007-09-19 21:18 -0400 djerius (df8f9fd02b7f) * TableParser.pm, lib/HTML/TableParser.pm, lib/HTML/TableParser/Table.pm: separate modules into separate files. rename private methods to satisfy pod-coverage 2007-09-19 21:12 -0400 djerius (0cba157ce5f9) * t/00-load.t, t/perlcritic.t, t/pod-coverage.t, t/pod.t: add new tests for pod and perlcritic 2007-09-19 21:12 -0400 djerius (c95a01dc6397) * t/contents.t: fix to work with Test::More version 0.71 2007-09-19 21:46 +0000 dj (f60fb810ce45) * ChangeLog: 2007-09-19 21:46:25 by dj added ChangeLog 2007-09-19 17:47 -0400 djerius (8a0299e24612) * .hgtags: Added tag V0_34 for changeset 453b953f2d9f 2002-09-07 05:32 +0000 dj (453b953f2d9f [V0_34]) * Changes, Makefile.PL, TableParser.pm: 2002-09-07 05:32:07 by dj requires HTML::Parser 3.26 which fixes callback bug in 3.25 2007-09-19 17:47 -0400 djerius (478bb87c1f1d) * .hgtags: Added tag V0_33 for changeset c0564fdb1ac8 2002-09-03 18:35 +0000 dj (c0564fdb1ac8 [V0_33]) * Changes, TableParser.pm: 2002-09-03 18:35:58 by dj 2007-09-19 17:47 -0400 djerius (0f8473cd7ff7) * .hgtags: Added tag V0_32 for changeset 4956937bff5b 2002-09-03 18:11 +0000 dj (4956937bff5b [V0_32]) * MANIFEST, TableParser.pm: 2002-09-03 18:11:19 by dj 2002-09-03 15:36 +0000 dj (836e5206bc16) * Changes, t/end_table.t, tdata/end_table.html: 2002-09-03 15:36:54 by dj new tests for extra tag 2002-09-03 15:36 +0000 dj (2e6fff08352c) * TableParser.pm: 2002-09-03 15:36:39 by dj extra tags were not handled properly. it now croaks if it hits an extra tag. 2007-09-19 17:47 -0400 djerius (e4b2f2607c8d) * .hgtags: Added tag V0_31 for changeset cdacedc7dc1a 2002-04-20 06:14 +0000 dj (cdacedc7dc1a [V0_31]) * Changes, Makefile.PL, README, TableParser.pm: 2002-04-20 06:14:08 by dj 2007-09-19 17:47 -0400 djerius (328df5306ba0) * .hgtags: Added tag V0_03 for changeset 1033aedf4281 2002-04-18 16:53 +0000 dj (1033aedf4281 [V0_03]) * README: 2002-04-18 16:53:19 by dj 2002-04-18 16:50 +0000 dj (554df778ed90) * TableParser.pm: 2002-04-18 16:50:16 by dj - decode_entitites was being called too late in fix_texts, so Trim was less than effectual. - added DecodeNBSP attribute to fix nbsp decoding issues. - callbacks for methods and classes can be turned off by assigning an undef value to the appropriate key in the table request. - the warn callback is also passed the line number now. this is an incompatible change in the API. 2002-04-18 16:49 +0000 dj (2ba5f22a5de6) * Changes, MANIFEST: 2002-04-18 16:49:42 by dj 2002-04-18 13:22 +0000 dj (a7f7a965932d) * t/class-01.t: 2002-04-18 13:22:25 by dj test of method/class undef 2002-04-17 16:01 +0000 dj (0184d19c59c0) * TableParser.pm: 2002-04-17 16:01:26 by dj - specification of ids and column names in matches has been extended and simplified. id and cols now may take arrayrefs of things to match. colre is deprecated. - matches can be made using literals, subroutines and qr// created regexps. the latter two are automatically recognized. - explicit exclusions and skipping of tables is now possible - improved docs (a bit) 2002-04-17 16:01 +0000 dj (e1ce201050aa) * t/contents.t: 2002-04-17 16:01:03 by dj new tests for new features 2002-04-17 16:00 +0000 dj (13b357876758) * Changes, README, data/table2.hdr, data/table2.html: 2002-04-17 16:00:39 by dj 2007-09-19 17:47 -0400 djerius (cb8a13943586) * .hgtags: Added tag V0_02 for changeset 75960cc6baf1 2002-04-12 20:48 +0000 dj (75960cc6baf1 [V0_02]) * TableParser.pm: 2002-04-12 20:48:08 by dj 2002-03-11 14:26 +0000 dj (a0ef168831d9) * TableParser.pm: 2002-03-11 14:26:13 by dj 2002-01-31 02:06 +0000 dj (476ba2ba3831) * MANIFEST, README, THANKS: 2002-01-31 02:05:05 by dj 2002-01-31 01:59 +0000 dj (9c0598046f62) * Changes, TableParser.pm: 2002-01-31 01:59:43 by dj one could not use id=DEFAULT as a fall through if a column name match didn't work. in fact, one couldn't intersperse id's in a request list; they all had to be at the beginning. there's now a well defined order in how requests are processed. fixing this uncovered another subtle bug. a header line was originally recognized only after finishing the first non-header line. this lead to the situation that if an embedded table was in the first non-header row, it would be matched against column name match requests before the enclosing table, because it would be completely parsed before the enclosing table's header was even recognized. to fix this, we finish off a header in the first non- header column if the previous row was a header and the current row isn't a header. added an embedded table test in t/contents.t format of comparison data was wrong. wanted embedded tab between columns, got character sequence '\t' checking whether a request had been used was 99% foobared. 2002-01-31 01:58 +0000 dj (595fbdeb6f11) * t/common.pl, t/contents.t: 2002-01-31 01:58:38 by dj consolidated some code. now tests embedded table fixed some errors from before. how'd it work? 2002-01-31 01:58 +0000 dj (c4427160d1c8) * t/counts.pl: 2002-01-31 01:58:13 by dj can't reuse parser objects now 2002-01-31 01:57 +0000 dj (5678b2ab5146) * t/req_order.t: 2002-01-31 01:57:51 by dj new test 2002-01-31 01:57 +0000 dj (0f30d6d72875) * MANIFEST, MANIFEST.SKIP: 2002-01-31 01:57:05 by dj 2002-01-31 01:34 +0000 dj (aa7ebe60ba56) * data/table2-1.Chomp.data, data/table2-1.Decode.data, data/table2-1.Default.data, data/table2-1.Trim.data, data/table2-1.hdr: 2002-01-31 01:34:06 by dj new data for embedded table 2002-01-31 01:33 +0000 dj (31cffe3cd722) * data/ned.Chomp.data, data/ned.Decode.data, data/ned.Default.data, data/ned.Trim.data, data/screwy.Chomp.data, data/screwy.Decode.data, data/screwy.Default.data, data/screwy.Trim.data, data/table.Chomp.data, data/table.Decode.data, data/table.Default.data, data/table.Trim.data, data/table2.Chomp.data, data/table2.Decode.data, data/table2.Default.data, data/table2.Trim.data: 2002-01-31 01:33:50 by dj really wanted tab, not '\t'. fixed that 2007-09-19 17:47 -0400 djerius (20af52277ea9) * .hgtags: Added tag V0_1 for changeset 0849908f7a2d 2001-12-12 22:17 +0000 dj (0849908f7a2d [V0_1]) * README: 2001-12-12 22:17:56 by dj 2001-12-12 22:17 +0000 dj (513f7d1f73cb) * Changes, INSTALL, LICENSE, MANIFEST, MANIFEST.SKIP, Makefile.PL, README, TableParser.pm, data/ned.Chomp.data, data/ned.Decode.data, data/ned.Default.data, data/ned.Trim.data, data/ned.hdr, data/ned.html, data/screwy.Chomp.data, data/screwy.Decode.data, data/screwy.Default.data, data/screwy.Trim.data, data/screwy.hdr, data/screwy.html, data/table.Chomp.data, data/table.Decode.data, data/table.Default.data, data/table.Trim.data, data/table.hdr, data/table.html, data/table2.Chomp.data, data/table2.Decode.data, data/table2.Default.data, data/table2.Trim.data, data/table2.hdr, data/table2.html, html/ned.html, html/screwy.html, html/table.html, html/table2.html, t/class.t, t/contents.t, t/counts.pl, t/funcs.t, t/methods.t, test.pl: 2001-12-12 22:16:59 by dj Major rewrite 2007-09-19 17:46 -0400 djerius (ea46c684d5de) * .hgtags: Added tag initial for changeset 11a58a96c262 1999-12-16 18:00 +0000 dj (11a58a96c262 [initial]) * Changes, INSTALL, MANIFEST, Makefile.PL, TableParser.pm, html/ned.html, html/screwy.html, html/table.html, html/table2.html, test.pl: 1999-12-16 18:00:21 by dj Initial revision 2007-09-19 17:46 -0400 djerius (11692bba182f) * .hgignore: Tailor preparing to convert repo by adding .hgignore