path: root/camel/camel-search-private.h

/*
 *  Copyright (C) 2001 Ximian Inc.
 *
 *  Authors: Michael Zucchi <notzed@ximian.com>
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of version 2 of the GNU General Public
 * License as published by the Free Software Foundation.
 *
 * 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., 59 Temple Place - Suite 330,
 * Boston, MA 02111-1307, USA.
 */

#ifndef _CAMEL_SEARCH_PRIVATE_H
#define _CAMEL_SEARCH_PRIVATE_H

#include <regex.h>

typedef enum {
    CAMEL_SEARCH_MATCH_START = 1<<0,
    CAMEL_SEARCH_MATCH_END = 1<<1,
    CAMEL_SEARCH_MATCH_REGEX = 1<<2, /* disables the first 2 */
    CAMEL_SEARCH_MATCH_ICASE = 1<<3,
    CAMEL_SEARCH_MATCH_NEWLINE = 1<<4,
} camel_search_flags_t;

typedef enum {
    CAMEL_SEARCH_MATCH_EXACT,
    CAMEL_SEARCH_MATCH_CONTAINS,
    CAMEL_SEARCH_MATCH_STARTS,
    CAMEL_SEARCH_MATCH_ENDS,
    CAMEL_SEARCH_MATCH_SOUNDEX,
} camel_search_match_t;

typedef enum {
    CAMEL_SEARCH_TYPE_ASIS,
    CAMEL_SEARCH_TYPE_ENCODED,
    CAMEL_SEARCH_TYPE_ADDRESS,
    CAMEL_SEARCH_TYPE_ADDRESS_ENCODED,
    CAMEL_SEARCH_TYPE_MLIST, /* its a mailing list pseudo-header */
} camel_search_t;

/* builds a regex that represents a string search */
int camel_search_build_match_regex(regex_t *pattern, camel_search_flags_t type, int argc, struct _ESExpResult **argv, CamelException *ex);
gboolean camel_search_message_body_contains(CamelDataWrapper *object, regex_t *pattern);

gboolean camel_search_header_match(const char *value, const char *match, camel_search_match_t how, camel_search_t type, const char *default_charset);
gboolean camel_search_header_soundex(const char *header, const char *match);

/* TODO: replace with a real search function */
const char *camel_ustrstrcase(const char *haystack, const char *needle);

/* Some crappy utility functions for handling multiple search words */
enum _camel_search_word_t {
    CAMEL_SEARCH_WORD_SIMPLE = 1,
    CAMEL_SEARCH_WORD_COMPLEX = 2,
    CAMEL_SEARCH_WORD_8BIT = 4,
};
struct _camel_search_word {
    enum _camel_search_word_t type;
    char *word;
};

struct _camel_search_words {
    int len;
    enum _camel_search_word_t type; /* OR of all word types in list */
    struct _camel_search_word **words;
};

struct _camel_search_words *camel_search_words_split(const unsigned char *in);
struct _camel_search_words *camel_search_words_simple(struct _camel_search_words *wordin);
void camel_search_words_free(struct _camel_search_words *);

#endif /* ! _CAMEL_SEARCH_PRIVATE_H */