package Prefix;
-use Carp;
+use IO::File;
use DXVars;
use DB_File;
+use Data::Dumper;
+use DXDebug;
use strict;
-my $db; # the DB_File handle
-my %prefix_loc; # the meat of the info
-my %prefix; # the prefix list
+use vars qw($VERSION $BRANCH);
+$VERSION = sprintf( "%d.%03d", q$Revision$ =~ /(\d+)\.(\d+)/ );
+$BRANCH = sprintf( "%d.%03d", q$Revision$ =~ /\d+\.\d+\.(\d+)\.(\d+)/ ) || 0;
+$main::build += $VERSION;
+$main::branch += $BRANCH;
+
+use vars qw($db %prefix_loc %pre);
+
+$db = undef; # the DB_File handle
+%prefix_loc = (); # the meat of the info
+%pre = (); # the prefix list
sub load
{
- if ($db) {
- untie %prefix;
- %prefix = ();
- %prefix_loc = ();
- }
- $db = tie(%prefix, "DB_File", undef, O_RDWR|O_CREAT, 0, $DB_BTREE) or confess "can't tie %prefix ($!)";
- do "$main::data/prefix_data.pl";
- confess $@ if $@;
+ if ($db) {
+ undef $db;
+ untie %pre;
+ %pre = ();
+ %prefix_loc = ();
+ }
+ $db = tie(%pre, "DB_File", undef, O_RDWR|O_CREAT, 0666, $DB_BTREE) or confess "can't tie \%pre ($!)";
+ my $out = $@ if $@;
+ do "$main::data/prefix_data.pl" if !$out;
+ $out = $@ if $@;
+ # print Data::Dumper->Dump([\%pre, \%prefix_loc], [qw(pre prefix_loc)]);
+ return $out;
}
sub store
{
- my ($k, $l);
- my $fh = new FileHandle;
- my $fn = "$main::data/prefix_data.pl";
+ my ($k, $l);
+ my $fh = new IO::File;
+ my $fn = "$main::data/prefix_data.pl";
- confess "Prefix system not started" if !$db;
+ confess "Prefix system not started" if !$db;
- # save versions!
- rename "$fn.oooo", "$fn.ooooo" if -e "$fn.oooo";
- rename "$fn.ooo", "$fn.oooo" if -e "$fn.ooo";
- rename "$fn.oo", "$fn.ooo" if -e "$fn.oo";
- rename "$fn.o", "$fn.oo" if -e "$fn.o";
- rename "$fn", "$fn.o" if -e "$fn";
+ # save versions!
+ rename "$fn.oooo", "$fn.ooooo" if -e "$fn.oooo";
+ rename "$fn.ooo", "$fn.oooo" if -e "$fn.ooo";
+ rename "$fn.oo", "$fn.ooo" if -e "$fn.oo";
+ rename "$fn.o", "$fn.oo" if -e "$fn.o";
+ rename "$fn", "$fn.o" if -e "$fn";
- $fh->open(">$fn") or die "Can't open $fn ($!)";
-
- # prefix location data
- $fh->print("%prefix_loc = (\n");
- foreach $l (sort {$a <=> $b} keys %prefix_loc) {
- my $r = $prefix_loc{$l};
- $fh->printf(" $l => { name => '%s', dxcc => %d, itu => %d, utcoff => %d, lat => %f, long => %f },\n",
- $r->{name}, $r->{dxcc}, $r->{itu}, $r->{cq}, $r->{utcoff}, $r->{lat}, $r->{long});
- }
- $fh->print(");\n\n");
-
- # prefix data
- $fh->print("%prefix = (\n");
- foreach $k (sort keys %prefix) {
- $fh->print(" '$k' => [");
- my @list = @{$prefix{$k}};
- my $l;
- my $str;
- foreach $l (@list) {
- $str .= " $l,";
- }
- chop $str;
- $fh->print("$str ],\n");
- }
- $fh->print(");\n");
- $fh->close;
+ $fh->open(">$fn") or die "Can't open $fn ($!)";
+
+ # prefix location data
+ $fh->print("%prefix_loc = (\n");
+ foreach $l (sort {$a <=> $b} keys %prefix_loc) {
+ my $r = $prefix_loc{$l};
+ $fh->printf(" $l => bless( { name => '%s', dxcc => %d, itu => %d, utcoff => %d, lat => %f, long => %f }, 'Prefix'),\n",
+ $r->{name}, $r->{dxcc}, $r->{itu}, $r->{cq}, $r->{utcoff}, $r->{lat}, $r->{long});
+ }
+ $fh->print(");\n\n");
+
+ # prefix data
+ $fh->print("%pre = (\n");
+ foreach $k (sort keys %pre) {
+ $fh->print(" '$k' => [");
+ my @list = @{$pre{$k}};
+ my $l;
+ my $str;
+ foreach $l (@list) {
+ $str .= " $l,";
+ }
+ chop $str;
+ $fh->print("$str ],\n");
+ }
+ $fh->print(");\n");
+ undef $fh;
+ untie %pre;
}
-# this may return several entries, be warned!
-#
-# what you get is a list of pairs of:-
+# what you get is a list that looks like:-
#
-# prefix => \[ @list of references to prefix_locs ]
+# prefix => @list of blessed references to prefix_locs
#
# This routine will only do what you ask for, if you wish to be intelligent
# then that is YOUR problem!
#
sub get
{
+ my $key = shift;
+ my @out;
+ my @outref;
+ my $ref;
+ my $gotkey;
+
+ $gotkey = $key;
+ return () if $db->seq($gotkey, $ref, R_CURSOR);
+ return () if $key ne substr $gotkey, 0, length $key;
+
+ @outref = map { $prefix_loc{$_} } split ',', $ref;
+ return ($gotkey, @outref);
+}
+
+#
+# get the next key that matches, this assumes that you have done a 'get' first
+#
+#
+sub next
+{
+ my $key = shift;
+ my @out;
+ my @outref;
+ my $ref;
+ my $gotkey;
+
+ return () if $db->seq($gotkey, $ref, R_NEXT);
+ return () if $key ne substr $gotkey, 0, length $key;
+
+ @outref = map { $prefix_loc{$_} } split ',', $ref;
+ return ($gotkey, @outref);
+}
+
+#
+# extract a 'prefix' from a callsign, in other words the largest entity that will
+# obtain a result from the prefix table.
+#
+# This is done by repeated probing, callsigns of the type VO1/G1TLH or
+# G1TLH/VO1 (should) return VO1
+#
+
+sub extract
+{
+ my $calls = uc shift;
+ my @out;
+ my $p;
+ my @parts;
+ my ($call, $sp, $i);
+
+ foreach $call (split /,/, $calls) {
+ # first check if the whole thing succeeds
+ my @nout = get($call);
+ if (@nout && $nout[0] eq $call) {
+ dbg("got exact prefix: $nout[0]") if isdbg('prefix');
+ push @out, @nout;
+ next;
+ }
+
+ # now split the call into parts if required
+ @parts = ($call =~ '/') ? split('/', $call) : ($call);
+
+ # remove any /0-9 /P /A /M /MM /AM suffixes etc
+ if (@parts > 1) {
+ $p = $parts[0];
+ shift @parts if $p =~ /^(WEB|NET)$/o;
+ $p = $parts[$#parts];
+ pop @parts if $p =~ /^(\d+|[JPABM]|AM|MM|BCN|JOTA|SIX|WEB|NET|Q\w+)$/o;
+ $p = $parts[$#parts];
+ pop @parts if $p =~ /^(\d+|[JPABM]|AM|MM|BCN|JOTA|SIX|WEB|NET|Q\w+)$/o;
+
+ # can we resolve them by direct lookup
+ foreach $p (@parts) {
+ @nout = get($p);
+ if (@nout && $nout[0] eq $call) {
+ dbg("got exact prefix: $nout[0]") if isdbg('prefix');
+ push @out, @nout;
+ next;
+ }
+ }
+ }
+
+ # which is the shortest part (first if equal)?
+ dbg("Parts: $call = " . join('|', @parts)) if isdbg('prefix');
+
+ # try ALL the parts
+L1: for (;@parts;) {
+ $sp = $parts[0];
+ foreach $p (@parts) {
+ $sp = $p if length $p < length $sp;
+ }
+ @parts = grep { $_ ne $sp } @parts; # remove it from the list
+ $sp =~ s/-\d+$//; # remove any SSID
+
+ # # now start to resolve it from the left hand end
+ # for ($i = 1; $i <= length $sp; ++$i) {
+ # now start to resolve it from the right hand end
+ for ($i = length $sp; $i >= 1; --$i) {
+ my $ssp = substr($sp, 0, $i);
+ my @wout = get($ssp);
+ if (isdbg('prefix')) {
+ my $part = $wout[0] || "*";
+ $part .= '*' unless $part eq '*' || $part eq $ssp;
+ dbg("Partial prefix: $sp $ssp $part" );
+ }
+ next if @wout > 0 && $wout[0] gt $ssp;
+ # last if @wout == 0;
+ push @out, @wout;
+ last L1 if @wout;
+ }
+ }
+ }
+ if (isdbg('prefix')) {
+ my $dd = new Data::Dumper([ \@out ], [qw(@out)]);
+ dbg($dd->Dumpxs);
+ }
+ return @out;
+}
+
+my %valid = (
+ lat => '0,Latitude,slat',
+ long => '0,Longitude,slong',
+ dxcc => '0,DXCC',
+ name => '0,Name',
+ itu => '0,ITU',
+ cq => '0,CQ',
+ utcoff => '0,UTC offset',
+ cont => '0,Continent',
+ );
+
+no strict;
+sub AUTOLOAD
+{
+ my $self = shift;
+ my $name = $AUTOLOAD;
+ return if $name =~ /::DESTROY$/;
+ $name =~ s/.*:://o;
+
+ confess "Non-existant field '$AUTOLOAD'" if !$valid{$name};
+ # this clever line of code creates a subroutine which takes over from autoload
+ # from OO Perl - Conway
+ *{$AUTOLOAD} = sub {@_ > 1 ? $_[0]->{$name} = $_[1] : $_[0]->{$name}} ;
+ if (@_) {
+ $self->{$name} = shift;
+ }
+ return $self->{$name};
}
+use strict;
+#
+# return a prompt for a field
+#
+
+sub field_prompt
+{
+ my ($self, $ele) = @_;
+ return $valid{$ele};
+}
1;
__END__
projects / spider.git / blobdiff