bool Compound_Selector::is_superselector_of(Compound_Selector* rhs)
{
To_String to_string;
Simple_Selector* lbase = base();
Simple_Selector* rbase = rhs->base();
// Check if pseudo-elements are the same between the selectors
set<string> lpsuedoset, rpsuedoset;
for (size_t i = 0, L = length(); i < L; ++i)
{
if ((*this)[i]->is_pseudo_element()) {
string pseudo((*this)[i]->perform(&to_string));
pseudo = pseudo.substr(pseudo.find_first_not_of(":")); // strip off colons to ensure :after matches ::after since ruby sass is forgiving
lpsuedoset.insert(pseudo);
}
}
for (size_t i = 0, L = rhs->length(); i < L; ++i)
{
if ((*rhs)[i]->is_pseudo_element()) {
string pseudo((*rhs)[i]->perform(&to_string));
pseudo = pseudo.substr(pseudo.find_first_not_of(":")); // strip off colons to ensure :after matches ::after since ruby sass is forgiving
rpsuedoset.insert(pseudo);
}
}
if (lpsuedoset != rpsuedoset) {
return false;
}
// Check the Simple_Selectors
set<string> lset, rset;
if (!lbase) // no lbase; just see if the left-hand qualifiers are a subset of the right-hand selector
{
for (size_t i = 0, L = length(); i < L; ++i)
{ lset.insert((*this)[i]->perform(&to_string)); }
for (size_t i = 0, L = rhs->length(); i < L; ++i)
{ rset.insert((*rhs)[i]->perform(&to_string)); }
return includes(rset.begin(), rset.end(), lset.begin(), lset.end());
}
else { // there's an lbase
for (size_t i = 1, L = length(); i < L; ++i)
{ lset.insert((*this)[i]->perform(&to_string)); }
if (rbase)
{
if (lbase->perform(&to_string) != rbase->perform(&to_string)) // if there's an rbase, make sure they match
{ return false; }
else // the bases do match, so compare qualifiers
{
for (size_t i = 1, L = rhs->length(); i < L; ++i)
{ rset.insert((*rhs)[i]->perform(&to_string)); }
return includes(rset.begin(), rset.end(), lset.begin(), lset.end());
}
}
}
// catch-all
return false;
}
bool Simple_Selector::operator<(const Simple_Selector& rhs) const {
// Use the string representation for ordering.
// Cast away const here. To_String should take a const object, but it doesn't.
Simple_Selector* pLHS = const_cast<Simple_Selector*>(this);
Simple_Selector* pRHS = const_cast<Simple_Selector*>(&rhs);
To_String to_string;
return pLHS->perform(&to_string) < pRHS->perform(&to_string);
}
bool Simple_Selector::operator==(const Simple_Selector& rhs) const
{
// Compare the string representations for equality.
// Cast away const here. To_String should take a const object, but it doesn't.
Simple_Selector* pLHS = const_cast<Simple_Selector*>(this);
Simple_Selector* pRHS = const_cast<Simple_Selector*>(&rhs);
To_String to_string;
return pLHS->perform(&to_string) == pRHS->perform(&to_string);
}
bool Compound_Selector::is_superselector_of(Compound_Selector* rhs)
{
To_String to_string;
Simple_Selector* lbase = base();
Simple_Selector* rbase = rhs->base();
set<string> lset, rset;
// TODO: check pseudo-elements once we store semantic info for them
if (!lbase) // no lbase; just see if the left-hand qualifiers are a subset of the right-hand selector
{
for (size_t i = 0, L = length(); i < L; ++i)
{ lset.insert((*this)[i]->perform(&to_string)); }
for (size_t i = 0, L = rhs->length(); i < L; ++i)
{ rset.insert((*rhs)[i]->perform(&to_string)); }
return includes(rset.begin(), rset.end(), lset.begin(), lset.end());
}
else { // there's an lbase
for (size_t i = 1, L = length(); i < L; ++i)
{ lset.insert((*this)[i]->perform(&to_string)); }
if (rbase)
{
if (lbase->perform(&to_string) != rbase->perform(&to_string)) // if there's an rbase, make sure they match
{ return false; }
else // the bases do match, so compare qualifiers
{
for (size_t i = 1, L = rhs->length(); i < L; ++i)
{ rset.insert((*rhs)[i]->perform(&to_string)); }
return includes(rset.begin(), rset.end(), lset.begin(), lset.end());
}
}
}
// catch-all
return false;
}
