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

  /system/libvintf/
MatrixHal.cpp 31 if (versionRanges != other.versionRanges)
40 for (VersionRange vRange : versionRanges) {
47 for (const auto& vr : versionRanges) {
83 return func(this->versionRanges, interface, instance, isRegex);
95 return std::any_of(versionRanges.begin(), versionRanges.end(), [&](const VersionRange& vr) {
135 auto existingVr = std::find_if(this->versionRanges.begin(), this->versionRanges.end(),
138 if (existingVr == this->versionRanges.end())
    [all...]
parse_string.cpp 381 if (!parse(v[2], &req->versionRanges)) {
394 << req.versionRanges << "/"
424 return {expandInstances(req, req.versionRanges.front(), false /* brace */)};
427 for (const auto& vr : req.versionRanges) {
CompatibilityMatrix.cpp 139 halToAdd.forEachInstance([&](const std::vector<VersionRange>& versionRanges,
146 splitInstance->insertVersionRanges(versionRanges);
HalManifest.cpp 347 .versionRanges = {VersionRange{e.version().majorVer, e.version().minorVer}},
parse_xml.cpp 522 appendChildren(root, versionRangeConverter, hal.versionRanges, d);
531 !parseChildren(root, versionRangeConverter, &object->versionRanges, error) ||
558 if (hal.versionRanges.size() != 1) {
564 const VersionRange& v = hal.versionRanges.at(0);
    [all...]
  /system/libvintf/include/vintf/
MatrixHal.h 43 std::vector<VersionRange> versionRanges;
  /system/libvintf/test/
LibVintfTest.cpp     [all...]

Completed in 1091 milliseconds