i am currently working on cryptocurrency exchange i am building matching engine now i need FIFO data structure for orderbook that is queue but if i apply it through slices then i have memory issue and if i apply it through link list type data structure then concurrency is not achieved i want a queue that should be memory efficient and it should support concurrency if you understand my problem then plz help me
When the capacity and actual size of a slice diverge to much, just use copy() explicitly into a slice with smaller capacity but where the old one still fits into.
This topic was automatically closed 90 days after the last reply. New replies are no longer allowed.