kami
6c92f85d10
Bring the Nexus/Praxis/Hexis integration in line with MAVEN_ECOSYSTEM_ARCHITECTURE.md: - Praxis over HTTP: drop the in-process praxis.db open (praxisstore/ praxistools) and call praxisd's /api/v1/tools/* API via a new praxisClient. Honors the "no component reads another's DB" invariant (AC#12). PraxisConfig.DBPath -> URL. - Hexis confirmation gate: mutating capabilities (ReadOnly=false) now park a bound pendingHexis confirmation and require a spoken "да" before executing; read-only run immediately (AC#7, no auto attention->action). - Capability safety: >1 verb match is ambiguous -> ask instead of firing the first; ambiguous Nexus resolution asks for clarification (AC#2). - Correlation IDs on Hexis execute, recorded in the cross-service trace. - Bug: importance arrives as JSON float64 over HTTP, not int. - Tests: confirm-gate, decline, read-only, and ambiguity paths. Build: vendor/ bakes in the hexis client (replace-directed at a sibling repo outside the Docker context); Dockerfile builds from vendor and no longer `go mod download`s the unreachable replace paths. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
40 lines
1009 B
Go
40 lines
1009 B
Go
// Copyright (c) 2014 The mathutil Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package mathutil // import "modernc.org/mathutil"
|
|
|
|
import (
|
|
"sort"
|
|
)
|
|
|
|
// PermutationFirst generates the first permutation of data.
|
|
func PermutationFirst(data sort.Interface) {
|
|
sort.Sort(data)
|
|
}
|
|
|
|
// PermutationNext generates the next permutation of data if possible and
|
|
// return true. Return false if there is no more permutation left. Based on
|
|
// the algorithm described here:
|
|
// http://en.wikipedia.org/wiki/Permutation#Generation_in_lexicographic_order
|
|
func PermutationNext(data sort.Interface) bool {
|
|
var k, l int
|
|
for k = data.Len() - 2; ; k-- { // 1.
|
|
if k < 0 {
|
|
return false
|
|
}
|
|
|
|
if data.Less(k, k+1) {
|
|
break
|
|
}
|
|
}
|
|
for l = data.Len() - 1; !data.Less(k, l); l-- { // 2.
|
|
}
|
|
data.Swap(k, l) // 3.
|
|
for i, j := k+1, data.Len()-1; i < j; i++ { // 4.
|
|
data.Swap(i, j)
|
|
j--
|
|
}
|
|
return true
|
|
}
|