Struct Regexp

pub struct Regexp<'ctx> { /* private fields */ }

Ast node representing a regular expression.

use z3::ast;
use z3::{Config, Context, Solver, SatResult};

let cfg = Config::new();
let ctx = &Context::new(&cfg);
let solver = Solver::new(&ctx);
let s = ast::String::new_const(ctx, "s");

// the regexp representing foo[a-c]*
let a = ast::Regexp::concat(ctx, &[
    &ast::Regexp::literal(ctx, "foo"),
    &ast::Regexp::range(ctx, &'a', &'c').star()
]);
// the regexp representing [a-z]+
let b = ast::Regexp::range(ctx, &'a', &'z').plus();
// intersection of a and b is non-empty
let intersect = ast::Regexp::intersect(ctx, &[&a, &b]);
solver.assert(&s.regex_matches(&intersect));
assert!(solver.check() == SatResult::Sat);

Implementations

impl<'ctx> Regexp<'ctx>

pub fn literal(ctx: &'ctx Context, s: &str) -> Self

Creates a regular expression that recognizes the string given as parameter

pub fn range(ctx: &'ctx Context, lo: &char, hi: &char) -> Self

Creates a regular expression that recognizes a character in the specified range (e.g. [a-z])

pub fn loop(&self, lo: u32, hi: u32) -> Self

Creates a regular expression that recognizes this regular expression lo to hi times (e.g. a{2,3})

pub fn power(&self, n: u32) -> Self

Creates a regular expression that recognizes this regular expression n number of times Requires Z3 4.8.15 or later.

pub fn full(ctx: &'ctx Context) -> Self

Creates a regular expression that recognizes all sequences

pub fn allchar(ctx: &'ctx Context) -> Self

Creates a regular expression that accepts all singleton sequences of the characters Requires Z3 4.8.13 or later.

pub fn empty(ctx: &'ctx Context) -> Self

Creates a regular expression that doesn’t recognize any sequences

pub fn plus(&self) -> Self

Creates a regular expression that recognizes this regular expression one or more times (e.g. a+)

pub fn star(&self) -> Self

Creates a regular expression that recognizes this regular expression any number of times (Kleene star, e.g. a*)

pub fn complement(&self) -> Self

Creates a regular expression that recognizes any sequence that this regular expression doesn’t

pub fn option(&self) -> Self

Creates a regular expression that optionally accepts this regular expression (e.g. a?)

pub fn diff(&self, other: &Self) -> Self

Creates a difference regular expression Requires Z3 4.8.14 or later.

pub fn concat(ctx: &'ctx Context, values: &[impl Borrow<Self>]) -> Self

Concatenates regular expressions

pub fn union(ctx: &'ctx Context, values: &[impl Borrow<Self>]) -> Self

Creates a regular expression that recognizes sequences that any of the regular expressions given as parameters recognize

pub fn intersect(ctx: &'ctx Context, values: &[impl Borrow<Self>]) -> Self

Creates a regular expression that only recognizes sequences that all of the parameters recognize

Trait Implementations

impl<'ctx> Ast<'ctx> for Regexp<'ctx>

unsafe fn wrap(ctx: &'ctx Context, ast: Z3_ast) -> Self

Wrap a raw Z3_ast.

fn get_ctx(&self) -> &'ctx Context

fn get_z3_ast(&self) -> Z3_ast

fn _eq(&self, other: &Self) -> Bool<'ctx>

where Self: Sized,

Compare this Ast with another Ast, and get a Bool representing the result.

fn _safe_eq(&self, other: &Self) -> Result<Bool<'ctx>, SortDiffers<'ctx>>

where Self: Sized,

Compare this Ast with another Ast, and get a Result. Errors if the sort does not match for the two values.

fn distinct(ctx: &'ctx Context, values: &[impl Borrow<Self>]) -> Bool<'ctx>

where Self: Sized,

Compare this Ast with a list of other Asts, and get a Bool which is true only if all arguments (including Self) are pairwise distinct.

fn get_sort(&self) -> Sort<'ctx>

Get the Sort of the Ast.

fn simplify(&self) -> Self

where Self: Sized,

Simplify the Ast. Returns a new Ast which is equivalent, but simplified using algebraic simplification rules, such as constant propagation.

fn substitute<T: Ast<'ctx>>(&self, substitutions: &[(&T, &T)]) -> Self

where Self: Sized,

Performs substitution on the Ast. The slice substitutions contains a list of pairs with a “from” Ast that will be substituted by a “to” Ast.

fn num_children(&self) -> usize

Return the number of children of this Ast.

fn nth_child(&self, idx: usize) -> Option<Dynamic<'ctx>>

Return the nth child of this Ast.

fn children(&self) -> Vec<Dynamic<'ctx>>

Return the children of this node as a Vec<Dynamic>.

fn kind(&self) -> AstKind

Return the AstKind for this Ast.

fn is_app(&self) -> bool

Return true if this is a Z3 function application.

fn is_const(&self) -> bool

Return true if this is a Z3 constant.

fn decl(&self) -> FuncDecl<'ctx>

Return the FuncDecl of the Ast.

fn safe_decl(&self) -> Result<FuncDecl<'ctx>, IsNotApp>

fn translate<'src_ctx>(&'src_ctx self, dest: &'ctx Context) -> Self

where Self: Sized,

impl<'ctx> Clone for Regexp<'ctx>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'ctx> Debug for Regexp<'ctx>

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<'ctx> Display for Regexp<'ctx>

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<'ctx> Drop for Regexp<'ctx>

fn drop(&mut self)

Executes the destructor for this type.

impl<'ctx> From<Regexp<'ctx>> for Z3_ast

fn from(ast: Regexp<'ctx>) -> Self

Converts to this type from the input type.

impl<'ctx> Hash for Regexp<'ctx>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'ctx> PartialEq for Regexp<'ctx>

fn eq(&self, other: &Regexp<'ctx>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'ctx> Eq for Regexp<'ctx>