2020-11-11 01:19:49 +03:00
|
|
|
/*
|
2021-04-27 20:19:25 +03:00
|
|
|
* BSD-3-Clause
|
2020-11-11 01:19:49 +03:00
|
|
|
*
|
2021-04-27 20:19:25 +03:00
|
|
|
* Copyright 2021 Ozan Tezcan
|
|
|
|
* All rights reserved.
|
2020-11-11 01:19:49 +03:00
|
|
|
*
|
2021-04-27 20:19:25 +03:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
2020-11-11 01:19:49 +03:00
|
|
|
*
|
2021-04-27 20:19:25 +03:00
|
|
|
* 1. Redistributions of source code must retain the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
|
|
* and/or other materials provided with the distribution.
|
|
|
|
* 3. Neither the name of the copyright holder nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
2020-11-11 01:19:49 +03:00
|
|
|
*
|
2021-04-27 20:19:25 +03:00
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
|
|
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
|
|
|
|
* OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
|
|
|
|
* OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
2020-11-11 01:19:49 +03:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef SC_HEAP_H
|
|
|
|
#define SC_HEAP_H
|
|
|
|
|
|
|
|
#include <stdbool.h>
|
|
|
|
#include <stddef.h>
|
|
|
|
#include <stdint.h>
|
|
|
|
|
2021-04-13 22:36:50 +03:00
|
|
|
#define SC_HEAP_VERSION "2.0.0"
|
2021-02-14 16:19:26 +03:00
|
|
|
|
2021-01-23 20:57:08 +03:00
|
|
|
#ifdef SC_HAVE_CONFIG_H
|
2021-04-07 00:28:50 +03:00
|
|
|
#include "config.h"
|
2021-01-23 20:57:08 +03:00
|
|
|
#else
|
2021-04-15 01:30:58 +03:00
|
|
|
#define sc_heap_malloc malloc
|
2021-04-07 00:28:50 +03:00
|
|
|
#define sc_heap_realloc realloc
|
2021-04-15 01:30:58 +03:00
|
|
|
#define sc_heap_free free
|
2021-01-23 20:57:08 +03:00
|
|
|
#endif
|
|
|
|
|
2021-04-07 00:28:50 +03:00
|
|
|
struct sc_heap_data {
|
|
|
|
int64_t key;
|
|
|
|
void *data;
|
2020-11-11 01:19:49 +03:00
|
|
|
};
|
|
|
|
|
2021-04-07 00:28:50 +03:00
|
|
|
struct sc_heap {
|
|
|
|
size_t cap;
|
|
|
|
size_t size;
|
|
|
|
struct sc_heap_data *elems;
|
2020-11-11 01:19:49 +03:00
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
2021-04-07 00:28:50 +03:00
|
|
|
* @param h heap
|
|
|
|
* @param cap initial capacity, pass '0' for no initial memory allocation
|
|
|
|
* @return 'true' on success, 'false' on out of memory
|
2020-11-11 01:19:49 +03:00
|
|
|
*/
|
2021-04-07 00:28:50 +03:00
|
|
|
bool sc_heap_init(struct sc_heap *h, size_t cap);
|
2020-11-11 01:19:49 +03:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Destroys heap, frees memory
|
2021-04-07 00:28:50 +03:00
|
|
|
* @param h heap
|
2020-11-11 01:19:49 +03:00
|
|
|
*/
|
2021-04-07 00:28:50 +03:00
|
|
|
void sc_heap_term(struct sc_heap *h);
|
2020-11-11 01:19:49 +03:00
|
|
|
|
|
|
|
/**
|
2021-04-07 00:28:50 +03:00
|
|
|
* @param h heap
|
|
|
|
* @return element count
|
2020-11-11 01:19:49 +03:00
|
|
|
*/
|
2021-04-07 00:28:50 +03:00
|
|
|
size_t sc_heap_size(struct sc_heap *h);
|
2020-11-11 01:19:49 +03:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Clears elements from the queue, does not free the allocated memory.
|
2021-04-07 00:28:50 +03:00
|
|
|
* @param h heap
|
2020-11-11 01:19:49 +03:00
|
|
|
*/
|
2021-04-07 00:28:50 +03:00
|
|
|
void sc_heap_clear(struct sc_heap *h);
|
2020-11-11 01:19:49 +03:00
|
|
|
|
|
|
|
/**
|
2021-04-07 00:28:50 +03:00
|
|
|
* @param h heap
|
2021-02-03 08:09:50 +03:00
|
|
|
* @param key key
|
|
|
|
* @param data data
|
2020-11-11 01:19:49 +03:00
|
|
|
* @return 'false' on out of memory.
|
|
|
|
*/
|
2021-04-07 00:28:50 +03:00
|
|
|
bool sc_heap_add(struct sc_heap *h, int64_t key, void *data);
|
2020-11-11 01:19:49 +03:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Read top element without removing from the heap.
|
|
|
|
*
|
2021-04-07 00:28:50 +03:00
|
|
|
* @param h heap
|
2021-04-27 20:19:25 +03:00
|
|
|
* @return pointer to data holder(valid until next heap operation)
|
|
|
|
* NULL if heap is empty.
|
2020-11-11 01:19:49 +03:00
|
|
|
*/
|
2021-04-27 20:19:25 +03:00
|
|
|
struct sc_heap_data *sc_heap_peek(struct sc_heap *h);
|
2020-11-11 01:19:49 +03:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Read top element and remove it from the heap.
|
|
|
|
*
|
2021-04-07 00:28:50 +03:00
|
|
|
* @param h heap
|
2021-04-27 20:19:25 +03:00
|
|
|
* @return pointer to data holder(valid until next heap operation)
|
|
|
|
* NULL if heap is empty.
|
2020-11-11 01:19:49 +03:00
|
|
|
*/
|
2021-04-27 20:19:25 +03:00
|
|
|
struct sc_heap_data *sc_heap_pop(struct sc_heap *h);
|
2020-11-11 01:19:49 +03:00
|
|
|
|
|
|
|
#endif
|