You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
frozen.LazySet should be implemented over the top of frozen.Set. Considerations:
Consider whether frozen.LazyMap is warranted. frozen.Map doesn't have many algebraic operations, at least not yet.
Incremental caching: As the LazySet materialises, cache all values seen so far in a Set.
Allow generative, quasi-infinite lazy sets such as AllUints(). These could be bounded by filters: AllUints().Where("$ < 10").
LazySet might need more fine-grained semantics for better optimisations. One example comes to mind: Instead of just IsEmpty() and Count(), it might be useful to have CountUpTo(n int), which will return the count up to a maximum of n, where a return value of n implies Count() ≥ n. This avoids problems with infinite lazy sets.
The text was updated successfully, but these errors were encountered:
frozen.LazySet
should be implemented over the top offrozen.Set
. Considerations:frozen.LazyMap
is warranted.frozen.Map
doesn't have many algebraic operations, at least not yet.LazySet
materialises, cache all values seen so far in aSet
.AllUints()
. These could be bounded by filters:AllUints().Where("$ < 10")
.LazySet
might need more fine-grained semantics for better optimisations. One example comes to mind: Instead of justIsEmpty()
andCount()
, it might be useful to haveCountUpTo(n int)
, which will return the count up to a maximum ofn
, where a return value ofn
impliesCount() ≥ n
. This avoids problems with infinite lazy sets.The text was updated successfully, but these errors were encountered: