Bio::DB::HIV HIVQueryHelper
Other packages in the module: Bio::DB::HIV::HIVQueryHelper
SummaryPackage variablesSynopsisDescriptionGeneral documentationMethods
Toolbar
WebCvs
Summary
Bio::DB::HIV::HIVQueryHelper - Routines and packages used by Bio::DB::HIV and
Bio::DB::Query::HIVQuery
Package variables
No package variables defined.
Included modules
Bio::Root::Root(1)
Bio::Root::Root(2)
XML::Simple
strict
Synopsis
  Used in Bio::DB::Query::HIVQuery. No need to use directly.
Description
Bio::DB::HIV::HIVQueryHelper contains a number of packages for use
by Bio::DB::Query::HIVQuery. Package HIVSchema parses the
lanl-schema.xml file, and allows access to it in the context of the
relational database it represents (see APPENDIX for excruciating
detail). Packages QRY, R, and Q together create the query
string parser that enables NCBI-like queries to be understood by
Bio::DB::Query::HIVQuery. They provide objects and operators to
perform and simplify logical expressions involving AND, OR, and
() and return hash structures that can be handled by
Bio::DB::Query::HIVQuery routines.
Methods
BEGIN Code
new(1)
No description
Code
tables
No description
Code
columns
No description
Code
fields(1)
No description
Code
options
No description
Code
aliases
No description
Code
ankh
No description
Code
tablepart
No description
Code
tbl
No description
Code
columnpart
No description
Code
col
No description
Code
primarykey
No description
Code
pk
No description
Code
foreignkey
No description
Code
fk
No description
Code
foreigntable
No description
Code
ftbl
No description
Code
find_join
No description
Code
_find_join_guts
No description
Code
loadHIVSchema
No description
Code
loadSchema
No description
Code
_sfieldh
No description
Code
_make_q
No description
Code
_make_q_guts
No description
Code
_parse_q
No description
Code
new(2)
No description
Code
requests
No description
Code
put_requests
No description
Code
isnull(1)
No description
Code
A(1)
No description
Code
len(1)
No description
Code
clone(1)
No description
Code
Or(1)
No description
Code
And(1)
No description
Code
Bool
No description
Code
Eq(1)
No description
Code
new(3)
No description
Code
len(2)
No description
Code
atoms
No description
Code
fields(2)
No description
Code
put_atoms
No description
Code
del_atoms
No description
Code
isnull(2)
No description
Code
A(2)
No description
Code
clone(2)
No description
Code
In
No description
Code
And(2)
No description
Code
Or(2)
No description
Code
Eq(2)
No description
Code
new(4)
No description
Code
isnull(3)
No description
Code
fld
No description
Code
dta
No description
Code
A(3)
No description
Code
clone(3)
No description
Code
qin
No description
Code
qeq
No description
Code
qor
No description
Code
qand
No description
Code
unique
No description
Code
Methods description
None available.
Methods code
BEGINTop
BEGIN {
#exceptions
@Bio::QueryStringSyntax::Exception::ISA = qw( Bio::Root::Exception);
}
new(1)descriptionprevnextTop
sub new(1) {
    my $class = shift;
    my @args = @_;
    my $self = {};
    if ($args[0]) {
	$self->{schema_ref} = loadHIVSchema($args[0]);
    }
    bless($self, $class);
    return $self;
}

### object methods
}
tablesdescriptionprevnextTop
sub tables {
    # return array of all tables in schema
local $_; my $self = shift; my $sref = $self->{schema_ref}; Bio::Root::Root->throw("schema not initialized") unless $sref; my @k = grep(/\./, keys %$sref); my %ret; foreach (@k) { s/\..*$//; $ret{$_}++; } @k = sort keys %ret; return @k;
}
columnsdescriptionprevnextTop
sub columns {
    # return array of columns for specified table
# all columns in schema, if called w/o args
local $_; my $self = shift; my ($tbl) = @_; my $sref = $self->{schema_ref}; Bio::Root::Root->throw("schema not initialized") unless $sref; # trim column name
$tbl =~ s/\..*$//; # check if table exists
return () unless grep(/^$tbl$/i, $self->tables); my @k = sort keys %$sref; @k = grep (/^$tbl\./i, @k); foreach (@k) { s/^$tbl\.//; } return @k;
}
fields(1)descriptionprevnextTop
sub fields(1) {
    # return array of all fields (Table.Column format) in schema
my $self = shift; my $sref = $self->{schema_ref}; Bio::Root::Root->throw("schema not initialized") unless $sref; my @k = sort keys %{$sref}; return @k;
}
optionsdescriptionprevnextTop
sub options {
    # return array of options available to specified field
my $self = shift; my ($sfield) = @_; my $sref = $self->{schema_ref}; Bio::Root::Root->throw("schema not initialized") unless $sref; return $$sref{$sfield}{option} ? @{$$sref{$sfield}{option}} : ();
}
aliasesdescriptionprevnextTop
sub aliases {
    # return array of aliases to specified field
my $self = shift; my ($sfield) = @_; my $sref = $self->{schema_ref}; my @ret; Bio::Root::Root->throw("schema not initialized") unless $sref; if ($sfield) { return $$sref{$sfield}{alias} ? @{$$sref{$sfield}{alias}} : (); } else { # all valid aliases
map {push @ret, @{$$sref{$_}{alias}} if $$sref{$_}{alias}} $self->fields; return @ret; }
}
ankhdescriptionprevnextTop
sub ankh {
    # return hash translating sfields to annotation keys for specified sfield(s)
my $self = shift; my %ret = (); my @sfields = @_; my $sref = $self->{schema_ref}; Bio::Root::Root->throw("schema not initialized") unless $sref; foreach (@sfields) { next unless $$sref{$_}{ankey}; $ret{$_} = {'ankey'=>$$sref{$_}{ankey},'antype'=>$$sref{$_}{antype}}; } return %ret;
}
tablepartdescriptionprevnextTop
sub tablepart {
    # return the 'Table' part of the specified field(s)
my $self = shift; my @sfields = @_; Bio::Root::Root->throw("schema not initialized") unless $self->{schema_ref}; my ($squish,@ret, %ret); if ($sfields[0] eq '-s') { # squish : remove duplicates from the returned array
$squish=1; shift @sfields; } foreach (@sfields) { push @ret, /^(.*)\./; } if ($squish) { # arg order is clobbered
@ret{@ret} = undef; @ret = keys %ret; } return (wantarray ? @ret : $ret[0]);
}
tbldescriptionprevnextTop
sub tbl {
    # tablepart alias
shift->tablepart(@_);
}
columnpartdescriptionprevnextTop
sub columnpart {
    # return the 'Column' part of the specified field(s)
my $self = shift; my @sfields = @_; Bio::Root::Root->throw("schema not initialized") unless $self->{schema_ref}; my @ret; foreach (@sfields) { push @ret, /\.(.*)$/; } return (wantarray ? @ret : $ret[0]);
}
coldescriptionprevnextTop
sub col {
    # columnpart alias
shift->columnpart(@_);
}
primarykeydescriptionprevnextTop
sub primarykey {
    # return the primary key (in Table.Column format) of specified table(s)
my $self = shift; my @tbl = @_; my @ret; Bio::Root::Root->throw("schema not initialized") unless $self->{schema_ref}; foreach my $tbl (@tbl) { # trim column name
$tbl =~ s/\..*$//; grep(/^$tbl$/i, $self->tables) ? push(@ret, grep(/\.[0-9a-zA-Z]+_id/, grep(/$tbl/i,$self->fields))) : push(@ret, ""); } return (wantarray ? @ret : $ret[0]);
}
pkdescriptionprevnextTop
sub pk {
    # primarykey alias
shift->primarykey(@_);
}
foreignkeydescriptionprevnextTop
sub foreignkey {
    # return foreign key in in-table ($intbl) to to-table ($totbl)
# or all foreign keys in in-table if to-table not specified
# keys returned in Table.Column format
my $self = shift; my ($intbl, $totbl) = @_; Bio::Root::Root->throw("schema not initialized") unless $self->{schema_ref}; # trim col names
$intbl =~ s/\..*$//; $totbl =~ s/\..*$// if $totbl; # check if in-table exists
return () unless grep( /^$intbl/i, $self->tables); my @ret = grep( /$intbl\.(?:[0-9a-zA-Z]+_){2,}id/i, $self->fields); if ($totbl) { my $tpk = $self->primarykey($totbl); return (wantarray ? () : "") unless grep( /^$totbl/i, $self->tables) && $tpk; ($tpk) = ($tpk =~ /\.(.*)$/); @ret = grep( /$tpk$/, @ret); return (wantarray ? @ret : $ret[0]); } else { # return all foreign keys in in-table
return @ret; }
}
fkdescriptionprevnextTop
sub fk {
    # foreignkey alias
shift->foreignkey(@_);
}
foreigntabledescriptionprevnextTop
sub foreigntable {
    # return table name that foreign key(s) point(s) to
my $self = shift; my @fk = @_; my @ret; Bio::Root::Root->throw("schema not initialized") unless $self->{schema_ref}; foreach (@fk) { my ($mnem, $fmnem) = /\.([0-9a-zA-Z]+)_([0-9a-zA-Z]+)_.*$/; next unless $mnem && $fmnem; # lookup based on Table.Column format of fields
my $sf = [grep( /^[0-9a-zA-Z]+\.$fmnem\_/, $self->fields )]->[0]; next unless $sf; ($sf) = ($sf =~ /^([0-9a-zA-Z]+)\./); push @ret, $sf; } return (wantarray ? @ret : $ret[0]);
}
ftbldescriptionprevnextTop
sub ftbl {
    # foreigntable alias
shift->foreigntable(@_);
}
find_joindescriptionprevnextTop
sub find_join {
    my $self = shift;
    my ($tgt, $tbl) = @_;
    my ($stack, $revstack, $found, $revcut) = ([],[], 0, 4);
    $self->_find_join_guts($tgt, $tbl, $stack,\$ found);
    if ($found) {
	if (@$stack > $revcut) {
	    # reverse order of tables, see if a shorter path emerges
$found = 0; $self->_find_join_guts($tgt, $tbl, $revstack,\$ found, 1); return (@$stack <= @$revstack ? @$stack : @$revstack); } return @$stack; } else { return undef; }
}
_find_join_gutsdescriptionprevnextTop
sub _find_join_guts {
    my $self = shift;
    my ($tbl, $tgt, $stack, $found, $rev) = @_;
    return () if $tbl eq $tgt;
    my $k = $self->pk($tbl);
    if ($k) {
	# all fks pointing to pk
my @fk2pk = map { $self->fk($_, $k) || () } ($rev ? reverse $self->tables : $self->tables); # skip keys already on stack
if (@$stack) { (@$stack == 1) && do { @fk2pk = grep (!/$$stack[0]/, @fk2pk); }; (@$stack > 1 ) && do { @fk2pk = map { my $f=$_; grep(/$f/, @$stack) ? () : $f } @fk2pk; }; } foreach my $f2p (@fk2pk) { # tables with fks pointing to pk
push @$stack, $f2p; if ($self->tbl($f2p) eq $tgt) { # this fk's table is the target
# found it
$$found = 1; return; } else { #keep looking
$self->_find_join_guts($self->tbl($f2p), $tgt, $stack, $found, $rev); return if $$found; } } } # all fks in $tbl
my @fks = ($rev ? reverse $self->fk($tbl) : $self->fk($tbl)); #skip keys already on stack
if (@$stack) { (@$stack == 1) && do { @fks = grep(!/$$stack[0]/, @fks); }; (@$stack > 1) && do { @fks = map { my $f=$_; grep(/$f/, @$stack) ? () : $f } @fks; }; } # all fks in table
if (@fks) { for my $f (@fks) { push @$stack, $f; if ($self->ftbl($f) eq $tgt) { #found it
$$found = 1; return; } else { $self->_find_join_guts($self->ftbl($f), $tgt, $stack, $found, $rev); $$found ? return : pop @$stack; } } } else { pop @$stack; return; }
}
loadHIVSchemadescriptionprevnextTop
sub loadHIVSchema {
    my $fn = shift;
    Bio::Root::Root->throw("loadHIVSchema: schema file not found") unless -e $fn;
    my $q = XML::Simple->new(ContentKey=>'name',NormalizeSpace=>2,ForceArray=>1);
    my %ret;
    my $ref = $q->XMLin($fn);
    my @sf = keys %{$$ref{sfield}};
    foreach (@sf) {
	my $h = $$ref{sfield}{$_};
	$ret{$_} = $h;
	foreach my $ptr ($$h{option}, $$h{alias}) {
	    if ($ptr) {
		# kludge for XMLin: appears to convert to arrays, if there
# exists a tag without content, but to convert to hashes
# with content as key, if all tags possess content
if (ref($ptr) eq 'HASH') { my @k = keys %{$ptr}; if (grep /desc/, keys %{$ptr->{$k[0]}}) { # slurp the desc's
$$h{desc} = [ map { $$ptr{$_}->{desc} } @k ]; } # now overwrite with keys (descs in same order...)
$ptr = [@k]; } elsif (ref($ptr) eq 'ARRAY') { $ptr = [map { ref eq 'HASH' ? $_->{name} : $_ } @{$ptr}] } else { 1; # stub : doh!
} } } for my $ptr ($$h{ankey}) { # flatten
my $ank = [keys %{$ptr}]->[0]; if (!defined $ank) { delete $$h{ankey}; } else { $h->{antype} = $ptr->{$ank}{antype}; $ptr = $ank; } } } return\% ret;
}
loadSchemadescriptionprevnextTop
sub loadSchema {
    my $self = shift;
    $self->{schema_ref} = loadHIVSchema(shift);
}

# below, dangerous
}
_sfieldhdescriptionprevnextTop
sub _sfieldh {
    # return reference to the specified field hash
my $self = shift; my ($sfield) = @_; return ${$self->{schema_ref}}{$sfield}; } 1;
}
_make_qdescriptionprevnextTop
sub _make_q {
    my $ptree = shift;
    my ($q_expr, @q, @an, $query, @dbq);
    _make_q_guts($ptree,\$ q_expr,\@ q,,\@ an);
$query = eval $q_expr;
throw Bio::Root::Root(-class=>'Bio::Root::Exception',
-text=>$@, -value=>$q_expr) if $@; return {} if $query->isnull; foreach my $rq ($query->requests) { my $h = {'query'=>{}}; foreach ($rq->atoms) { my @d = split(/\s+/, $_->dta); foreach my $d (@d) { $d =~ s/[+]/ /g; ###! _ to [+]
$d =~ s/'//g; } $h->{'query'}{$_->fld} = (@d == 1) ? $d[0] : [@d]; } $h->{'annot'} = [@an] if @an; push @dbq, $h; } return @dbq;
}
_make_q_gutsdescriptionprevnextTop
sub _make_q_guts {
    my ($ptree, $q_expr, $qarry, $anarry) = @_;
    my (@words, $o);
    eval { # catch
foreach (@{$ptree->{cont}}) { m{^AND$} && do { $$q_expr .= "&"; next; }; m{^OR$} && do { $$q_expr .= "|"; next; }; m{^HASH} && do { for my $dl ($_->{delim}) { ($dl =~ m{\(}) && do { if (grep /^HASH/, @{$_->{cont}}) { $$q_expr .= "&" unless !$$q_expr || !length($$q_expr) || (substr($$q_expr, -1, 1) =~ /[&|(]/); $$q_expr .= "("; _make_q_guts($_,$q_expr,$qarry,$anarry); $$q_expr .= ")"; } else { my @c; my $c = join(' ',@{$_->{cont}}); $c =~ s/,/ /g; Bio::Root::Root->throw("query syntax error: unmatched ['\"]") if (@c = ($c =~ /(['"])/g)) % 2; @c = split(/\s*(['"])\s*/, $c); do { $c = shift @c; if ($c =~ m{['"]}) { $c = join('', ($c, shift @c, shift @c)); $c =~ s/\s+/+/g; ###! _ to +
push @words, $c; } else { push @words, split(/\s+/,$c); } } while @c; } last; }; ($dl =~ m{\[}) && do { Bio::Root::Root->throw("syntax error: empty field descriptor") unless @{$_->{cont}}; Bio::Root::Root->throw("syntax error: more than one field descriptor in square brackets") unless @{$_->{cont}} == 1; push @{$qarry}, new QRY( new R( new Q( $_->{cont}->[0], @words))); # add default operation if nec
$$q_expr .= "&" unless !$$q_expr || !length($$q_expr) || (substr($$q_expr, -1, 1) =~ /[&|(]/); $$q_expr .= "\$q[".$#$qarry."]"; @words = (); last; }; ($dl =~ m{\{}) && do { foreach my $an (@{$_->{cont}}) { ($an =~ /^HASH/) && do { if ($an->{delim} eq '[') { push @$anarry, @{$an->{cont}}; } else { Bio::Root::Root->throw("query syntax error: only field descriptors (with or without square brackets) allowed in annotation spec"); } next; }; do { #else
push @$anarry, $an; next; }; } last; }; do { 1; #else stub
}; } next; }; do { # else, bareword
if ($o) { $words[-1] .= "+$_"; ####! _ to +
} else { push @words, $_; } m/['"]/ && ($o = !$o);
}; } # @{ptree->{cont}}
Bio::Root::Root->throw("query syntax error: no search fields specified") unless $$q_expr =~ /q\[[0-9]+\]/; }; $@ ? throw Bio::Root::Root(-class=>'Bio::QueryStringSyntax::Exception', -text=>$@, -value=>$$q_expr) : return 1;
}
_parse_qdescriptionprevnextTop
sub _parse_q {
    local $_;
    my $qstr = shift;
    my $illegal = qr/[^a-zA-Z0-9-_<>=,\.\(\[\{\}\]\)\s'"]/;
my $pdlm = qr/[\{\[\(\)\]\}]/;
my %md = ('('=>')', '['=>']','{'=>'}'); my @tok = grep !/^\s*$/, split /($pdlm)/, $qstr; return {} unless @tok; my @pstack = (); my @dstack = (); my ($ptree, $p); eval { #catch
Bio::Root::Root->throw("query syntax error: illegal character") if $qstr =~ /$illegal/; $ptree = $p = {'delim'=>'*'}; foreach (@tok) { #trim whsp
s/^\s+//; s/\s+$//; m{[\(\[\{]} && do { my $new = {'delim'=>$_}; $p->{cont} = [] unless $p->{cont}; push @{$p->{cont}}, $new; push @pstack, $p; push @dstack, $_; $p = $new; next; }; m{[\)\]\}]} && do { my $d = pop @dstack; if ($md{$d} eq $_) { $p = pop @pstack; Bio::Root::Root->throw("query syntax error: unmatched\" $_\"") unless $p; } else { Bio::Root::Root->throw("query syntax error: saw\" $_\" before matching\" $md{$d}\""); } next; }; do { # else
$p->{cont} = [] unless $p->{cont}; push @{$p->{cont}}, split(/\s+/); }; } }; $@ ? throw Bio::Root::Root(-class=>'Bio::QueryStringSyntax::Exception', -text=>$@, -value=>"") : return $ptree; } ## QRY constructor
}
new(2)descriptionprevnextTop
sub new(2) {
    my $class = shift;
    my @args = @_;
    my $self = {};
    $self->{requests} = [];
    bless($self, $class);
    $self->put_requests(@args) if @args;
    return $self;
}

## QRY instance methods
}
requestsdescriptionprevnextTop
sub requests {
    my $self = shift;
    $self->put_requests(@_) if @_;
    return @{$self->{'requests'}};
}
put_requestsdescriptionprevnextTop
sub put_requests {
    my $self = shift;
    my @args = @_;
    foreach (@args) {
	Bio::Root::Root->throw('requires type R (request)') unless ref && $_->isa('R');
	push @{$self->{requests}}, $_;
    }
    return @args;
}
isnull(1)descriptionprevnextTop
sub isnull(1) {
    my $self = shift;
    return ($self->requests) ? 0 : 1;
}
A(1)descriptionprevnextTop
sub A(1) {
    my $self = shift;
    return join( "\n", map {$_->A} $self->requests );
}
len(1)descriptionprevnextTop
sub len(1) {
    my $self = shift;
    return scalar @{$self->{'requests'}};
}
clone(1)descriptionprevnextTop
sub clone(1) {
    local $_;
    my $self = shift;
    my $ret = new QRY();
    foreach ($self->requests) {
	$ret->put_requests($_->clone);
    }
    return $ret;
}

## QRY class methods
}
Or(1)descriptionprevnextTop
sub Or(1) {
    local $_;
    my ($q, $r, $rev_f) = @_;
    Bio::Root::Root->throw('requires type QRY') unless ref($q) && $q->isa('QRY');
    Bio::Root::Root->throw('requires type QRY') unless ref($r) && $r->isa('QRY');
    if ($q->isnull) {
	return $r->clone;
    }
    elsif ($r->isnull) {
	return $q->clone;
    }
    do {my $qq = $q; $q=$r; $r=$qq} if ($q->len > $r->len);
    my @rq_r = $r->requests;
    my @rq_q = $q->requests;
    my (@cand_rq, @ret_rq);
    # search for simplifications
my @now = @rq_q; my @nxt =(); foreach (@rq_r) { my $found = 0; while (my $rq = pop @now) { my @result = R::Or($rq, $_); if (@result==1) { push @cand_rq, $result[0]->clone; $found = 1; last; } else { push @nxt, $rq; } } push @cand_rq, $_->clone unless ($found); # @now becomes unexamined @rq_q's plus failed @rq_q's
@now = (@now, @nxt); } push @cand_rq, map {$_->clone} @now; # add all failed @rq_q's
# squeeze out redundant requests
while (my $rq = pop @cand_rq) { push @ret_rq, $rq unless @cand_rq && grep {R::Eq($rq, $_)} @cand_rq; } return new QRY( @ret_rq );
}
And(1)descriptionprevnextTop
sub And(1) {
    my ($q, $r, $rev_f) = @_;
    Bio::Root::Root->throw('requires type QRY') unless ref($q) && $q->isa('QRY');
    Bio::Root::Root->throw('requires type QRY') unless ref($r) && $r->isa('QRY');
    return ($QRY::NULL) if ($q->isnull || $r->isnull);
    my (@cand_rq, @ret_rq);
    foreach my $rq_r ($r->requests) {
	foreach my $rq_q ($q->requests) {
	    my ($rq) = R::And($rq_r, $rq_q);
	    push @cand_rq, $rq unless $rq->isnull;
	}
    }
    return $QRY::NULL unless @cand_rq;
    # squeeze out redundant requests
while (my $rq = pop @cand_rq) { push @ret_rq, $rq unless @cand_rq && grep {R::Eq($rq, $_)} @cand_rq; } return new QRY( @ret_rq );
}
BooldescriptionprevnextTop
sub Bool {
    my $q = shift;
    Bio::Root::Root->throw('requires type QRY') unless ref($q) && $q->isa('QRY');
    return $q->isnull ? 0 : 1;
}
Eq(1)descriptionprevnextTop
sub Eq(1) {
    my ($q, $r, $rev_f) = @_;
    Bio::Root::Root->throw('requires type QRY') unless ref($q) && $q->isa('QRY');
    Bio::Root::Root->throw('requires type QRY') unless ref($r) && $r->isa('QRY');
    return 0 unless $q->len == $r->len;
    foreach my $rq_q ($q->requests) {
	my $found = 0;
	foreach my $rq_r ($r->requests) {
	    if (R::Eq($rq_q,$rq_r)) {
		$found = 1;
		last;
	    }
	}
	return 0 unless $found;
    }
    return 1;
}

1;
}
new(3)descriptionprevnextTop
sub new(3) {
    my $class = shift;
    my @args = @_;
    my $self = {};
    $self->{atoms} = {};
    bless($self, $class);
    $self->put_atoms(@args) if @args;
    return $self;
}

## R instance methods
}
len(2)descriptionprevnextTop
sub len(2) {
    my $self = shift;
    return scalar @{[keys %{$self->{'atoms'}}]};
}
atomsdescriptionprevnextTop
sub atoms {
    local $_;
    # returns an array of atoms
# no arg: all atoms;
# args: atoms with specified fields
my $self = shift; my @flds = (@_ ? @_ : keys %{$self->{'atoms'}}); return wantarray ? map { $self->{'atoms'}->{$_} } @flds : $self->{'atoms'}->{$flds[0]};
}
fields(2)descriptionprevnextTop
sub fields(2) {
    my $self = shift;
    return keys %{$self->{'atoms'}};
}
put_atomsdescriptionprevnextTop
sub put_atoms {
    # AND this atom to the request
local $_; my $self = shift; my @args = @_; foreach (@args) { Bio::Root::Root->throw('requires type Q (atom)') unless ref && $_->isa('Q'); if ($self->atoms($_->fld)) { my $a = Q::qand( $self->atoms($_->fld), $_ ); if ($a->isnull) { delete $self->{'atoms'}->{$_->fld}; } else { $self->{atoms}->{$_->fld} = $a->clone; } } else { $self->{atoms}->{$_->fld} = $_->clone; } } return;
}
del_atomsdescriptionprevnextTop
sub del_atoms {
    # remove atoms by field from request
local $_; my $self = shift; my @args = @_; return () unless @args; my @ret; foreach (@args) { push @ret, delete $self->{'atoms'}->{$_}; } return @ret;
}
isnull(2)descriptionprevnextTop
sub isnull(2) {
    my $self = shift;
    return ($self->len) ? 0 : 1;
}
A(2)descriptionprevnextTop
sub A(2) {
    my $self = shift;
    my @a = sort {$a->fld cmp $b->fld} $self->atoms;
    return join(" ", map {$_->A} @a);
}
clone(2)descriptionprevnextTop
sub clone(2) {
    local $_;
    my $self = shift;
    my $ret = new R();
    foreach ($self->atoms) {
	$ret->put_atoms($_->clone);
    }
    return $ret;
}

## R class methods
}
IndescriptionprevnextTop
sub In {
    local $_;
    my ($s, $t) = @_;
    Bio::Root::Root->throw('requires type R (request)') unless ref($s) && $s->isa('R');
    Bio::Root::Root->throw('requires type R (request)') unless ref($t) && $t->isa('R');
    return 1 if ($s->isnull);
    # common fields
my @cf = grep {defined} map {my $f=$_; grep /^$f$/,$s->fields} $t->fields; return 0 unless @cf==$t->len; foreach (@cf) { my @sd = split(/\s+/, $s->atoms($_)->dta); my @td = split(/\s+/, $t->atoms($_)->dta); my @cd = grep {defined} map {my $d=$_; grep /^$d$/, @td} @sd; return 0 unless @cd==@sd; } return 1;
}
And(2)descriptionprevnextTop
sub And(2) {
    local $_;
    my ($s, $t) = @_;
    Bio::Root::Root->throw('requires type R (request)') unless ref($s) && $s->isa('R');
    Bio::Root::Root->throw('requires type R (request)') unless ref($t) && $t->isa('R');
    return ($R::NULL) if ($s->isnull || $t->isnull);

    do { my $ss = $s; $s = $t; $t = $ss } if ( $s->len > $t->len );
    # $t has at least as many fields defined than $s ($t is more restrictive)
# common fields
my @cf = grep {defined} map {my $sf = $_; grep /$sf/, $t->fields } $s->fields; my $ret = new R(); my $v = $t->clone; $v->del_atoms(@cf); my $u = $s->clone; $u->del_atoms(@cf); # And the atoms with identical fields
foreach (@cf) { my ($a) = Q::qand($s->atoms($_), $t->atoms($_)); if ($a->isnull) { return $R::NULL; } else { $ret->put_atoms($a); } } # put the private atoms
$ret->put_atoms($u->atoms, $v->atoms); return ($ret);
}
Or(2)descriptionprevnextTop
sub Or(2) {
    local $_;
    my ($s, $t) = @_;
    Bio::Root::Root->throw('requires type R (request)') unless ref($s) && $s->isa('R');
    Bio::Root::Root->throw('requires type R (request)') unless ref($t) && $t->isa('R');
    if ($s->isnull) {
	return $t->clone;
    }
    elsif ($t->isnull) {
	return $s->clone;
    }
    return $s->clone if (R::In($t, $s));
    return $t->clone if (R::In($s, $t));

    # try simplifying
do { my $ss = $s; $s = $t; $t = $ss } if ( $s->len > $t->len ); # common fields
my @cf = grep {defined} map {my $sf = $_; grep /$sf/, $t->fields } $s->fields; #
if ($t->len == @cf) { # all atoms equal within fields but one? If yes, simplify...
my @df = grep {!Q::qeq($s->atoms($_), $t->atoms($_))} @cf; if (@df == 1) { my ($a) = Q::qor($s->atoms($df[0]), $t->atoms($df[0])); my $ret = $s->clone; $ret->del_atoms($df[0]); $ret->put_atoms($a); return ($ret); } } # neither request contains the other, and the requests cannot be
# simplified; reflect back (clones of) the input...
return ($s->clone, $t->clone);
}
Eq(2)descriptionprevnextTop
sub Eq(2) {
    local $_;
    my ($s, $t) = @_;
    Bio::Root::Root->throw('requires type R (request)') unless ref($s) && $s->isa('R');
    Bio::Root::Root->throw('requires type R (request)') unless ref($t) && $t->isa('R');
    my @sf = $s->fields;
    my @tf = $t->fields;
    return 0 unless @sf==@tf;
    my @cf = grep {defined} map {my $f=$_; grep /^$f$/,@sf} @tf;
    return 0 unless @cf==@tf;
    foreach (@cf) {
	return 0 unless Q::qeq($s->atoms($_), $t->atoms($_));
    }
    return 1;
}
1;
}
new(4)descriptionprevnextTop
sub new(4) {
    local $_;
    my ($class,@args) = @_;
    my $self={};
    foreach (@args) { s/^\s+//; s/\s+$//; }
    my ($fld, @dta) = @args;
    $self->{fld}=$fld;
    $self->{dta}=join(" ", @dta);
    bless($self, $class);
    return $self;
}

## Q instance methods
}
isnull(3)descriptionprevnextTop
sub isnull(3) {
    my $self = shift;
    Bio::Root::Root->throw("requires type Q (atom)") unless ref($self) && $self->isa('Q');
    return 1 unless (($self->fld && length($self->fld)) || ($self->dta && length($self->dta)));
    return 0;
}
flddescriptionprevnextTop
sub fld {
    my $self = shift;
    Bio::Root::Root->throw("requires type Q (atom)") unless ref($self) && $self->isa('Q');
    my $f = shift;
    if ($f) {
	$f =~ s/^\s+//;
	$f =~ s/\s+$//;
	return $self->{fld}=$f;
    }
    return $self->{fld};
}
dtadescriptionprevnextTop
sub dta {
    my $self = shift;
    Bio::Root::Root->throw("requires type Q (atom)") unless ref($self) && $self->isa('Q');
    my $d = join(" ", @_);
    if ($d) {
	$d =~ s/^\s+//;
	$d =~ s/\s+$//;
	return $self->{dta} = $d;
    }
    return $self->{dta};
}
A(3)descriptionprevnextTop
sub A(3) {
    my $self = shift;
    Bio::Root::Root->throw("requires type Q (atom)") unless ref($self) && $self->isa('Q');
    my @a = split(/\s+/, $self->dta);

    return "(".join(' ', sort {$a cmp $b} @a).")[".$self->fld."]";
}
clone(3)descriptionprevnextTop
sub clone(3) {
    my $self = shift;
    Bio::Root::Root->throw("requires type Q (atom)") unless ref($self) && $self->isa('Q');
    my $ret = new Q ($self->fld, $self->dta);
    return $ret;
}

### Q class methods
}
qindescriptionprevnextTop
sub qin {
    my ($a, $b) = @_;
    Bio::Root::Root->throw('requires type Q (atom)') unless (ref $a) && $a->isa('Q') && (ref $b) && $b->isa('Q');
    return 0 unless $a->fld eq $b->fld;
    return Q::qeq( $b, Q::qor($a, $b) );
}
qeqdescriptionprevnextTop
sub qeq {
    local $_;
    my ($a, $b) = @_;
    Bio::Root::Root->throw('requires type Q (atom)') unless (ref $a) && $a->isa('Q') && (ref $b) && $b->isa('Q');
    return 0 unless $a->fld eq $b->fld;
    my @ad = unique(split(/\s+/,$a->dta));
    my @bd = unique(split(/\s+/,$b->dta));
    return 0 unless @ad==@bd;
    my @cd = grep {defined} map {my $f = $_; grep /^$f$/, @ad} @bd;
    return @cd == @bd;
}
qordescriptionprevnextTop
sub qor {
    local $_;
    my @a = @_;
    foreach (@a) {
	Bio::Root::Root->throw("requires type Q (atom)") unless ref && $_->isa('Q');
    }
    my @ret;
    my (%f, @f);
    @a = grep {!$_->isnull} @a;
    return ($Q::NULL) unless @a > 0;
    # list of unique flds
@f = unique(map {$_->fld} @a); foreach my $f (@f) { my @fobjs = grep {$_->fld eq $f} @a; my @d = unique(map {split(/\s/, $_->dta)} @fobjs ); my $r = new Q($f, @d); push @ret, $r; } return @ret;
}
qanddescriptionprevnextTop
sub qand {
    local $_;
    my ($a, $b) = @_;
    Bio::Root::Root->throw('requires type Q (atom)') unless (ref $a) && $a->isa('Q') && (ref $b) && $b->isa('Q');
    my @ret;
    if (ref $a eq 'ARRAY') {
	foreach my $ea (@$a) {
	    push @ret, qand( $ea, $b );
	}
	return qor(@ret); # simplify
} elsif (ref $b eq 'ARRAY') { foreach my $eb (@$b) { push @ret, qand( $a, $eb); 1; } return qor(@ret); # simplify
} else { return ($Q::NULL) if ($a->isnull || $b->isnull); if ($a->fld eq $b->fld) { # find intersection of data
my (%ad, @ad, @bd); @ad = split(/\s+/, $a->dta); @ad{@ad} = (1) x @ad; @bd = split(/\s+/, $b->dta); foreach (@bd) { $ad{$_}++; } my $r = new Q($a->fld, grep {$_} map {$ad{$_} == 2 ? $_ : undef} keys %ad); return (length($r->dta) > 0) ? ($r) : ($Q::NULL); } else { return ($a, $b); } }
}
uniquedescriptionprevnextTop
sub unique {
    my @a = @_;
    my %a;
    @a{@a} = undef;
    return keys %a;
}

1;
}
General documentation
FEEDBACKTop
Mailing ListsTop
User feedback is an integral part of the evolution of this and other
Bioperl modules. Send your comments and suggestions preferably to
the Bioperl mailing list. Your participation is much appreciated.
  bioperl-l@bioperl.org                  - General discussion
http://bioperl.org/wiki/Mailing_lists - About the mailing lists
SupportTop
Please direct usage questions or support issues to the mailing list:
bioperl-l@bioperl.org
rather than to the module maintainer directly. Many experienced and
reponsive experts will be able look at the problem and quickly
address it. Please include a thorough description of the problem
with code and data examples if at all possible.
Reporting BugsTop
Report bugs to the Bioperl bug tracking system to help us keep track
of the bugs and their resolution. Bug reports can be submitted via
the web:
  https://redmine.open-bio.org/projects/bioperl/
AUTHOR - Mark A. JensenTop
Email maj@fortinbras.us
CONTRIBUTORSTop
Mark A. Jensen
APPENDIXTop
The rest of the documentation details each of the contained packages.
Internal methods are usually preceded with a _
HIVSchema - objects/methods to manipulate a version of the LANL HIV DB schemaTop
HIVSchema SYNOPSISTop
    $schema = new HIVSchema( 'lanl-schema.xml' );
@tables = $schema->tables;
@validFields = $schema->fields;
@validAliases = $schema->aliases;
@query_aliases_for_coreceptor = $schema->aliases( 'SEQ_SAMple.SSAM_second_receptor' );
$pk_for_SequenceEntry = $schema->primarykey('SequenceEntry'); # returns 'SequenceEntry.SE_id'
$fk_for_SEQ_SAMple_to_SequenceEntry =
$schema->foreignkey('SEQ_SAMple', 'SequenceEntry'); # returns 'SEQ_SAMple.SSAM_SE_id'
$table = $schema->tablepart('SEQ_SAMple.SSAM_badseq'); # returns 'SEQ_SAMple' $column = $schema->columnpart('SEQ_SAMple.SSAM_badseq'); # returns 'SSAM_badseq'
HIVSchema DESCRIPTIONTop
HIVSchema methods are used in Bio::DB::Query::HIVQuery for table,
column, primary/foreign key manipulations based on the observed Los
Alamos HIV Sequence Database (LANL DB) naming conventions for their
CGI parameters. The schema is contained in an XML file
(lanl-schema.xml) which is read into an HIVSchema object, in turn a
property of the HIVQuery object. HIVSchema methods are used to build
correct cgi queries in a way that attempts to preserve the context of
the relational database the query parameters represent.
HIVSchema CONSTRUCTORTop
HIVSchema::newTop
 Title   : new
Usage : $schema = new HIVSchema( "lanl-schema.xml ");
Function:
Example :
Returns : an HIVSchema object
Args : XML filename
HIVSchema INSTANCE METHODSTop
HIVSchema tablesTop
 Title   : tables
Usage : $schema->tables()
Function: get all table names in schema
Example :
Returns : array of table names
Args : none
HIVSchema columnsTop
 Title   : columns
Usage : $schema->columns( [$tablename] );
Function: return array of columns for specified table, or all columns in
schema, if called w/o args
Example :
Returns :
Args : tablename or fieldname string
HIVSchema fieldsTop
 Title   : fields
Usage : $schema->fields();
Function: return array of all fields in schema, in format "table.column"
Example :
Returns : array of all fields
Args : none
HIVSchema optionsTop
 Title   : options
Usage : $schema->options(@fieldnames)
Function: get array of options (i.e., valid match data strings) available
to specified field
Example :
Returns : array of match data strings
Args : [array of] fieldname string[s] in "table.column" format
HIVSchema aliasesTop
 Title   : aliases
Usage : $schema->aliases(@fieldnames)
Function: get array of aliases to specified field[s]
Example :
Returns : array of valid query aliases for fields as spec'd in XML file
Args : [an array of] fieldname[s] in "table.column" format
HIVSchema ankhTop
 Title   : ankh (annotation key hash)
Usage : $schema->ankh(@fieldnames)
Function: return a hash translating fields to annotation keys for the
spec'd fields.
(Annotation keys are used for parsing the tab-delimited response
to Bio::DB::Query::HIVQuery::_do_lanl_request.)
Example :
Returns : hash ref
Args : [an array of] fieldname[s] in "table.column" format
HIVSchema tablepartTop
 Title   : tablepart (alias: tbl)
Usage : $schema->tbl(@fieldnames)
Function: return the portion of the fieldname[s] that refer to the
db table
Example : $schema->tbl('SequenceEntry.SE_id'); # returns 'SequenceEntry'
Returns : table name as string
Args : [an array of] fieldname[s] in "table.column" format
HIVSchema columnpartTop
 Title   : columnpart (alias: col)
Usage : $schema->col(@fieldnames)
Function: return the portion of the fieldname[s] that refer to the
db column
Example : $schema->col('SequenceEntry.SE_id'); # returns 'SE_id'
Returns : column name as string
Args : [an array of] fieldname[s] in "table.column" format
HIVSchema primarykeyTop
 Title   : primarykey [alias: pk]
Usage : $schema->pk(@tablenames);
Function: return the primary key of the specified table[s], as judged by
the syntax of the table's[s'] fieldnames
Example : $schema->pk('SequenceEntry') # returns 'SequenceEntry.SE_id'
Returns : primary key fieldname[s] in "table.column" format, or null if
no pk exists
Args : [an array of] table name[s] (fieldnames are ok, table part used)
HIVSchema foreignkeyTop
 Title   : foreignkey [alias: fk]
Usage : $schema->fk($intable [, $totable])
Function: return foreign key fieldname in table $intable referring to
table $totable, or all foreign keys in $intable if $totable
unspec'd
Example : $schema->fk('AUthor', 'SequenceEntry'); # returns 'AUthor_AU_SE_id'
Returns : foreign key fieldname[s] in "table.column" format
Args : tablename [, optional foreign table name] (fieldnames are ok,
table part used)
HIVSchema foreigntableTop
 Title   : foreigntable [alias ftbl]
Usage : $schema->ftbl( @foreign_key_fieldnames );
Function: return tablename of table that foreign keys points to
Example : $schema->ftbl( 'AUthor.AU_SE_id' ); # returns 'SequenceEntry'
Returns : tablename
Args : [an array of] fieldname[s] in "table.column" format
HIVSchema find_joinTop
 Title   : find_join
Usage : $sch->find_join('Table1', 'Table2')
Function: Retrieves a set of foreign and primary keys (in table.column
format) that represents a join path from Table1 to Table2
Example :
Returns : an array of keys (as table.column strings) -or- an empty
array if Table1 == Table2 -or- undef if no path exists
Args : two table names as strings
HIVSchema _find_join_gutsTop
 Title   : _find_join_guts
Usage : $sch->_find_join_guts($table1, $table2, $stackref, \$found, $reverse)
(call with $stackref = [], $found=0)
Function: recursive guts of find_join
Example :
Returns : if a path is found, $found==1 and @$stackref contains the keys
in table.column format representing the path; if a path is not
found, $found == 0 and @$stackref contains garbage
Args : $table1, $table2 : table names as strings
$stackref : an arrayref to an empty array
\$found : a scalar ref to the value 0
$rev : if $rev==1, the arrays of table names will be reversed;
this can give a shorter path if cycles exist in the
schema graph
HIVSchema loadSchemaTop
 Title   : loadHIVSchema [alias: loadSchema]
Usage : $schema->loadSchema( $XMLfilename )
Function: read (LANL DB) schema spec from XML
Example : $schema->loadSchema('lanl-schema.xml');
Returns : hashref to schema data
Keys are fieldnames in "table.column" format.
Each value is a hashref with the following properties:
{name} : HIVWEB 'table.column' format fieldname,
can be used directly in the cgi query
{aliases} : ref to array containing valid aliases/shortcuts for
{name}; can be used in routines creating the HTML query
{options} : ref to array containing valid matchdata for this field
can be used directly in the HTML query
{ankey} : contains the annotation key for this field used with
Bioperl annotation objects
{..attr..}: ..value_of_attr.. for this field (app-specific metadata)
Args :
HIVSchema _sfieldhTop
 Title   : _sfieldh
Usage : $schema->_sfieldh($fieldname)
Function: get hashref to the specified field hash
Example :
Returns : hashref
Args : fieldname in "table.column" format
Class QRY - a query algebra for HIVQueryTop
QRY SYNOPSISTop
  $Q = new QRY(
new R(
new Q('coreceptor', 'CXCR4'),
new Q('country', 'ZA')
)
);
QRY::Eq(QRY::And($Q, $Q), $Q); # returns 1
QRY::Eq(QRY::Or($Q, $Q), $Q); # returns 1
$Q2 = $Q1->clone;
$Q2 = new QRY(
new R(
new Q( 'coreceptor', 'CCR5' ),
new Q( 'country', 'ZA')
)
);
(QRY::And($Q, $Q2))->isnull; # returns 1
$Q3 = QRY::Or($Q, $Q2);
print $Q3->A; # prints '(CCR5 CXCR4)[coreceptor] (ZA)[country]'
QRY DESCRIPTIONTop
The QRY package provides a query parser for
Bio::DB::Query::HIVQuery. Currently, the parser supports AND, OR,
and () operations. The structure of the LANL cgi makes it tricky to
perform NOTs, though this could be implemented if the desire were
great.
Two class methods do the work. QRY::_parse_q does a first-pass
parse of the query string. QRY::_make_q interprets the parse tree
as returned by QRY::_parse_q and produces an array of hash
structures that can be used directly by Bio::DB::Query::HIVQuery
query execution methods. Validation of query fields and options is
performed at the Bio::DB::Query::HIVQuery level, not here.
QRY objects are collections of R (or request) objects, which are
in turn collections of Q (or atomic query) objects. Q objects
represent a query on a single field, with match data options ORed
together, e.g. (A B)[subtype]. R objects collect Q objects
that could be processed in a single HTTP request; i.e., a set of
atomic queries each having different fields ANDed together, such as
  (A B)[subtype] AND ('CCR5')[coreceptor] AND (US CA)[country]
The QRY object collects Rs that cannot be reduced (through
logical operations) to a single HTTP request, e.g.
  ((C)[subtype] AND (SI)[phenotype]) OR ( (D)[subtype] AND (NSI)[phenotype] ),
which cannot be got in one go through the current LANL cgi
implementation (as far as I can tell). The parser will simplify
something like
  ((C)[subtype] AND (SI)[phenotype]) OR ((C)[subtype] AND (NSI)[phenotype])
to the single request
  (C)[subtype] AND (NSI SI)[phenotype]
however.
The operators & and | are overloaded to QRY::And and
QRY::Or, to get Perl precedence and grouping for free. bool is
overloaded to get symbolic tests such as if ($QRY) {stuff}. ==
is overloaded with QRY::Eq for convenience. No overloading is done
for R or Q.
QRY _make_qTop
 Title   : _make_q
Usage : QRY::_make_q($parsetree)
Function: creates hash structures suitable for HIVQuery from parse tree
returned by QRY::_parse_q
Example :
Returns : array of hashrefs of query specs
Args : a hashref
QRY _make_q_gutsTop
 Title   : _make_q_guts (Internal class method)
Usage : _make_q_guts($ptree, $q_expr, $qarry, $anarry)
Function: traverses the parse tree returned from QRY::_parse_q, checking
syntax and creating HIVQuery-compliant query structures
Example :
Returns :
Args : $parse_tree (hashref), $query_expression (scalar string ref),
$query_array (array ref : stack for returning query structures),
$annotation_array (array ref : stack for returning annotation
fields)
QRY _parse_qTop
 Title   : _parse_q
Usage : QRY::_parse_q($query_string)
Function: perform first pass parse of a query string with some syntax
checking, return a parse tree suitable for QRY::_make_q
Example : QRY::_parse_q(" to[be] OR (not to)[be] ");
Returns : hashref
Args : query string
QRY CONSTRUCTORTop
QRY ConstructorTop
 Title   : QRY constructor
Usage : $QRY = new QRY()
Function:
Example :
Returns :
Args : array of R objects, optional
QRY INSTANCE METHODSTop
QRY requestsTop
 Title   : requests
Usage : $QRY->requests
Function: get/set array of requests comprising this QRY object
Example :
Returns :
Args : array of class R objects
QRY put_requestsTop
 Title   : put_requests
Usage : $QRY->put_request(@R)
Function: add object of class R to $QRY
Example :
Returns :
Args : [an array of] of class R object[s]
QRY isnullTop
 Title   : isnull
Usage : $QRY->isnull
Function: test if QRY object is null
Example :
Returns : 1 if null, 0 otherwise
Args :
QRY ATop
 Title   : A
Usage : print $QRY->A
Function: get a string representation of QRY object
Example :
Returns : string scalar
Args :
QRY lenTop
 Title   : len
Usage : $QRY->len
Function: get number of class R objects contained by QRY object
Example :
Returns : scalar
Args :
QRY cloneTop
 Title   : clone
Usage : $QRY2 = $QRY1->clone;
Function: create and return a clone of the object
Example :
Returns : object of class QRY
Args :
QRY CLASS METHODSTop
QRY OrTop
 Title   : Or
Usage : $QRY3 = QRY::Or($QRY1, $QRY2)
Function: logical OR for QRY objects
Example :
Returns : a QRY object
Args : two class QRY objects
QRY AndTop
 Title   : And
Usage : $QRY3 = QRY::And($QRY1, $QRY2)
Function: logical AND for QRY objects
Example :
Returns : a QRY object
Args : two class QRY objects
QRY BoolTop
 Title   : Bool
Usage : QRY::Bool($QRY1)
Function: allows symbolic testing of QRY object when bool overloaded
Example : do {stuff} if $QRY1 *same as* do {stuff} if !$QRY1->isnull
Returns :
Args : a class QRY object
QRY EqTop
 Title   : Eq
Usage : QRY::Eq($QRY1, $QRY2)
Function: test if R objects in two QRY objects are the same
(irrespective of order)
Example :
Returns : 1 if equal, 0 otherwise
Args : two class QRY objects
Class R - request objects for QRY algebraTop
R SYNOPSISTop
  $R = new R( $q1, $q2 );
$R->put_atoms($q3);
$R->del_atoms('coreceptor', 'phenotype');
return $R->clone;
$R1 = new R( new Q('subtype', 'B') );
$R2 = new R( new Q('subtype', 'B C'),
new Q('country', 'US') );
R::Eq( (R::And($R1, $R2))[0],
new R( new Q('subtype', 'B' ),
new Q('country', 'US') )); # returns 1
QRY::Eq( new QRY(R::Or($R1, $R2)), new QRY($R1, $R2) ); # returns 1
R::In( (R::And($R1, $R2))[0], $R1 ); # returns 1
R DESCRIPTIONTop
Class R objects contain a list of atomic queries (class Q
objects). Each class R object represents a single HTTP request to the
LANL DB. When converted to a DB query, the class Q objects contained
by an R object are effectively ANDed.
R CONSTRUCTORTop
R constructorTop
 Title   : R constructor
Usage : $R = new R()
Function: create a new R (request) object
Example :
Returns : class R (request) object
Args : optional, array of class Q objects
R INSTANCE METHODSTop
R lenTop
 Title   : len
Usage : $R->len
Function: get number of class Q objects contained in R object
Example :
Returns : scalar
Args :
R atomsTop
 Title   : atoms
Usage : $R->atoms( [optional $field])
Function: get array of class Q (atomic query) objects in class R object
Example : $R->atoms(); $R->atoms('coreceptor')
Returns : array of class Q objects (all Qs or those corresponding to $field
if present)
Args : optional, scalar string
R fieldsTop
 Title   : fields
Usage : $R->fields
Function: get array of fields of all Q objects contained in $R
Example :
Returns : array of scalars
Args :
R put_atomsTop
 Title   : put_atoms
Usage : $R->put_atoms( @q )
Function: AND an atomic query (class Q object) to the class R object's list
Example :
Returns : void
Args : an [array of] class Q object[s]
R del_atomsTop
 Title   : del_atoms
Usage : $R->del_atoms( @qfields )
Function: removes class Q objects from R object's list according to the
field names given in arguments
Example :
Returns : the class Q objects deleted
Args : scalar array of field names
R isnullTop
 Title   : isnull
Usage : $R->isnull
Function: test if class R object is null
Example :
Returns : 1 if null, 0 otherwise
Args :
R ATop
 Title   : A
Usage : print $R->A
Function: get a string representation of class R object
Example :
Returns : string scalar
Args :
R cloneTop
 Title   : clone
Usage : $R2 = $R1->clone;
Function: create and return a clone of the object
Example :
Returns : object of class R
Args :
R CLASS METHODSTop
R InTop
 Title   : In
Usage : R::In($R1, $R2)
Function: tests whether the query represented by $R1 would return a subset
of items returned by the query represented by $R2
Example : print "R2 gets those and more" if R::In($R1, $R2);
Returns : 1 if R1 is subset of R2, 0 otherwise
Args : two class R objects
R AndTop
 Title   : And
Usage : @Rresult = R::And($R1, $R2)
Function: logical AND for R objects
Example :
Returns : an array containing class R objects
Args : two class R objects
R OrTop
 Title   : Or
Usage : @Rresult = R::Or($R1, $R2)
Function: logical OR for R objects
Example :
Returns : an array containing class R objects
Args : two class R objects
R EqTop
 Title   : Eq
Usage : R::Eq($R1, $R2)
Function: test if class Q objects in two R objects are the same
(irrespective of order)
Example :
Returns : 1 if equal, 0 otherwise
Args : two class R objects
Class Q - atomic query objects for QRY algebraTop
Q SYNOPSISTop
    $q = new Q('coreceptor', 'CXCR4 CCR5');
$u = new Q('coreceptor', 'CXCR4');
$q->fld; # returns 'coreceptor'
$q->dta; # returns 'CXCR4 CCR5'
print $q->A; # prints '(CXCR4 CCR5)[coreceptor]
Q::qeq($q, $u); # returns 0
Q::qeq( Q::qor($q, $q), $q ); # returns 1
Q::qin($u, $q) # returns 1
Q::qeq(Q::qand($u, $q), $u ); # returns 1
Q DESCRIPTIONTop
Class Q objects represent atomic queries, that can be described by a
single LANL cgi parameter=value pair. Class R objects (requests) are
built from class Qs. The logical operations at the higher levels
(QRY, R) ultimately depend on the lower level operations on Qs:
qeq, qin, qand, qor.
Q CONSTRUCTORTop
Q constructorTop
 Title   : Q constructor
Usage : $q = new Q($field, $data)
Function: create a new Q (atomic query) object
Example :
Returns : class Q object
Args : optional $field, $data strings
Q INSTANCE METHODSTop
Q isnullTop
 Title   : isnull
Usage : $q->isnull
Function: test if class Q object is null
Example :
Returns : 1 if null, 0 otherwise
Args :
Q fldTop
 Title   : fld
Usage : $q->fld($field)
Function: get/set fld (field name) property
Example :
Returns : scalar
Args : scalar
Q dtaTop
 Title   : dta
Usage : $q->dta($data)
Function: get/set dta (whsp-separated data string) property
Example :
Returns : scalar
Args : scalar
Q ATop
 Title   : A
Usage : print $q->A
Function: get a string representation of class Q object
Example :
Returns : string scalar
Args :
Q cloneTop
 Title   : clone
Usage : $q2 = $q1->clone;
Function: create and return a clone of the object
Example :
Returns : object of class Q
Args :
Q CLASS METHODSTop
Q qinTop
 Title   : qin
Usage : Q::qin($q1, $q2)
Function: tests whether the query represented by $q1 would return a subset
of items returned by the query represented by $q2
Example : print "q2 gets those and more" if Q::qin($q1, $q2);
Returns : 1 if q1 is subset of q2, 0 otherwise
Args : two class Q objects
Q qeqTop
 Title   : qeq
Usage : Q::qeq($q1, $q2)
Function: test if fld and dta properties in two class Q objects are the same
(irrespective of order)
Example :
Returns : 1 if equal, 0 otherwise
Args : two class Q objects
Q qorTop
 Title   : qor
Usage : @qresult = Q::qor($q1, $q2)
Function: logical OR for Q objects
Example :
Returns : an array of class Q objects
Args : two class Q objects
Q qandTop
 Title   : qand
Usage : @qresult = Q::And($q1, $q2)
Function: logical AND for R objects
Example :
Returns : an array of class Q objects
Args : two class Q objects
Q INTERNALSTop
Q uniqueTop
 Title   : unique
Usage : @ua = unique(@a)
Function: return contents of @a with duplicates removed
Example :
Returns :
Args : an array
Additional tools for Bio::AnnotationCollectionITop
Bio::AnnotationCollectionI SYNOPSIS (additional methods)Top
    $seq->annotation->put_value('patient_id', 1401)
$seq->annotation->get_value('patient_ids') # returns 1401
$seq->annotation->put_value('patient_group', 'MassGenH')
$seq->annotation->put_value(['clinical', 'cd4count'], 503);
$seq->annotation->put_value(['clinical', 'virus_load'], 150805);
foreach ( qw( cd4count virus_load ) ) {
$blood_readings{$_} = $seq->annonation->get_value(['clinical', $_]);
}
Bio::AnnotationCollectionI DESCRIPTION (additional methods)Top
get_value() and put_value allow easy creation of and access to an
annotation collection tree with nodes of Bio::Annotation::SimpleValue. These
methods obiviate direct accession of the SimpleValue objects.