M0: compilable skeleton — Kigi 0.1.0 fork surgery

Hard fork of xai-org/grok-build (Apache-2.0) re-targeted as Kigi, an unofficial Kimi Code CLI community build. Rename & identity - 72 xai-*/xai-grok-* crates -> kigi-* (explicit: xai-grok-pager-bin -> kigi-bin [binary `kigi`], xai-grok-pager -> kigi-tui; rest mechanical); ptyctl, ptyctl-cli, third_party/ unchanged; proto package xai.grok.tools.v1 -> kigi.tools.v1 - Config home ~/.kigi (KIGI_SHARE_DIR override), env prefix GROK_* -> KIGI_*, `kigi --version` carries the unofficial-community-build notice - clap identity, help text, startup banner, prompt templates rebranded (templates re-encrypted) Deletions (PRD removal list #5/#6/#7/#9/#10) - voice input (xai-grok-voice) and all TUI wiring - telemetry: Mixpanel client, external OTel stream, Sentry, OTLP layers, trace/GCS/S3 upload queues (kigi-file-utils halved), workspace upload module & dc_log, heap-profile uploader, auth-diagnostics uploader, session-analytics halves of feedback; local zero-egress observability preserved in new kigi-log crate (unified log, --debug firehose, subsystem file logs, opt-in instrumentation) - announcements (crate, remote-settings fields, TUI surfaces) - plugin marketplace (crate, sources/browse/CTA/extensions-modal tab); direct plugin install/uninstall/update via kigi-agent git_install kept - relay/gateway/assets endpoints and features (agent relay, headless relay transport, gateway bridge, LeaderEnvUrls); leader IPC socket now ~/.kigi/leader.sock + KIGI_LEADER_SOCKET, no ws-url derivation - functional types rehomed instead of deleted: PermissionMode -> kigi-config-types, McpInitStrategy -> kigi-mcp, PrCreationSource -> session signals, TerminalDiagnostics -> kigi-pager-render, agent_id -> shell util Endpoints - kigi-env rewritten: single production KigiEndpoints {coding_api_base_url https://api.kimi.com/coding/v1 (KIGI_CODE_BASE_URL), oauth_host https://auth.kimi.com (KIGI_OAUTH_HOST), update_base_url (GitHub Releases API), upgrade_page_url}; GrokBuildEnvironment enum deleted Toolchain & workspace hygiene - Rust 1.97.0 pinned; edition 2024; full cargo update; git2 hoisted to workspace at 0.21 (Option->Result API migration), quick-xml 0.41 - Root Cargo.toml hand-maintained (PRD §8.1): version 0.1.0 inherited by all members, members sorted, unused deps pruned - cargo-deny advisories gate (deny.toml with documented transitive exceptions); CI workflow (check/clippy/fmt/deny/test, macOS+Linux) - cross-crate test seams re-gated behind `test-support` cargo feature; insta snapshot baselines renamed to the kigi_tui prefix - clippy --workspace --all-targets: zero warnings; fmt clean Fixes surfaced by the port - updater probe/installer divergence (bin/kigi vs bin/grok symlink set) - idle model-metadata refresh dead under KIGI_CODE_BASE_URL override (new is_effective_coding_endpoint_url, loopback+override aware) - macOS symlinked-TMPDIR fixture canonicalization (foreign_sessions, fast-worktree); RSS measurement tests serialized via serial_test Docs & legal (Apache §4) - NOTICE added (upstream attribution + change statement); THIRD-PARTY notices sustained; kigi-tools ported-code notices extended; README, CONTRIBUTING, SECURITY, AGENTS.md rewritten Out of scope for M0 (tracked): Kimi auth/inference (M1), search/fetch, command parity, config import (M2), Computer Hub excision & final brand-token sweep (M2), distribution & self-update rewrite (M3).
2026-07-17 05:31:01 -04:00
commit d6c20fc13f
2612 changed files with 1353757 additions and 0 deletions
@@ -0,0 +1,107 @@
+use crate::Graph;
+use std::collections::HashMap;
+use std::error::Error;
+use std::fmt::Debug;
+
+/*
+ * A helper that preforms a pre- or post-order traversal on the input graph
+ * and returns the nodes in the order they were visited. If the graph is
+ * undirected then this algorithm will navigate using neighbors. If the graph
+ * is directed then this algorithm will navigate using successors.
+ *
+ * If the order is not "post", it will be treated as "pre".
+ */
+pub fn dfs<GL: Default, N: Default + Clone + Debug, E: Default + Clone + Debug>(
+    g: &mut Graph<GL, N, E>,
+    vs: &Vec<String>,
+    order: &str,
+) -> Result<Vec<String>, Box<dyn Error>> {
+    let navigation: Box<dyn Fn(&String, &Graph<GL, N, E>) -> Vec<String>> =
+        Box::new(move |v: &String, g: &Graph<GL, N, E>| {
+            if g.is_directed() {
+                g.successors(&v).unwrap_or(vec![])
+            } else {
+                g.neighbors(&v).unwrap_or(vec![])
+            }
+        });
+
+    let order_func = match order {
+        "post" => post_order_dfs,
+        _ => pre_order_dfs,
+    };
+
+    let mut acc: Vec<String> = vec![];
+    let mut visited: HashMap<String, bool> = HashMap::new();
+    for v in vs.iter() {
+        if !g.has_node(v) {
+            return Err(format!("Graph does not have node: {}", v).into());
+        }
+
+        order_func(v, &navigation, &mut visited, &mut acc, g);
+    }
+
+    Ok(acc)
+}
+
+fn post_order_dfs<GL: Default, N: Default + Clone + Debug, E: Default + Clone + Debug>(
+    v: &String,
+    navigation: &Box<dyn Fn(&String, &Graph<GL, N, E>) -> Vec<String>>,
+    visited: &mut HashMap<String, bool>,
+    acc: &mut Vec<String>,
+    g: &Graph<GL, N, E>,
+) {
+    let mut stack: Vec<(String, bool)> = vec![(v.clone(), false)];
+    while stack.len() > 0 {
+        let curr_ = stack.pop();
+        if curr_.is_none() {
+            continue;
+        }
+        let curr = curr_.unwrap();
+        if curr.1 {
+            acc.push(curr.0.clone());
+        } else {
+            if !visited.contains_key(&curr.0) {
+                visited.insert(curr.0.clone(), true);
+                stack.push((curr.0.clone(), true));
+
+                // TODO: for_each_right implement in future
+                let _navigation_nodes: Vec<String> = navigation(&curr.0, g);
+                let mut idx = _navigation_nodes.len();
+                while idx > 0 {
+                    let nav_node = _navigation_nodes.get(idx - 1).cloned().unwrap();
+                    stack.push((nav_node, false));
+                    idx -= 1;
+                }
+            }
+        }
+    }
+}
+
+fn pre_order_dfs<GL: Default, N: Default + Clone, E: Default + Clone>(
+    v: &String,
+    navigation: &Box<dyn Fn(&String, &Graph<GL, N, E>) -> Vec<String>>,
+    visited: &mut HashMap<String, bool>,
+    acc: &mut Vec<String>,
+    g: &Graph<GL, N, E>,
+) {
+    let mut stack: Vec<String> = vec![v.clone()];
+    while stack.len() > 0 {
+        let curr_ = stack.pop();
+        if curr_.is_none() {
+            continue;
+        }
+        let curr = curr_.unwrap();
+        if !visited.contains_key(&curr) {
+            visited.insert(curr.clone(), true);
+            acc.push(curr.clone());
+
+            // TODO: for_each_right implement in future
+            let _navigation_nodes: Vec<String> = navigation(&curr, g);
+            let mut idx = _navigation_nodes.len() as i32;
+            while idx >= 0 {
+                stack.push(String::from(_navigation_nodes.get(idx as usize).unwrap()));
+                idx -= 1;
+            }
+        }
+    }
+}
@@ -0,0 +1,3 @@
+pub mod dfs;
+pub mod postorder;
+pub mod preorder;
@@ -0,0 +1,14 @@
+use crate::algo::dfs::dfs;
+use crate::Graph;
+use std::fmt::Debug;
+
+// TODO: need to check if exceptions are required
+pub fn postorder<GL: Default, N: Default + Clone + Debug, E: Default + Clone + Debug>(
+    g: &mut Graph<GL, N, E>,
+    vs: &Vec<String>,
+) -> Vec<String> {
+    return match dfs(g, vs, "post") {
+        Ok(t) => t,
+        _ => vec![],
+    };
+}
@@ -0,0 +1,14 @@
+use crate::algo::dfs::dfs;
+use crate::Graph;
+use std::fmt::Debug;
+
+// TODO: need to check if exceptions are required
+pub fn preorder<GL: Default, N: Default + Clone + Debug, E: Default + Clone + Debug>(
+    g: &mut Graph<GL, N, E>,
+    vs: &Vec<String>,
+) -> Vec<String> {
+    return match dfs(g, vs, "pre") {
+        Ok(t) => t,
+        _ => vec![],
+    };
+}