mirror of
https://github.com/esengine/DeepSeek-Reasonix.git
synced 2026-11-07 10:45:59 -10:00
Bring in the finished Go rewrite (developed under the placeholder name "duo") as the v2 codebase. Code-only import — no upstream git history. Config- and plugin-driven coding agent: registry core, OpenAI-compatible providers, builtin tools, MCP (stdio + HTTP) plugins, permission + sandbox, custom slash commands, @-references, two-model collaboration. Renamed throughout: duo→reasonix, Duo→Reasonix, DUO→REASONIX — module path, imports, CLI name, cmd/ dirs, reasonix.toml, .reasonix/commands, and $REASONIX_* env prefixes. Kept the v2 MIT LICENSE (the Go project had none). Verified: go build ./... · go vet ./... · go test ./... all green; gofmt clean. Co-Authored-By: Claude Opus 4.8 (1M context) <[email protected]>
119 lines
3.8 KiB
Go
119 lines
3.8 KiB
Go
package builtin
|
|
|
|
import (
|
|
"context"
|
|
"encoding/json"
|
|
"fmt"
|
|
"os"
|
|
"strings"
|
|
|
|
"reasonix/internal/tool"
|
|
)
|
|
|
|
func init() { tool.RegisterBuiltin(multiEdit{}) }
|
|
|
|
// multiEdit applies a batch of edits to one file. roots confines the target to
|
|
// the workspace when non-empty (see writeFile).
|
|
type multiEdit struct{ roots []string }
|
|
|
|
// editStep is one edit in a multi_edit operation. Mirrors edit_file's args
|
|
// plus a per-step replace_all toggle so a single call can mix targeted and
|
|
// sweep replacements (e.g. rename a function with replace_all, then patch
|
|
// one specific call site with a unique-match edit).
|
|
type editStep struct {
|
|
OldString string `json:"old_string"`
|
|
NewString string `json:"new_string"`
|
|
ReplaceAll bool `json:"replace_all,omitempty"`
|
|
}
|
|
|
|
func (multiEdit) Name() string { return "multi_edit" }
|
|
|
|
func (multiEdit) Description() string {
|
|
return "Apply a list of edits to a single file atomically: each edit runs against the result of the previous one, all in memory; the file is rewritten only if every edit succeeds. Cheaper and safer than chaining edit_file calls — a failure in step 3 leaves the file untouched instead of half-edited."
|
|
}
|
|
|
|
func (multiEdit) Schema() json.RawMessage {
|
|
return json.RawMessage(`{
|
|
"type":"object",
|
|
"properties":{
|
|
"path":{"type":"string","description":"File path"},
|
|
"edits":{
|
|
"type":"array",
|
|
"minItems":1,
|
|
"description":"Ordered edits. Each step sees the file as left by the previous step.",
|
|
"items":{
|
|
"type":"object",
|
|
"properties":{
|
|
"old_string":{"type":"string","description":"Exact text to find. Without replace_all, must match exactly once."},
|
|
"new_string":{"type":"string","description":"Replacement text (empty deletes)."},
|
|
"replace_all":{"type":"boolean","description":"Replace every occurrence instead of requiring uniqueness."}
|
|
},
|
|
"required":["old_string","new_string"]
|
|
}
|
|
}
|
|
},
|
|
"required":["path","edits"]
|
|
}`)
|
|
}
|
|
|
|
func (multiEdit) ReadOnly() bool { return false }
|
|
|
|
func (m multiEdit) Execute(ctx context.Context, args json.RawMessage) (string, error) {
|
|
var p struct {
|
|
Path string `json:"path"`
|
|
Edits []editStep `json:"edits"`
|
|
}
|
|
if err := json.Unmarshal(args, &p); err != nil {
|
|
return "", fmt.Errorf("invalid args: %w", err)
|
|
}
|
|
if p.Path == "" {
|
|
return "", fmt.Errorf("path is required")
|
|
}
|
|
if len(p.Edits) == 0 {
|
|
return "", fmt.Errorf("edits must not be empty")
|
|
}
|
|
if err := confine(m.roots, p.Path); err != nil {
|
|
return "", err
|
|
}
|
|
|
|
b, err := os.ReadFile(p.Path)
|
|
if err != nil {
|
|
return "", fmt.Errorf("read %s: %w", p.Path, err)
|
|
}
|
|
content := string(b)
|
|
|
|
// Apply edits in order against the running in-memory buffer. Any failure
|
|
// returns before the write, leaving the file untouched — that's the
|
|
// safety guarantee that makes multi_edit preferable to chained
|
|
// edit_file calls.
|
|
applied := 0
|
|
for i, step := range p.Edits {
|
|
if step.OldString == "" {
|
|
return "", fmt.Errorf("edit %d: old_string is required", i+1)
|
|
}
|
|
if step.ReplaceAll {
|
|
count := strings.Count(content, step.OldString)
|
|
if count == 0 {
|
|
return "", fmt.Errorf("edit %d: old_string not found", i+1)
|
|
}
|
|
content = strings.ReplaceAll(content, step.OldString, step.NewString)
|
|
applied += count
|
|
continue
|
|
}
|
|
switch strings.Count(content, step.OldString) {
|
|
case 0:
|
|
return "", fmt.Errorf("edit %d: old_string not found", i+1)
|
|
case 1:
|
|
content = strings.Replace(content, step.OldString, step.NewString, 1)
|
|
applied++
|
|
default:
|
|
return "", fmt.Errorf("edit %d: old_string is not unique; add more surrounding context or set replace_all", i+1)
|
|
}
|
|
}
|
|
|
|
if err := os.WriteFile(p.Path, []byte(content), 0o644); err != nil {
|
|
return "", fmt.Errorf("write %s: %w", p.Path, err)
|
|
}
|
|
return fmt.Sprintf("multi_edit %s: %d edits applied (%d total replacements)", p.Path, len(p.Edits), applied), nil
|
|
}
|