cswap-bend-cli

Releases (1)

• 0.1.0.0 indexed

Definitions (4,210)

policy/decide.bend

• def sw.pickThe pick for one ranking context, as a decision: the target, or `next`.
• def choose.retryRank with the bar; if that leaves nothing and the barred account has recovered, rank again without it.
• def env.active
• def env.as
• def env.cfg
• def trig.is_cf
• def env.now
• def env.st
• def env.us
• def env.mem
• def trig.of
• def env.ahThe active account's headroom, as this tick reads it.
• def decide.noneNo OAuth candidate qualified: last-resort API-key account, else say why.
• def rank.bar
• def rank.go
• def cands.none
• def cands.cfA healthy consume-first account with no OAuth peer to compare against is below the threshold, exactly as under `best`.
• def decide.cands
• def cool.go
• def decide.trigCooldown bounds proactive and consume-first switches; at-limit and failover ignore it.
• def fail.count
• def failover.go
• def idle.go
• def unknown.go
• def below.go
• def util.go
• def decide.known
• def decide.run
• def apikey.go
• def decide.kind
• def decide.acct
• def decideOne autoswitch tick.

policy/exhaust.bend

• type BrHow an account is blocked: not at all, at 100 % with no known reset, or until the latest reset among its windows at 100 %.
• type Er
• def readable.at
• def readable.acctThe trusted headroom of a candidate, backoff or not.
• def is_some
• def any_knownSome candidate has a trusted reading.
• def exhausted.known
• def exhausted.at
• def all_exhaustedEvery OAuth candidate is readable and at its limit.
• def any_cand
• def any_api
• def api.firstThe first last-resort API-key candidate, in sequence order.
• def br.upd
• def br.if
• def br.win
• def br.fresh
• def br.row
• def er.min
• def er.at
• def er.step
• def er.out
• def earliestEarliest moment any blocked account (the live one included) is usable again; None when it cannot be proven.

policy/pick.bend

• type FamThe family a candidate is judged in: weekly reset (consume-first), the recovery tiers (back soon, back late, one-way fallback).
• type RHA candidate's ranking time (reset or recovery; None is inf) and headroom.
• type PmA pick before it is tagged with its ranking mode: nothing, or a slot with the key it won on.
• type PkThe tagged pick.
• type RkEverything the pickers read: the trigger, whether the strategy is consume-first, whether this is recovery mode, the active headroom (0 when unknown), the best candidate headroom, the active account's binding recovery and weekly reset, the threshold, and the selection context.
• type MnThe best ranking time so far among the family's candidates.
• def need.ofThe least headroom a target needs: at-limit and failover take any headroom; proactive must land below the threshold and beat the active account by the hysteresis margin.
• def trig.pc
• def strat.cf
• def ah.or0
• def rk.mk
• def rk.bar
• def land.gate
• def reset.sooner
• def reset.gate
• def rh.if
• def by_recoveryIs this candidate ranked by recovery rather than by headroom?
• def cdn.rec0
• def cdn.rec1
• def cdn.fall
• def cdn.reset
• def cdn.fam
• def cdn.at
• def rk.sel
• def cdnA candidate of family f, with its ranking time and headroom.
• def top.step
• def topThe most headroom any candidate offers (0 when there is none).
• def first.hit
• def first.pick
• def firstThe first account (sequence order breaks ties) whose candidate headroom is h.
• def pk.slot
• def pick.head.at
• def pick.head
• def mn.min
• def minr.step
• def minrThe earliest ranking time among the family's candidates.
• def maxh.pick
• def maxh.step
• def maxhThe most headroom among the family's candidates whose time is r0.
• def maxall.step
• def maxallThe most headroom among the family's candidates.
• def minat.pick
• def minat.step
• def minatThe earliest time among the family's candidates with headroom h0.
• def firstrh.hit
• def firstrhThe first account whose key is exactly (r0, h0).