diff --git a/src/match.c b/src/match.c
index 313c76e686dde0c563c71b0ad762b6980027d2fc..9e4c39148483210b21e656a9bc2648bdcc859b00 100644 (file)
--- a/src/match.c
+++ b/src/match.c
/* ncmpc (Ncurses MPD Client)
- * (c) 2004-2009 The Music Player Daemon Project
+ * (c) 2004-2017 The Music Player Daemon Project
* Project homepage: http://musicpd.org
-
+ *
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
-
+ *
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
-
+ *
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
-*/
+ */
#include "match.h"
#include "charset.h"
return folded;
}
+GRegex *
+compile_regex(const char *src, bool anchor)
+{
+ GRegexCompileFlags compile_flags =
+ G_REGEX_CASELESS | G_REGEX_DOTALL | G_REGEX_OPTIMIZE;
+ if (anchor)
+ compile_flags |= G_REGEX_ANCHORED;
+
+ char *src_folded = locale_casefold(src);
+ GRegex *regex = g_regex_new ((const gchar*)src_folded, compile_flags,
+ 0, NULL);
+
+ g_free(src_folded);
+
+ return regex;
+}
+
+bool
+match_regex(GRegex *regex, const char *line)
+{
+ char *line_folded = locale_casefold(line);
+ GMatchInfo *match_info;
+ g_regex_match(regex, line_folded, 0, &match_info);
+ bool match = (bool)g_match_info_matches(match_info);
+
+ g_match_info_free(match_info);
+ g_free(line_folded);
+
+ return match;
+}
+
bool
match_line(const char *line, const char *needle)
{
return ret;
}
-
-int
-find_occurence(const char *str_orig, const char *str_occur, const int str_occur_len)
-{
- const int str_orig_len = strlen (str_orig);
- int i, j;
-
- if (str_occur_len > str_orig_len)
- return -1;
-
- for (i = 0; i < str_orig_len; i++) {
- if ((i + str_occur_len) > str_orig_len)
- return -1;
-
- for (j = 0; j < str_occur_len; j++) {
- if (tolower (str_occur[j]) != tolower (str_orig[i+j]))
- break;
-
- if (j == str_occur_len - 1)
- return 0;
- }
- }
-
- return -1;
-}
-