Lines Matching full:uint32
13 UInt32 *key_ids, int flags) {
35 std::vector<UInt32> *key_ids, int flags) {
47 std::vector<UInt32> *key_ids, int flags) {
61 std::vector<UInt32> *key_ids, int flags) {
63 build_trie(keys, static_cast<UInt32 *>(NULL), flags);
66 std::vector<UInt32> temp_key_ids(keys.size());
72 UInt32 *key_ids, int flags) {
74 Vector<UInt32> terminals;
79 typedef std::pair<UInt32, UInt32> TerminalIdPair;
82 for (UInt32 i = 0; i < pairs.size(); ++i) {
89 UInt32 node = 0;
90 for (UInt32 i = 0; i < pairs.size(); ++i) {
110 for (UInt32 i = 0; i < pairs.size(); ++i) {
121 Vector<UInt32> *terminals, Progress &progress) {
135 Vector<UInt32> next_terminals;
146 for (UInt32 i = 0; i < next_terminals.size(); ++i) {
165 Vector<UInt32> *terminals, Progress &progress) {
175 queue.push(Range(0, (UInt32)keys.size(), 0));
177 const UInt32 node = (UInt32)(link_flags_.size() - queue.size());
193 for (UInt32 i = range.begin() + 1; i < range.end(); ++i) {
208 for (UInt32 i = 0; i < wranges.size(); ++i) {
210 UInt32 pos = wrange.pos() + 1;
213 UInt32 j;
261 Vector<UInt32> *terminals, Progress &progress) {
265 for (UInt32 i = 0; i < strs.size(); ++i) {
273 for (UInt32 i = 0; i < rkeys.size(); ++i) {
284 Vector<UInt32> *terminals, Progress &progress) {
288 for (UInt32 i = 0; i < strs.size(); ++i) {
300 UInt32 Trie::sort_keys(Vector<Key<T> > &keys) const {
304 for (UInt32 i = 0; i < keys.size(); ++i) {
308 UInt32 count = 1;
309 for (UInt32 i = 1; i < keys.size(); ++i) {
319 Vector<UInt32> *terminals) const {
320 Vector<UInt32> temp_terminals;
322 for (UInt32 i = 0; i < keys.size(); ++i) {
