Inheritance diagram for SortRef:Public Member Functions | |
| def | as_ast (self) |
| def | get_id (self) |
| def | kind (self) |
| def | subsort (self, other) |
| def | cast (self, val) |
| def | name (self) |
| def | __eq__ (self, other) |
| def | __ne__ (self, other) |
| def | __hash__ (self) |
Public Member Functions inherited from AstRef | |
| def | __init__ (self, ast, ctx=None) |
| def | __del__ (self) |
| def | __str__ (self) |
| def | __repr__ (self) |
| def | __eq__ (self, other) |
| def | __hash__ (self) |
| def | __nonzero__ (self) |
| def | __bool__ (self) |
| def | sexpr (self) |
| def | as_ast (self) |
| def | get_id (self) |
| def | ctx_ref (self) |
| def | eq (self, other) |
| def | translate (self, target) |
| def | hash (self) |
Public Member Functions inherited from Z3PPObject | |
| def | use_pp (self) |
Additional Inherited Members | |
Data Fields inherited from AstRef | |
| ast | |
| ctx | |
A Sort is essentially a type. Every Z3 expression has a sort. A sort is an AST node.
| def __eq__ | ( | self, | |
| other | |||
| ) |
Return `True` if `self` and `other` are the same Z3 sort.
>>> p = Bool('p')
>>> p.sort() == BoolSort()
True
>>> p.sort() == IntSort()
False
Definition at line 535 of file z3py.py.
Referenced by Probe.__ne__().
| def __hash__ | ( | self | ) |
| def __ne__ | ( | self, | |
| other | |||
| ) |
Return `True` if `self` and `other` are not the same Z3 sort.
>>> p = Bool('p')
>>> p.sort() != BoolSort()
False
>>> p.sort() != IntSort()
True
| def as_ast | ( | self | ) |
| def cast | ( | self, | |
| val | |||
| ) |
| def get_id | ( | self | ) |
| def kind | ( | self | ) |
Return the Z3 internal kind of a sort. This method can be used to test if `self` is one of the Z3 builtin sorts. >>> b = BoolSort() >>> b.kind() == Z3_BOOL_SORT True >>> b.kind() == Z3_INT_SORT False >>> A = ArraySort(IntSort(), IntSort()) >>> A.kind() == Z3_ARRAY_SORT True >>> A.kind() == Z3_INT_SORT False
| def name | ( | self | ) |
Return the name (string) of sort `self`. >>> BoolSort().name() 'Bool' >>> ArraySort(IntSort(), IntSort()).name() 'Array'
| def subsort | ( | self, | |
| other | |||
| ) |
1.8.12