/*
 * Dynomite - A thin, distributed replication layer for multi non-distributed
 * storages. Copyright (C) 2014 Netflix, Inc.
 */

/*
 * twemproxy - A fast and lightweight proxy for memcached protocol.
 * Copyright (C) 2011 Twitter, Inc.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#ifndef _DYN_ARRAY_H_
#define _DYN_ARRAY_H_

#include "dyn_types.h"

typedef int (*array_compare_t)(const void *, const void *);
typedef rstatus_t (*array_each_t)(void *elem);
typedef rstatus_t (*array_each_2_t)(void *elem, void *data1, void *data2);

struct array {
  uint32_t nelem;  /* # element */
  void *elem;      /* element */
  size_t size;     /* element size */
  uint32_t nalloc; /* # allocated element */
};

#define null_array \
  { 0, NULL, 0, 0 }

static inline void array_null(struct array *a) {
  a->nelem = 0;
  a->elem = NULL;
  a->size = 0;
  a->nalloc = 0;
}

static inline void array_set(struct array *a, void *elem, size_t size,
                             uint32_t nalloc) {
  a->nelem = 0;
  a->elem = elem;
  a->size = size;
  a->nalloc = nalloc;
}

static inline uint32_t array_n(const struct array *a) { return a->nelem; }

static inline void array_reset(struct array *a) { a->nelem = 0; }

struct array *array_create(uint32_t n, size_t size);
void array_destroy(struct array *a);
rstatus_t array_init(struct array *a, uint32_t n, size_t size);
void array_deinit(struct array *a);

uint32_t array_idx(struct array *a, void *elem);
void *array_push(struct array *a);
void *array_pop(struct array *a);
void *array_get(struct array *a, uint32_t idx);
void *array_top(struct array *a);
void array_swap(struct array *a, struct array *b);
void array_sort(struct array *a, array_compare_t compare);
rstatus_t array_each(struct array *a, array_each_t func);
rstatus_t array_each_2(struct array *a, array_each_2_t func, void *data1,
                       void *data2);

#endif
