selSide : Border,set : irr(),npv() / idea (2)

[1]pair()で相殺するための事前ルールを示す。
[2]additinal rule is as follows;
_[re general]
__[a]例）c(8)=one(!sosuu); c(8,9)=both(!sosuu);
__[b]例）c(7)=one(sosuu); c(7,11)=both(sosuu);
__[c]diff%=distance between(target.vs.nearest(avg(1)|avg(2) in dataset(a=,aa=)));
______@target=c(q1,q2,q3,q4), @avg(2)=average(2 recs);
______diff%=c(0%, (0 to 6%), (6% to 10%), (10% to 100%)); @as v2(=now selected);
_________diff%=c(0%, (0 to 5%), (5% to 10%), (10% to 100%)); @as v1;
__[d]avg(1)=one(sosuu|!sosuu); avg(2)=c(both(sosuu|!sosuu), c(sosuu,!sosuu));
__[e]nearest(sosuu) is selected by min(distance) between(target.vs.nearest(sosuu));
_____例）c(15,16)->c(17); c(9,10)->c(11); c(8,9)->c(7); c(9)->c(7,11);
__[f]diff%=0% : same(sosuu|!sosuu) is deleted as pair(), at firsrt;
__[g]diff%>10% : delete this; @pair()=valid;

_[re one(sosuu), both(sosuu), c(sosuu,!sosuu)~included sosuu]
__->c(no-operation, left until final) until deleted by pair();
__c(?,diff%)->???(TODO)diff% handling is needed for this case?

_[re both(!sosuu,diff%)]
__both(!sosuu,diff%=0%)->nearest(sosuu=c(one|both));
__both(!sosuu,diff%=(0 to 6%))->nearest(sosuu=c(one|both))?; @(TODO);
__both(!sosuu,diff%=(6 to 10%))->nearest(sosuu=c(one|both))?; @(TODO);

_[re one(!sosuu,diff%)]
__one(!sosuu,diff%=0%)->nearest(sosuu,one-side=upper-side);
______@例)c(4,0%)->c(5); c(6)->c(7); c(10)->c(11);
__one(!sosuu,diff%=(0 to 6%))->(no-operation); @left until final|wait until deleted by pair();
__one(!sosuu,diff%=(6 to 10%))->nearest(sosuu, both-side); @expand...

_[re upper-limit, lower-limit](TODO)
__[a](!selected) max(upper-limit(a=,aa=))<=10 : select=max(); @max()>10 : select=min();
__[b](!selected) upper-limit=valid(aa=); How?
__[c](Selected) init=29 : all-?recで、diff%<10%が全くない場合、min(diff%)をlower-limitとして扱う。
__[d](TODO) init=c(2:29)で、2-sheets(all,sosuu)と中のdataset(a=,aa=)と、c(left, upper-limit)の一覧から 本件をクリアする方向あり。同じ手段で、init=c(0.3 to 1.0, undo=c(0.4,0.6))で、 init=c(0.8)が最適解かを判断できるかも試す。

end.