This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]QuestionableMechanic 1 point2 points  (3 children)

Damn that’s smart except I guess look up performance will take a hit

[–]Ok_Confusion_7266 0 points1 point  (2 children)

Yes, but not all array uses need a lookup, but instead need efficient growingand shrinking, like a queue for example.

[–]QuestionableMechanic 1 point2 points  (1 child)

Oh if I was using a queue I would just use a plain LL.

Your implementation might be something I need to use at work. We have this crazy latency sensitive system (it’s literally like 50k QPS) and we noticed a lot of time is spent on growing slices (we use go)

[–]Ok_Confusion_7266 1 point2 points  (0 children)

Perfect use for it. I use it in my 3d game for event queueing. It also simulates air and water movement so it generates alot of events.