Why is FIFO Queue's shift faster than native javascript array shift?
Background: I've a non CS background, so no CS101 knowledge at all.
Why is tiny-queue's shift method (github.com/nolanlawson/tiny-queue/blob/mast..) faster than native array shift, as told in the readme of the module?