| Commit message (Collapse) | Author | Age |
| |
|
| |
|
|
|
|
|
| |
* Use LinekdHashMap in delta-based stores to improve iteration performance
* Avoid allocating ObjectCodeImpl
|
|\
| |
| |
| | |
partial-interpretation
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
| |
| |
| | |
different indices.
|
| | |
|
| |
| |
| |
| | |
StateEquivalenceCheckerImpl
|
| | |
|
| |
| |
| |
| | |
cached.
|
| |\ |
|
| | |\ |
|
| | | |
| | | |
| | | |
| | | | |
Uses Graphviz to create a visualization of the models and can save them to disk as an image or various textual representations
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
- Transformation rules
- Design Space Exploration adapter
- Depth First Strategy
|
| | | |
| | | |
| | | |
| | | | |
StateEquivalenceChecker prototypes
|
| | |/
| |/|
| | |
| | | |
No tests yet.
|
| | |
| | |
| | |
| | | |
When a Version is collected by gc, the store lets the state get collected by gc as well.
|
| |/
| |
| |
| |
| |
| |
| | |
VersionedMapStoreStateImpl, update builder.
- details of the maps goes to internal packages
- ModelStoreBuilderImpl uses VersionedMapStoreFactoryBuilder
|
| | |
|
| |\ |
|
| | |
| | |
| | |
| | |
| | | |
- by special handling of unary and binary relations
- introducing murmur32Scramble
|
| | |
| | |
| | |
| | | |
VersionedMapStoreBuilder.java is removed.
|
| | |
| | |
| | |
| | | |
By implementing an InOrderMapCursor cursor, and a MapDiffCursor that synchronize two cursors.
|
| | | |
|
| | |
| | |
| | |
| | | |
when setting the new parent state
|
| | | |
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
- AnyVersionedMap.checkIntegrity added to the superclass
- Default value of the map is gettable.
- Errors fixed:
- Delta store failed to update reference to the previous transaction in some cases. Fixed in VersionedMapStoreDeltaImpl.java
import java.util.HashMap;
- Null values caused issues in UncommittedDeltaMapStore.java as putIfAbsent does not work with null.
- Small fixes in DeltaDiffCursor.java and IteratorAsCursor.java
|
| | | |
|
| | | |
|
| | | |
|
| | |
| | |
| | |
| | | |
shifting, improving code quality. + formatting
|
| | | |
|
| | |
| | |
| | |
| | | |
in case null != default
|
| | | |
|
| | |
| | |
| | |
| | | |
printer appending + empty node stack checking
|
| | |
| | |
| | |
| | |
| | |
| | | |
improving code quality.
+ formatting
|
| | | |
|
| | | |
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
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.
|
| | | |
|
| | | |
|
| |/
|/|
| |
| | |
Support for count and aggregation is still missing.
|
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
Enable deterministic state-space exploration by ordering activations in
lexicographic order.
This preliminary implementation adds oredering as a wrapper for ResultSet
instances, but more sophisticated support could be built directly into query
engine adapters if a query engine supports deterministic output by default.
* Implements Comparable for tuples with loops unrolled for small tuples by hand.
* Cleans up the contents of the (root of the) tools.refinery.query package.
* Adds ResultSetListener to notify clients about ResultSet changes.
* Adds OrderStatisticTree data structure for determinisitc ordering of keys.
|
| |
| |
| |
| | |
Shorthad syntax for the most commonly used symbol types.
|
| |
| |
| |
| |
| |
| |
| |
| | |
* Remove the reflection-based machinery around adapter types.
* Adapter builders, store adapters, and model adapters are now only associated
with each other based on static and runtime types.
* Simplifies writing new adapters.
* Hierarchical syntax for adding adapter builders to the store builder.
|
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
Make sure we obey the REUSE (https://reuse.software) specification and the
origin, copyright owner, and license of all files are clearly marked.
The whole project is under the EPL-2.0, except for trivial files where copyright
is not applicable that are marked with the CC0-1.0 license. Moreover, code
included from third parties is also available under the respective license.
chore: add CONTRIBUTORS.md
List all authors and supporting organizations in accordance with the REUSE
specification.
|
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
* Directly transform VIATRA tuples into Refinery tuples, since creating
the additional wrapper object doesn't save any memory.
* Adds static arity Tuple3 and Tuple4 implementations to be more
aligned with VIATRA internals and save memory for queries with up to
4 parameters.
* Makes sure no new objects are allocated (for varargs handling) when a
static arity tuple is hashed.
|