+#
+# this routine accepts a composite filter with a reject component and then an accept
+# the filter returns 0 if an entry is matched by any reject rule and also if any
+# accept rule fails otherwise it returns 1
+#
+# the either set of rules may be missing meaning an implicit 'ok'
+#
+# reject rules are implicitly 'or' logic (any reject rules which fires kicks it out)
+# accept rules are implicitly 'and' logic (all accept rules must pass to indicate a match)
+#
+# unlike the old system, this is kept as a hash of hashes so that you can
+# easily change them by program.
+#
+# you can have a [any] number of 'filters', they are tried in random order until one matches
+#
+# an example in machine readable form:-
+# bless ({
+# name => 'G7BRN.pl',
+# sort => 'spots',
+# filter1 => {
+# user_rej => {
+# by_dxcc => 'W,VE',
+# },
+# reject => {
+# by_dxcc => [6, 'n', 226,197],
+# },
+# user_acc => {
+# freq => '0/30000',
+# },
+# accept => {
+# freq => [0, 'r', 0, 30000],
+# },
+# },
+# filter2 => {
+# user_acc => {
+# freq => 'vhf',
+# by_zone => '14,15,16',
+# },
+# accept => {
+# freq => [0, 'r', 50000,52000,70000,70500,144000,148000],
+# by_zone => [11, 'n', 14,15,16],
+# }
+# },
+# }, 'Filter');
+#
+# in user commands:-
+#
+# clear/spots 1 2
+# accept/spots 1 freq 0/30000
+# reject/spots 1 by_dxcc W,VE
+# accept/spots 2 freq vhf
+# accept/spots 2 by_zone 14,15,16
+#
+# no filter no implies filter 1
+#
+# The field nos are the same as for the 'Old' filters
+#
+# The user_* fields are there so that the structure can be listed easily
+# in human readable form when required. They are not used in the filtering
+# process itself.
+#
+# This defines an HF filter and a VHF filter (as it happens)
+#
+
+sub it
+{
+ my $self = shift;
+
+ my $hops = undef;
+ my $filter;
+ my $r;
+
+ my ($key, $ref, $field, $fieldsort, $comp);
+ L1: foreach $key (grep {/^filter/ } keys %$self) {
+ my $filter = $self->{$key};
+ $r = 0;
+ if ($filter->{reject}) {
+ foreach $ref (values %{$filter->{reject}}) {
+ ($field, $fieldsort) = @$ref[0,1];
+ my $val = $_[$field];
+ if ($fieldsort eq 'n') {
+ next L1 if grep $_ == $val, @{$ref}[2..$#$ref];
+ } elsif ($fieldsort eq 'r') {
+ my $i;
+ for ($i = 2; $i < @$ref; $i += 2) {
+ next L1 if $val >= $ref->[$i] && $val <= $ref->[$i+1];
+ }
+ } elsif ($fieldsort eq 'a') {
+ next L1 if grep $val =~ m{$_}, @$ref[2..$#$ref];
+ }
+ }
+ }
+ if ($filter->{accept}) {
+ foreach $ref (values %{$filter->{accept}}) {
+ ($field, $fieldsort) = @$ref[0,1];
+ my $val = $_[$field];
+ if ($fieldsort eq 'n') {
+ next L1 unless grep $_ == $val, @{$ref}[2..$#$ref];
+ } elsif ($fieldsort eq 'r') {
+ my $i;
+ for ($i = 2; $i < @$ref; $i += 2) {
+ next L1 unless $val >= $ref->[$i] && $val <= $ref->[$i+1];
+ }
+ } elsif ($fieldsort eq 'a') {
+ next L1 unless grep $val =~ m{$_}, @{$ref}[2..$#$ref];
+ }
+ }
+ }
+ $r = 1;
+ last;
+ }
+
+ # hops are done differently
+ if ($self->{hops}) {
+ my $h;
+ while (($comp, $ref) = each %{$self->{hops}}) {
+ ($field, $h) = @$ref;
+ if ($_[$field] =~ m{$comp}) {
+ $hops = $h;
+ last;
+ }
+ }
+ }
+ return ($r, $hops);
+}
+