| Commit message (Collapse) | Author | Age |
|---|
| | |
|
| | |
|
| |
|
|
|
| |
We use a palette-based coloring strategy, where each class and enum gets a color
from
|
| | |
|
| |\
| |
| | |
Round-trip model serialization and command line application
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| |/
|
|
|
|
|
| |
Efficiently store cross references even if default ref(*, *): false.
Uses propagation rules instead of view queries to reason about type constraints
and multiplicity.
|
| |
|
|
|
|
|
| |
Updates references to Eclipse in documentation (but IntelliJ is the preferred
editor now).
Also fixes incompatibilities with the Eclipse compiler.
|
| | |
|
| |
|
|
| |
Also bumps other dependencies.
|
| |
|
|
| |
We were spuriously counting lower multiplicity errors for non-existent objects.
|
| |\
| |
| | |
Improve content assist and validator
|
| | | |
|
| | | |
|
| | |
| |
| |
| |
| |
| |
| |
| |
| | |
Make sure the scope bound guides the best-first search and is always obeyed even
if it can't be fully represented using the scoped partial model abstraction.
For representable bounds (classes and unary predicate that are always fully
knwon to be false or true in the initial model) this leads to duplicated
computations.
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| | |
| |
| |
| | |
Only show references that may plausibly appear in an opposite declaration.
|
| | |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
Now unary predicates may be used as types for cross-references.
This might create circular references between predicate, but no differently than
when the user manually creates predicates with circular references.
The reference types of containment and container references still have to be
classes, because we use the class hierarchy to encode contained types.
|
| | | |
|
| | | |
|
| |/ |
|
| | |
|
| |\
| |
| | |
Generator facade
|
| | |
| |
| |
| |
| | |
Also moves model metadata into language-web, since we only use it on the
frontent.
|
| | | |
|
| | | |
|
| |/ |
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
Optimize calls to potentially costly aggregators by only extracting the value
from a stateful aggregator when it is needed by subsequent RETE nodes.
This optimization only works with timeless evaluation and delete-and-rederive
evaluation disabled, i.e., only for queries without any recursion. Potentially,
it could also be extended to other mailboxes if needed.
We replace the BehaviorChangingMailbox of ColumnAggregatorNode with a
DefaultMailbox to force update batching. Batched updates only extract the value
from the aggregator when it has been already updated with all received tuples.
|
| | |
|
| |\
| |
| |
| |
| | |
graphs4value/dependabot/npm_and_yarn/babel/traverse-7.23.2
build(deps): bump @babel/traverse from 7.22.10 to 7.23.2
|
| | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
Bumps [@babel/traverse](https://github.com/babel/babel/tree/HEAD/packages/babel-traverse) from 7.22.10 to 7.23.2.
- [Release notes](https://github.com/babel/babel/releases)
- [Changelog](https://github.com/babel/babel/blob/main/CHANGELOG.md)
- [Commits](https://github.com/babel/babel/commits/v7.23.2/packages/babel-traverse)
---
updated-dependencies:
- dependency-name: "@babel/traverse"
dependency-type: indirect
...
Signed-off-by: dependabot[bot] <support@github.com>
|
| |\ \
| |/
|/| |
build(deps): bump postcss from 8.4.27 to 8.4.31
|
| | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
Bumps [postcss](https://github.com/postcss/postcss) from 8.4.27 to 8.4.31.
- [Release notes](https://github.com/postcss/postcss/releases)
- [Changelog](https://github.com/postcss/postcss/blob/main/CHANGELOG.md)
- [Commits](https://github.com/postcss/postcss/compare/8.4.27...8.4.31)
---
updated-dependencies:
- dependency-name: postcss
dependency-type: indirect
...
Signed-off-by: dependabot[bot] <support@github.com>
|
| | | |
|
| | |
| |
| |
| |
| |
| |
| | |
Make sure contains is parsed as a contextual keyword whenever possible.
The existing cut operator wasn't sufficient for this, so we also add dynamic
precedence to the grammar rule.
|
| |\ \
| | |
| | | |
Optimize Interpreter communication tracker
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | | |
Use a faster algorithm to detect cycles in the RETE network.
Only if cycles are detected fall back to the transitive closure algorithm to
construct the SCCs and the reduced graph.
|
| |/ /
| |
| |
| |
| | |
Let representative election be used in places where IncSCCAlg was used with
generic arguments other than Object.
|
| |\ \
| |/
|/| |
Interpreter performance fix
|
| | |
| |
| |
| | |
Use a simpler data structure for constructing simple names.
|
| | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
Use isomorphism-aware hashing to speed up RecipeRecognizer.
Due to possibly cyclic (recursive) recipes, we can't recursively turn recipes
into a canonical form. Recipes referring to already canonical (non-recurisve, or
recursive and entirely canonicalized) recipes can be hashed, while recursive
recipes in the middle of caninicalization still have to be compared more slowly
by their contents.
To keep the list of recipes compared by contents small, recipes are assigned a
hash code whenever possible.
We keep the equivalence class IDs for recipes, as there might be hash code
clashes, as well as recursive recipes that only later get assigned a hash code.
Also fixes a concurrency problem with equivalence class IDs by using an
AtomicLong.
Also reworks recipe instantiation, as now recipes might be canonicalized before
they are instantiated.
|
Kristóf Marussy
Kristóf Marussy
dependabot[bot]