Searched refs:furthest (Results 1 – 10 of 10) sorted by relevance
511 int32_t furthest = start; in parseArgument() local522 if (newIndex > furthest) { in parseArgument()523 furthest = newIndex; in parseArgument()525 if (furthest == source.length()) { in parseArgument()532 if (furthest == start) { in parseArgument()535 pos.setIndex(furthest); in parseArgument()
15 ; returns values furthest beyond its nominal upper bound of pi/4.
18 ; returns values furthest beyond its nominal upper bound of pi/4.
1875 int furthest = start; in parseChoiceArgument() local1885 if (newIndex > furthest) { in parseChoiceArgument()1886 furthest = newIndex; in parseChoiceArgument()1888 if (furthest == source.length()) { in parseChoiceArgument()1895 if (furthest == start) { in parseChoiceArgument()1898 pos.setIndex(furthest); in parseChoiceArgument()
1922 int furthest = start; in parseChoiceArgument() local1932 if (newIndex > furthest) { in parseChoiceArgument()1933 furthest = newIndex; in parseChoiceArgument()1935 if (furthest == source.length()) { in parseChoiceArgument()1942 if (furthest == start) { in parseChoiceArgument()1945 pos.setIndex(furthest); in parseChoiceArgument()
949 2. Let the furthest block be the topmost node in the stack of953 3. If there is no furthest block, then the UA must skip the961 5. If the furthest block has a parent node, then remove the962 furthest block from its parent node.966 7. Let node and last node be the furthest block. Follow these975 4. Otherwise, if last node is the furthest block, then move994 10. Take all of the child nodes of the furthest block and append996 11. Append that clone to the furthest block.1003 immediately below the position of the furthest block in that
1333 tern the error occurred. It is not necessarily the furthest point in
64035 furthest %32653 fˈərðɪst, fˈərθəst
75921 furthest %23521 fˈərðɪst, fˈərθəst