string_util.h

Go to the documentation of this file.

/* Copyright (C) 2013-2016, The Regents of The University of Michigan.
All rights reserved.
This software was developed in the APRIL Robotics Lab under the
direction of Edwin Olson, ebolson@umich.edu. This software may be
available under alternative licensing terms; contact the address above.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
   list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
   this list of conditions and the following disclaimer in the documentation
   and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
The views and conclusions contained in the software and documentation are those
of the authors and should not be interpreted as representing official policies,
either expressed or implied, of the Regents of The University of Michigan.
*/
 
#pragma once
 
#include <stdio.h>
#include <stdarg.h>
#include <stdbool.h>
#include <ctype.h>
 
#include "zarray.h"
 
#ifdef __cplusplus
extern "C" {
#endif
 
 
typedef struct string_buffer string_buffer_t;
 
typedef struct string_feeder string_feeder_t;
struct string_feeder
{
    char *s;
    size_t len;
    size_t pos;
 
    int line, col;
};
 
char *sprintf_alloc(const char *fmt, ...)
#ifndef _MSC_VER
__attribute__ ((format (printf, 1, 2)))
#endif
;
 
char *vsprintf_alloc(const char *fmt, va_list args);
 
#define str_concat(...) _str_concat_private(__VA_ARGS__, NULL)
char *_str_concat_private(const char *first, ...);
 
 
// Returns the index of the first character that differs:
int str_diff_idx(const char * a, const char * b);
 
zarray_t *str_split(const char *str, const char *delim);
 
zarray_t *str_split_spaces(const char *str);
 
void str_split_destroy(zarray_t *s);
 
/*
 * Determines if str1 exactly matches str2 (more efficient than strcmp(...) == 0)
 */
static inline bool streq(const char *str1, const char* str2)
{
    int i;
    for (i = 0 ; str1[i] != '\0' ; i++) {
        if (str1[i] != str2[i])
            return false;
    }
 
    return str2[i] == '\0';
}
 
static inline bool strcaseeq(const char *str1, const char* str2)
{
    int i;
    for (i = 0 ; str1[i] != '\0' ; i++) {
        if (str1[i] == str2[i])
            continue;
        else if (islower(str1[i]) && (str1[i] - 32) == str2[i])
            continue;
        else if (isupper(str1[i]) && (str1[i] + 32) == str2[i])
            continue;
 
        return false;
    }
 
    return str2[i] == '\0';
}
 
char *str_trim(char *str);
 
char *str_lstrip(char *str);
 
char *str_rstrip(char *str);
 
bool str_ends_with(const char *haystack, const char *needle);
 
bool str_starts_with(const char *haystack, const char *needle);
 
bool str_starts_with_any(const char *haystack, const char **needles, int num_needles);
 
bool str_matches_any(const char *haystack, const char **needles, int num_needles);
 
char *str_substring(const char *str, size_t startidx, size_t endidx);
 
int str_indexof(const char *haystack, const char *needle);
 
    static inline int str_contains(const char *haystack, const char *needle) {
        return str_indexof(haystack, needle) >= 0;
    }
 
// same as above, but returns last match
int str_last_indexof(const char *haystack, const char *needle);
 
char *str_tolowercase(char *s);
 
char *str_touppercase(char *s);
 
char *str_replace(const char *haystack, const char *needle, const char *replacement);
 
    char *str_replace_many(const char *_haystack, ...);
// String Buffer
 
string_buffer_t *string_buffer_create();
 
void string_buffer_destroy(string_buffer_t *sb);
 
void string_buffer_append(string_buffer_t *sb, char c);
 
char string_buffer_pop_back(string_buffer_t *sb);
 
void string_buffer_append_string(string_buffer_t *sb, const char *str);
 
void string_buffer_appendf(string_buffer_t *sb, const char *fmt, ...)
#ifndef _MSC_VER
__attribute__ ((format (printf, 2, 3)))
#endif
;
 
bool string_buffer_ends_with(string_buffer_t *sb, const char *str);
 
size_t string_buffer_size(string_buffer_t *sb);
 
char *string_buffer_to_string(string_buffer_t *sb);
 
void string_buffer_reset(string_buffer_t *sb);
 
// String Feeder
 
string_feeder_t *string_feeder_create(const char *str);
 
void string_feeder_destroy(string_feeder_t *sf);
 
bool string_feeder_has_next(string_feeder_t *sf);
 
char string_feeder_next(string_feeder_t *sf);
 
char *string_feeder_next_length(string_feeder_t *sf, size_t length);
 
char string_feeder_peek(string_feeder_t *sf);
 
char *string_feeder_peek_length(string_feeder_t *sf, size_t length);
 
int string_feeder_get_line(string_feeder_t *sf);
 
int string_feeder_get_column(string_feeder_t *sf);
 
bool string_feeder_starts_with(string_feeder_t *sf, const char *str);
 
void string_feeder_require(string_feeder_t *sf, const char *str);
 
/*#ifndef strdup
    static inline char *strdup(const char *s) {
        int len = strlen(s);
        char *out = malloc(len+1);
        memcpy(out, s, len + 1);
        return out;
    }
#endif
*/
 
 
// find everything that looks like an env variable and expand it
// using getenv. Caller should free the result.
// e.g. "$HOME/abc" ==> "/home/ebolson/abc"
char *str_expand_envs(const char *in);
 
#ifdef __cplusplus
}
#endif