StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
14511921
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-01-24T22:23:18.550
FavoriteCount
0
LastActivityDate
2013-01-24T22:23:18.550
LastEditDate
LastEditorUserId
0
OwnerUserId
841416
ParentId
14446413
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
You are in the right direction. However, the code is missing two important cases: bit-vectors, and finite datatypes that are not enumeration types (example, a pair of finite types). Here is the code that consider these two extra cases. The function <code>universe(s)</code> returns the elements in the universe of sort <code>s</code>. BTW, a possible improvement is to use iterators instead of lists. Thus, we could even support infinite sorts such as integers and recursive datatypes (e.g., lists), and generate the elements on demand. <pre><code>from z3 import * import itertools def universe(vsort): found = set() def rec(vsort): id = Z3_get_ast_id(vsort.ctx_ref(), vsort.as_ast()) if id in found: raise AssertionError('recursive sorts are not supported') found.add(id) ctx = vsort.ctx if vsort.kind() == Z3_BOOL_SORT: return [ BoolVal(False, ctx), BoolVal(True, ctx) ] elif vsort.kind() == Z3_BV_SORT: sz = vsort.size() return [ BitVecVal(i, vsort) for i in range(2**sz) ] elif vsort.kind() == Z3_DATATYPE_SORT: r = [] for i in range(vsort.num_constructors()): c = vsort.constructor(i) if c.arity() == 0: r.append(c()) else: domain_universe = [] for j in range(c.arity()): domain_universe.append(rec(c.domain(j))) r = r + [ c(*args) for args in itertools.product(*domain_universe) ] return r else: raise AssertionError('dont know how to deal with this sort') return rec(vsort) </code></pre> Here are some examples: <pre><code>print universe(BoolSort()) >> [False, True] print universe(BitVecSort(4)) >> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15] S, elems = EnumSort('S', ['a', 'b', 'c', 'd']) print universe(S) >> [a, b, c, d] # Create a Pair (Bool, S) d = Datatype('Pair') d.declare('mkpair', ('bval', BoolSort()), ('sval', S)) D = d.create() print universe(D) >> [mkpair(False, a), mkpair(False, b), mkpair(False, c), mkpair(False, d), mkpair(True, a), mkpair(True, b), mkpair(True, c), mkpair(True, d)] # Create a Choice sort where each element is a Pair or a BitVector of size 4. c = Datatype('Choice') c.declare('aspair', ('pval', D)) c.declare('asbv', ('bval', BitVecSort(4))) C = c.create() print universe(C) >> [aspair(mkpair(False, a)), aspair(mkpair(False, b)), aspair(mkpair(False, c)), aspair(mkpair(False, d)), aspair(mkpair(True, a)), aspair(mkpair(True, b)), aspair(mkpair(True, c)), aspair(mkpair(True, d)), asbv(0), asbv(1), asbv(2), asbv(3), asbv(4), asbv(5), asbv(6), asbv(7), asbv(8), asbv(9), asbv(10), asbv(11), asbv(12), asbv(13), asbv(14), asbv(15)] l = Datatype('List') l.declare('cons', ('car', BoolSort()), ('cdr', l)) l.declare('nil') List = l.create() print universe(List) >> Traceback (most recent call last): >> ... >> AssertionError: recursive sorts are not supported </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POZ3: finding all possible values of a variable
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USLeonardo de Moura
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.