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
{{ message }}
This repository has been archived by the owner on Jan 3, 2024. It is now read-only.
We can use graph cloning to implement the dependency solver safety, with an atomic reference and compareAndSet().
Similar procedures can be used to do safe inserts into the provider cache. MemoizingProvider is already thread safe, and walking a graph is safe because any new nodes won't affect something in the process of being instantiated.
*Originally reported by mludwig on BitBucket
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
We can use graph cloning to implement the dependency solver safety, with an atomic reference and compareAndSet().
Similar procedures can be used to do safe inserts into the provider cache. MemoizingProvider is already thread safe, and walking a graph is safe because any new nodes won't affect something in the process of being instantiated.
*Originally reported by mludwig on BitBucket
The text was updated successfully, but these errors were encountered: