DBIx::DBStag::Constraint(3pm)

DBIx::DBStag::Constraint3pm

Recursive structure for representing query constraints

Overview

A constraint is a recursive structure for representing query constraints;

  AND ---  x=1
    \
     \---- OR   ---  y>2
            \
             \-----  boolfunc(z)

A constraint is either a bool (AND, OR, NOT) with >0 children, or it can be a leaf node representing an atomic constraint

the constraint corresponds to a SQLTemplate option block; eg

  [ name LIKE &name& ]
  [ name => &name& ]
  [ start > &min_start& ]
  [ start => &start& ]
  [ somefunc(&x&) ]
  [ somefunc(&x&, &y&) ]
  [ somefunc(t.col, &x&, &y&) => &z& ]

the constraint consists of an operator (represented by => in the option block). If no => is present, then it is a simple variable binding.

A constraint can consist of multiple variable bindings

Website

<http://stag.sourceforge.net>

Releases

7 releases since Debian 7 (Wheezy); the text changed 2 times.

  1. 7–8
  2. 9–11
  3. 12–13

Author

Chris Mungall <[email protected]>

From libdbix-dbstag-perl 0.12-4 in Debian 13 (Trixie). Parsed by carta from the page's man source.