Lines Matching defs:mStack
44 private Stack<StateEntry> mStack = new Stack<StateEntry>();
60 if (!mStack.isEmpty()) {
72 mStack.push(new StateEntry(data, state));
90 if (!mStack.isEmpty()) {
101 mStack.push(new StateEntry(data, state));
107 if (mStack.isEmpty()) {
115 for (StateEntry entry : mStack) {
123 if (!mStack.isEmpty()) getTopState().resume();
129 if (!mStack.isEmpty()) getTopState().onPause();
137 if (!mStack.isEmpty()) {
143 return mStack.size();
147 if (!mStack.isEmpty()) {
150 if (mStack.size() > 1) {
160 if (!mStack.isEmpty()) {
171 while (mStack.size() > 1) {
172 mStack.pop().activityState.onDestroy();
179 if (mStack.size() == 1) {
193 if (state != mStack.peek().activityState) {
200 + mStack.peek().activityState);
205 mStack.pop();
207 ActivityState top = !mStack.isEmpty() ? mStack.peek().activityState : null;
228 if (oldState != mStack.peek().activityState) {
231 + mStack.peek().activityState);
234 mStack.pop();
251 mStack.push(new StateEntry(data, state));
260 while (!mStack.isEmpty()) {
261 mStack.pop().activityState.onDestroy();
263 mStack.clear();
288 mStack.push(new StateEntry(data, activityState));
300 Parcelable list[] = new Parcelable[mStack.size()];
302 for (StateEntry entry : mStack) {
316 for (StateEntry entry : mStack) {
325 Utils.assertTrue(!mStack.isEmpty());
326 return mStack.peek().activityState;
