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
A similar question was asked, but it didn’t ask about statics. Summary of what static, heap, and stack memory are: A static variable is basically a global variable, even if you cannot access it globally. Usually there is an address for it that is in the executable itself. There is only one copy for the … 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
Here’s an example using CardLayout. import java.awt.BorderLayout; import java.awt.CardLayout; import java.awt.Color; import java.awt.Dimension; import java.awt.EventQueue; import java.awt.event.ActionEvent; import java.util.Random; import javax.swing.AbstractAction; import javax.swing.JButton; import javax.swing.JFrame; import javax.swing.JLabel; import javax.swing.JPanel; /** @see http://stackoverflow.com/questions/5654926 */ public class CardPanel extends JPanel { private static final Random random = new Random(); private static final JPanel cards = new JPanel(new … Read more
Hmm… it works for me and with far less than 999MB of stack: > java -Xss4m Test 0 (Windows JDK 7, build 17.0-b05 client VM, and Linux JDK 6 – same version information as you posted)
Your array is way too big to fit into the stack, consider using the heap: int *sieve = malloc(2000000 * sizeof(*sieve)); If you really want to change the stack size, take a look at this document. Tip: – Don’t forget to free your dynamically allocated memory when it’s no-longer needed.
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
A pointer is a pointer. No matter where it points to. I mean: you can assign to the same pointer both the address of a region on the stack and on the heap, don’t you? So there cannot be any intrinsic difference between a pointer pointing here or there.
There are predefined classes in Java for these data structures: java.util.Stack and java.util.Queue (choose one of the implementations for Queue).
Pop k-1 elements in k-1 operations. Now for the last operation, either you can pop one more element, or can push one element from the popped elements. So compare both the cases, if you pop element in kth operation, the element on top should be more than all first k-1 popped elements, otherwise for kth … Read more