network_map.h

// network_map.h
#pragma once
 
#include <stdint.h>
#include <stdlib.h>
#include "ecs.h"

typedef struct {
    uint32_t network_id; 
    entity_t local_id; 
} network_id_pair_t;

typedef struct {
    network_id_pair_t *pairs; 
    size_t count; 
    size_t capacity; 
} network_map_t;

static inline void network_map_init(network_map_t *map) {
    map->pairs = NULL;
    map->count = 0;
    map->capacity = 0;
}

static inline void network_map_destroy(network_map_t *map) {
    if (map && map->pairs) {
        free(map->pairs);
        map->pairs = NULL;
        map->count = 0;
        map->capacity = 0;
    }
}
 

static inline entity_t network_map_lookup(network_map_t *map, uint32_t network_id) {
    if (!map || !map->pairs) return (entity_t)-1;
    for (size_t i = 0; i < map->count; ++i) {
        if (map->pairs[i].network_id == network_id) {
            return map->pairs[i].local_id;
        }
    }
    return (entity_t)-1;
}

static inline void network_map_insert(network_map_t *map, uint32_t network_id, entity_t local_id) {
    if (!map) return;
    if (map->count >= map->capacity) {
        size_t new_cap = map->capacity == 0 ? 16 : map->capacity * 2;
        network_id_pair_t *new_pairs = (network_id_pair_t *)realloc(map->pairs, new_cap * sizeof(network_id_pair_t));
        if (!new_pairs) return;
        map->pairs = new_pairs;
        map->capacity = new_cap;
    }
    map->pairs[map->count].network_id = network_id;
    map->pairs[map->count].local_id = local_id;
    map->count++;
}

static inline int network_map_remove(network_map_t *map, uint32_t network_id) {
    if (!map || !map->pairs) return 0;
    for (size_t i = 0; i < map->count; ++i) {
        if (map->pairs[i].network_id == network_id) {
            // Move the last element into this position and shrink the count
            map->pairs[i] = map->pairs[map->count - 1];
            map->count--;
            return 1;
        }
    }
    return 0;
}