Searched refs:kValidSchemes (Results 1 – 4 of 4) sorted by relevance
21 const char* kValidSchemes[] = { variable39 COMPILE_ASSERT(arraysize(kValidSchemes) == arraysize(kValidSchemeMasks),203 for (size_t i = 0; i < arraysize(kValidSchemes); ++i) { in IsValidScheme()204 if (scheme == kValidSchemes[i] && (valid_schemes_ & kValidSchemeMasks[i])) in IsValidScheme()343 for (size_t i = 0; i < arraysize(kValidSchemes); ++i) { in ConvertToExplicitSchemes()344 if (MatchesScheme(kValidSchemes[i])) { in ConvertToExplicitSchemes()346 temp.SetScheme(kValidSchemes[i]); in ConvertToExplicitSchemes()
22 const char* kValidSchemes[] = { variable42 COMPILE_ASSERT(arraysize(kValidSchemes) == arraysize(kValidSchemeMasks),291 for (size_t i = 0; i < arraysize(kValidSchemes); ++i) { in IsValidScheme()292 if (scheme == kValidSchemes[i] && (valid_schemes_ & kValidSchemeMasks[i])) in IsValidScheme()516 for (size_t i = 0; i < arraysize(kValidSchemes); ++i) { in GetExplicitSchemes()517 if (MatchesScheme(kValidSchemes[i])) { in GetExplicitSchemes()518 result.push_back(kValidSchemes[i]); in GetExplicitSchemes()
16 const char* kValidSchemes[] = { variable79 for (unsigned i = 0; i < arraysize(kValidSchemes); ++i) { in IsValidUrl()80 if (url.scheme() == kValidSchemes[i]) in IsValidUrl()
28 const char* kValidSchemes[] = { variable187 for (unsigned i = 0; i < arraysize(kValidSchemes); ++i) { in CanSendEvents()188 if (scheme == kValidSchemes[i]) in CanSendEvents()