mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-06-06 22:23:22 +00:00
Code Activity

fix python doc regressions

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2019-03-24 13:10:11 -07:00
parent cdc89b6193
commit 32164b6c7f
1 changed files with 6 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

13
src/api/python/z3/z3.py
View file

@ -3841,7 +3841,7 @@ def Extract(high, low, a):
>>> Extract(6, 2, x).sort() >>> Extract(6, 2, x).sort()
BitVec(5) BitVec(5)
>>> simplify(Extract(StringVal("abcd"),2,1)) >>> simplify(Extract(StringVal("abcd"),2,1))
c "c"
""" """
if isinstance(high, str): if isinstance(high, str):
high = StringVal(high) high = StringVal(high)
@ -10051,10 +10051,10 @@ def Empty(s):
True True
>>> e3 = Empty(SeqSort(IntSort())) >>> e3 = Empty(SeqSort(IntSort()))
>>> print(e3) >>> print(e3)
seq.empty Empty(Seq(Int))
>>> e4 = Empty(ReSort(SeqSort(IntSort()))) >>> e4 = Empty(ReSort(SeqSort(IntSort())))
>>> print(e4) >>> print(e4)
re.empty Empty(ReSort(Seq(Int)))
""" """
if isinstance(s, SeqSortRef): if isinstance(s, SeqSortRef):
return SeqRef(Z3_mk_seq_empty(s.ctx_ref(), s.ast), s.ctx) return SeqRef(Z3_mk_seq_empty(s.ctx_ref(), s.ast), s.ctx)
@ -10066,10 +10066,10 @@ def Full(s):
"""Create the regular expression that accepts the universal language """Create the regular expression that accepts the universal language
>>> e = Full(ReSort(SeqSort(IntSort()))) >>> e = Full(ReSort(SeqSort(IntSort())))
>>> print(e) >>> print(e)
re.all Full(ReSort(Int))
>>> e1 = Full(ReSort(StringSort())) >>> e1 = Full(ReSort(StringSort()))
>>> print(e1) >>> print(e1)
rel.all Full(ReSort(String))
""" """
if isinstance(s, ReSortRef): if isinstance(s, ReSortRef):
return ReRef(Z3_mk_re_full(s.ctx_ref(), s.ast), s.ctx) return ReRef(Z3_mk_re_full(s.ctx_ref(), s.ast), s.ctx)
@ -10131,7 +10131,7 @@ def Replace(s, src, dst):
"""Replace the first occurrence of 'src' by 'dst' in 's' """Replace the first occurrence of 'src' by 'dst' in 's'
>>> r = Replace("aaa", "a", "b") >>> r = Replace("aaa", "a", "b")
>>> simplify(r) >>> simplify(r)
baa "baa"
""" """
ctx = _get_ctx2(dst, s) ctx = _get_ctx2(dst, s)
if ctx is None and is_expr(src): if ctx is None and is_expr(src):
@ -10276,7 +10276,6 @@ def Union(*args):
def Intersect(*args): def Intersect(*args):
"""Create intersection of regular expressions. """Create intersection of regular expressions.
>>> re = Intersect(Re("a"), Re("b"), Re("c")) >>> re = Intersect(Re("a"), Re("b"), Re("c"))
Intersect(Re("a"), Re("b"), Re("c"))
""" """
args = _get_args(args) args = _get_args(args)
sz = len(args) sz = len(args)