Visualize hierarchical estimates
NunoSempere
74d1f2be23
Details: The findPathsInner function in lib/findPaths.js is too expensive, and has a tendency to throw "too much recursion" errors. However, it can be optimized. In particular, instead of just going through all paths, we could go in the paths in the right direction. Note that: The current improvements don't do that yet. I was trying to do that at the findDistance level, but I was being dumb. |
||
|---|---|---|
| data | ||
| lib | ||
| pages | ||
| public | ||
| styles | ||
| .gitignore | ||
| package-lock.json | ||
| package.json | ||
| postcss.config.js | ||
| README.md | ||
| tailwind.config.js | ||
About
This repository creates a react webpage that allows to extract a utility function from possibly inconsistent binary comparisons
Object structure
The core structure is json array of objects. Only the "name" attribute is required; the (numerical) id is also internally required but it's created on the fly. The reason that ids are needed is that comparing objects is annoying.
The isReferenceValue property determines the display at the end, but it is optional.
So internally this would look like:
[
{
"id": 1,
"name": "Peter Parker",
"someOptionalKey": "...",
"anotherMoreOptionalKey": "...",
"isReferenceValue": true
},
{
"id": 2,
"name": "Spiderman",
"someOptionalKey": "...",
"anotherMoreOptionalKey": "..."
}
]