tokio-tungstenite VS slotmap

I can't help you debug your code if you do not provide it. Have you looked at the example client?

It passed all test of the autobahn testsuite And web-socket-benchmark show about 3x faster then tokio-tungstenite

There are example files in the tokio-tungstenite crate called `autobahn-client.rs` and `autobahn-server.rs`. Why are they called autobahn? I googled and can't understand what autobahn is all about. Is it a websocket pattern? Or some protocol?

I'm using another crate that requires tls, specifically tokio-tungstenite, I'll try your suggestions later today once I get home

Tokio-tungstenite - It looks like in this example, it's spamming the task thread with wakeup calls from all of the active connections. This design choice makes me doubt that this was well written in general.

tokio-tungstenite is the more popular library. In frameworks, offhand Axum supports websockets (docs, example)

If you only have one task sending data to the sink, you probably don't need forward, as you can just write to the sink directly (you might not even need to split the stream in the first place, but i'm not sure about that). But often you want to write to the sink from different tasks (e.g. this example takes messages sent from one websocket connection, and broadcasts it onto every other connected websocket, so the sink for each websocket needs to be accessed by every other websocket handler task), and you can't do that with only the sink as you can't clone it. Either need to wrap it into a Mutex and clone that around the different tasks (and lock it every time you need to write to it, like OP did originally) or you can use forward to map the rx (receiver) of a channel to the sink, and clone the tx (sender) part of the channel for each task that wants to write to the sink. That way, you only have one task that is accessing the sink directly, so no issues with synchronization.

Has anyone worked with websockets before? Particularly with the tokio-tungstenite crate? I'm getting a Protocol(ResetWithoutClosingHandshake) error in my request. I send in some text, and i'm supposed to receive an audio file back.

tokio-tungstenite

i based my code mostly on the client example from the tokio-tungstenite project: https://github.com/snapview/tokio-tungstenite/blob/master/examples/client.rs

It looks like .get_disjoint_mut() from slotmap failed under stacked borrows, but seems to pass under tree borrows

I think slotmap is meant to solve this exact issue. Basically when you insert into a collection you get an Id:Version tuple as key. When you reuse a slot, next time the key will be Id:Version+1 and when you try to access the removed value by using Id:Version, it will return None. You can think about it as delayed invalidation.

Dunno about existing implementations, but it looks like it's a feature they'd accept: https://github.com/orlp/slotmap/issues/73

It's actually quite easy.

You can use either slot map or slab to side step rust borrow checker. Example https://github.com/orlp/slotmap/blob/master/examples/rand_meld_heap.rs

I don't know, only have some theories.

1. The name isn't particularly catchy or descriptive. It is the correct name for the data structure, but not too many people know the data structure.

2. People don't even know what they're missing. It's not a very Google-able problem to begin with. Slotmap provides an interesting solution to (circular) ownership and safe allocator / weak pointer design problems, but people don't recognize that they're having them or that slotmap could help.

As an example of this, the doubly linked list example (https://github.com/orlp/slotmap/blob/master/examples/doubly_...) can safely remove nodes from the linked list given their handle, in O(1), even from the middle, completely safely and correctly, even in the presence of double deletions or ABA memory re-use. You can't replicate this with just pointers, without introducing heavy refcounting solutions.

Nope, it's perfectly safe: https://github.com/orlp/slotmap/blob/master/examples/doubly_linked_list.rs.

I think keeping the relationship between child and parent elements in the node graph might be better accommodating better via a psuedo-ECS system, see https://www.reddit.com/r/rust/comments/cnjhup/idiomatic_way_to_reference_parent_struct/. The https://github.com/orlp/slotmap crate looks promising. I think I'm just going to ditch the global shared HashMap in favor of something that can better accommodate child/parent relations.

I think the slotmap crate is similar to what you're trying to write: https://github.com/orlp/slotmap