src/grim.cc

Commits

b966b2a517365074e5c381dbdea05b3221dc0198 e840f1eeb0ae26af69e1ae146ea9938e28e9f1af e4e05418a640eaed08cd1ec7cd8644eb1dbcca50 4e01ba8ad2c3361fa4be3d896288020948b58b5e aae562ac1350480e4889aabb35899f776c5b59e9 6c3ae0e31eb0893f20e3872117f92cc6b9a942af 350e7d88bb2feb9db00c6e032cc6623f215b7adf 95e6c70d23e99ffcf70e5bbe12503496e5d8f232 e188783659b9bc3b9993a647e93ed110e7f41db6 5e4c38ff3c212cdd9881427ef3f8c2706539a190 e50ea9e1356a74af18fdd171337ef9dc931e1f4e 8f2e83556d12aaebe8e8597ea6923804b0eb7a43 1627c585128af263181053ab2cf1a4cdcd14ee21 def3513f75b325464ad88a33c741c4ca80572b77 a21501590980a905fa9b902897d700a42a08b7f0 56074a6bfe4498d092f3a227297c8c20e2bb962c d9cf1485b7ae0614130494f0e73237921323b9a1 80f04b134ae32ad8a9d526007b33dd02f6600f05 23d6c65f9368d3c622a55a3068a6b2f1efa0c8d4 09c195df02536b6a796bd648fce9669397b96109 f2b5c8202fbc904e2ed78260e3fdbd55164799d2 4bfba076120f389994fc46a98e8b7a2622314400 e36ac5417e10ee9b9f94f340e1ccf28afc5705ea d00dc89a86dd7e2fcfd4618bc3a1c8cfba9e3c3d d9eef16adaf292f3748db5fb5aa98463de10d712 18ff2ec1bfc1cf9fcd17c1acb05c3b41f8f0ed83 9e7fd2980d723437ea621b78d395fa72ca3f4922

Diff

diff --git a/src/grim.cc b/src/grim.cc
index 301e78f..9950d0c 100755
--- a/src/grim.cc
+++ b/src/grim.cc
@@ -240 +239,0 @@ class StyleHandler {
-					bool inbracket = false;
@@ -244,10 +243,21 @@ class StyleHandler {
-						if (w == ':' && !inbracket) {
-							break;
-						}
-						// We don't care if the thing we are splitting is a id or class we just 
-						// need them split up so we can use them as map keys
-
-						if (w == '#' && !inbracket) {
-							if (part != "") {
-								parts.push_back(part);
-								part = "";
+						if (w != ':') {
+							// We don't care if the thing we are splitting is a id or class we just 
+							// need them split up so we can use them as map keys
+
+							if (w == '#') {
+								if (part != "") {
+									parts.push_back(part);
+									part = "";
+								}
+
+							} else if (w == '.') {
+								if (part != "") {
+									parts.push_back(part);
+									part = "";
+								}
+							} else if (w == '[' || w == ']') {
+								if (part != "") {
+									parts.push_back(part);
+									part = "";
+								}
+								continue;
@@ -256,16 +266,3 @@ class StyleHandler {
-						} else if (w == '.' && !inbracket) {
-							if (part != "") {
-								parts.push_back(part);
-								part = "";
-							}
-						} else if (w == '[' || w == ']') {
-							if (w=='[') {
-								inbracket = true;
-							} else if (w == ']'){
-								inbracket = false;
-							}
-							if (part != "") {
-								parts.push_back(part);
-								part = "";
-							}
-							continue;
+							part += w;
+						} else {
+							break;
@@ -273,2 +269,0 @@ class StyleHandler {
-
-						part += w;

#include "grim.h"
#include <iostream>
#include <sstream>
#include <algorithm>
#include <stdexcept>
#include <cctype>

std::string ClassList::value() const {
    if (classes.empty()) {
        return "";
    }
    std::string collection = classes[0];
    for (size_t i = 1; i < classes.size(); ++i) {
        collection += " " + classes[i];
    }
    return collection;
}

std::vector<std::string> ClassList::values() {
	return classes;
}

void ClassList::add(std::string value) {
    classes.push_back(value);
}

void ClassList::remove(std::string value) {
    auto it_prev = std::find(classes.begin(), classes.end(), value);
    if (it_prev != classes.end()) {
        *it_prev = classes.back();
        classes.pop_back();
    }
}

// Constructor
Node::Node() : parent(nullptr) {}

std::string Node::getTagName() const { return TagName; }
void Node::setTagName(const std::string& name) { TagName = name; }

const std::unordered_map<std::string, std::string>& Node::getAttributes() const {
    return Attributes;
}

// Implement the getter/setter methods declared using the macro
#define IMPLEMENT_ATTRIBUTE_ACCESSORS(_Type, _FuncNameSuffix, _AttrKeyString) \
    _Type Node::get##_FuncNameSuffix() const { \
        return getAttribute<_Type>(_AttrKeyString); \
    } \
    void Node::set##_FuncNameSuffix(_Type value) { \
        setAttribute(_AttrKeyString, value); \
    }

IMPLEMENT_ATTRIBUTE_ACCESSORS(std::string, Id, "id")
IMPLEMENT_ATTRIBUTE_ACCESSORS(std::string, InnerText, "innerText")
IMPLEMENT_ATTRIBUTE_ACCESSORS(bool, ContentEditable, "contenteditable")
IMPLEMENT_ATTRIBUTE_ACCESSORS(std::string, Href, "href")
IMPLEMENT_ATTRIBUTE_ACCESSORS(std::string, Src, "src")
IMPLEMENT_ATTRIBUTE_ACCESSORS(std::string, Title, "title")
IMPLEMENT_ATTRIBUTE_ACCESSORS(std::string, Value, "value")
IMPLEMENT_ATTRIBUTE_ACCESSORS(int, TabIndex, "tabindex")
IMPLEMENT_ATTRIBUTE_ACCESSORS(bool, Disabled, "disabled")
IMPLEMENT_ATTRIBUTE_ACCESSORS(bool, Required, "required")
IMPLEMENT_ATTRIBUTE_ACCESSORS(bool, Checked, "checked")

Node* Node::createElement(std::string name) {
    std::unique_ptr<Node> newNode = std::make_unique<Node>();
    newNode->setTagName(name);
    newNode->parent = this;
    children.push_back(std::move(newNode));
    return children.back().get();
}

template<typename T>
void Node::setAttribute(const std::string& name, const T& value) {
    if constexpr (std::is_same_v<T, bool>) {
        if (value) {
            Attributes[name] = "";
        } else {
            Attributes.erase(name);
        }
    } else if constexpr (std::is_arithmetic_v<T>) {
        Attributes[name] = std::to_string(value);
    } else {
        static_assert(std::is_convertible_v<T, std::string>,
            "setAttribute: Type cannot be converted to std::string automatically.");
        Attributes[name] = static_cast<std::string>(value);
    }
}

void Node::setAttribute(const std::string& name, const std::string& value) {
    Attributes[name] = value;
}

template<typename T>
T Node::getAttribute(const std::string& name) const {
    auto it = Attributes.find(name);
    if (it != Attributes.end()) {
        const std::string& s = it->second;

if constexpr (std::is_same_v<T, int>) {
            try {
                return std::stoi(s);
            } catch (const std::invalid_argument& e) {
                return 0;
            } catch (const std::out_of_range& e) {
                return 0;
            }
        } else if constexpr (std::is_same_v<T, bool>) {
            std::string lower_s = s;
            std::transform(lower_s.begin(), lower_s.end(), lower_s.begin(),
                [](unsigned char c){ return std::tolower(c); });
            return (!lower_s.empty() && lower_s != "false");
        } else if constexpr (std::is_same_v<T, double>) {
            try {
                return std::stod(s);
            } catch (const std::invalid_argument& e) {
                return 0.0;
            } catch (const std::out_of_range& e) {
                return 0.0;
            }
        } else {
            static_assert(std::is_convertible_v<std::string, T>,
                "getAttribute: Type conversion from std::string not implemented for this type.");
            return static_cast<T>(s);
        }
    }
    return T();
}

std::string Node::getAttribute(const std::string& name) const {
    auto it = Attributes.find(name);
    if (it != Attributes.end()) {
        return it->second;
    }
    return "";
}

std::vector<std::string> Node::getAttributeKeys() {
	std::vector<std::string> keys;

for(auto p : Attributes) {
		keys.push_back(p.first);
	}
	return keys;
}

void Node::print(int indent) const {
    for (int i = 0; i < indent; ++i) {
        std::cout << "  ";
    }

std::cout << "<" << getTagName();
    for (const auto& attr_pair : getAttributes()) {
        if (attr_pair.first == "innerText" || attr_pair.first == "tagName") {
            continue;
        }
        std::cout << " " << attr_pair.first;
        if (!attr_pair.second.empty()) {
            std::cout << "=\"" << attr_pair.second << "\"";
        }
    }
    std::cout << ">";

if (!getAttribute("innerText").empty()) {
        std::cout << "\n" << getAttribute("innerText");
    }

std::cout << std::endl;

for (const auto& child : children) {
        child->print(indent + 1);
    }

for (int i = 0; i < indent; ++i) {
        std::cout << "  ";
    }
    std::cout << "</" << getTagName() << ">" << std::endl;
}

struct Style {
	std::unordered_map<std::string, std::string> properties;
	std::string selector;
	// Index of when it was added (for cascading)
	size_t index;
};

// struct BaseParts {
// 	std::string tagName;
// 	std::string id;
// 	std::vector<std::string> classes;
// 	std::unordered_map<std::string, std::string> attributes;
// }

class StyleHandler {
	private:
		// basemap: Maps baseparts to a index of the styles vector pointing to a Style object
		// because processing a CSS selector isn't trivial we want to make a short list of 
		// the styles that can possibly be a match so we aren't spending a lot of compute 
		// on a selector that applies to the wrong element. Todo this we take the right most part
		// of a selector (that is the part that targets the current element) and we do a few checks
		// like is the tagname the same, does it have that class, and do the id's match. If so that 
		// is a candidate and we run the full selector on it. That includes checking parents,children, 
		// or what ever else the selector needs to match.
		std::unordered_map<std::string, std::vector<size_t>> basemap;
		std::vector<Style> styles;

std::vector<std::string> parseSelectorParts(std::string selector) {
			// we want to find the right most (right of a " " > ~ + ) selector
			// account for * for commas split the selector then for each parse right
			
			std::vector<std::string> parts;
			std::string word;

for (size_t s = 0; s < selector.length(); s++) {
				// Start parsing if we see a comma or the end of the selector
				word += selector[s];

if (selector[s] == ',' || s == selector.length()-1) {
					if (selector[s] == ',') {
						word.pop_back(); // Remove the trailing comma
					}
					// Break the tag and add the right most parts to parts
					for (int i = word.length()-1; i > -1; i--) {
						if (
								word[i] == ' ' ||
								word[i] == '>' ||
								word[i] == '~' ||
								word[i] == '+' 
								) {
							word = word.substr(i+1);
							break;
						}
					}

// Now word contains the right most selection
					// we will extract the quick to verify parts from it
					// so we can build the basemap
					std::string part;
					bool inbracket = false;
					for (auto w : word) {
						// if the current letter is a : that is either a pseudo element
						// or selector. We don't care about that part for this part
						if (w == ':' && !inbracket) {
							break;
						}
						// We don't care if the thing we are splitting is a id or class we just 
						// need them split up so we can use them as map keys

if (w == '#' && !inbracket) {
							if (part != "") {
								parts.push_back(part);
								part = "";
							}

} else if (w == '.' && !inbracket) {
							if (part != "") {
								parts.push_back(part);
								part = "";
							}
						} else if (w == '[' || w == ']') {
							if (w=='[') {
								inbracket = true;
							} else if (w == ']'){
								inbracket = false;
							}
							if (part != "") {
								parts.push_back(part);
								part = "";
							}
							continue;
						}

part += w;
					}

if (part != "") {
						parts.push_back(part);
					}
				}
			}

std::vector<std::string> deduplicated;

for (size_t p1 = 0; p1 < parts.size(); p1++) {
				bool matches = false;

for (size_t p2 = p1+1; p2 < parts.size(); p2++) {
					if (parts[p1] == parts[p2]) {
						matches = true;
					}
				}

if (!matches) {
					deduplicated.push_back(parts[p1]);
				}
			}

return deduplicated;
		}

std::vector<std::string> parseNodeParts(Node* node) {
			std::vector<std::string> parts;

parts.push_back(node->getTagName());
			parts.push_back("#"+node->getId());

// classes and attributes
			auto keys = node->getAttributeKeys();

for (auto k : keys) {
				if (k != "tagName" || k != "id" || k != "innerText" || k != "class") {
					std::string v;
					std::string av = node->getAttribute(k);
					if (av != "") {
							v = "=\""+av+"\"";

}
					parts.push_back(k+v);
				}
			}

auto classes = node->classList.values();

for (auto c : classes) {
				parts.push_back("."+c);
			}

return parts;
		}

std::string cleanSelector(std::string selector) {
			std::string cleaned;
			for (size_t i = 0; i < selector.length(); i++) {
				if (selector[i] == ' ' && i > 0 && i < selector.length()-1) {
					char prev = selector[i-1];
					char next = selector[i+1];

if (prev != '>' && prev != '+' && prev != '~' && next != '>' && next != '+' && next != '~' && !std::isspace(prev) && !std::isspace(next)) {
						cleaned += selector[i];
					}
				} else if (selector[i] == ' ' && (i == 0 || i == selector.length()-1)) {
					continue;
				} else {
					cleaned += selector[i];
				}
			}
			return cleaned;
		}
	public:
		void add(Style style) {
			std::string selector = cleanSelector(style.selector);
			style.selector = selector;
			size_t index = styles.size();

style.index = index;
			styles.push_back(std::move(style));

std::vector<std::string> parts = parseSelectorParts(selector);

for (auto p : parts) {
				if (basemap.find(p) != basemap.end()) {
					basemap[p].push_back(index);
				} else {
					std::vector<size_t> bm = {index};
					basemap[p] = bm;
				}
			}
		}
		
		std::unordered_map<std::string, std::string> getStyles(Node* node) {
			std::vector<std::string> parts = parseNodeParts(node);

std::vector<size_t> canidates;

for (auto p : parts) {
				if (auto sty = basemap.find(p); sty != basemap.end()) {
					for (auto s : sty->second) {
						bool found = false;
						// This makes sure we aren't adding the same styles to the candidates list
						for (auto c : canidates) {
							if (c == s) {
								found = true;
								break;
							}
						}
						if (!found) {
							canidates.push_back(s);
						}
					}
				}
			}

// Now we have the list of candidates next we will refined our selection
			// we need to pull the selectors from each candidate then run testSelector on it
		}
};

std::vector<std::string> splitSelector(std::string selector, char key) {
	size_t nesting = 0;

std::vector<std::string> selectors;
	std::string current = "";

for (auto s : selector) {
		if (s == '(') {
			nesting++;
		} else if (s == ')') {
			nesting--;
		} else if (s == '[') {
			nesting++;
		} else if (s == ']') {
			nesting--;
		} else if (s == '{') {
			nesting++;
		} else if (s == '}') {
			nesting--;
		} else if (s == key && nesting == 0) {
			selectors.push_back(current);
			current = "";
			continue;
		}
		current += s;
	}

selectors.push_back(current);

// Trim the space
	for (size_t i = 0; i < selectors.size(); i++) {
		size_t start = 0;
		size_t end = selectors[i].length()-1;
		for (size_t s = 0; s < selectors[i].length(); s++) {
			if (!std::isspace(selectors[i][s])) {
				start = s;
				break;
			}
		}
		for (size_t e = selectors[i].length()-1; e > start; e--) {
			if (!std::isspace(selectors[i][e])) {
				end = e;
				break;
			}
		}
		selectors[i] = selectors[i].substr(start,end - start +1);
	}

return selectors;
}

void popSelector(std::string selector, std::string& trimmed, std::string& popped, char& symbol) {
	for (size_t i = selector.length()-1; i >= 0; i--) {
		if (
				selector[i] == ' ' ||
				selector[i] == '>' ||
				selector[i] == '~' ||
				selector[i] == '+' 
		   ) {
			symbol = selector[i];
			trimmed = selector.substr(0,i);
			break;
		} else {
			popped = selector[i]+popped;
		}
	}
}

bool testSelector(Node* node, std::string selector) {
	// By the time we get here, we know the right most selector some what matches
	// so now if it is a compound selector we should see if the parent('s) some what match
	if (selector == '*') {
		return true;
	}

std::vector<std::string> selectors = splitSelector(selector, ',');

if (selectors.size() > 1) {
		for (auto s : selectors) {
			bool match = testSelector(node, s);

if (match) {
				return true;
			}
		}
	}

std::string trimmed, popped;
	char symbol;
	popSelector(selector, trimmed, popped, symbol);

// Check if popped matches this element
	if () {
	} else {
		return false;
	}

if (symbol == '' || node->parent != nullptr) {
		return false;
	}

bool matched = false;
	if (symbol == '>') {
		// We are just testing the parent node here
		matched = testSelector(node->parent, trimmed);
	} else if (symbol == '+') {
		auto children = node->parent.children;
		if (children.size() > 1) {
			for (size_t i = 0; i < children.size(); i++) {
				Node* child_ptr = children[i].get();

if (child_ptr == node) {
					if (i == 0) {
						return false;
					} else {
						// In this selector we just need to get the direct sibling and test it
						matched = testSelector(children[i-1].get(), trimmed);
					}
					break;
				}
			}
		}
	} else if (symbol == '~') {
		auto children = node->parent.children;
		if (children.size() > 1) {
			for (size_t i = 0; i < children.size(); i++) {
				Node* child_ptr = children[i].get();

if (child_ptr == node) {
					break;
				} else {
					// We have to test every selector before the current element,
					// if any match then it matches
					matched = testSelector(children[i].get(), trimmed);
					if (matched) {
						break;
					}
				}
			}
		}
	} else if (symbol == ' ') {
		// For the descendant combinator we have to check every parent until we match or nullptr out
		Node* current = node->parent.get();
		while (current != nullptr) {
			if (testSelector(current, trimmed)) {
				matched = true;
				break;
			}
			current = current->parent.get();
		}
	}

return matched;
}