List has the method add(int, E), so you can use: list.add(0, yourObject); Afterwards you can delete the last element with: if(list.size() > 10) list.remove(list.size() – 1); However, you might want to rethink your requirements or use a different data structure, like a Queue EDIT Maybe have a look at Apache’s CircularFifoQueue: CircularFifoQueue is a first-in … Read more
No, and it never will since Guido van Rossum prefers to be able to have proper tracebacks: Tail Recursion Elimination (2009-04-22) Final Words on Tail Calls (2009-04-27) You can manually eliminate the recursion with a transformation like this: >>> def trisum(n, csum): … while True: # Change recursion to a while loop … if n … Read more
Stack Smashing here is actually caused due to a protection mechanism used by gcc to detect buffer overflow errors. For example in the following snippet: #include <stdio.h> void func() { char array[10]; gets(array); } int main(int argc, char **argv) { func(); } The compiler, (in this case gcc) adds protection variables (called canaries) which have … Read more
Try adding FLAG_ACTIVITY_NEW_TASK as described in the docs for FLAG_ACTIVITY_CLEAR_TOP: This launch mode can also be used to good effect in conjunction with FLAG_ACTIVITY_NEW_TASK: if used to start the root activity of a task, it will bring any currently running instance of that task to the foreground, and then clear it to its root state. … Read more
Keep 2 stacks, let’s call them inbox and outbox. Enqueue: Push the new element onto inbox Dequeue: If outbox is empty, refill it by popping each element from inbox and pushing it onto outbox Pop and return the top element from outbox Using this method, each element will be in each stack exactly once – … Read more
The answer is right there in the man page (at least on Linux): RETURN VALUE The alloca() function returns a pointer to the beginning of the allocated space. If the allocation causes stack overflow, program behaviour is undefined. Which isn’t to say it should never be used. One of the OSS projects I work on … Read more
Stack allocation is much faster since all it really does is move the stack pointer. Using memory pools, you can get comparable performance out of heap allocation, but that comes with a slight added complexity and its own headaches. Also, stack vs. heap is not only a performance consideration; it also tells you a lot … Read more
Vector synchronizes on each individual operation. That’s almost never what you want to do. Generally you want to synchronize a whole sequence of operations. Synchronizing individual operations is both less safe (if you iterate over a Vector, for instance, you still need to take out a lock to avoid anyone else changing the collection at … Read more
var stack = []; stack.push(2); // stack is now [2] stack.push(5); // stack is now [2, 5] var i = stack.pop(); // stack is now [2] alert(i); // displays 5 var queue = []; queue.push(2); // queue is now [2] queue.push(5); // queue is now [2, 5] var i = queue.shift(); // queue is now … Read more