Searched refs:m_stack (Results 1 – 3 of 3) sorted by relevance
33 m_stack = m_array; in b2GrowableStack()40 if (m_stack != m_array) in ~b2GrowableStack()42 b2Free(m_stack); in ~b2GrowableStack()43 m_stack = NULL; in ~b2GrowableStack()51 T* old = m_stack; in Push()53 m_stack = (T*)b2Alloc(m_capacity * sizeof(T)); in Push()54 std::memcpy(m_stack, old, m_count * sizeof(T)); in Push()61 m_stack[m_count] = element; in Push()69 return m_stack[m_count]; in Pop()78 T* m_stack;
377 Object[] m_stack = new Object[max]; field in NamespaceMappings.Stack383 clone.m_stack = new Object[clone.max]; in clone()387 clone.m_stack[i] = this.m_stack[i]; in clone()401 System.arraycopy(m_stack,0, newArray, 0, max); in push()403 m_stack = newArray; in push()405 m_stack[top] = o; in push()412 o = m_stack[top]; in pop()424 o = m_stack[top]; in peek()432 return m_stack[idx]; in peek()444 m_stack[i] = null; in clear()[all …]
49 vector<ConstValueRangeAccess> m_stack; member in rsg::SubValueRangeIterator54 m_stack.push_back(valueRange); in SubValueRangeIterator()59 return !m_stack.empty(); in hasItem()64 return m_stack[m_stack.size()-1]; in getItem()70 m_stack.pop_back(); // Remove current in next()78 m_stack.push_back(curItem.member(ndx)); in next()86 m_stack.push_back(curItem.member(ndx)); in next()