mirror of
https://github.com/priyanshujain/sanderling.git
synced 2026-10-02 11:07:10 +00:00
* feat(ltl): add Now/Next/Eventually/Implies/Or/And/Not formulas Replace the fold-with-latch evaluator with a residual-formula reducer. Each Observe() instantiates a fresh obligation from the root (stripping an outer Always), reduces each pending obligation against current state, latches Violated on first failure, and surfaces Pending verdicts for deferred obligations. Existing Always/Pure/Thunk tests continue to pass. * feat(ltl): support relative duration for eventually().within() * feat(proto): add Swipe, PressKey, RecentLogs RPCs * feat(verifier,runner): formula handles, new action kinds, rich state - verifier: add formula-spec registry; bindNow/bindNext/bindEventually with chainable .implies/.or/.and/.not and .within(n,unit) on eventually; bindFrom for uniform sampling. bindAlways keeps accepting plain predicates. - verifier: store lastTree, lastAction, step time, logs, exceptions on the Verifier; SnapshotInput replaces the (snapshots, tree) pair. stateObject now produces state.lastAction/time/logs/exceptions matching the TS State type. - verifier: make taps/swipes/waitOnce/pressKey built-in generators actually fire; taps picks a clickable, enabled element from the last hierarchy. - agent: add exceptions field to Message wire format. - driver: add Swipe/PressKey/RecentLogs to Driver interface; wire maestro client and mock driver. LogEntry exposed for runner consumption. - runner: apply Swipe/PressKey/Wait actions; collect logcat and exceptions; pass lastAction and step time into PushSnapshot. * feat(spec-api): LTL operators, new actions, richer State - ltl.ts exports now/next/eventually; always overload accepts a Formula - types.ts: Formula gains implies/or/and/not; EventuallyFormula adds .within; State gains lastAction/time/logs/exceptions; Swipe/PressKey/Wait action types - actions.ts: Swipe/PressKey/Wait/from constructors; waitOnce + pressKey default generators - tests exercise the chaining, sampling, and new actions through a recorded fake runtime * feat(sidecar): add swipe, pressKey, recentLogs RPC handlers * feat(sdk-android): capture uncaught exceptions Install a default uncaught handler on Uatu.start, chained with any existing handler so Android's crash reporter still runs. Expose Uatu.reportError for callers to forward caught throwables. A bounded circular buffer (default 50) drains into each STATE message's new exceptions field. Protocol.kt serializes/deserializes the field, matching the Go wire format added to internal/agent/protocol.go. * feat(spec-api): add @uatu/spec/defaults/properties bundle * feat(sample-app): exercise new LTL operators + defaults spec.ts now imports eventually/next/now/from from @uatu/spec and noUncaughtExceptions from @uatu/spec/defaults/properties. It declares three properties that exercise the new surface: - accountCountNonNegative: plain always() safety - addAccountAdvances: always(now(x).implies(next(y))) - eventuallyLoggedIn: eventually(p).within(30, "seconds") - noUncaughtExceptions: imported default The weighted actions root uses from() for random phone/name sampling and entries for taps/swipes/waitOnce/pressKey built-ins. SampleApplication gains a debug hook gated on the system property uatu.inject_error so the e2e run can synthesize an Uatu.reportError and verify noUncaughtExceptions violates. cmd/uatu/test_run.go adds a subpath alias so specs importing "@uatu/spec/defaults/properties" resolve against the in-tree source when running from the uatu checkout. The spec-integration tests swap the old click-counter fixtures for the new login hierarchy. * feat(trace): record swipe/key/wait details + exceptions trace.Step gains an Exceptions array so the trace captures the class/message/stackTrace for each SDK-reported throwable in a step. trace.Action gains FromX/FromY/ToX/ToY/Key/DurationMillis so the full payload of Swipe/PressKey/Wait actions is visible in trace.jsonl. sample-app's debug error hook now gates on ApplicationInfo.DEBUGGABLE instead of a system property (adb setprop fails on non-rooted emulators).
125 lines
3.3 KiB
Go
125 lines
3.3 KiB
Go
package ltl
|
|
|
|
import (
|
|
"strings"
|
|
"testing"
|
|
"time"
|
|
)
|
|
|
|
func observe(formula Formula, count int) []Verdict {
|
|
evaluator := NewEvaluator(formula)
|
|
verdicts := make([]Verdict, 0, count)
|
|
for range count {
|
|
verdicts = append(verdicts, evaluator.Observe())
|
|
}
|
|
return verdicts
|
|
}
|
|
|
|
func TestPure_HoldsThenStays(t *testing.T) {
|
|
got := observe(Always(Pure(true)), 3)
|
|
for index, verdict := range got {
|
|
if verdict != VerdictHolds {
|
|
t.Errorf("step %d: got %v, want holds", index, verdict)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestPure_FalseImmediatelyViolates(t *testing.T) {
|
|
got := observe(Always(Pure(false)), 3)
|
|
for index, verdict := range got {
|
|
if verdict != VerdictViolated {
|
|
t.Errorf("step %d: got %v, want violated", index, verdict)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestThunk_TransitionFromHoldToViolate(t *testing.T) {
|
|
values := []bool{true, true, false, true, true}
|
|
step := 0
|
|
evaluator := NewEvaluator(Always(Thunk(func() bool {
|
|
current := values[step]
|
|
step++
|
|
return current
|
|
})))
|
|
|
|
wantSequence := []Verdict{
|
|
VerdictHolds, // true
|
|
VerdictHolds, // true
|
|
VerdictViolated, // false — latches
|
|
VerdictViolated, // true after violation — still violated
|
|
VerdictViolated, // true after violation — still violated
|
|
}
|
|
for index, want := range wantSequence {
|
|
got := evaluator.Observe()
|
|
if got != want {
|
|
t.Errorf("step %d: got %v, want %v", index, got, want)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestEvaluator_StickinessAfterViolation(t *testing.T) {
|
|
state := true
|
|
evaluator := NewEvaluator(Always(Thunk(func() bool { return state })))
|
|
|
|
if got := evaluator.Observe(); got != VerdictHolds {
|
|
t.Fatalf("step 1: got %v, want holds", got)
|
|
}
|
|
state = false
|
|
if got := evaluator.Observe(); got != VerdictViolated {
|
|
t.Fatalf("step 2: got %v, want violated", got)
|
|
}
|
|
state = true
|
|
if got := evaluator.Observe(); got != VerdictViolated {
|
|
t.Fatalf("step 3 (recovered state): violation should latch, got %v", got)
|
|
}
|
|
}
|
|
|
|
func TestEvaluator_TopLevelPureCountedAtEachStep(t *testing.T) {
|
|
got := observe(Pure(true), 2)
|
|
if got[0] != VerdictHolds || got[1] != VerdictHolds {
|
|
t.Errorf("bare Pure(true): %v", got)
|
|
}
|
|
}
|
|
|
|
func TestEvaluator_TopLevelThunkRespectsObservation(t *testing.T) {
|
|
state := true
|
|
evaluator := NewEvaluator(Thunk(func() bool { return state }))
|
|
if got := evaluator.Observe(); got != VerdictHolds {
|
|
t.Errorf("expected holds, got %v", got)
|
|
}
|
|
state = false
|
|
if got := evaluator.Observe(); got != VerdictViolated {
|
|
t.Errorf("expected violated, got %v", got)
|
|
}
|
|
}
|
|
|
|
func TestVerdict_String(t *testing.T) {
|
|
if VerdictHolds.String() != "holds" {
|
|
t.Errorf("VerdictHolds.String() = %q", VerdictHolds.String())
|
|
}
|
|
if VerdictViolated.String() != "violated" {
|
|
t.Errorf("VerdictViolated.String() = %q", VerdictViolated.String())
|
|
}
|
|
}
|
|
|
|
func TestDescribe(t *testing.T) {
|
|
formula := Always(Pure(true))
|
|
if got := Describe(formula); !strings.Contains(got, "Always") || !strings.Contains(got, "Pure(true)") {
|
|
t.Errorf("Describe wrong: %q", got)
|
|
}
|
|
thunk := Always(Thunk(func() bool { return true }))
|
|
if got := Describe(thunk); !strings.Contains(got, "Thunk") {
|
|
t.Errorf("Describe(thunk) wrong: %q", got)
|
|
}
|
|
}
|
|
|
|
func TestObserve_PanicsOnUnknownFormulaType(t *testing.T) {
|
|
type unsupportedFormula struct{ Formula }
|
|
defer func() {
|
|
if recovered := recover(); recovered == nil {
|
|
t.Errorf("expected panic on unsupported formula type")
|
|
}
|
|
}()
|
|
reduce(unsupportedFormula{}, time.Now())
|
|
}
|