We now build against core commmit
6fa14a8d87b625cf90204a79a415e85c87acc465 (0.0.0.r1468.g6fa14a8d8) [1].

This is a commit after new normalization was adopted. Not *that* much
of the API was broken. Notable changes are that core now returns
core::type_details instead of a std::string. Also the
std::__cxx11::basic_string types are gone and replaced with a simple
std::string.

[1] automata-library@6fa14a8d

npm ci and cache should be used in tests too, not exclusively in build.

Fixes: 8f5dfcce

The parser was unable to deal with nested parentheses in names.

Closes: #48

Martin Prokopič authored 3 years ago and Tomáš Pecka committed 3 years ago

Call to search fails, because it expects a valid RegExp, but /)/ isn't one.

Hana Litavská authored 3 years ago and Tomáš Pecka committed 3 years ago

Closes: algorithms-library-toolkit/webui-client#52

Hana Litavská authored 3 years ago and Tomáš Pecka committed 3 years ago

Closes: #52

Hana Litavská authored 3 years ago and Tomáš Pecka committed 3 years ago

Refactor code duplications.
Closes: #73

Hana Litavská authored 3 years ago and Tomáš Pecka committed 3 years ago

Height resizing is newly based on number of input parameters, it fixes issue with size of the boxes that have more input parameters. Text in the box is now centered in the middle, it doesn't use alignments but calculates the position.
Closes: algorithms-library-toolkit/webui-client#73

Hana Litavská authored 3 years ago and Tomáš Pecka committed 3 years ago

Closes: #57

Hana Litavská authored 3 years ago and Tomáš Pecka committed 3 years ago

Add node resizing from useNodeTextSize to useTextSize hook
Closes: #56

Hana Litavská authored 3 years ago and Tomáš Pecka committed 3 years ago

Added height resizing for the nodes. Name of the algorithm is visualized in the middle of the box and templated parameters under the name.
Closes: #56

Hana Litavská authored 3 years ago and Tomáš Pecka committed 3 years ago

Closes: #56

The withRoot method is used in real code so we should test it.

There were some files testing evaluation of some input nodes but not all
of them. This patch merges the files in one and adds the remaining input
nodes.

Test whether all pairs of nodes that depends on each other are evaluated
in correct order instead of comparing that topsort algorithm returned an
exact list. This approach can fail when the implementation changes.

It's moving just a shared_ptr, but the move constructor for
std::shared_ptr is defined [1] so let's use it.

[1] https://en.cppreference.com/w/cpp/memory/shared_ptr/shared_ptr

Throughout the worker I have seen several places where a magic
map<string, shared_ptr<AbstractNode>> was appearing. This represented
the Algorithm Graph. Let's encapsulate it inside AlgorithmGraph class
that can also evaluate it.

I don't think we need any NodeBuilder factories and interfaces. We are
neither building any hierarchy tree of the Builders nor we need the
interface for mocking or something like that. At least not now.