aboutsummaryrefslogtreecommitdiff
path: root/src/ClientPattern.hh
diff options
context:
space:
mode:
Diffstat (limited to 'src/ClientPattern.hh')
-rw-r--r--src/ClientPattern.hh8
1 files changed, 4 insertions, 4 deletions
diff --git a/src/ClientPattern.hh b/src/ClientPattern.hh
index 4531c4a..dd24add 100644
--- a/src/ClientPattern.hh
+++ b/src/ClientPattern.hh
@@ -42,7 +42,7 @@ class ClientPattern:private FbTk::NotCopyable {
42public: 42public:
43 ClientPattern(); 43 ClientPattern();
44 /** 44 /**
45 * Create the pattern from the given string as it would appear in the 45 * Create the pattern from the given string as it would appear in the
46 * apps file. the bool value returns the character at which 46 * apps file. the bool value returns the character at which
47 * there was a parse problem, or -1. 47 * there was a parse problem, or -1.
48 */ 48 */
@@ -76,7 +76,7 @@ public:
76 */ 76 */
77 bool addTerm(const std::string &str, WinProperty prop, bool negate = false); 77 bool addTerm(const std::string &str, WinProperty prop, bool negate = false);
78 78
79 inline void addMatch() { ++m_nummatches; } 79 void addMatch() { ++m_nummatches; }
80 80
81 // whether this pattern has identical matching criteria 81 // whether this pattern has identical matching criteria
82 bool operator ==(const ClientPattern &pat) const; 82 bool operator ==(const ClientPattern &pat) const;
@@ -85,7 +85,7 @@ public:
85 * If there are no terms, then there is assumed to be an error 85 * If there are no terms, then there is assumed to be an error
86 * the column of the error is stored in m_matchlimit 86 * the column of the error is stored in m_matchlimit
87 */ 87 */
88 inline int error() const { return m_terms.empty() ? 1 : 0; } 88 int error() const { return m_terms.empty() ? 1 : 0; }
89 89
90 static std::string getProperty(WinProperty prop, const Focusable &client); 90 static std::string getProperty(WinProperty prop, const Focusable &client);
91 91
@@ -95,7 +95,7 @@ private:
95 * We have a "term" in the whole expression which is the full pattern 95 * We have a "term" in the whole expression which is the full pattern
96 * we also need to keep track of the uncompiled regular expression 96 * we also need to keep track of the uncompiled regular expression
97 * for final output 97 * for final output
98 */ 98 */
99 struct Term { 99 struct Term {
100 Term(const std::string &regstr, bool full_match) :regexp(regstr, full_match){}; 100 Term(const std::string &regstr, bool full_match) :regexp(regstr, full_match){};
101 std::string orig; 101 std::string orig;