This is ttv1 code (Timm tools, version 1).
home | discuss | report bug
Run some some experiments, setting some globals, the un-doing those changes once the experiment fails.
Example:
class silly:
X=1
Y=min
class solly:
Z=22
B="love"
def f1():
return 3>1
# begin experiments
for _ in rx(solly, Z=[20,30], B=["love","hate"]):
for _ in rx( silly, X=[2,3], Y=[max,f1]):
# insert your experiment here
assert silly.X != 1
assert solly.Z != 22
# afterwards, we are back to the old values.
assert silly.X == 1
assert solly.Z == 22
In the following, klass
is some with attributes k.v1,k.v2,..
etc
which we want to (temporarily) set
to something else (and the something else comes from
the values in the dictionary **d
).
Note that the
values in d
can be lists or a single items
import itertools,sys,random
def rx(klass,**d):
lst = [[(k,v) for v in
Ensure k's value is something we can iterate over.
(vs if type(vs)==list else [vs])]
for k,vs in d.items()]
Generate all combinations.
combos = list( itertools.product(*lst) )
Run over the combinations.
for settings in combos:
now = {k:v for k,v in settings}
Cache the old settings.
saved = {k:getattr(klass,k) for k in now}
Impose the temp settings.
for k in now:
setattr(klass,k,now[k])
Let something do something with the temp settings.
yield now
Reset to old.
for k in saved:
setattr(klass,k,saved[k])
def rx1(lst):
d = {key:val for d in lst for key,val in d.items()}
tmp = []
for k,v in d.items():
i = 1
key = k[:i]
while key in tmp and len(key) < len(k):
i += 1
key = k[:i]
if v==True : v="1"
elif v==False : v="0"
elif type(v)==float: v= "%g" % v
elif type(v)==int : v=v
elif v.__class__.__name__ == 'function': v=v.__name__
tmp += ["%s%s" % (key,v)]
return ':'.join(tmp)
def say(*lst):
print(*lst, sep=' ', end='', file=sys.stdout, flush=True)
def watch(src,seed=1,every=10,klass="__all__",repeats=20):
random.seed(seed)
n = 0
for _ in range(repeats):
for one in src(klass):
n += 1
if (n % every) == 0 : say("",n)
yield one
def dominates(pop,objs=None,betters=None):
betters = betters or [min for _ in pop[0]]
if objs==None:
objs= lambda z: z[1:]
doms={}
for i,one in enumerate( pop):
doms[i] = 0
for i,xs in enumerate(pop):
for j,ys in enumerate(pop):
if cdom1(objs(xs),objs(ys),betters):
doms[i] += 1
return sorted([( doms[i] ,xs) for i,xs in enumerate(pop)],reverse=True)
def cdom1(x, y, betters):
"many objective"
def w(better):
return -1 if better == min else 1
def expLoss(w,x1,y1,n):
return -1*2.71828**( w*(x1 - y1) / n )
Copyright © 2016,2017 Tim Menzies tim@menzies.us, MIT license v2.
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Share and enjoy.