slist.c File Reference

A separated list of strings. More...

#include "config.h"
#include <stddef.h>
#include "slist.h"
#include "buffer.h"
#include "list.h"
#include "memory.h"
#include "queue.h"
#include "string2.h"

Include dependency graph for slist.c:

Go to the source code of this file.

Functions
struct Slist *	slist_new (uint32_t flags)
	Create a new string list.
struct Slist *	slist_add_list (struct Slist *list, const struct Slist *add)
	Add a list to another list.
struct Slist *	slist_add_string (struct Slist *list, const char *str)
	Add a string to a list.
bool	slist_compare (const struct Slist *a, const struct Slist *b)
	Compare two string lists.
struct Slist *	slist_dup (const struct Slist *list)
	Create a copy of an Slist object.
struct Slist *	slist_empty (struct Slist **list)
	Empty out an Slist object.
void	slist_free (struct Slist **ptr)
	Free an Slist object.
bool	slist_is_empty (const struct Slist *list)
	Is the slist empty?
bool	slist_is_member (const struct Slist *list, const char *str)
	Is a string a member of a list?
struct Slist *	slist_parse (const char *str, uint32_t flags)
	Parse a list of strings into a list.
struct Slist *	slist_remove_string (struct Slist *list, const char *str)
	Remove a string from a list.
int	slist_to_buffer (const struct Slist *list, struct Buffer *buf)
	Export an Slist to a Buffer.

Detailed Description

A separated list of strings.

Authors

• Richard Russon

Copyright

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, see http://www.gnu.org/licenses/.

Definition in file slist.c.

Function Documentation

slist_new()

struct Slist * slist_new

(

uint32_t

flags

)

Create a new string list.

Parameters

flags

Flag to set, e.g. SLIST_SEP_COMMA

Return values

ptr	New string list

Definition at line 43 of file slist.c.

{
  struct Slist *list = mutt_mem_calloc(1, sizeof(*list));
  list->flags = flags;
  STAILQ_INIT(&list->head);
 
  return list;
}

Here is the call graph for this function:

Here is the caller graph for this function:

slist_add_list()

struct Slist * slist_add_list	(	struct Slist *	list,
		const struct Slist *	add
	)

Add a list to another list.

Parameters

list	String list to add to
add	String list to add

Return values

ptr	Modified list

Definition at line 58 of file slist.c.

{
  if (!add)
    return list;
  if (!list)
    return slist_dup(add);
 
  struct ListNode *np = NULL;
  STAILQ_FOREACH(np, &add->head, entries)
  {
    mutt_list_insert_tail(&list->head, mutt_str_dup((char *) np->data));
    list->count++;
  }
  return list;
}

Here is the call graph for this function:

slist_add_string()

struct Slist * slist_add_string	(	struct Slist *	list,
		const char *	str
	)

Add a string to a list.

Parameters

list	List to modify
str	String to add

Return values

ptr	Modified list

Definition at line 80 of file slist.c.

{
  if (!list)
    return NULL;
 
  if (str && (str[0] == '\0'))
    str = NULL;
 
  if (!str && !(list->flags & SLIST_ALLOW_EMPTY))
    return list;
 
  mutt_list_insert_tail(&list->head, mutt_str_dup(str));
  list->count++;
 
  return list;
}

Here is the call graph for this function:

Here is the caller graph for this function:

slist_compare()

bool slist_compare	(	const struct Slist *	a,
		const struct Slist *	b
	)

Compare two string lists.

Parameters

a	First list
b	Second list

Return values

true	They are identical

Definition at line 103 of file slist.c.

{
  if (!a && !b) /* both empty */
    return true;
  if (!a ^ !b) /* one is empty, but not the other */
    return false;
  if (a->count != b->count)
    return false;
 
  return mutt_list_compare(&a->head, &b->head);
}

Here is the call graph for this function:

slist_dup()

struct Slist * slist_dup

(

const struct Slist *

list

)

Create a copy of an Slist object.

Parameters

list	Slist to duplicate

Return values

ptr	New Slist object

Definition at line 120 of file slist.c.

{
  if (!list)
    return NULL;
 
  struct Slist *list_new = slist_new(list->flags);
 
  struct ListNode *np = NULL;
  STAILQ_FOREACH(np, &list->head, entries)
  {
    mutt_list_insert_tail(&list_new->head, mutt_str_dup(np->data));
  }
  list_new->count = list->count;
  return list_new;
}

Here is the call graph for this function:

Here is the caller graph for this function:

slist_empty()

struct Slist * slist_empty

(

struct Slist **

list

)

Empty out an Slist object.

Parameters

list	Slist to empty

Return values

ptr	New Slist object

Definition at line 141 of file slist.c.

{
  if (!list || !*list)
    return NULL;
 
  mutt_list_free(&(*list)->head);
 
  if ((*list)->flags & SLIST_ALLOW_EMPTY)
  {
    (*list)->count = 0;
    return *list;
  }
 
  FREE(list);
  return NULL;
}

Here is the call graph for this function:

slist_free()

void slist_free

(

struct Slist **

ptr

)

Free an Slist object.

Parameters

ptr	Slist to free

Definition at line 162 of file slist.c.

{
  if (!ptr || !*ptr)
    return;
 
  struct Slist *slist = *ptr;
  mutt_list_free(&slist->head);
 
  FREE(ptr);
}

Here is the call graph for this function:

Here is the caller graph for this function:

slist_is_empty()

bool slist_is_empty

(

const struct Slist *

list

)

Is the slist empty?

Parameters

list	List to check

Return values

true	List is empty

Definition at line 178 of file slist.c.

{
  if (!list)
    return true;
 
  return list->count == 0;
}

Here is the caller graph for this function:

slist_is_member()

bool slist_is_member	(	const struct Slist *	list,
		const char *	str
	)

Is a string a member of a list?

Parameters

list	List to modify
str	String to find

Return values

true	String is in the list

Definition at line 192 of file slist.c.

{
  if (!list)
    return false;
 
  if (!str && !(list->flags & SLIST_ALLOW_EMPTY))
    return false;
 
  struct ListNode *np = NULL;
  STAILQ_FOREACH(np, &list->head, entries)
  {
    if (mutt_str_equal(np->data, str))
      return true;
  }
  return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

slist_parse()

struct Slist * slist_parse	(	const char *	str,
		uint32_t	flags
	)

Parse a list of strings into a list.

Parameters

str	String of strings
flags	Flags, e.g. SLIST_ALLOW_EMPTY

Return values

ptr	New Slist object

Definition at line 215 of file slist.c.

{
  char *src = mutt_str_dup(str);
  if (!src && !(flags & SLIST_ALLOW_EMPTY))
    return NULL;
 
  char sep = ' ';
  if ((flags & SLIST_SEP_MASK) == SLIST_SEP_COMMA)
    sep = ',';
  else if ((flags & SLIST_SEP_MASK) == SLIST_SEP_COLON)
    sep = ':';
 
  struct Slist *list = mutt_mem_calloc(1, sizeof(struct Slist));
  list->flags = flags;
  STAILQ_INIT(&list->head);
 
  if (!src)
    return list;
 
  char *start = src;
  for (char *p = start; *p; p++)
  {
    if ((p[0] == '\\') && (p[1] != '\0'))
    {
      p++;
      continue;
    }
 
    if (p[0] == sep)
    {
      p[0] = '\0';
      if (slist_is_member(list, start))
      {
        start = p + 1;
        continue;
      }
      mutt_list_insert_tail(&list->head, mutt_str_dup(start));
      list->count++;
      start = p + 1;
    }
  }
 
  if (!slist_is_member(list, start))
  {
    mutt_list_insert_tail(&list->head, mutt_str_dup(start));
    list->count++;
  }
 
  FREE(&src);
  return list;
}

Here is the call graph for this function:

Here is the caller graph for this function:

slist_remove_string()

struct Slist * slist_remove_string	(	struct Slist *	list,
		const char *	str
	)

Remove a string from a list.

Parameters

list	List to modify
str	String to remove

Return values

ptr	Modified list

Definition at line 273 of file slist.c.

{
  if (!list)
    return NULL;
  if (!str && !(list->flags & SLIST_ALLOW_EMPTY))
    return list;
 
  struct ListNode *prev = NULL;
  struct ListNode *np = NULL;
  struct ListNode *tmp = NULL;
  STAILQ_FOREACH_SAFE(np, &list->head, entries, tmp)
  {
    if (mutt_str_equal(np->data, str))
    {
      if (prev)
        STAILQ_REMOVE_AFTER(&list->head, prev, entries);
      else
        STAILQ_REMOVE_HEAD(&list->head, entries);
      FREE(&np->data);
      FREE(&np);
      list->count--;
      break;
    }
    prev = np;
  }
  return list;
}

Here is the call graph for this function:

Here is the caller graph for this function:

slist_to_buffer()

int slist_to_buffer	(	const struct Slist *	list,
		struct Buffer *	buf
	)

Export an Slist to a Buffer.

Parameters

list	List to export
buf	Buffer for the results

Return values

num	Number of strings written to Buffer

Definition at line 307 of file slist.c.

{
  if (!list || !buf || (list->count == 0))
    return 0;
 
  struct ListNode *np = NULL;
  STAILQ_FOREACH(np, &list->head, entries)
  {
    buf_addstr(buf, np->data);
    if (STAILQ_NEXT(np, entries))
    {
      const int sep = (list->flags & SLIST_SEP_MASK);
      if (sep == SLIST_SEP_COMMA)
        buf_addch(buf, ',');
      else if (sep == SLIST_SEP_COLON)
        buf_addch(buf, ':');
      else
        buf_addch(buf, ' ');
    }
  }
 
  return list->count;
}

Here is the call graph for this function:

Here is the caller graph for this function: