2009-04-25 12:09:47 +04:00
|
|
|
/*
|
|
|
|
Search text engine.
|
|
|
|
Common share code for module.
|
|
|
|
|
2013-08-09 09:22:24 +04:00
|
|
|
Copyright (C) 2009, 2011, 2013
|
2011-10-15 14:56:47 +04:00
|
|
|
The Free Software Foundation, Inc.
|
2009-04-25 12:09:47 +04:00
|
|
|
|
|
|
|
Written by:
|
2013-08-09 09:22:24 +04:00
|
|
|
Slava Zanko <slavazanko@gmail.com>, 2009, 2011
|
|
|
|
Andrew Borodin <aborodin@vmail.ru>, 2013
|
2009-04-25 12:09:47 +04:00
|
|
|
|
|
|
|
This file is part of the Midnight Commander.
|
|
|
|
|
2011-10-15 14:56:47 +04:00
|
|
|
The Midnight Commander is free software: you can redistribute it
|
2009-04-25 12:09:47 +04:00
|
|
|
and/or modify it under the terms of the GNU General Public License as
|
2011-10-15 14:56:47 +04:00
|
|
|
published by the Free Software Foundation, either version 3 of the License,
|
|
|
|
or (at your option) any later version.
|
2009-04-25 12:09:47 +04:00
|
|
|
|
2011-10-15 14:56:47 +04:00
|
|
|
The Midnight Commander 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.
|
2009-04-25 12:09:47 +04:00
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
2011-10-15 14:56:47 +04:00
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
2009-04-25 12:09:47 +04:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
|
2009-09-22 13:35:09 +04:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <sys/types.h>
|
2009-04-25 12:09:47 +04:00
|
|
|
|
2010-01-20 18:11:52 +03:00
|
|
|
#include "lib/global.h"
|
2010-01-21 15:17:26 +03:00
|
|
|
#include "lib/strutil.h"
|
2010-01-21 16:06:15 +03:00
|
|
|
#include "lib/search.h"
|
2012-04-30 15:52:39 +04:00
|
|
|
#ifdef HAVE_CHARSET
|
|
|
|
#include "lib/charsets.h"
|
|
|
|
#endif
|
2010-01-21 15:17:26 +03:00
|
|
|
|
2010-01-07 02:57:27 +03:00
|
|
|
#include "internal.h"
|
2009-04-25 12:09:47 +04:00
|
|
|
|
|
|
|
/*** global variables ****************************************************************************/
|
|
|
|
|
2010-11-08 13:21:45 +03:00
|
|
|
const char *STR_E_NOTFOUND = N_("Search string not found");
|
|
|
|
const char *STR_E_UNKNOWN_TYPE = N_("Not implemented yet");
|
|
|
|
const char *STR_E_RPL_NOT_EQ_TO_FOUND =
|
|
|
|
N_("Num of replace tokens not equal to num of found tokens");
|
|
|
|
const char *STR_E_RPL_INVALID_TOKEN = N_("Invalid token number %d");
|
2009-04-25 17:53:05 +04:00
|
|
|
|
2009-04-25 12:09:47 +04:00
|
|
|
/*** file scope macro definitions ****************************************************************/
|
|
|
|
|
|
|
|
/*** file scope type declarations ****************************************************************/
|
|
|
|
|
|
|
|
/*** file scope variables ************************************************************************/
|
|
|
|
|
|
|
|
/*** file scope functions ************************************************************************/
|
|
|
|
|
|
|
|
/*** public functions ****************************************************************************/
|
|
|
|
|
|
|
|
gchar *
|
|
|
|
mc_search__recode_str (const char *str, gsize str_len,
|
|
|
|
const char *charset_from, const char *charset_to, gsize * bytes_written)
|
|
|
|
{
|
|
|
|
gchar *ret;
|
|
|
|
gsize bytes_read;
|
|
|
|
GIConv conv;
|
|
|
|
|
2013-09-06 12:59:54 +04:00
|
|
|
if (charset_from == NULL || charset_to == NULL
|
|
|
|
|| g_ascii_strcasecmp (charset_to, charset_from) == 0)
|
2010-11-08 13:21:45 +03:00
|
|
|
{
|
2009-04-25 12:09:47 +04:00
|
|
|
*bytes_written = str_len;
|
|
|
|
return g_strndup (str, str_len);
|
|
|
|
}
|
|
|
|
|
|
|
|
conv = g_iconv_open (charset_to, charset_from);
|
2010-11-08 13:21:45 +03:00
|
|
|
if (conv == INVALID_CONV)
|
|
|
|
{
|
2009-12-04 12:27:24 +03:00
|
|
|
*bytes_written = str_len;
|
|
|
|
return g_strndup (str, str_len);
|
|
|
|
}
|
2009-04-25 12:09:47 +04:00
|
|
|
|
|
|
|
ret = g_convert_with_iconv (str, str_len, conv, &bytes_read, bytes_written, NULL);
|
|
|
|
g_iconv_close (conv);
|
2009-12-04 12:27:24 +03:00
|
|
|
|
2010-11-08 13:21:45 +03:00
|
|
|
if (ret == NULL)
|
|
|
|
{
|
2009-12-04 12:27:24 +03:00
|
|
|
*bytes_written = str_len;
|
|
|
|
return g_strndup (str, str_len);
|
|
|
|
}
|
|
|
|
|
2009-04-25 12:09:47 +04:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* --------------------------------------------------------------------------------------------- */
|
|
|
|
|
|
|
|
gchar *
|
|
|
|
mc_search__get_one_symbol (const char *charset, const char *str, gsize str_len,
|
|
|
|
gboolean * just_letters)
|
|
|
|
{
|
2009-05-07 13:20:34 +04:00
|
|
|
gchar *converted_str, *next_char;
|
2009-04-25 12:09:47 +04:00
|
|
|
|
|
|
|
gsize tmp_len;
|
2009-05-07 13:20:34 +04:00
|
|
|
#ifdef HAVE_CHARSET
|
|
|
|
gsize converted_str_len;
|
|
|
|
gchar *converted_str2;
|
2009-04-25 12:09:47 +04:00
|
|
|
|
2009-06-08 14:54:35 +04:00
|
|
|
if (charset == NULL)
|
|
|
|
charset = cp_source;
|
|
|
|
|
2009-04-25 12:09:47 +04:00
|
|
|
converted_str = mc_search__recode_str (str, str_len, charset, cp_display, &converted_str_len);
|
2009-05-07 13:20:34 +04:00
|
|
|
#else
|
2009-11-20 12:11:31 +03:00
|
|
|
(void) charset;
|
|
|
|
|
2009-06-08 14:54:35 +04:00
|
|
|
converted_str = g_strndup (str, str_len);
|
2009-05-07 13:20:34 +04:00
|
|
|
#endif
|
2009-04-25 12:09:47 +04:00
|
|
|
|
|
|
|
next_char = (char *) str_cget_next_char (converted_str);
|
|
|
|
|
|
|
|
tmp_len = next_char - converted_str;
|
|
|
|
|
|
|
|
converted_str[tmp_len] = '\0';
|
|
|
|
|
2009-05-07 13:20:34 +04:00
|
|
|
#ifdef HAVE_CHARSET
|
2009-04-25 12:09:47 +04:00
|
|
|
converted_str2 =
|
|
|
|
mc_search__recode_str (converted_str, tmp_len, cp_display, charset, &converted_str_len);
|
2009-05-07 13:20:34 +04:00
|
|
|
#endif
|
2010-11-08 13:21:45 +03:00
|
|
|
if (just_letters)
|
|
|
|
{
|
2009-06-08 14:54:35 +04:00
|
|
|
if (str_isalnum (converted_str) && !str_isdigit (converted_str))
|
|
|
|
*just_letters = TRUE;
|
|
|
|
else
|
|
|
|
*just_letters = FALSE;
|
|
|
|
}
|
2009-05-07 13:20:34 +04:00
|
|
|
#ifdef HAVE_CHARSET
|
2009-04-25 12:09:47 +04:00
|
|
|
g_free (converted_str);
|
|
|
|
return converted_str2;
|
2009-05-07 13:20:34 +04:00
|
|
|
#else
|
|
|
|
return converted_str;
|
|
|
|
#endif
|
2009-04-25 12:09:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* --------------------------------------------------------------------------------------------- */
|
2010-11-08 21:50:15 +03:00
|
|
|
|
2009-04-25 12:09:47 +04:00
|
|
|
GString *
|
|
|
|
mc_search__tolower_case_str (const char *charset, const char *str, gsize str_len)
|
|
|
|
{
|
2009-05-07 13:20:34 +04:00
|
|
|
GString *ret;
|
|
|
|
#ifdef HAVE_CHARSET
|
2009-04-25 12:09:47 +04:00
|
|
|
gchar *converted_str, *tmp_str1, *tmp_str2, *tmp_str3;
|
|
|
|
gsize converted_str_len;
|
|
|
|
gsize tmp_len;
|
|
|
|
|
2009-06-08 14:54:35 +04:00
|
|
|
if (charset == NULL)
|
|
|
|
charset = cp_source;
|
|
|
|
|
2009-04-25 12:09:47 +04:00
|
|
|
tmp_str2 = converted_str =
|
|
|
|
mc_search__recode_str (str, str_len, charset, cp_display, &converted_str_len);
|
|
|
|
|
|
|
|
tmp_len = converted_str_len + 1;
|
|
|
|
|
|
|
|
tmp_str3 = tmp_str1 = g_strdup (converted_str);
|
|
|
|
|
|
|
|
while (str_tolower (tmp_str1, &tmp_str2, &tmp_len))
|
|
|
|
tmp_str1 += str_length_char (tmp_str1);
|
|
|
|
|
|
|
|
g_free (tmp_str3);
|
|
|
|
tmp_str2 =
|
|
|
|
mc_search__recode_str (converted_str, converted_str_len, cp_display, charset, &tmp_len);
|
|
|
|
g_free (converted_str);
|
|
|
|
|
2009-05-07 13:20:34 +04:00
|
|
|
ret = g_string_new_len (tmp_str2, tmp_len);
|
2009-06-08 14:54:35 +04:00
|
|
|
g_free (tmp_str2);
|
2009-05-07 13:20:34 +04:00
|
|
|
return ret;
|
|
|
|
#else
|
|
|
|
const gchar *tmp_str1 = str;
|
|
|
|
gchar *converted_str, *tmp_str2;
|
2009-06-08 14:54:35 +04:00
|
|
|
gsize converted_str_len = str_len + 1;
|
2009-05-07 13:20:34 +04:00
|
|
|
|
2009-11-20 12:11:31 +03:00
|
|
|
(void) charset;
|
|
|
|
|
2009-06-08 14:54:35 +04:00
|
|
|
tmp_str2 = converted_str = g_strndup (str, str_len);
|
2009-05-07 13:20:34 +04:00
|
|
|
|
|
|
|
while (str_tolower (tmp_str1, &tmp_str2, &converted_str_len))
|
|
|
|
tmp_str1 += str_length_char (tmp_str1);
|
|
|
|
|
|
|
|
ret = g_string_new_len (converted_str, str_len);
|
2009-06-08 14:54:35 +04:00
|
|
|
g_free (converted_str);
|
2009-05-07 13:20:34 +04:00
|
|
|
return ret;
|
|
|
|
#endif
|
2009-04-25 12:09:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* --------------------------------------------------------------------------------------------- */
|
|
|
|
|
|
|
|
GString *
|
|
|
|
mc_search__toupper_case_str (const char *charset, const char *str, gsize str_len)
|
|
|
|
{
|
2009-05-07 13:20:34 +04:00
|
|
|
GString *ret;
|
|
|
|
#ifdef HAVE_CHARSET
|
2009-04-25 12:09:47 +04:00
|
|
|
gchar *converted_str, *tmp_str1, *tmp_str2, *tmp_str3;
|
|
|
|
gsize converted_str_len;
|
|
|
|
gsize tmp_len;
|
|
|
|
|
2009-06-08 14:54:35 +04:00
|
|
|
if (charset == NULL)
|
|
|
|
charset = cp_source;
|
|
|
|
|
2009-04-25 12:09:47 +04:00
|
|
|
tmp_str2 = converted_str =
|
|
|
|
mc_search__recode_str (str, str_len, charset, cp_display, &converted_str_len);
|
|
|
|
|
|
|
|
tmp_len = converted_str_len + 1;
|
|
|
|
|
|
|
|
tmp_str3 = tmp_str1 = g_strdup (converted_str);
|
|
|
|
|
|
|
|
while (str_toupper (tmp_str1, &tmp_str2, &tmp_len))
|
|
|
|
tmp_str1 += str_length_char (tmp_str1);
|
|
|
|
|
|
|
|
g_free (tmp_str3);
|
|
|
|
|
|
|
|
tmp_str2 =
|
|
|
|
mc_search__recode_str (converted_str, converted_str_len, cp_display, charset, &tmp_len);
|
|
|
|
g_free (converted_str);
|
|
|
|
|
2009-05-07 13:20:34 +04:00
|
|
|
ret = g_string_new_len (tmp_str2, tmp_len);
|
2009-06-08 14:54:35 +04:00
|
|
|
g_free (tmp_str2);
|
2009-05-07 13:20:34 +04:00
|
|
|
return ret;
|
|
|
|
#else
|
2009-11-20 12:11:31 +03:00
|
|
|
|
2009-05-07 13:20:34 +04:00
|
|
|
const gchar *tmp_str1 = str;
|
|
|
|
gchar *converted_str, *tmp_str2;
|
2009-06-08 14:54:35 +04:00
|
|
|
gsize converted_str_len = str_len + 1;
|
2009-05-07 13:20:34 +04:00
|
|
|
|
2009-11-20 12:11:31 +03:00
|
|
|
(void) charset;
|
|
|
|
|
2009-06-08 14:54:35 +04:00
|
|
|
tmp_str2 = converted_str = g_strndup (str, str_len);
|
2009-05-07 13:20:34 +04:00
|
|
|
|
|
|
|
while (str_toupper (tmp_str1, &tmp_str2, &converted_str_len))
|
|
|
|
tmp_str1 += str_length_char (tmp_str1);
|
|
|
|
|
|
|
|
ret = g_string_new_len (converted_str, str_len);
|
2009-06-08 14:54:35 +04:00
|
|
|
g_free (converted_str);
|
2009-05-07 13:20:34 +04:00
|
|
|
return ret;
|
|
|
|
#endif
|
2009-04-25 12:09:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* --------------------------------------------------------------------------------------------- */
|
|
|
|
|
2009-05-06 11:50:12 +04:00
|
|
|
gchar **
|
2010-11-08 13:21:45 +03:00
|
|
|
mc_search_get_types_strings_array (size_t * num)
|
2009-05-06 11:50:12 +04:00
|
|
|
{
|
|
|
|
gchar **ret;
|
2009-10-30 04:12:04 +03:00
|
|
|
int lc_index;
|
2009-09-22 13:35:09 +04:00
|
|
|
size_t n;
|
|
|
|
|
2009-05-08 16:23:38 +04:00
|
|
|
const mc_search_type_str_t *type_str;
|
2009-09-22 13:35:09 +04:00
|
|
|
const mc_search_type_str_t *types_str = mc_search_types_list_get (&n);
|
2009-05-06 11:50:12 +04:00
|
|
|
|
2009-12-12 13:54:22 +03:00
|
|
|
ret = g_try_new0 (char *, n + 1);
|
2009-08-05 17:07:51 +04:00
|
|
|
if (ret == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
2010-11-08 13:21:45 +03:00
|
|
|
for (lc_index = 0, type_str = types_str; type_str->str != NULL; type_str++, lc_index++)
|
2009-10-30 04:12:04 +03:00
|
|
|
ret[lc_index] = g_strdup (type_str->str);
|
2009-09-22 13:35:09 +04:00
|
|
|
|
|
|
|
/* don't count last NULL item */
|
|
|
|
if (num != NULL)
|
2010-11-08 13:21:45 +03:00
|
|
|
*num = (size_t) lc_index;
|
2009-08-05 17:07:51 +04:00
|
|
|
|
2009-05-06 11:50:12 +04:00
|
|
|
return ret;
|
|
|
|
}
|
2009-06-09 13:01:00 +04:00
|
|
|
|
|
|
|
/* --------------------------------------------------------------------------------------------- */
|