[lldb] Unbreak lldb builds due to r327219

[mgrang]

Summary

r327219 adds wrappers to sort which shuffle the container before sorting.
This causes lldb bots to break as the call to sort is now ambiguous:
http://lab.llvm.org:8011/builders/lldb-x86_64-ubuntu-14.04-buildserver/builds/20725/steps/ninja%20build%20local/logs/stdio

So we need use llvm::sort instead of sort to avoid ambiguity with std::sort.

Note: This patch is just to unbreak the bots. I plan to have subsequent patches which will convert all
calls to std::sort to llvm::sort.

[andreadb]

If this patch is to unbreak the buildbots, then I think you should just commit it.
We don't want to leave the buildbots in a failing state for too long.

If instead you don't feel confortable about this fix, then you should revert r327219.

[RKSimon]

(post) LGTM

lldb/trunk/source/Breakpoint/Breakpoint.cpp

if (num_new_locations > 0) {
           // and new modules, we'll just map them one to one in ascending ID
           // order (assuming the
           // resolver's order would match the equivalent ones.
           // Otherwise, we'll dump all the old ones, and just take the new ones,
           // erasing the elements
           // from both maps as we go.
 
           if (old_id_vec.size() == new_id_vec.size()) {
-            sort(old_id_vec.begin(), old_id_vec.end());
-            sort(new_id_vec.begin(), new_id_vec.end());
+            llvm::sort(old_id_vec.begin(), old_id_vec.end());
+            llvm::sort(new_id_vec.begin(), new_id_vec.end());
             size_t num_elements = old_id_vec.size();
             for (size_t idx = 0; idx < num_elements; idx++) {
               BreakpointLocationSP old_loc_sp =
                   old_break_locs.FindByIDPair(GetID(), old_id_vec[idx]);
               BreakpointLocationSP new_loc_sp =
                   new_break_locs.FindByIDPair(GetID(), new_id_vec[idx]);
               m_locations.SwapLocation(old_loc_sp, new_loc_sp);
               old_sc_map.erase(old_id_vec[idx]);