capabilities.cc 1.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142
  1. // Copyright 2013 The Chromium Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license that can be
  3. // found in the LICENSE file.
  4. #include "remoting/base/capabilities.h"
  5. #include <algorithm>
  6. #include <vector>
  7. #include "base/stl_util.h"
  8. #include "base/strings/string_piece.h"
  9. #include "base/strings/string_split.h"
  10. #include "base/strings/string_util.h"
  11. namespace remoting {
  12. bool HasCapability(const std::string& capabilities, const std::string& key) {
  13. std::vector<base::StringPiece> caps = base::SplitStringPiece(
  14. capabilities, " ", base::KEEP_WHITESPACE, base::SPLIT_WANT_NONEMPTY);
  15. return std::find(caps.begin(), caps.end(), base::StringPiece(key)) !=
  16. caps.end();
  17. }
  18. std::string IntersectCapabilities(const std::string& client_capabilities,
  19. const std::string& host_capabilities) {
  20. std::vector<base::StringPiece> client_caps =
  21. base::SplitStringPiece(client_capabilities, " ", base::KEEP_WHITESPACE,
  22. base::SPLIT_WANT_NONEMPTY);
  23. std::sort(client_caps.begin(), client_caps.end());
  24. std::vector<base::StringPiece> host_caps = base::SplitStringPiece(
  25. host_capabilities, " ", base::KEEP_WHITESPACE, base::SPLIT_WANT_NONEMPTY);
  26. std::sort(host_caps.begin(), host_caps.end());
  27. std::vector<base::StringPiece> result =
  28. base::STLSetIntersection<std::vector<base::StringPiece>>(client_caps,
  29. host_caps);
  30. return base::JoinString(result, " ");
  31. }
  32. } // namespace remoting