{"push_id":639651441,"size":30,"distinct_size":30,"ref":"refs/heads/master","head":"7369f6b496fc4ea9c0b8f624e506079d3095b76e","before":"36fb3d1efdf6670d1a1c90529b2ccd7224fe6c96","commits":[{"sha":"2f56dd30b8fdd540b2fbd2727dddb1f999f04374","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"PowerSet: Add BitSetIterable\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/2f56dd30b8fdd540b2fbd2727dddb1f999f04374"},{"sha":"b1465574ef2ede30b9f9680bbca442eaf63f1708","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"getLocationMap(): Correctly handle alphabets with just a single entry\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/b1465574ef2ede30b9f9680bbca442eaf63f1708"},{"sha":"0cb7c66faa05613718bb62580b217ebadaadcfb9","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"SynthesizePN: Add a builder class replacing various constructors\n\nThings were getting out of hand with all those constructors. Instead, the\nbuilder allows to easily add new options to SynthesizePN without having to add\ntons of new constructors.\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/0cb7c66faa05613718bb62580b217ebadaadcfb9"},{"sha":"714c27f50656b4f8cfc29acc107dbe6362fd0cb8","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"SynthesizePN: Add a quick fail mode\n\nWhen this mode is enabled, SynthesizePN stops after the first separation\nfailure. This is interesting if you do not care about the individual separation\nfailures and saves time in this case.\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/714c27f50656b4f8cfc29acc107dbe6362fd0cb8"},{"sha":"5ed56c07ad2ac1e99d227795b1f407ea137f85da","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"SynthesizePN: Shorten our list of assertions\n\nI think this results in a more readable result.\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/5ed56c07ad2ac1e99d227795b1f407ea137f85da"},{"sha":"98252b7b9ce7892ad0b71d55ffc0c5e6a14a9709","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"EquivalenceRelation: implement equals() and hashCode()\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/98252b7b9ce7892ad0b71d55ffc0c5e6a14a9709"},{"sha":"9a188e09827cdcb3ee8da2232f72b3f0f78ddc95","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"EquivalenceRelation: Add a method for refining a relation\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/9a188e09827cdcb3ee8da2232f72b3f0f78ddc95"},{"sha":"0a3c2bd06a849551ab522d87cff440dcbd8973a9","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"Add the necessary interfaces and classes for finite automatons\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/0a3c2bd06a849551ab522d87cff440dcbd8973a9"},{"sha":"fbc778c8942446d6440ef35ca368d5701926df7d","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"Add a utility class for constructing and working with FiniteAutomaton\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/fbc778c8942446d6440ef35ca368d5701926df7d"},{"sha":"eb214c5150a006b88227d6f1caf01eebeeb0342c","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"EquivalenceRelation: Don't use a LazyMap\n\nThis was causing ConcurrentModificationExceptions because isEquivalent() was\nmodifying the underlying maps. This commit changes the code so that this does\nnot occur.\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/eb214c5150a006b88227d6f1caf01eebeeb0342c"},{"sha":"03b634abb1618e2fe08084a6755dd911d08aade2","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"FiniteAutomatonUtility.getAtomicLanguage(): Really be finite\n\nBefore this commit, repeatedly asking an automaton constructed via\ngetAtomicLanguage() for its (correct) following state returned different states\nwhich were not equal to each other. This commit fixes this so that only states\nwhich are equal to each other (by being the exact same state) are returned.\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/03b634abb1618e2fe08084a6755dd911d08aade2"},{"sha":"56946e0610bba4e08e9ed63cffd5cacefa71de8e","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"FiniteAutomaton: Add DFAs and minimal DFAs\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/56946e0610bba4e08e9ed63cffd5cacefa71de8e"},{"sha":"8bb56157ac906d7e009dd1e9b8e97b5770349e00","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"Add a test for the Symbol class and implement toString()\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/8bb56157ac906d7e009dd1e9b8e97b5770349e00"},{"sha":"f6f46f026210067ccc4c79da867ceadc497d704b","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"Add a construction for DFA negation\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/f6f46f026210067ccc4c79da867ceadc497d704b"},{"sha":"a8428cb2cb322455b1e646df0c98066766c4cb9d","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"DeterministicFiniteAutomaton: Add intersection\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/a8428cb2cb322455b1e646df0c98066766c4cb9d"},{"sha":"11ea885bacf3da02606488566c95bb333338794e","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"Add a direct union for DeterministicFiniteAutomaton\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/11ea885bacf3da02606488566c95bb333338794e"},{"sha":"50aa587aa4ae84b752a0e9ce66a7904eccb0fc0c","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"Add a function for testing automaton for language equivalence\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/50aa587aa4ae84b752a0e9ce66a7904eccb0fc0c"},{"sha":"aa037d48c1a922a7b21a14b9b67962d5a7f8d2c5","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"Replace old DFA classes with the new DFA classes\n\nThis adds a method to turn a TransitionSystem into a FiniteAutomaton. With this,\nthe new FiniteAutomatonUtility can replace the old DFA classes.\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/aa037d48c1a922a7b21a14b9b67962d5a7f8d2c5"},{"sha":"52aa886833da3bd970ee679737c80dbed4bd29c2","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"DFA union: Use the correct alphabet\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/52aa886833da3bd970ee679737c80dbed4bd29c2"},{"sha":"da1d77566c3c9c3d44d739b40c4294d8eef15b56","author":{"email":"ede10f140ad8f5ad90197d17839fb90345d66dd4@informatik.uni-oldenburg.de","name":"Uli Schlachter"},"message":"Negate(): Add a possibility for specifying an alphabet\n\nThis is used to fix findWordDifference() where previously the negation didn't do\nwhat it was supposed to do (accept all words that \"this\" DFA does not accept,\nbut the other DFA does accept).\n\nSigned-off-by: Uli Schlachter <uli.schlachter@informatik.uni-oldenburg.de>","distinct":true,"url":"https://api.github.com/repos/CvO-Theory/apt/commits/da1d77566c3c9c3d44d739b40c4294d8eef15b56"}]}