/** * Copyright (c) 2019 Leonardo Vencovsky * * This file is part of the C Macro Collections Library. * * 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. */ /** * INIT * * The part 'INIT' gives a new way of initializing a collection. The collection * struct is not heap allocated, only its internal structure (nodes, buffers). */ #ifdef CMC_EXT_INIT struct SNAME CMC_(PFX, _init)(size_t capacity, double load, struct CMC_DEF_FKEY(SNAME) * f_key, struct CMC_DEF_FVAL(SNAME) * f_val) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif return CMC_(PFX, _init_custom)(capacity, load, f_key, f_val, NULL, NULL); } struct SNAME CMC_(PFX, _init_custom)(size_t capacity, double load, struct CMC_DEF_FKEY(SNAME) * f_key, struct CMC_DEF_FVAL(SNAME) * f_val, CMC_ALLOC_TYPE alloc, CMC_CALLBACK_TYPE callbacks) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif CMC_CALLBACKS_MAYBE_UNUSED(callbacks); struct SNAME _map_ = { 0 }; if (capacity == 0 || load <= 0 || load >= 1) return _map_; /* Prevent integer overflow */ if (capacity >= (double)UINTMAX_MAX * load) return _map_; if (!f_key || !f_val) return _map_; size_t real_capacity = CMC_(PFX, _impl_calculate_size)(capacity / load); if (!alloc) alloc = &cmc_alloc_node_default; _map_.buffer = alloc->calloc(real_capacity, sizeof(struct CMC_DEF_ENTRY(SNAME))); if (!_map_.buffer) return _map_; _map_.count = 0; _map_.capacity = real_capacity; _map_.load = load; _map_.flag = CMC_FLAG_OK; _map_.f_key = f_key; _map_.f_val = f_val; _map_.alloc = alloc; CMC_CALLBACKS_ASSIGN(&_map_, callbacks); return _map_; } void CMC_(PFX, _release)(struct SNAME _map_) { if (_map_.f_key->free || _map_.f_val->free) { for (size_t i = 0; i < _map_.capacity; i++) { struct CMC_DEF_ENTRY(SNAME) *entry = &(_map_.buffer[i]); if (entry->state == CMC_ES_FILLED) { if (_map_.f_key->free) _map_.f_key->free(entry->key); if (_map_.f_val->free) _map_.f_val->free(entry->value); } } } _map_.alloc->free(_map_.buffer); } #endif /* CMC_EXT_INIT */ /** * ITER * * Hashmap bi-directional iterator. */ #ifdef CMC_EXT_ITER struct CMC_DEF_ITER(SNAME) CMC_(PFX, _iter_start)(struct SNAME *target) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif struct CMC_DEF_ITER(SNAME) iter; iter.target = target; iter.cursor = 0; iter.index = 0; iter.first = 0; iter.last = 0; iter.start = true; iter.end = CMC_(PFX, _empty)(target); if (!CMC_(PFX, _empty)(target)) { for (size_t i = 0; i < target->capacity; i++) { if (target->buffer[i].state == CMC_ES_FILLED) { iter.first = i; break; } } iter.cursor = iter.first; for (size_t i = target->capacity; i > 0; i--) { if (target->buffer[i - 1].state == CMC_ES_FILLED) { iter.last = i - 1; break; } } } return iter; } struct CMC_DEF_ITER(SNAME) CMC_(PFX, _iter_end)(struct SNAME *target) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif struct CMC_DEF_ITER(SNAME) iter; iter.target = target; iter.cursor = 0; iter.index = 0; iter.first = 0; iter.last = 0; iter.start = CMC_(PFX, _empty)(target); iter.end = true; if (!CMC_(PFX, _empty)(target)) { for (size_t i = 0; i < target->capacity; i++) { if (target->buffer[i].state == CMC_ES_FILLED) { iter.first = i; break; } } for (size_t i = target->capacity; i > 0; i--) { if (target->buffer[i - 1].state == CMC_ES_FILLED) { iter.last = i - 1; break; } } iter.cursor = iter.last; iter.index = target->count - 1; } return iter; } bool CMC_(PFX, _iter_at_start)(struct CMC_DEF_ITER(SNAME) * iter) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif return CMC_(PFX, _empty)(iter->target) || iter->start; } bool CMC_(PFX, _iter_at_end)(struct CMC_DEF_ITER(SNAME) * iter) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif return CMC_(PFX, _empty)(iter->target) || iter->end; } bool CMC_(PFX, _iter_to_start)(struct CMC_DEF_ITER(SNAME) * iter) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif if (!CMC_(PFX, _empty)(iter->target)) { iter->cursor = iter->first; iter->index = 0; iter->start = true; iter->end = CMC_(PFX, _empty)(iter->target); return true; } return false; } bool CMC_(PFX, _iter_to_end)(struct CMC_DEF_ITER(SNAME) * iter) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif if (!CMC_(PFX, _empty)(iter->target)) { iter->cursor = iter->last; iter->index = iter->target->count - 1; iter->start = CMC_(PFX, _empty)(iter->target); iter->end = true; return true; } return false; } bool CMC_(PFX, _iter_next)(struct CMC_DEF_ITER(SNAME) * iter) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif if (iter->end) return false; if (iter->index + 1 == iter->target->count) { iter->end = true; return false; } iter->start = CMC_(PFX, _empty)(iter->target); struct CMC_DEF_ENTRY(SNAME) *scan = &(iter->target->buffer[iter->cursor]); iter->index++; while (1) { iter->cursor++; scan = &(iter->target->buffer[iter->cursor]); if (scan->state == CMC_ES_FILLED) break; } return true; } bool CMC_(PFX, _iter_prev)(struct CMC_DEF_ITER(SNAME) * iter) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif if (iter->start) return false; if (iter->index == 0) { iter->start = true; return false; } iter->end = CMC_(PFX, _empty)(iter->target); struct CMC_DEF_ENTRY(SNAME) *scan = &(iter->target->buffer[iter->cursor]); iter->index--; while (1) { iter->cursor--; scan = &(iter->target->buffer[iter->cursor]); if (scan->state == CMC_ES_FILLED) break; } return true; } /* Returns true only if the iterator moved */ bool CMC_(PFX, _iter_advance)(struct CMC_DEF_ITER(SNAME) * iter, size_t steps) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif if (iter->end) return false; if (iter->index + 1 == iter->target->count) { iter->end = true; return false; } if (steps == 0 || iter->index + steps >= iter->target->count) return false; for (size_t i = 0; i < steps; i++) CMC_(PFX, _iter_next)(iter); return true; } /* Returns true only if the iterator moved */ bool CMC_(PFX, _iter_rewind)(struct CMC_DEF_ITER(SNAME) * iter, size_t steps) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif if (iter->start) return false; if (iter->index == 0) { iter->start = true; return false; } if (steps == 0 || iter->index < steps) return false; for (size_t i = 0; i < steps; i++) CMC_(PFX, _iter_prev)(iter); return true; } /* Returns true only if the iterator was able to be positioned at the */ /* given index */ bool CMC_(PFX, _iter_go_to)(struct CMC_DEF_ITER(SNAME) * iter, size_t index) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif if (index >= iter->target->count) return false; if (iter->index > index) return CMC_(PFX, _iter_rewind)(iter, iter->index - index); else if (iter->index < index) return CMC_(PFX, _iter_advance)(iter, index - iter->index); return true; } K CMC_(PFX, _iter_key)(struct CMC_DEF_ITER(SNAME) * iter) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif if (CMC_(PFX, _empty)(iter->target)) return (K){ 0 }; return iter->target->buffer[iter->cursor].key; } V CMC_(PFX, _iter_value)(struct CMC_DEF_ITER(SNAME) * iter) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif if (CMC_(PFX, _empty)(iter->target)) return (V){ 0 }; return iter->target->buffer[iter->cursor].value; } V *CMC_(PFX, _iter_rvalue)(struct CMC_DEF_ITER(SNAME) * iter) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif if (CMC_(PFX, _empty)(iter->target)) return NULL; return &(iter->target->buffer[iter->cursor].value); } size_t CMC_(PFX, _iter_index)(struct CMC_DEF_ITER(SNAME) * iter) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif return iter->index; } #endif /* CMC_EXT_ITER */ /** * STR * * Print helper functions. */ #ifdef CMC_EXT_STR bool CMC_(PFX, _to_string)(struct SNAME *_map_, FILE *fptr) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif struct SNAME *m_ = _map_; return 0 <= fprintf(fptr, "struct %s<%s, %s> " "at %p { " "buffer:%p, " "capacity:%" PRIuMAX ", " "count:%" PRIuMAX ", " "load:%lf, " "flag:%d, " "f_key:%p, " "f_val:%p, " "alloc:%p, " "callbacks:%p }", CMC_TO_STRING(SNAME), CMC_TO_STRING(K), CMC_TO_STRING(V), m_, m_->buffer, m_->capacity, m_->count, m_->load, m_->flag, m_->f_key, m_->f_val, m_->alloc, CMC_CALLBACKS_GET(m_)); } bool CMC_(PFX, _print)(struct SNAME *_map_, FILE *fptr, const char *start, const char *separator, const char *end, const char *key_val_sep) { #ifdef CMC_DEV CMC_DEV_FCALL; #endif fprintf(fptr, "%s", start); size_t last = 0; for (size_t i = _map_->capacity; i > 0; i--) { if ((_map_->buffer[i - 1]).state == CMC_ES_FILLED) { last = i - 1; break; } } for (size_t i = 0; i < _map_->capacity; i++) { struct CMC_DEF_ENTRY(SNAME) *entry = &(_map_->buffer[i]); if (entry->state == CMC_ES_FILLED) { if (!_map_->f_key->str(fptr, entry->key)) return false; fprintf(fptr, "%s", key_val_sep); if (!_map_->f_val->str(fptr, entry->value)) return false; if (i + 1 < last) fprintf(fptr, "%s", separator); } } fprintf(fptr, "%s", end); return true; } #endif /* CMC_EXT_STR */