Lines Matching full:top
35 int top = static_cast<int>(stack->GetTop()); in Push() local
36 JSHandle<TaggedArray> elements = GrowCapacity(thread, stack, top + 1); in Push()
39 elements->Set(thread, top + 1, value); in Push()
40 stack->SetTop(++top); in Push()
46 int top = this->GetTop(); in Peek() local
47 if (top == -1) { in Peek()
53 return elements->Get(thread, top); in Peek()
58 int top = this->GetTop(); in Pop() local
59 if (top == -1) { in Pop()
64 this->SetTop(--top); in Pop()
65 return elements->Get(thread, top + 1); in Pop()
70 int top = this->GetTop(); in Search() local
73 for (int i = 0; i <= top; i++) { in Search()
119 int top = static_cast<int>(GetTop()); in Has() local
120 if (top == -1) { in Has()
124 for (int i = 0; i < top + 1; i++) { in Has()