node.c File Reference

Basic Expando Node. More...

#include "config.h"
#include <stddef.h>
#include "mutt/lib.h"
#include "node.h"

Include dependency graph for node.c:

Go to the source code of this file.

Functions
struct ExpandoNode *	node_new (void)
	Create a new empty ExpandoNode.
void	node_free (struct ExpandoNode **ptr)
	Free an ExpandoNode and its private data.
void	node_add_child (struct ExpandoNode *node, struct ExpandoNode *child)
	Add a child to an ExpandoNode.
struct ExpandoNode *	node_get_child (const struct ExpandoNode *node, int index)
	Get a child of an ExpandoNode.
struct ExpandoNode *	node_last (struct ExpandoNode *node)
	Find the last Node in a tree.

Detailed Description

Basic Expando Node.

Authors

• Tóth János
• 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 node.c.

Function Documentation

node_new()

struct ExpandoNode * node_new

(

void

)

Create a new empty ExpandoNode.

Return values

ptr	New ExpandoNode

Definition at line 39 of file node.c.

{
  return mutt_mem_calloc(1, sizeof(struct ExpandoNode));
}

Here is the call graph for this function:

Here is the caller graph for this function:

node_free()

void node_free

(

struct ExpandoNode **

ptr

)

Free an ExpandoNode and its private data.

Parameters

ptr	Node to free

Definition at line 48 of file node.c.

{
  if (!ptr || !*ptr)
    return;
 
  struct ExpandoNode *node = *ptr;
 
  struct ExpandoNode **enp = NULL;
  ARRAY_FOREACH(enp, &node->children)
  {
    node_free(enp);
  }
  ARRAY_FREE(&node->children);
 
  if (node->ndata_free)
    node->ndata_free(&node->ndata);
 
  FREE(&node->format);
  FREE(&node->text);
 
  FREE(ptr);
}

Here is the call graph for this function:

Here is the caller graph for this function:

node_add_child()

void node_add_child	(	struct ExpandoNode *	node,
		struct ExpandoNode *	child
	)

Add a child to an ExpandoNode.

Parameters

node	Parent node
child	Child node

Definition at line 76 of file node.c.

{
  if (!node)
    return;
 
  ARRAY_ADD(&node->children, child);
}

Here is the caller graph for this function:

node_get_child()

struct ExpandoNode * node_get_child	(	const struct ExpandoNode *	node,
		int	index
	)

Get a child of an ExpandoNode.

Parameters

node	Parent node
index	Index of child to get

Return values

ptr	Child node
NULL	No child, or index out of range

Definition at line 91 of file node.c.

{
  if (!node)
    return NULL;
 
  struct ExpandoNode **ptr = ARRAY_GET(&node->children, index);
  if (!ptr)
    return NULL;
 
  return *ptr;
}

Here is the caller graph for this function:

node_last()

struct ExpandoNode * node_last

(

struct ExpandoNode *

node

)

Find the last Node in a tree.

Parameters

node

Root Node

Return values

ptr

Last Node

Definition at line 108 of file node.c.

{
  if (!node)
    return NULL;
 
  struct ExpandoNode **np = NULL;
  while ((np = ARRAY_LAST(&node->children)) && *np)
  {
    node = *np;
  }
 
  return node;
}

Here is the caller graph for this function: