feat(ARCO-291): Ordered callbacks

[boecklim]

Description of Changes

• Use ordered send manager to guarantee callbacks are sent in order
• Refactor callbacker

Testing Procedure

Describe the tests you've added or any testing steps you've taken.

• I have added new unit tests
• All tests pass locally
• I have tested manually in my local environment

Checklist:

• I have performed a self-review of my own code
• I have made corresponding changes to the documentation
• My changes generate no new warnings
• I have updated CHANGELOG.md with my changes

[shotasilagadzetaal]

This sorting is working in N^2 time I think. Above 10,000 entries this will be a dead code.

Isn't https://github.com/google/btree an option here? we would simply add items there and not worry about sorting at all. Front would always return smallest (by timestamp).

[boecklim]

Probably this btree package would be faster to sort. But then I need to use another data structure than that linked list which is used here.

There is a maximum of items for the queue so that it cannot have more than 10'000 items:

arc/internal/callbacker/send_manager/send_manager.go

Line 54 in 38b431a

entriesBufferSize = 10000

I could make sure that this value is not exceeded like this for example

func WithBufferSize(size int) func(*SendManager) {
	return func(m *SendManager) {
		if size >= entriesBufferSize {
			m.bufferSize = entriesBufferSize
			return
		}
		m.bufferSize = size
	}
}

[shotasilagadzetaal]

Why linked list? if you had simply slice and just called sort function every time it would be even faster I think. Anyway, you decide. you can resolve.

[boecklim]

I added another commit implementing the send manager not using the linked list but a slice

[sonarqubecloud]

Quality Gate passed

Issues
3 New issues
0 Accepted issues

Measures
0 Security Hotspots
89.2% Coverage on New Code
0.0% Duplication on New Code

See analysis details on SonarQube Cloud