Part 2 of this series will provide a detailed description of the event iterator-based API.
本系列的第二部分将详细讨论这种基于事件迭代器的API。
To use the event iterator-based API, the application must first obtain an instance of XMLEventReader from the XMLInputFactory.
要使用基于事件迭代器的API，应用程序首先必须从XMLInputFactory获得XMLEventReader 的实例。
The compiler translates this code into the equivalent iterator-based loop, as shown in Listing 2.
编译器把这个代码转换成等价的基于迭代器的循环，如清单2所示。
When iterating over a Collection, the compiler generates the standard iterator-based idiom.
当在Collection上迭代时，编译器生成标准的基于迭代器的语法。
These are just some of the examples of what can be done with the event iterator-based API provided by StAX, thanks to its flexibility and ease of use.
本文仅介绍了用StAX基于事件迭代器的API所能完成的一部分功能，见证了它的灵活性以及易用性。
You need to extend this class and provide implementation for the methods Iterator getChoices(String input); to return the probable user list based on the input (Listing 17).
需要扩展此类并为方法IteratorgetChoices(Stringinput); 提供实现，以便基于输入返回这个可能的用户列表（清单17）。
The main interface of the event iterator-based API is XMLEventReader.
事件迭代器API的主要接口是XMLEventReader。
As you already know, the event iterator-based API is a layer that is logically above the cursor-based API.
正如您已了解的一样，在逻辑上基于事件迭代器的API是基于指针的API上面的一层。
This option in particular demonstrates how the event iterator-based API stacks (no pun intended) on top of the cursor-based API.
这种用法可以很好地说明基于事件迭代器的API如何堆叠于基于指针的API之上。
The event iterator-based API represents a more object-oriented approach than the cursor-based API.
和基于指针的API相比，基于事件迭代器的 API 具有更多的面向对象特征。
Even though the XMLEventReader interface seems deceptively simple, the event iterator-based approach offers an important advantage over the cursor-based method.
虽然XMLEventReader接口看起来似乎很简单，但是基于事件迭代器的方法具有一个基于指针的方法不具备的重要优点。
XMLEventAllocator is essentially a bridge between the cursor-based and the event iterator-based API.
XMLEventAllocator 本质上是基于指针的 API和基于事件迭代器的 API之间的一座桥梁。
Listing 2. Iterator-based equivalent for Listing 1.
清单2。
Based on iterator concepts model, traits extraction mechanism and compile time dispatch technic, STL generic algorithms achieve best efficiency.
在STL迭代器概念模型基础上，利用特性萃取机制和编译时代码分派技术，泛型算法达到了最佳运行效率。
Imagine that we have an iterator-based algorithm that requires random access iterators.
假设我们有一个基于迭代器的算法，要求是随机访问迭代器。
You can use the table below to find the right types based on the type of your iterator.
你可以用下表基于你的迭代器类型来找到正确的类型。
You can use the table below to find the right types based on the type of your iterator.
你可以用下表基于你的迭代器类型来找到正确的类型。
应用推荐