"""Provisional scorer for user-supplied revised EEG-sAAD criteria.

H uses max(0,2*accuracy-1). Switch search stops before the next switch in the
same trial, as well as at 100s or trial end. Sustain is also limited to that
trial/next-switch interval. The organizer's full updated page was unavailable
(bot challenge); verify edge semantics with the official scorer before release.
Legacy scorer is intentionally untouched so earlier results remain reproducible.
"""
import numpy as np
from numba import njit

@njit(cache=True)
def latency_core(pred,gt,sw,fs,nsearch,nsustain,t_end):
 out=np.empty(len(sw),dtype=np.float64)
 for k in range(len(sw)):
  i0=sw[k];old=gt[i0-1];new=gt[i0]
  stop=t_end[i0]
  if k+1<len(sw) and sw[k+1]<=stop:stop=sw[k+1]-1
  hi=min(stop,i0+nsearch);n=hi-i0+1
  if n<=0:out[k]=np.inf;continue
  prefix=np.zeros(n+1,np.int64);suffix=np.zeros(n+1,np.int64)
  for j in range(n):prefix[j+1]=prefix[j]+(1 if pred[i0+j]==old else 0)
  for j in range(n-1,-1,-1):suffix[j]=suffix[j+1]+(1 if pred[i0+j]==new else 0)
  scores=prefix[:n]+suffix[:n];best=np.empty(n,np.int64);best[n-1]=n-1
  for j in range(n-2,-1,-1):best[j]=j if scores[j]>=scores[best[j+1]] else best[j+1]
  # Sustain may extend past the 100s search endpoint, but cannot cross
  # the trial boundary or the following true switch.
  ext_hi=min(stop,hi+nsustain-1);m=ext_hi-i0+1;run=np.zeros(m+1,np.int64)
  for j in range(m-1,-1,-1):
   if pred[i0+j]==new:run[j]=run[j+1]+1
  tau=-1;lower=0
  while lower<n:
   cand=best[lower]
   if cand+nsustain<=m and run[cand]>=nsustain:
    tau=cand;break
   lower=cand+1
  out[k]=np.inf if tau<0 else tau/fs
 return out

def fast_score_subject(pred,gt,trial,fs=128,searchWindow=100.,tSustain=.5,tau0=60.):
 pred=np.asarray(pred,float);gt=np.asarray(gt,float);trial=np.asarray(trial)
 if len(pred)!=len(gt) or len(gt)!=len(trial):raise ValueError('length mismatch')
 acc=float(np.mean(pred==gt)*100)
 change=np.r_[False,np.diff(gt)!=0];boundary=np.r_[False,np.diff(trial)!=0]
 sw=np.flatnonzero(change & ~boundary).astype(np.int64)
 if not len(sw):return dict(acc=acc,sdt=np.nan,L=np.nan,nSwitches=0,nUndetected=0,sdtPerSwitch=np.zeros(0),ellPerSwitch=np.zeros(0),nOverlap=0)
 edges=np.r_[0,np.flatnonzero(np.diff(trial)!=0)+1,len(trial)];ends=np.empty(len(trial),np.int64)
 for b in range(len(edges)-1):ends[edges[b]:edges[b+1]]=edges[b+1]-1
 sdt=latency_core(pred,gt,sw,float(fs),int(np.floor(searchWindow*fs+.5)),max(1,int(np.floor(tSustain*fs+.5))),ends)
 ell=np.exp(-sdt/tau0)
 return dict(acc=acc,sdt=float(np.median(sdt)),L=float(np.median(ell)),nSwitches=len(sw),nUndetected=int(np.isinf(sdt).sum()),sdtPerSwitch=sdt,ellPerSwitch=ell,nOverlap=0)

def aggregate(per_subject):
 acc=np.array([p['acc'] for p in per_subject],float);L=np.array([p['L'] for p in per_subject],float);sdt=np.array([p['sdt'] for p in per_subject],float)
 A=float(np.nanmean(acc)) if np.any(np.isfinite(acc)) else np.nan
 lm=float(np.nanmean(L)) if np.any(np.isfinite(L)) else np.nan
 sd=float(np.nanmedian(sdt)) if np.any(~np.isnan(sdt)) else np.nan
 kappa=max(0.,2.*A/100.-1.) if np.isfinite(A) else np.nan
 H=0. if kappa==0. and np.isfinite(lm) else (2.*kappa*lm/(kappa+lm) if kappa+lm>0 else np.nan)
 return dict(Acc=A,Kappa=kappa,L=lm,SDT=sd,H=H,nSaturated=int(np.sum(np.isinf(sdt))),nSwitches=int(sum(p['nSwitches'] for p in per_subject)),nUndetected=int(sum(p['nUndetected'] for p in per_subject)))

def weighted_accuracy_by_samples(accuracies, sample_counts):
 """Combine set-level raw accuracies (fractions) using test sample counts.

 This helper does not define how L is pooled; that needs the full updated
 organizer specification. It must not be applied as equal-dataset LODO H.
 """
 a=np.asarray(accuracies,dtype=float);n=np.asarray(sample_counts,dtype=float)
 if a.ndim!=1 or a.shape!=n.shape or not len(a):raise ValueError('invalid test set arrays')
 if not np.isfinite(a).all() or np.any((a<0)|(a>1)) or not np.isfinite(n).all() or np.any(n<=0):raise ValueError('invalid accuracy or sample count')
 return float(np.average(a,weights=n))
