def test_treeInputs():
random.seed(42)
vals = [[random.randint(23, 345) for _ in range(10)] for _ in range(10)]
rvals = pgf.var_int()
rsum = pgf.treeSum(rvals)
expected = sum([sum(v) for v in vals])
pgf.assign(rvals, vals)
assert tu.equal(expected, pgf.read(rsum))
def listItemGenericTest(vals, pgvarfn, comparefn):
rvals = pgvarfn(vals)
rindex = pgf.var_int()
result = pgf.listItem(rvals, rindex)
random.seed(42)
for _ in range(25):
index = random.randint(0, len(vals) - 1)
pgf.assign(rindex, index)
assert comparefn(vals[index], pgf.read(result))
def test_itemListMapping():
random.seed(42)
singleval = 42
single = pgf.var_int(singleval)
lst = pgf.var_int()
out = pgf.add(single, lst)
for _ in range(10):
vals = list(range(12))
random.shuffle(vals)
expected = [singleval + v for v in vals]
pgf.assign(lst, vals)
assert tu.equal(expected, pgf.read(out))
def test_distance2():
p1 = pgf.var_vec2()
p2 = pgf.var_vec2()
dist = pgf.distance(p1, p2)
for _ in range(20):
val1 = (random.uniform(1.2, 12.5), random.uniform(2.5, 15.6))
val2 = (random.uniform(1.26, 22.5), random.uniform(1.5, 13.9))
dval = math.sqrt(
math.pow(val1[0] - val2[0], 2.) + math.pow(val1[1] - val2[1], 2.))
pgf.assign(p1, val1)
pgf.assign(p2, val2)
assert tu.equalf(pgf.read(dist), dval)
def test_flatten():
random.seed(42)
intree = pgf.var_int()
outtree = pgf.flatten(intree)
for _ in range(5):
vals = [[random.randint(23, 234)] for __ in range(10)]
pgf.assign(intree, vals)
expected = [item for subl in vals for item in subl]
assert tu.equal(expected, pgf.read(outtree))
vals = [[[random.randint(23, 234) for __ in range(5)]
for ___ in range(5)] for _____ in range(5)]
pgf.assign(intree, vals)
expected = [item for l0 in vals for l1 in l0 for item in l1]
assert tu.equal(expected, pgf.read(outtree))
def test_sort():
random.seed(42)
rvals = pgf.var_int()
rkeys = pgf.var_int()
rsorted = pgf.sort(rvals, rkeys)
lvals = []
lkeys = []
for _ in range(10):
nItems = random.randint(75, 155)
vals = list(range(nItems))
keys = list(range(nItems))
random.shuffle(vals)
random.shuffle(keys)
lvals.append(vals)
lkeys.append(keys)
expected = [
x for x, _ in sorted(zip(vals, keys), key=lambda pair: pair[1])
]
pgf.assign(rvals, vals)
pgf.assign(rkeys, keys)
assert tu.equal(expected, pgf.read(rsorted))
# Test the same with tree combinatorics.
expected = [[x for x, _ in sorted(zip(v, k), key=lambda pair: pair[1])]
for v, k in zip(lvals, lkeys)]
pgf.assign(rvals, lvals)
pgf.assign(rkeys, lkeys)
assert tu.equal(expected, pgf.read(rsorted))
def unaryFloatOpTest(expFn, pgfn, minval=0., maxval=9.):
random.seed(42)
x = pgf.var_float()
s = pgfn(x)
for _ in range(20):
vx = random.uniform(minval, maxval)
expected = expFn(vx)
pgf.assign(x, vx)
tu.assertEqualf(expected, pgf.read(s), 1e-3)
vxs = [random.uniform(minval, maxval) for _ in range(20)]
expectedvals = [expFn(v) for v in vxs]
pgf.assign(x, vxs)
tu.assertEqualf(expectedvals, pgf.read(s), 1e-3)
def test_graft():
random.seed(42)
intree = pgf.var_int()
out = pgf.graft(intree)
for _ in range(5):
vals = [random.randint(23, 345) for __ in range(10)]
expected = [[v] for v in vals]
pgf.assign(intree, vals)
assert tu.equal(expected, pgf.read(out))
for _ in range(5):
vals = [[random.randint(23, 345) for __ in range(5)]
for ___ in range(5)]
expected = [[[v] for v in vl] for vl in vals]
pgf.assign(intree, vals)
assert tu.equal(expected, pgf.read(out))
def test_combinations():
random.seed(42)
valrange = (23, 345)
rvals = pgf.var_int()
rnumc = pgf.var_int()
rcombs = pgf.combinations(rvals, rnumc)
for _ in range(5):
nItems = random.randint(23, 29)
numc = random.randint(3, 5)
vals = [
random.randint(valrange[0], valrange[1]) for _ in range(nItems)
]
combs = list(itertools.combinations(vals, numc))
pgf.assign(rvals, vals)
pgf.assign(rnumc, numc)
assert tu.equal(combs, pgf.read(rcombs))
def test_meshBounds():
assetFiles = ["bunny_large.obj", "bunny.obj"]
fpaths = pgf.var_string("")
pgf.assign(fpaths, [tu.assetPath(a) for a in assetFiles])
meshes = pgf.loadObjFile(fpaths)
bounds = pgf.bounds(meshes)
pmins, pmaxs = pgf.boxPoints(bounds)
vpmins = pgf.read(pmins)
vpmaxs = pgf.read(pmaxs)
assert tu.equalf(
vpmins,
[[-1.8937978744506836, -1.1759940385818481, -0.3402520418167114],
[-0.09438041597604752, -0.058714643120765686, 0.033309899270534515]])
assert tu.equalf(
vpmaxs,
[[1.2201818227767944, 1.2374719381332397, 2.746419906616211],
[0.060778796672821045, 0.061679162085056305, 0.18699601292610168]])
def test_dispatch():
random.seed(42)
valrange = (23, 345)
rvals = pgf.var_int()
rpattern = pgf.var_bool()
rtvals, rfvals = pgf.dispatch(rvals, rpattern)
for _ in range(20):
nItems = 25
vals = [
random.randint(valrange[0], valrange[1]) for _ in range(nItems)
]
pattern = [
random.randint(valrange[0], valrange[1]) % 2 == 0
for _ in range(nItems)
]
tvals = [v for v, p in zip(vals, pattern) if p]
fvals = [v for v, p in zip(vals, pattern) if not p]
pgf.assign(rvals, vals)
pgf.assign(rpattern, pattern)
assert tu.equal(tvals, pgf.read(rtvals))
assert tu.equal(fvals, pgf.read(rfvals))
def binaryFloatOpTest(expFn, pgfn, minval=2., maxval=124.5):
random.seed(42)
a = pgf.var_float()
b = pgf.var_float()
r = pgfn(a, b)
for _ in range(20):
va = random.uniform(minval, maxval)
vb = random.uniform(minval, maxval)
expected = expFn(va, vb)
pgf.assign(a, va)
pgf.assign(b, vb)
assert tu.equalf(expected, pgf.read(r), 1e-3)
vas = [random.uniform(minval, maxval) for _ in range(20)]
vbs = [random.uniform(minval, maxval) for _ in range(20)]
expectedVals = [expFn(va, vb) for va, vb in zip(vas, vbs)]
pgf.assign(a, vas)
pgf.assign(b, vbs)
assert tu.equalf(expectedVals, pgf.read(r), 1e-3)
def binaryIntOpTest(expFn, pgfn, minval=2, maxval=124):
random.seed(42)
a = pgf.var_int()
b = pgf.var_int()
r = pgfn(a, b)
for _ in range(20):
va = random.randint(minval, maxval)
vb = random.randint(minval, maxval)
expected = expFn(va, vb)
pgf.assign(a, va)
pgf.assign(b, vb)
assert tu.equal(expected, pgf.read(r))
vas = [random.randint(minval, maxval) for _ in range(20)]
vbs = [random.randint(minval, maxval) for _ in range(20)]
expectedVals = [expFn(va, vb) for va, vb in zip(vas, vbs)]
pgf.assign(a, vas)
pgf.assign(b, vbs)
assert tu.equal(expectedVals, pgf.read(r))
def test_listLength():
random.seed(42)
valrange = (23, 345)
rvals = pgf.var_int()
rstart = pgf.var_int()
rstop = pgf.var_int()
slist = pgf.subList(rvals, rstart, rstop)
for _ in range(20):
vals = [random.randint(valrange[0], valrange[1]) for _ in range(25)]
irange = (random.randint(0,
len(vals) - 1),
random.randint(0,
len(vals) - 1))
irange = sorted(irange)
expected = vals[irange[0]:irange[1]]
# print(len(vals), irange[0], irange[1])
pgf.assign(rvals, vals)
pgf.assign(rstart, irange[0])
pgf.assign(rstop, irange[1])
tu.assertEqual(expected, pgf.read(slist))