Searched refs:stack (Results 1 – 4 of 4) sorted by relevance
95 ArrayDeque<Integer> stack = new ArrayDeque<>(); in maxSubRectangle() local99 while (!stack.isEmpty() && heightsRow[stack.peek()] > heightsRow[i]) { in maxSubRectangle()100 int height = heightsRow[stack.pop()]; in maxSubRectangle()101 int width = stack.isEmpty() ? i : i - stack.peek() - 1; in maxSubRectangle()104 int leftCornerXCoord = stack.isEmpty() ? 0 : stack.peek() + 1; in maxSubRectangle()109 stack.push(i); in maxSubRectangle()112 while (!stack.isEmpty()) { in maxSubRectangle()113 int height = heightsRow[stack.pop()]; in maxSubRectangle()115 stack.isEmpty() ? heightsRow.length : (heightsRow.length - stack.peek() - 1); in maxSubRectangle()118 int leftCornerXCoord = stack.isEmpty() ? 0 : stack.peek() + 1; in maxSubRectangle()
23 void allocate_memory(std::stack<void*>* addresses, size_t size) { in allocate_memory()37 void deallocate_memory(std::stack<void*>* addresses, size_t size) { in deallocate_memory()
34 std::stack<void*> allocated_addresses_;
10 …stack),i=!1}return e.apply(this,arguments)},e)}var C,P={};function T(t,e){null!=a.deprecationHandl…