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

  /external/chromium_org/ui/accessibility/
ax_tree.cc 211 const std::vector<int32> new_child_ids) {
215 for (size_t i = 0; i < new_child_ids.size(); ++i) {
216 if (new_child_id_set.find(new_child_ids[i]) != new_child_id_set.end()) {
218 node->id(), new_child_ids[i]);
221 new_child_id_set.insert(new_child_ids[i]);
236 const std::vector<int32> new_child_ids,
240 for (size_t i = 0; i < new_child_ids.size(); ++i) {
241 int32 child_id = new_child_ids[i];
ax_tree.h 105 // child and its subtree if its id is not in |new_child_ids|. Returns
108 const std::vector<int32> new_child_ids);
110 // Iterate over |new_child_ids| and populate |new_children| with
116 const std::vector<int32> new_child_ids,
ax_tree_serializer.h 380 base::hash_set<int32> new_child_ids; local
386 new_child_ids.insert(new_child_id);
406 if (new_child_ids.find(old_child_id) == new_child_ids.end()) {
440 if (new_child_ids.find(child_id) == new_child_ids.end())
443 new_child_ids.erase(child_id);

Completed in 591 milliseconds