treap.h

Go to the documentation of this file.

// The MIT License (MIT)
// Copyright (c) 2018 Maksim Andrianov
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
// IN THE SOFTWARE.
#ifndef CDCONTAINERS_INCLUDE_CDCONTAINERS_TREAP_H
#define CDCONTAINERS_INCLUDE_CDCONTAINERS_TREAP_H

#include <cdcontainers/common.h>
#include <cdcontainers/status.h>

#include <assert.h>
#include <stdarg.h>
#include <stdbool.h>

typedef int (*cdc_priority_fn_t)(void *);

struct cdc_treap_node {
  struct cdc_treap_node *parent;
  struct cdc_treap_node *left;
  struct cdc_treap_node *right;
  void *key;
  void *value;
  int priority;
};

struct cdc_treap {
  struct cdc_treap_node *root;
  size_t size;
  cdc_priority_fn_t prior;
  struct cdc_data_info *dinfo;
};

struct cdc_treap_iter {
  struct cdc_treap *container;
  struct cdc_treap_node *prev;
  struct cdc_treap_node *current;
};

struct cdc_pair_treap_iter_bool {
  struct cdc_treap_iter first;
  bool second;
};

// Base
enum cdc_stat cdc_treap_ctor(struct cdc_treap **t, struct cdc_data_info *info);

enum cdc_stat cdc_treap_ctorl(struct cdc_treap **t, struct cdc_data_info *info,
                              ...);

enum cdc_stat cdc_treap_ctorv(struct cdc_treap **t, struct cdc_data_info *info,
                              va_list args);

enum cdc_stat cdc_treap_ctor1(struct cdc_treap **t, struct cdc_data_info *info,
                              cdc_priority_fn_t prior);

enum cdc_stat cdc_treap_ctorl1(struct cdc_treap **t, struct cdc_data_info *info,
                               cdc_priority_fn_t prior, ...);

enum cdc_stat cdc_treap_ctorv1(struct cdc_treap **t, struct cdc_data_info *info,
                               cdc_priority_fn_t prior, va_list args);

void cdc_treap_dtor(struct cdc_treap *t);
// Lookup
enum cdc_stat cdc_treap_get(struct cdc_treap *t, void *key, void **value);

size_t cdc_treap_count(struct cdc_treap *t, void *key);

void cdc_treap_find(struct cdc_treap *t, void *key, struct cdc_treap_iter *it);
// Capacity
static inline size_t cdc_treap_size(struct cdc_treap *t)
{
  assert(t != NULL);

  return t->size;
}

static inline bool cdc_treap_empty(struct cdc_treap *t)
{
  assert(t != NULL);

  return t->size == 0;
}
// Modifiers
void cdc_treap_clear(struct cdc_treap *t);

enum cdc_stat cdc_treap_insert(struct cdc_treap *t, void *key, void *value,
                               struct cdc_pair_treap_iter_bool *ret);

enum cdc_stat cdc_treap_insert1(struct cdc_treap *t, void *key, void *value,
                                struct cdc_treap_iter *it, bool *inserted);

enum cdc_stat cdc_treap_insert_or_assign(struct cdc_treap *t, void *key,
                                         void *value,
                                         struct cdc_pair_treap_iter_bool *ret);

enum cdc_stat cdc_treap_insert_or_assign1(struct cdc_treap *t, void *key,
                                          void *value,
                                          struct cdc_treap_iter *it,
                                          bool *inserted);

size_t cdc_treap_erase(struct cdc_treap *t, void *key);

void cdc_treap_swap(struct cdc_treap *a, struct cdc_treap *b);
// Iterators
void cdc_treap_begin(struct cdc_treap *t, struct cdc_treap_iter *it);

void cdc_treap_end(struct cdc_treap *t, struct cdc_treap_iter *it);
// Iterators
void cdc_treap_iter_next(struct cdc_treap_iter *it);

void cdc_treap_iter_prev(struct cdc_treap_iter *it);

static inline bool cdc_treap_iter_has_next(struct cdc_treap_iter *it)
{
  assert(it != NULL);

  return it->current != NULL;
}

static inline bool cdc_treap_iter_has_prev(struct cdc_treap_iter *it)
{
  assert(it != NULL);

  return it->prev != NULL;
}

static inline void *cdc_treap_iter_key(struct cdc_treap_iter *it)
{
  assert(it != NULL);

  return it->current->key;
}

static inline void *cdc_treap_iter_value(struct cdc_treap_iter *it)
{
  assert(it != NULL);

  return it->current->value;
}

static inline struct cdc_pair cdc_treap_iter_key_value(
    struct cdc_treap_iter *it)
{
  assert(it != NULL);

  struct cdc_pair pair = {it->prev->key, it->prev->value};
  return pair;
}

static inline bool cdc_treap_iter_is_eq(struct cdc_treap_iter *it1,
                                        struct cdc_treap_iter *it2)
{
  assert(it1 != NULL);
  assert(it2 != NULL);

  return it1->container == it2->container && it1->prev == it2->prev &&
         it1->current == it2->current;
}
// Short names
#ifdef CDC_USE_SHORT_NAMES
typedef struct cdc_treap treap_t;
typedef struct cdc_treap_iter treap_iter_t;
typedef struct cdc_pair_treap_iter pair_treap_iter_t;
typedef struct cdc_pair_treap_iter_bool pair_treap_iter_bool_t;

// Base
#define treap_ctor(...) cdc_treap_ctor(__VA_ARGS__)
#define treap_ctorv(...) cdc_treap_ctorv(__VA_ARGS__)
#define treap_ctorl(...) cdc_treap_ctorl(__VA_ARGS__)
#define treap_ctor1(...) cdc_treap_ctor1(__VA_ARGS__)
#define treap_ctorv1(...) cdc_treap_ctorv1(__VA_ARGS__)
#define treap_ctorl1(...) cdc_treap_ctorl1(__VA_ARGS__)
#define treap_dtor(...) cdc_treap_dtor(__VA_ARGS__)

// Lookup
#define treap_get(...) cdc_treap_get(__VA_ARGS__)
#define treap_count(...) cdc_treap_count(__VA_ARGS__)
#define treap_find(...) cdc_treap_find(__VA_ARGS__)

// Capacity
#define treap_size(...) cdc_treap_size(__VA_ARGS__)
#define treap_empty(...) cdc_treap_empty(__VA_ARGS__)

// Modifiers
#define treap_clear(...) cdc_treap_clear(__VA_ARGS__)
#define treap_insert(...) cdc_treap_insert(__VA_ARGS__)
#define treap_insert1(...) cdc_treap_insert1(__VA_ARGS__)
#define treap_insert_or_assign(...) cdc_treap_insert_or_assign(__VA_ARGS__)
#define treap_insert_or_assign1(...) cdc_treap_insert_or_assign1(__VA_ARGS__)
#define treap_erase(...) cdc_treap_erase(__VA_ARGS__)
#define treap_swap(...) cdc_treap_swap(__VA_ARGS__)

// Iterators
#define treap_begin(...) cdc_treap_begin(__VA_ARGS__)
#define treap_end(...) cdc_treap_end(__VA_ARGS__)

// Iterators
#define treap_iter_next(...) cdc_treap_iter_next(__VA_ARGS__)
#define treap_iter_has_next(...) cdc_treap_iter_has_next(__VA_ARGS__)
#define treap_iter_key(...) cdc_treap_iter_key(__VA_ARGS__)
#define treap_iter_value(...) cdc_treap_iter_value(__VA_ARGS__)
#define treap_iter_key_value(...) cdc_treap_iter_key_value(__VA_ARGS__)
#define treap_iter_is_eq(...) cdc_treap_iter_is_eq(__VA_ARGS__)
#endif

#endif  // CDSTRUCTURES_INCLUDE_CDCONTAINERS_VECTOR_H