shenleiandClaude Opus 5.5
a46093104c
- extension/src/{port,platform,codepage} -> src/; native_render -> src/host
(+ dxt, shaders/); libgr2 -> src/gr2; extension/third_party -> third_party
- extension/tests -> tests/port, libgr2/tests -> tests/gr2
- android-native -> android (build.sh, push-client.sh moved in)
- script -> scripts; tools/40250 -> tools/server; oracle -> tools/granny-oracle;
perf tools -> tools/perf
- all build trees under build/ (native, release, android, port-gate)
- xrender:: CMake aliases -> mt::; port-map ledger impl paths rewritten
No code changes. ctest 15/15, port_gate macos+android PASS, port_map check 0 errors.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
28 lines
901 B
C
28 lines
901 B
C
/* "Rotating trees" (Armin Rigo)
|
|
*
|
|
* Google "splay trees" for the general idea.
|
|
*
|
|
* It's a dict-like data structure that works best when accesses are not
|
|
* random, but follow a strong pattern. The one implemented here is for
|
|
* access patterns where the same small set of keys is looked up over
|
|
* and over again, and this set of keys evolves slowly over time.
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
|
|
#define EMPTY_ROTATING_TREE ((rotating_node_t *)NULL)
|
|
|
|
typedef struct rotating_node_s rotating_node_t;
|
|
typedef int (*rotating_tree_enum_fn) (rotating_node_t *node, void *arg);
|
|
|
|
struct rotating_node_s {
|
|
void *key;
|
|
rotating_node_t *left;
|
|
rotating_node_t *right;
|
|
};
|
|
|
|
void RotatingTree_Add(rotating_node_t **root, rotating_node_t *node);
|
|
rotating_node_t* RotatingTree_Get(rotating_node_t **root, void *key);
|
|
int RotatingTree_Enum(rotating_node_t *root, rotating_tree_enum_fn enumfn,
|
|
void *arg);
|