— So I have to throttle and cache DB requests
Arrays have fixed length at the time of creation and cannot grow in length to accommodate new items past its size.. Arraylist can grow dynamically
— Also deleting an element in the middle of the array means shifting all the other items forward to fill the gap.. Doing many creation and deletions on large data sets can be detrimental to performance.. Linked lists on the other hand don't suffer this problem
— Before initial release:
1. Use prepared statements everywhere I can, and implement proper escaping where prepared statements are impossible
2. Support multiple DB backends
— Mh.. Sounds interesting..
— JS Arrays are completely dynamic, they can contain elements of any time, different types at the same time, grow and shrink, etc
— But yes, they do have this problem in JS. V8 may do some magic to optimize this, but the bigger question is:
Why are you storing huge arrays in JS?
— JS is not great for CPU-heavy operations
— It's perfect for streaming, data-heavy apps, and I/O
— In JS you generally don't want or need that much data in-memory at once
— What do you mean by streaming?
— Streaming data