Convert gitgram/ and aitimemachine/ from embedded git repos (which showed as opaque submodule gitlinks on GitHub) into fully-tracked first-party content. AITM now merges its 7 vendored repos as first-party engines: - memory: beads (Go task DAG) + context7 (docs SDK), unified into saved_contexts - git: vendored C git (bundled binary) + gitnexus (in-process code intelligence) - agentic: a2a (@a2a-js/sdk) + pal (AITM-managed Python subprocess) Includes the full session's product build: Gitgram web/mobile/backend features, AITM website/CLI/MCP, the unified memory layer, engine build tooling (scripts/build-engines.sh, Dockerfile, CI), docs (README, ENGINES.md, ARCHITECTURE.md), and extensive test suites. Build artifacts, node_modules, external/, and gemini-cli are gitignored. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com>
75 lines
1.4 KiB
C
75 lines
1.4 KiB
C
/*
|
|
* Copyright 2020 Google LLC
|
|
*
|
|
* Use of this source code is governed by a BSD-style
|
|
* license that can be found in the LICENSE file or at
|
|
* https://developers.google.com/open-source/licenses/bsd
|
|
*/
|
|
|
|
#include "system.h"
|
|
#include "tree.h"
|
|
|
|
#include "basics.h"
|
|
|
|
struct tree_node *tree_search(struct tree_node *tree,
|
|
void *key,
|
|
int (*compare)(const void *, const void *))
|
|
{
|
|
int res;
|
|
if (!tree)
|
|
return NULL;
|
|
res = compare(key, tree->key);
|
|
if (res < 0)
|
|
return tree_search(tree->left, key, compare);
|
|
else if (res > 0)
|
|
return tree_search(tree->right, key, compare);
|
|
return tree;
|
|
}
|
|
|
|
struct tree_node *tree_insert(struct tree_node **rootp,
|
|
void *key,
|
|
int (*compare)(const void *, const void *))
|
|
{
|
|
int res;
|
|
|
|
if (!*rootp) {
|
|
struct tree_node *n;
|
|
|
|
REFTABLE_CALLOC_ARRAY(n, 1);
|
|
if (!n)
|
|
return NULL;
|
|
|
|
n->key = key;
|
|
*rootp = n;
|
|
return *rootp;
|
|
}
|
|
|
|
res = compare(key, (*rootp)->key);
|
|
if (res < 0)
|
|
return tree_insert(&(*rootp)->left, key, compare);
|
|
else if (res > 0)
|
|
return tree_insert(&(*rootp)->right, key, compare);
|
|
return *rootp;
|
|
}
|
|
|
|
void infix_walk(struct tree_node *t, void (*action)(void *arg, void *key),
|
|
void *arg)
|
|
{
|
|
if (t->left)
|
|
infix_walk(t->left, action, arg);
|
|
action(arg, t->key);
|
|
if (t->right)
|
|
infix_walk(t->right, action, arg);
|
|
}
|
|
|
|
void tree_free(struct tree_node *t)
|
|
{
|
|
if (!t)
|
|
return;
|
|
if (t->left)
|
|
tree_free(t->left);
|
|
if (t->right)
|
|
tree_free(t->right);
|
|
reftable_free(t);
|
|
}
|