mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-02-01 03:53:33 +00:00
ea0b5d9d1c
A new rollup tool now exists for flattening out the headers in a way that works better for our purposes than cpp. A lot of the API clutter has been removed. APIs that aren't a sure thing in terms of general recommendation are now marked internal. There's now a smoke test for the amalgamation archive and gigantic header file. So we can now guarantee you can use this project on the easiest difficulty setting without the gigantic repository. A website is being created, which is currently a work in progress: https://justine.storage.googleapis.com/cosmopolitan/index.html
47 lines
2.5 KiB
C
47 lines
2.5 KiB
C
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
||
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
||
╞══════════════════════════════════════════════════════════════════════════════╡
|
||
│ Copyright 2020 Justine Alexandra Roberts Tunney │
|
||
│ │
|
||
│ This program is free software; you can redistribute it and/or modify │
|
||
│ it under the terms of the GNU General Public License as published by │
|
||
│ the Free Software Foundation; version 2 of the License. │
|
||
│ │
|
||
│ This program is distributed in the hope that it will be useful, but │
|
||
│ WITHOUT ANY WARRANTY; without even the implied warranty of │
|
||
│ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU │
|
||
│ General Public License for more details. │
|
||
│ │
|
||
│ You should have received a copy of the GNU General Public License │
|
||
│ along with this program; if not, write to the Free Software │
|
||
│ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA │
|
||
│ 02110-1301 USA │
|
||
╚─────────────────────────────────────────────────────────────────────────────*/
|
||
#include "libc/alg/critbit0.h"
|
||
#include "libc/alg/internal.h"
|
||
#include "libc/mem/mem.h"
|
||
|
||
static void critbit0_clear_traverse(void *top) {
|
||
unsigned char *p = top;
|
||
if (1 & (intptr_t)p) {
|
||
struct CritbitNode *q = (void *)(p - 1);
|
||
critbit0_clear_traverse(q->child[0]);
|
||
critbit0_clear_traverse(q->child[1]);
|
||
free(q), q = NULL;
|
||
} else {
|
||
free(p), p = NULL;
|
||
}
|
||
}
|
||
|
||
/**
|
||
* Removes all items from 𝑡.
|
||
* @param t tree
|
||
* @note h/t djb and agl
|
||
*/
|
||
void critbit0_clear(struct critbit0 *t) {
|
||
if (t->root) {
|
||
critbit0_clear_traverse(t->root);
|
||
t->root = NULL;
|
||
}
|
||
t->count = 0;
|
||
}
|