File Coverage

blib/lib/Proc/ProcessTable/Match/Priority.pm

Criterion	Covered	Total	%
statement	8	54	14.8
branch	0	36	0.0
condition	0	3	0.0
subroutine	3	5	60.0
pod	2	2	100.0
total	13	100	13.0

package Proc::ProcessTable::Match::Priority;

use 5.006;
use strict;
use warnings;

=head1 NAME

Proc::ProcessTable::Match::Priority - Check if the Priority of a process matches.

=head1 VERSION

Version 0.0.0

=cut

our $VERSION = '0.0.0';


=head1 SYNOPSIS

    use Proc::ProcessTable::Match::Priority;

    my %args=(
              priorities=>[
                     0,
                     '>1000',
                    ],
              );

    my $checker=Proc::ProcessTable::Match::Priority->new( \%args );

    if ( $checker->match( $proc ) ){
        print "It matches.\n";
    }

=head1 METHODS

=head2 new

This intiates the object.

It takes a hash reference with one key. One key is required and
that is 'priorities', which is a array of priority values to match.

The Priority values can be prefixed with the equalities below for doing
additional comparisons.

    <
    <=
    >
    >=
    !

Atleast one Priority must be specified.

If the new method fails, it dies.

    my %args=(
              priorities=>[
                     0,
                     '>1000',
                    ],
              );

    my $checker=Proc::ProcessTable::Match::Priority->new( \%args );

=cut

sub new{
	my %args;
	if(defined($_[1])){
		%args= %{$_[1]};
	};

	# run some basic checks to make sure we have the minimum stuff required to work
	if ( ! defined( $args{priorities} ) ){
		die ('No priorities key specified in the argument hash');
	}
	if ( ref( \$args{priorities} ) eq 'ARRAY' ){
		die ('The priorities key is not a array');
	}
	if ( ! defined $args{priorities}[0] ){
		die ('Nothing defined in the priorities array');
	}

    my $self = {
				priorities=>$args{priorities},
				};
    bless $self;

	return $self;
}

=head2 match

Checks if a single Proc::ProcessTable::Process object matches the stack.

One argument is taken and that is a Proc::ProcessTable::Process object.

The returned value is a boolean.

    if ( $checker->match( $proc ) ){
        print "The process matches.\n";
    }

=cut

sub match{
	my $self=$_[0];
	my $object=$_[1];

	if ( !defined( $object ) ){
		return 0;
	}

	if ( ref( $object ) ne 'Proc::ProcessTable::Process' ){
		return 0;
	}

	my $proc_priority;
	eval{
		$proc_priority=$object->priority;
	};

	# don't bother proceeding, the object won't match ever
	# as it does not have a Priority
	if ( ! defined( $proc_priority ) ){
		return 0;
	}

	# use while as foreach will reference the value
	my $priority_int=0;
	while (defined( $self->{priorities}[$priority_int] )){
		my $priority=$self->{priorities}[$priority_int];
		if (
			( $priority =~ /^[0-9]+$/ ) &&
			( $priority eq $proc_priority )
			){
			return 1;
		}elsif( $priority =~ /^\<\=[0-9]+$/ ){
			$priority=~s/^\<\=//;
			if ( $proc_priority <= $priority ){
				return 1;
			}
		}elsif( $priority =~ /^\<[0-9]+$/ ){
			$priority=~s/^\
			if ( $proc_priority < $priority ){
				return 1;
			}
		}elsif( $priority =~ /^\>\=[0-9]+$/ ){
			$priority=~s/^\>\=//;
			if ( $proc_priority >= $priority ){
				return 1;
			}
		}elsif( $priority =~ /^\>[0-9]+$/ ){
			$priority=~s/^\>//;
			if ( $proc_priority > $priority ){
				return 1;
			}
		}elsif( $priority =~ /^\![0-9]+$/ ){
			$priority=~s/^\!//;
			if ( $proc_priority ne $priority ){
				return 1;
			}
		}
		$priority_int++;
	}

	return 0;
}

=head1 AUTHOR

Zane C. Bowers-Hadley, C<<  >>

=head1 BUGS

Please report any bugs or feature requests to C, or through
the web interface at L.  I will be notified, and then you'll
automatically be notified of progress on your bug as I make changes.




=head1 SUPPORT

You can find documentation for this module with the perldoc command.

    perldoc Proc::ProcessTable::Match


You can also look for information at:

=over 4

=item * RT: CPAN's request tracker (report bugs here)

L

=item * AnnoCPAN: Annotated CPAN documentation

L

=item * CPAN Ratings

L

=item * Search CPAN

L

=back


=head1 ACKNOWLEDGEMENTS


=head1 LICENSE AND COPYRIGHT

Copyright 2019 Zane C. Bowers-Hadley.

This program is free software; you can redistribute it and/or modify it
under the terms of the the Artistic License (2.0). You may obtain a
copy of the full license at:

L

Any use, modification, and distribution of the Standard or Modified
Versions is governed by this Artistic License. By using, modifying or
distributing the Package, you accept this license. Do not use, modify,
or distribute the Package, if you do not accept this license.

If your Modified Version has been derived from a Modified Version made
by someone other than you, you are nevertheless required to ensure that
your Modified Version complies with the requirements of this license.

This license does not grant you the right to use any trademark, service
mark, tradename, or logo of the Copyright Holder.

This license includes the non-exclusive, worldwide, free-of-charge
patent license to make, have made, use, offer to sell, sell, import and
otherwise transfer the Package with respect to any patent claims
licensable by the Copyright Holder that are necessarily infringed by the
Package. If you institute patent litigation (including a cross-claim or
counterclaim) against any party alleging that the Package constitutes
direct or contributory patent infringement, then this Artistic License
to you shall terminate on the date that such litigation is filed.

Disclaimer of Warranty: THE PACKAGE IS PROVIDED BY THE COPYRIGHT HOLDER
AND CONTRIBUTORS "AS IS' AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES.
THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
PURPOSE, OR NON-INFRINGEMENT ARE DISCLAIMED TO THE EXTENT PERMITTED BY
YOUR LOCAL LAW. UNLESS REQUIRED BY LAW, NO COPYRIGHT HOLDER OR
CONTRIBUTOR WILL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OR
CONSEQUENTIAL DAMAGES ARISING IN ANY WAY OUT OF THE USE OF THE PACKAGE,
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.


=cut

1; # End of Proc::ProcessTable::Match