HomeSort by relevance Sort by last modified time
    Searched refs:new_child_ids (Results 1 - 5 of 5) sorted by null

  /external/chromium_org/ui/accessibility/
ax_tree.cc 154 const std::vector<int32> new_child_ids) {
158 for (size_t i = 0; i < new_child_ids.size(); ++i) {
159 if (new_child_id_set.find(new_child_ids[i]) != new_child_id_set.end()) {
161 node->id(), new_child_ids[i]);
164 new_child_id_set.insert(new_child_ids[i]);
179 const std::vector<int32> new_child_ids,
183 for (size_t i = 0; i < new_child_ids.size(); ++i) {
184 int32 child_id = new_child_ids[i];
ax_tree.h 67 // child and its subtree if its id is not in |new_child_ids|. Returns
70 const std::vector<int32> new_child_ids);
72 // Iterate over |new_child_ids| and populate |new_children| with
79 const std::vector<int32> new_child_ids,
ax_tree_serializer.h 370 base::hash_set<int32> new_child_ids; local
375 new_child_ids.insert(new_child_id);
395 if (new_child_ids.find(old_child_id) == new_child_ids.end()) {
423 if (new_child_ids.find(child_id) == new_child_ids.end())
426 new_child_ids.erase(child_id);
  /external/chromium_org/content/browser/accessibility/
browser_accessibility_manager.cc 336 std::set<int32> new_child_ids; local
338 if (new_child_ids.find(src.child_ids[i]) != new_child_ids.end())
340 new_child_ids.insert(src.child_ids[i]);
384 if (new_child_ids.find(old_id) == new_child_ids.end())
  /external/chromium_org/content/renderer/accessibility/
renderer_accessibility_complete.cc 388 base::hash_set<int32> new_child_ids; local
394 new_child_ids.insert(new_child_id);
432 if (new_child_ids.find(old_child_id) == new_child_ids.end()) {
466 if (new_child_ids.find(child_id) == new_child_ids.end())
469 new_child_ids.erase(child_id);

Completed in 62 milliseconds