Searched defs:it (Results 1 - 25 of 1744) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jar ... .analysis.DFAState d java.util.Iterator it public boolean analysisOverflowed () public boolean isNonLLStarDecision () public int getNumberOfStates () public ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DCommonTreeNodeStream.java44 /** If this tree (root) was created from a token stream, track it. */
51 protected TreeIterator it; field in class:CommonTreeNodeStream
69 it = new TreeIterator(adaptor,root);
74 it.reset();
84 Object t = it.next();
86 if ( t == it.up ) {
88 if ( level==0 && hasNilRoot ) return it.next(); // don't give last UP; get EOF
90 else if ( t == it.down ) level++;
93 t = it.next(); // t is now DOWN, so get first real node next
95 t = it
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRCommonTreeNodeStream.h42 /** If this tree (root) was created from a token stream, track it. */
49 ANTLRTreeIterator *it; variable
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRCommonTreeNodeStream.h42 /** If this tree (root) was created from a token stream, track it. */
49 ANTLRTreeIterator *it; variable
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRCommonTreeNodeStream.h42 /** If this tree (root) was created from a token stream, track it. */
49 ANTLRTreeIterator *it; variable
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRCommonTreeNodeStream.h42 /** If this tree (root) was created from a token stream, track it. */
49 __strong ANTLRTreeIterator *it; variable
117 @property (retain) ANTLRTreeIterator *it; variable
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
H A DTestTreeIterator.java44 TreeIterator it = new TreeIterator(t);
45 StringBuffer buf = toString(it);
55 TreeIterator it = new TreeIterator(t);
56 StringBuffer buf = toString(it);
66 TreeIterator it = new TreeIterator(t);
67 StringBuffer buf = toString(it);
77 TreeIterator it = new TreeIterator(t);
78 StringBuffer buf = toString(it);
88 TreeIterator it = new TreeIterator(t);
89 StringBuffer buf = toString(it);
123 toString(TreeIterator it) argument
[all...]
/external/ceres-solver/include/ceres/
H A Dordered_groups.h66 typename map<T, int>::const_iterator it = element_to_group_.find(element); local
67 if (it != element_to_group_.end()) {
68 if (it->second == group) {
73 group_to_elements_[it->second].erase(element);
74 if (group_to_elements_[it->second].size() == 0) {
75 group_to_elements_.erase(it->second);
89 // Remove the element, no matter what group it is in. Return value
100 // If the group is empty, then get rid of it.
124 typename map<int, set<T> >::reverse_iterator it = local
127 new_group_to_elements[it
146 typename map<T, int>::const_iterator it = element_to_group_.find(element); local
154 typename map<T, int>::const_iterator it = element_to_group_.find(element); local
161 typename map<int, set<T> >::const_iterator it = local
[all...]
/external/ceres-solver/internal/ceres/
H A Dblock_random_access_sparse_matrix.cc67 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
68 it != block_pairs.end();
69 ++it) {
70 const int row_block_size = blocks_[it->first];
71 const int col_block_size = blocks_[it->second];
86 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
87 it != block_pairs.end();
88 ++it) {
89 const int row_block_size = blocks_[it->first];
90 const int col_block_size = blocks_[it
134 const LayoutType::iterator it = local
[all...]
H A Dcanonical_views_clustering.cc231 IntMap::const_iterator it = local
234 if (it != view_to_canonical_view_.end()) {
235 cluster_id = FindOrDie(center_to_cluster_id, it->second);
H A Dcompressed_col_sparse_matrix_utils.cc69 vector<int>::const_iterator it = lower_bound(row_block_starts.begin(), local
72 // Since we are using lower_bound, it will return the row id
81 if (it == row_block_starts.end() || *it != scalar_rows[idx]) {
85 block_rows->push_back(it - row_block_starts.begin());
H A Dcoordinate_descent_minimizer.cc72 for (map<int, set<double*> >::const_iterator it = group_to_elements.begin();
73 it != group_to_elements.end();
74 ++it) {
75 for (set<double*>::const_iterator ptr_it = it->second.begin();
76 ptr_it != it->second.end();
83 independent_set_offsets_.back() + it->second.size());
106 const map<ParameterBlock*, int>::const_iterator it = local
108 if (it != parameter_block_index.end()) {
109 residual_blocks_[it->second].push_back(residual_block);
178 // some ways is fine, since it wo
244 map<int, set<double*> >::const_iterator it = group_to_elements.begin(); local
[all...]
H A Dgraph_algorithms.h113 for (typename HashSet<Vertex>::const_iterator it = vertices.begin();
114 it != vertices.end();
115 ++it) {
116 vertex_color[*it] = kWhite;
117 vertex_queue.push_back(*it);
124 // Iterate over vertex_queue. Pick the first white vertex, add it
125 // to the independent set. Mark it black and its neighbors grey.
135 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin();
136 it != neighbors.end();
137 ++it) {
245 typename HashMap<Vertex, Vertex>::iterator it = union_find->find(vertex); local
[all...]
H A Dmap_util.h43 // Crash if it does not.
50 // * It is not thread-safe (even when it is not inserting, it can still
52 // * It invalidates iterators (when it chooses to resize)
53 // * It default constructs a value object even if it doesn't need to
55 // This version assumes the key is printable, and includes it in the fatal log
61 typename Collection::const_iterator it = collection.find(key); local
62 CHECK(it != collection.end()) << "Map key not found: " << key;
63 return it->second;
74 typename Collection::const_iterator it local
102 typename Collection::iterator it = collection.find(key); local
113 typename Collection::const_iterator it = collection.find(key); local
[all...]
H A Dproblem_impl.cc64 ParameterMap::const_iterator it = parameter_map.find(parameter_block); local
65 CHECK(it != parameter_map.end())
67 return it->second;
99 ParameterMap::iterator it = parameter_block_map_.find(values); local
100 if (it != parameter_block_map_.end()) {
102 int existing_size = it->second->Size();
109 return it->second;
113 // Before adding the parameter block, also check that it doesn't alias any
167 ResidualBlockSet::iterator it = residual_block_set_.find(residual_block); local
168 residual_block_set_.erase(it);
[all...]
/external/chromium_org/android_webview/browser/
H A Daw_form_database_service.cc117 QueryMap::const_iterator it = result_map_.find(h); local
118 if (it == result_map_.end()) {
122 *(it->second.result) = has_form_data;
123 it->second.completion->Signal();
H A Dglobal_tile_manager.cc20 // descriptors. For each tile, there is a gralloc buffer backing it, which
46 ListType::reverse_iterator it; local
47 for (it = mru_list_.rbegin(); it != mru_list_.rend(); it++) {
51 if (*it == *key)
54 size_t evicted_tiles = (*it)->GetMemoryPolicy().num_resources_limit;
56 (*it)->SetMemoryPolicy(zero_policy, true);
141 ListType::const_iterator it; local
142 for (it
[all...]
/external/chromium_org/android_webview/browser/renderer_host/
H A Daw_resource_dispatcher_host_delegate.cc283 // retrying the same request, even if it is with a GET.
341 PendingThrottleMap::iterator it = pending_throttles_.find( local
344 if (it != pending_throttles_.end()) {
345 pending_throttles_.erase(it);
389 PendingThrottleMap::iterator it = pending_throttles_.find( local
392 if (it != pending_throttles_.end()) {
393 IoThreadClientThrottle* throttle = it->second;
395 pending_throttles_.erase(it);
422 for (net::HttpRequestHeaders::Iterator it(headers); it
[all...]
/external/chromium_org/android_webview/native/
H A Daw_contents.cc199 // The |aw_content| param is technically spurious as it duplicates |obj| but
565 std::list<OriginCallback>::iterator it = pending_geolocation_prompts_.begin(); local
566 while (it != pending_geolocation_prompts_.end()) {
567 if ((*it).first == origin.GetOrigin()) {
568 if (it == pending_geolocation_prompts_.begin()) {
571 it = pending_geolocation_prompts_.erase(it);
573 ++it;
811 // Convert the certificate and return it
/external/chromium_org/apps/
H A Dsaved_devices_service.cc91 for (base::ListValue::const_iterator it = devices->begin();
92 it != devices->end();
93 ++it) {
95 if (!(*it)->GetAsDictionary(&device_entry)) {
150 for (std::vector<SavedDeviceEntry>::const_iterator it =
152 it != persistent_devices_.end();
153 ++it) {
154 if (it->vendor_id != device->vendor_id()) {
157 if (it->product_id != device->product_id()) {
166 if (it
278 std::map<std::string, SavedDevices*>::iterator it = local
307 std::map<std::string, SavedDevices*>::const_iterator it = local
[all...]
H A Dsaved_files_service.cc117 for (base::DictionaryValue::Iterator it(*file_entries); !it.IsAtEnd();
118 it.Advance()) {
120 if (!it.value().GetAsDictionary(&file_entry))
136 SavedFileEntry(it.key(), file_path, is_directory, sequence_number));
169 // g_max_sequence_number. Outside of testing, it is set to kint32max, so this
280 std::map<std::string, SavedFiles*>::const_iterator it = local
282 if (it != extension_id_to_saved_files_.end())
283 return it->second;
301 std::map<std::string, SavedFiles*>::iterator it local
331 base::hash_map<std::string, SavedFileEntry*>::iterator it = local
339 std::map<int, SavedFileEntry*>::reverse_iterator it = local
358 std::map<int, SavedFileEntry*>::iterator it = saved_file_lru_.begin(); local
373 base::hash_map<std::string, SavedFileEntry*>::const_iterator it = local
397 std::map<int, SavedFileEntry*>::reverse_iterator it = local
[all...]
/external/chromium_org/ash/accelerators/
H A Daccelerator_controller.cc313 // right now, queue this animation so when it starts it picks up a neutral
899 // implement it in your module's controller code (like TOGGLE_MIRROR_MODE
900 // below) or pull it into a HandleFoo() function above.
1155 // Note we prevent the shortcut from propagating so it will not
1195 std::map<ui::Accelerator, int>::const_iterator it = local
1197 DCHECK(it != accelerators_.end());
1198 return PerformAction(static_cast<AcceleratorAction>(it->second), accelerator);
/external/chromium_org/ash/display/
H A Ddisplay_manager.cc332 // This comment is to make it easy to distinguish the crash
575 // If 'selected' mode is empty, it should return the default mode. This means
578 // restored mode to |display_mode_|, so it needs to look up the mode whose
621 std::map<int64, DisplayInfo>::const_iterator it = local
623 return (it != display_info_.end()) ?
624 it->second.overscan_insets_in_dip() : gfx::Insets();
636 // Just sets color profile if it's not running on ChromeOS (like tests).
772 // the root window so that it matches the external display's
802 // Remove existing external display if it is going to be used as
866 // more displays in current list between ids, which means it i
[all...]
/external/chromium_org/ash/frame/caption_buttons/
H A Dframe_caption_button_container_view.cc305 std::map<CaptionButtonIcon, ButtonIconIds>::const_iterator it = local
307 if (it != button_icon_id_map_.end()) {
310 it->second.icon_image_id,
311 it->second.inactive_icon_image_id,
312 it->second.hovered_background_image_id,
313 it->second.pressed_background_image_id);

Completed in 368 milliseconds

1234567891011>>