impotent/stc/sortedset.h
2025-08-31 16:22:38 +03:00

48 lines
1.6 KiB
C

/* MIT License
*
* Copyright (c) 2025 Tyge Løvset
*
* 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.
*/
// Sorted set - implemented as an AA-tree (balanced binary tree).
/*
#include <stdio.h>
#define T Intset, int
#include <stc/sortedset.h> // sorted set of int
int main(void) {
Intset set = {0};
Intset_insert(&set, 5);
Intset_insert(&set, 8);
Intset_insert(&set, 3);
Intset_insert(&set, 5);
for (c_each(k, Intset, set))
printf(" %d\n", *k.ref);
Intset_drop(&set);
}
*/
#define _i_prefix sset_
#define _i_is_set
#include "smap.h"