FM / class

/usr/lib/x86_64-linux-gnu/openmpi/include/openmpi/opal/class/

/usr/lib/x86_64-linux-gnu/openmpi/include/openmpi/opal/class

Name	Size	Mode	Actions
opal_bitmap.h	8021	0644	edit dl rm
opal_fifo.h	10948	0644	edit dl rm
opal_free_list.h	14067	0644	edit dl rm
opal_graph.h	11595	0644	edit dl rm
opal_hash_table.h	17371	0644	edit dl rm
opal_hotel.h	12559	0644	edit dl rm
opal_interval_tree.h	8457	0644	edit dl rm
opal_lifo.h	11207	0644	edit dl rm
opal_list.h	30880	0644	edit dl rm
opal_object.h	19049	0644	edit dl rm
opal_pointer_array.h	6649	0644	edit dl rm
opal_rb_tree.h	6580	0644	edit dl rm
opal_ring_buffer.h	2843	0644	edit dl rm
opal_tree.h	17219	0644	edit dl rm
opal_value_array.h	8727	0644	edit dl rm

Edit: /usr/lib/x86_64-linux-gnu/openmpi/include/openmpi/opal/class/opal_rb_tree.h (6580B)

/* -*- Mode: C; c-basic-offset:4 ; indent-tabs-mode:nil -*- */
/*
 * Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
 *                         University Research and Technology
 *                         Corporation.  All rights reserved.
 * Copyright (c) 2004-2005 The University of Tennessee and The University
 *                         of Tennessee Research Foundation.  All rights
 *                         reserved.
 * Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
 *                         University of Stuttgart.  All rights reserved.
 * Copyright (c) 2004-2005 The Regents of the University of California.
 *                         All rights reserved.
 * Copyright (c) 2015      Los Alamos National Security, LLC. All rights
 *                         reserved.
 * $COPYRIGHT$
 *
 * Additional copyrights may follow
 *
 * $HEADER$
 *
 */

/** @file
 *
 *     A red black tree
 */

#ifndef OPAL_RB_TREE_H
#define OPAL_RB_TREE_H

#include "opal_config.h"
#include <stdlib.h>
#include "opal/constants.h"
#include "opal/class/opal_object.h"
#include "opal/class/opal_free_list.h"

BEGIN_C_DECLS
/*
 * Data structures and datatypes
 */

/**
  * red and black enum
  */
typedef enum {RED, BLACK} opal_rb_tree_nodecolor_t;

/**
  * node data structure
  */
struct opal_rb_tree_node_t
{
    opal_free_list_item_t super;        /**< the parent class */
    opal_rb_tree_nodecolor_t color;     /**< the node color */
    struct opal_rb_tree_node_t * parent;/**< the parent node, can be NULL */
    struct opal_rb_tree_node_t * left;  /**< the left child - can be nill */
    struct opal_rb_tree_node_t * right; /**< the right child - can be nill */
    void *key;                          /**< a pointer to the key */
    void *value;                        /**< a pointer to the value */
};
typedef struct opal_rb_tree_node_t opal_rb_tree_node_t;

/**
  * the compare function typedef. This function is used to compare 2 nodes.
  */
typedef int (*opal_rb_tree_comp_fn_t)(void *key1, void *key2);

/**
  * the data structure that holds all the needed information about the tree.
  */
struct opal_rb_tree_t {
    opal_object_t parent;           /**< the parent class */
    /* this root pointer doesn't actually point to the root of the tree.
     * rather, it points to a sentinal node who's left branch is the real
     * root of the tree. This is done to eliminate special cases */
    opal_rb_tree_node_t * root_ptr; /**< a pointer to the root of the tree */
    opal_rb_tree_node_t * nill;     /**< the nill sentinal node */
    opal_rb_tree_comp_fn_t comp;    /**< the compare function */
    opal_free_list_t free_list;   /**< the free list to get the memory from */
    size_t tree_size;                  /**< the size of the tree */
};
typedef struct opal_rb_tree_t opal_rb_tree_t;

/** declare the tree node as a class */
OPAL_DECLSPEC OBJ_CLASS_DECLARATION(opal_rb_tree_node_t);
/** declare the tree as a class */
OPAL_DECLSPEC OBJ_CLASS_DECLARATION(opal_rb_tree_t);

/* Function pointers for map traversal function */
/**
  * this function is used for the opal_rb_tree_traverse function.
  * it is passed a pointer to the value for each node and, if it returns
  * a one, the action function is called on that node. Otherwise, the node is ignored.
  */
typedef int (*opal_rb_tree_condition_fn_t)(void *);
/**
 * this function is used for the user to perform any action on the passed
 * values. The first argument is the key and the second is the value.
 * note that this function SHOULD NOT modify the keys, as that would
 * mess up the tree.
 */
typedef void (*opal_rb_tree_action_fn_t)(void *, void *);

/*
 * Public function protoypes
 */

/**
  * the function creates a new tree
  *
  * @param tree a pointer to an allocated area of memory for the main
  *  tree data structure.
  * @param comp a pointer to the function to use for comaparing 2 nodes
  *
  * @retval OPAL_SUCCESS if it is successful
  * @retval OPAL_ERR_TEMP_OUT_OF_RESOURCE if unsuccessful
  */
OPAL_DECLSPEC int opal_rb_tree_init(opal_rb_tree_t * tree, opal_rb_tree_comp_fn_t comp);

/**
  * inserts a node into the tree
  *
  * @param tree a pointer to the tree data structure
  * @param key the key for the node
  * @param value the value for the node
  *
  * @retval OPAL_SUCCESS
  * @retval OPAL_ERR_TEMP_OUT_OF_RESOURCE if unsuccessful
  */
OPAL_DECLSPEC int opal_rb_tree_insert(opal_rb_tree_t *tree, void * key, void * value);

/**
  * finds a value in the tree based on the passed key using passed
  * compare function
  *
  * @param tree a pointer to the tree data structure
  * @param key a pointer to the key
  * @param compare function
  *
  * @retval pointer to the value if found
  * @retval NULL if not found
  */
OPAL_DECLSPEC void * opal_rb_tree_find_with(opal_rb_tree_t *tree, void *key, opal_rb_tree_comp_fn_t compfn);

/**
  * finds a value in the tree based on the passed key
  *
  * @param tree a pointer to the tree data structure
  * @param key a pointer to the key
  *
  * @retval pointer to the value if found
  * @retval NULL if not found
  */
static inline void * opal_rb_tree_find(opal_rb_tree_t *tree, void *key)
{
    return opal_rb_tree_find_with(tree, key, tree->comp);
}

/**
  * deletes a node based on its key
  *
  * @param tree a pointer to the tree data structure
  * @param key a pointer to the key
  *
  * @retval OPAL_SUCCESS if the node is found and deleted
  * @retval OPAL_ERR_NOT_FOUND if the node is not found
  */
OPAL_DECLSPEC int opal_rb_tree_delete(opal_rb_tree_t *tree, void *key);

/**
  * frees all the nodes on the tree
  *
  * @param tree a pointer to the tree data structure
  *
  * @retval OPAL_SUCCESS
  */
OPAL_DECLSPEC int opal_rb_tree_destroy(opal_rb_tree_t *tree);

/**
  * traverses the entire tree, performing the cond function on each of the
  * values and if it returns one it performs the action function on the values
  *
  * @param tree a pointer to the tree
  * @param cond a pointer to the condition function
  * @param action a pointer to the action function
  *
  * @retval OPAL_SUCCESS
  * @retval OPAL_ERROR if there is an error
  */
OPAL_DECLSPEC int opal_rb_tree_traverse(opal_rb_tree_t *tree,
                          opal_rb_tree_condition_fn_t cond,
                          opal_rb_tree_action_fn_t action);

/**
  * returns the size of the tree
  *
  * @param tree a pointer to the tree data structure
  *
  * @retval int the nuber of items on the tree
  */
OPAL_DECLSPEC int opal_rb_tree_size(opal_rb_tree_t *tree);

END_C_DECLS
#endif /* OPAL_RB_TREE_H */

cmd: