AJ Heller

The "Functions" example on lljs.org shows that function copying leaks into the dynamic type system: ``` let unsafeQuux = quux; ``` Just to see what happens, `let i32 unsafeQuux =...

Add libuv:: namespace to exported libuvConfig.cmake

1

I believe this was an oversight when the `install(EXPORT` was added last year in https://github.com/libuv/libuv/pull/3293. @pemensik please correct me if I'm wrong about that.

This decouples the backoff reconnect timeout from the connection timeout when fixed-length timeouts are set in the end2end tests. If we can do away with the fixed timeouts altogether, then...

Relands https://github.com/grpc/grpc/pull/30128 ``` Any class that is derived from std::enable_shared_from_this can now be stored as a shared_ptr inside ChannelArgs. This is a step towards using ChannelArgs as the primary means...

``` /// Reset gRPC's EventEngine factory to the built-in default. /// /// Applications that have called SetEventEngineFactory can remove their /// custom factory using this method. The built-in EventEngine factories...

L82: gRPC Core EventEngine API

1

@markdroth @nicolasnoble @ctiller @veblush Please review!

I think the primary need here is to update the README. ```bash florp:ansible-playbook me$ ansible-playbook ./ec2.yml --extra-vars "vars_file=./example_ec2_vars.yml" --tags launch [WARNING]: log file at /var/log/ansible.log is not writeable and we...

Precondition ChannelArgs with EventEngines

6

If an EventEngine is not explicitly provided to ChannelArgs, the default EventEngine will be set when ChannelArgs are preconditioned. This relands the second half of #30556, along with some added...

Now that it is a weak_ptr, there's no need to explicitly reset it. When the tracked shared_ptr is deleted, the weak_ptr will fail to lock, and a new default EventEngine...

[Feature] Min-cut / Max-flow

1

Potential implementations: - [A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel](http://link.springer.com/chapter/10.1007%2F978-3-642-23094-3_1) - [A distributed algorithm for min-max tree and max-min cut problems in communication networks](http://dl.acm.org/citation.cfm?id=1959368&dl=ACM&coll=DL&CFID=680683929&CFTOKEN=44385931)