Add a simple benchmark: x := queue([])$Queue(Integer) for f in 0..(10^5) repeat enqueue!(0,x)
Before patch, it's 53.91 s, after it's 1.02 s. > OTOH if for some computation queue operations > become critical it is likely that array based queue will > give better performance. I might add ArrayQueue and ArrayDequeue in the future, just like ArrayStack, but their implementation will also have a front and a rear, to achieve O(1) insertion and extraction at one direction or both. -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
