Queue all changes in order using non-blocking async queue

[gammazero]

It is possible for changes to get our of order when they are submitted by goroutines for non-blocking operations. Instead of goroutines, use an asynchronous queue to maintain order of events.

This may prevent provlems caused by mis-ordering of events shuch as connect and disconnect events.

[codecov]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 61.53%. Comparing base (2c5f80a) to head (c15e74f).
Report is 4 commits behind head on main.

@@            Coverage Diff             @@
##             main     #981      +/-   ##
==========================================
+ Coverage   61.51%   61.53%   +0.01%     
==========================================
  Files         254      254              
  Lines       31494    31490       -4     
==========================================
+ Hits        19373    19376       +3     
+ Misses      10533    10527       -6     
+ Partials     1588     1587       -1     

Files with missing lines	Coverage Δ
...tswap/client/internal/session/sessionwantsender.go	97.33% <100.00%> (+0.45%)	⬆️

... and 9 files with indirect coverage changes

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

[guillaumemichel]

It makes sense!

[guillaumemichel]

@gammazero you wrote the library so you probably know better.

Are there any benefits of doing like above?

changes := sws.changes.Out()
for range sws.changes.Len() {
	select {
	case next := <-changes:
...

[gammazero]

Maybe slightly? The function call should get inlined anyway, so is it worth the extra line of code? 🤷