Searched refs:peeki (Results 1 – 7 of 7) sorted by relevance
200 int32_t peeki(void) const;284 inline int32_t UVector32::peeki(void) const { in peeki() function
266 StackBranch where = (StackBranch) fBranchStack.peeki(); in snext()315 where = (StackBranch) fBranchStack.peeki(); in snext()598 const CompactTrieNode *node = getCompactNode(fHeader, fNodeStack.peeki()); in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()599 int where = fIndexStack.peeki(); in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()607 node = getCompactNode(fHeader, fNodeStack.peeki()); in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()608 where = fIndexStack.peeki(); in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()626 node = getCompactNode(fHeader, fNodeStack.peeki()); in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()627 where = fIndexStack.peeki(); in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()649 node = getCompactNode(fHeader, fNodeStack.peeki()); in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()650 where = fIndexStack.peeki(); in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
323 int32_t peeki(void) const;406 inline int32_t UStack::peeki(void) const { in peeki() function
417 if (foundBreaks.peeki() >= rangeEnd) { in divideUpDictionaryRange()
1694 if (endPos > breaks.peeki()) { in checkDictionary()
439 TEST_ASSERT(a->peeki() == 10); in UVector32_API()441 TEST_ASSERT(a->peeki() == 20); in UVector32_API()443 TEST_ASSERT(a->peeki() == 30); in UVector32_API()
1586 U_ASSERT(fSetOpStack.peeki()==setStart); in doParseActions()1679 int32_t tosOp = fSetOpStack.peeki(); in doParseActions()4276 int32_t pendingSetOperation = fSetOpStack.peeki(); in setEval()