Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | fix(frontend): completion cache invalidation | Kristóf Marussy | 2023-08-30 |
| | | | | | | In some cases, especially with an empty editor, trying to map completions over the last changes may result in a RangeError. If unhandled, the error corrupts editor state. | ||
* | feat(frontend): hide isolated nodes | Kristóf Marussy | 2023-08-30 |
| | |||
* | feat(frontend): projection dialog | Kristóf Marussy | 2023-08-30 |
| | |||
* | refactor(frontend): containment arrow size | Kristóf Marussy | 2023-08-29 |
| | |||
* | refactor: rename invalidNumberOfContainers | Kristóf Marussy | 2023-08-29 |
| | | | | | Use a simplified name invalidContainer, since this pattern may match even if there is a sufficient number of ERROR containers. | ||
* | chore(deps): bump frontend dependencies | Kristóf Marussy | 2023-08-28 |
| | | | | Also downgrade EMF dependencies to be compatible with the Xtext BOM | ||
* | refactor: disable contains refinement | Kristóf Marussy | 2023-08-27 |
| | | | | | | Providing an efficient refinement calculus would be too difficult at this point, and contains is much more useful as a constraint in predicates that as an assertions anyway. | ||
* | fix: strong represenative election algorithm | Kristóf Marussy | 2023-08-27 |
| | | | | Make sure to merge all clusters reachable from source and target. | ||
* | chore(deps): bump frontend dependencies | Kristóf Marussy | 2023-08-26 |
| | |||
* | refactor(frontent): improve graph drawing | Kristóf Marussy | 2023-08-26 |
| | |||
* | feat(frontend): automatic fit zoom | Kristóf Marussy | 2023-08-24 |
| | |||
* | chore: clarify permissing licensing | Kristóf Marussy | 2023-08-24 |
| | | | | | | | | | | | | For permissive licenses like MIT and BSD, OR EPL doesn't make sense, because the copyright original permission notice must be retained at all times. For code simply copied with minimal modifications that are unrelated to Refinery, we can just use the plain MIT license or BSD-3-clause license. For code with complex modifications related to Refinery, we can instead use the MIT AND EPL-2.0 SPDX expression, which forces downstream users to retain the original MIT notices as required by the MIT license, but also extends Refinery's copyleft to our modifications. | ||
* | refactor(web): clean up graphviz visualization | Kristóf Marussy | 2023-08-24 |
| | |||
* | refactor(web): move d3-zoom patch into repo | Kristóf Marussy | 2023-08-23 |
| | | | | | Instead of referencing an external pull request, move the patch into yarn/.patches and update it to handle pinch-to-zoom. | ||
* | feat(web): zoom controls | Kristóf Marussy | 2023-08-23 |
| | |||
* | refactor: d3 zoom centering | Kristóf Marussy | 2023-08-23 |
| | | | | Uses patch from https://github.com/d3/d3-zoom/pull/212 | ||
* | feat: dot visualization | Kristóf Marussy | 2023-08-23 |
| | |||
* | fix: predicate value translation | Kristóf Marussy | 2023-08-21 |
| | |||
* | feat: improve semantics error reporting | Kristóf Marussy | 2023-08-20 |
| | | | | | Also makes model seeds cancellable to reduce server load during semantic analysis. | ||
* | fix: nullary model initialization | Kristóf Marussy | 2023-08-19 |
| | | | | | Decision trees can only handle relations with 1 level and up, so we use a special case for nullary relations. | ||
* | fix: abstract type chain elimination | Kristóf Marussy | 2023-08-19 |
| | |||
* | feat: interruptible VIATRA engine | Kristóf Marussy | 2023-08-19 |
| | | | | Reduce server load by introducing a timeout for semantics analysis. | ||
* | refactor: move ITC algorithms | Kristóf Marussy | 2023-08-19 |
| | | | | | Since only RETE uses ITC, we may move ITC into the RETE project. Also removes unused ITC algorithms. | ||
* | refactor: apply local search fixes to VIATRA | Kristóf Marussy | 2023-08-19 |
| | |||
* | chore: mark modified VIATRA files | Kristóf Marussy | 2023-08-19 |
| | | | | Make sure the copyright headers are up to date. | ||
* | refactor: merge VIATRA subprojects | Kristóf Marussy | 2023-08-19 |
| | | | | | Since we remove EMF dependencies, there is no point to maintaining a base index separate from the rest of the runtime. | ||
* | refactor: remove unused VIATRA code | Kristóf Marussy | 2023-08-19 |
| | | | | We don't need Eclipse platform support, table-based scopes, and EMF support. | ||
* | chore: import VIATRA source | Kristóf Marussy | 2023-08-19 |
| | | | | | Make our modifications more maintainable by editing the source code directly instead of using reflection. | ||
* | feat: predicate semantics | Kristóf Marussy | 2023-08-18 |
| | |||
* | build: fix deprecation warning | Kristóf Marussy | 2023-08-17 |
| | | | | https://docs.gradle.org/8.2.1/userguide/upgrading_version_8.html#test_framework_implementation_dependencies | ||
* | refactor: candidate interpreation only on demand | Kristóf Marussy | 2023-08-17 |
| | | | | Avoid creating interpretations not needed for the graph analysis task. | ||
* | fix: typo in language-web build script | Kristóf Marussy | 2023-08-17 |
| | |||
* | fix: more precise new object types | Kristóf Marussy | 2023-08-17 |
| | | | | | A new object should not be an instance of any subclasses. Also, it should be possible cleare a node without any other type. | ||
* | fix: opposite translation error reporting | Kristóf Marussy | 2023-08-17 |
| | |||
* | fix: containment link translation | Kristóf Marussy | 2023-08-17 |
| | | | | | Improper equality implementation of representative election literals merged weak and strong connected components during query canonicalization. | ||
* | feat: basic semantics mapping and visualization | Kristóf Marussy | 2023-08-17 |
| | |||
* | chore(deps): bump dependencies | Kristóf Marussy | 2023-08-15 |
| | |||
* | refactor(language): invalid multiplicity trace | Kristóf Marussy | 2023-08-15 |
| | | | | | Also simplifies attributes and flags for now, as we don't translate them to abstractions. | ||
* | fix: concrete supertype translation | Kristóf Marussy | 2023-08-13 |
| | |||
* | feat: metamodel translator | Kristóf Marussy | 2023-08-13 |
| | |||
* | refactor: partial model initialzer unique table | Kristóf Marussy | 2023-07-25 |
| | | | | | Reduce memory use of initial partial models by consolidating value objects. | ||
* | feat: concrete count in partial models | Kristóf Marussy | 2023-07-25 |
| | |||
* | feat: custom connected component RETE node | Kristóf Marussy | 2023-07-23 |
| | |||
* | feat: partial interpretation for type hierarchy | Kristóf Marussy | 2023-07-20 |
| | |||
* | feat: multi-object based EQUALS and EXISTS | Kristóf Marussy | 2023-07-20 |
| | | | | | | | | | Adds translator for EQUALS and EXISTS symbols based on the multi-object formalism. Only diagonal equality links are supported (e.g., distinct nodes may not be EQUALS with each other). Also introduces initial model seeds to separate partial interpreter construction and graph initialization better. | ||
* | feat: basic partial interpretation infrastructure | Kristóf Marussy | 2023-07-20 |
| | |||
* | feat: use base index for local search | Kristóf Marussy | 2023-07-15 |
| | |||
* | feat: base indexer for store | Kristóf Marussy | 2023-07-15 |
| | |||
* | fix: ConstantLiteral to PConstraint | Kristóf Marussy | 2023-07-15 |
| | |||
* | feat: query rewriters for Viatra | Kristóf Marussy | 2023-07-15 |
| |