intermediate commit to checkout something else
This commit is contained in:
parent
dd53c7554b
commit
59fcd6a26c
|
@ -9,12 +9,14 @@ describe("Mean", () => {
|
||||||
betaMake(2e0, 4e0),
|
betaMake(2e0, 4e0),
|
||||||
exponentialMake(1.234e0),
|
exponentialMake(1.234e0),
|
||||||
uniformMake(7e0, 1e1),
|
uniformMake(7e0, 1e1),
|
||||||
cauchyMake(1e0, 1e0),
|
// cauchyMake(1e0, 1e0),
|
||||||
lognormalMake(1e0, 1e0),
|
lognormalMake(1e0, 1e0),
|
||||||
triangularMake(1e0, 1e1, 5e1),
|
triangularMake(1e0, 1e1, 5e1),
|
||||||
floatMake(1e1)
|
floatMake(1e1)
|
||||||
}
|
}
|
||||||
test("addition", () => {
|
let digits = 7
|
||||||
|
|
||||||
|
testAll("addition", () => {
|
||||||
true -> expect -> toBe(true)
|
true -> expect -> toBe(true)
|
||||||
})
|
})
|
||||||
})
|
})
|
|
@ -24,7 +24,6 @@ let toExtDist: option<DistributionTypes.genericDist> => DistributionTypes.generi
|
||||||
let unpackFloat = x => x -> toFloat -> toExtFloat
|
let unpackFloat = x => x -> toFloat -> toExtFloat
|
||||||
let unpackDist = y => y -> toDist -> toExtDist
|
let unpackDist = y => y -> toDist -> toExtDist
|
||||||
|
|
||||||
// TODO: use Normal.make (etc.), but preferably after the new validation dispatch is in.
|
|
||||||
let mkNormal = (mean, stdev) => DistributionTypes.Symbolic(#Normal({mean: mean, stdev: stdev}))
|
let mkNormal = (mean, stdev) => DistributionTypes.Symbolic(#Normal({mean: mean, stdev: stdev}))
|
||||||
let mkBeta = (alpha, beta) => DistributionTypes.Symbolic(#Beta({alpha: alpha, beta: beta}))
|
let mkBeta = (alpha, beta) => DistributionTypes.Symbolic(#Beta({alpha: alpha, beta: beta}))
|
||||||
let mkExponential = rate => DistributionTypes.Symbolic(#Exponential({rate: rate}))
|
let mkExponential = rate => DistributionTypes.Symbolic(#Exponential({rate: rate}))
|
||||||
|
|
|
@ -260,11 +260,22 @@ module L = {
|
||||||
let update = Rationale.RList.update
|
let update = Rationale.RList.update
|
||||||
let iter = List.iter
|
let iter = List.iter
|
||||||
let findIndex = Rationale.RList.findIndex
|
let findIndex = Rationale.RList.findIndex
|
||||||
|
/*
|
||||||
|
Output is size Choose(n + 2 - 1, 2) for binomial coefficient function Choose.
|
||||||
|
inspired by https://docs.python.org/3/library/itertools.html#itertools.combinations_with_replacement at r=2
|
||||||
|
*/
|
||||||
let completeGraph = xs => {
|
let completeGraph = xs => {
|
||||||
// TODO
|
// TODO
|
||||||
|
let rec loop = (x', xs') => {
|
||||||
|
let intermediate = fmap(y => append(y, list{x'}))
|
||||||
|
// map (y => append(y, list{x'})) xs'
|
||||||
|
}
|
||||||
|
|
||||||
|
let intermediate = fmap()
|
||||||
let n = length(xs)
|
let n = length(xs)
|
||||||
let result = n
|
|
||||||
n
|
let indices = list{0, 0}
|
||||||
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user