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>
46 lines
1.3 KiB
C
46 lines
1.3 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
|
|
*/
|
|
|
|
#ifndef TREE_H
|
|
#define TREE_H
|
|
|
|
/* tree_node is a generic binary search tree. */
|
|
struct tree_node {
|
|
void *key;
|
|
struct tree_node *left, *right;
|
|
};
|
|
|
|
/*
|
|
* Search the tree for the node matching the given key using `compare` as
|
|
* comparison function. Returns the node whose key matches or `NULL` in case
|
|
* the key does not exist in the tree.
|
|
*/
|
|
struct tree_node *tree_search(struct tree_node *tree,
|
|
void *key,
|
|
int (*compare)(const void *, const void *));
|
|
|
|
/*
|
|
* Insert a node into the tree. Returns the newly inserted node if the key does
|
|
* not yet exist. Otherwise it returns the preexisting node. Returns `NULL`
|
|
* when allocating the new node fails.
|
|
*/
|
|
struct tree_node *tree_insert(struct tree_node **rootp,
|
|
void *key,
|
|
int (*compare)(const void *, const void *));
|
|
|
|
/* performs an infix walk of the tree. */
|
|
void infix_walk(struct tree_node *t, void (*action)(void *arg, void *key),
|
|
void *arg);
|
|
|
|
/*
|
|
* deallocates the tree nodes recursively. Keys should be deallocated separately
|
|
* by walking over the tree. */
|
|
void tree_free(struct tree_node *t);
|
|
|
|
#endif
|