Tree: 6ee3395544

accumulation

accumulation-v4.7

automata-finite

master

tud-infrastructure-2018-10-12

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '6ee3395544'

${ noResults }

Commit Graph

1 Commits (6ee3395544920af667342c981b8397dbb6145fc5)

Author	SHA1	Message	Date
Joachim Klein	985a939102	refactor explicit.Model/NondetModel, getSuccessorsIterator: new abstract method getSuccessors, getSuccessorsIterator becomes default method The getSuccessorsIterator provides an iterator over the set of successors, i.e., deduplication is sometimes required (e.g. for MDPs). We introduce here a SuccessorsIterator class that allows to make deduplication optional, which may have benefits in performance. Additionally, SuccessorsIterator implements a primitive OfInt iterator, which can avoid auto-boxing. Subclasses of explicit.Model now have to provide an implementation for getSuccessors(int s), getSuccessorsIterator(int s) is provided via a default method that automatically requests deduplication. Subclasses of explicit.NondetModel now have to provide an implementation for getSuccessors(int s, int)., getSuccessorsIterator(int s, int i) is provided via a default method that automatically requests deduplication. Adapt the existing subclasses of explicit.Model. Provides additional default methods and removes unneeded specializations in sub-classes: boolean isSuccessor(int s1, int s2) boolean allSuccessorsInSet(int s, BitSet set) boolean someSuccessorsInSet(int s, BitSet set) boolean allSuccessorsMatch(int s, IntPredicate p) boolean someSuccessorsMatch(int s, IntPredicate p) and for NondetModel: boolean allSuccessorsInSet(int s, int i, BitSet set) boolean someSuccessorsInSet(int s, int i, BitSet set) boolean allSuccessorsMatch(int s, int i, IntPredicate p) boolean someSuccessorsMatch(int s, int i, IntPredicate p) git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@12085 bbc10eb1-c90d-0410-af57-cb519fbb1720	9 years ago