{"push_id":745265978,"size":33,"distinct_size":1,"ref":"refs/heads/gh-source","head":"b14b68128e8be7e1e40d6f35c0fdeb2a700c550d","before":"ab418924cbc7cf431b8a40dc9a8b14809512a97f","commits":[{"sha":"537b26ea0a4bfcee3a47697cb343e6709b7a5580","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Add warnings for the reference count of a top gate\n\nIndexedFaultTree and Preprocessor heavily relies on correct reference\ncounting for indexed nodes. The caller of the functions must make sure\nthat there is no extra pointers outside of an indexed fault tree.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/537b26ea0a4bfcee3a47697cb343e6709b7a5580"},{"sha":"a7d74e08e2830f196b6285f5b3689e7e3c318cd6","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Add min and max visit times for Indexed Nodes\n\nThese functions help the module detection code. The code gets simpler\nwith indexed nodes saving their visit information.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/a7d74e08e2830f196b6285f5b3689e7e3c318cd6"},{"sha":"790539554b6da6fe782144c37bf6b3de24ca9740","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Recover the module filtering and grouping code\n\nCouple of simple typo bugs are fixed. Some code is put out-of-loops for\nperformance reasons.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/790539554b6da6fe782144c37bf6b3de24ca9740"},{"sha":"63f0c5228c0a9620a7162a06bd3ac5ccfdb156bb","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Record performance regression\n\nOnly one performance test gained greatly from the recent module\ndetection changes. Other cases seem to suffer from loss of some compiler\noptimizations.\n\nThe regression was introduced in\n[15ef5cd5c3a4aa1408fd9e2199ea0980703e1f18] Use the auto-indexation in\nFaultTreeAnalysis","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/63f0c5228c0a9620a7162a06bd3ac5ccfdb156bb"},{"sha":"7013ce09b75da82f58dd6eaed91eb0cb9dade77b","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Separate indexed gate marks and node visit times","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/7013ce09b75da82f58dd6eaed91eb0cb9dade77b"},{"sha":"41b2e2d1f5bc32441f20c1ef5cea7e71326a257c","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Reuse single parent gates for complement push-down\n\nThere is no need to create a new gate for a single parent gate for\ncomplementing. The original gate can transform into its own complement.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/41b2e2d1f5bc32441f20c1ef5cea7e71326a257c"},{"sha":"5c0d062c5199f43f251887206067303fb8fd95de","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Detect duplicate indexed children upon addition\n\nThe outcome of the addition has complications due to the context. The\ncaller must be aware of the limitations.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/5c0d062c5199f43f251887206067303fb8fd95de"},{"sha":"f3b1ca7eafb9d9aa5abf384a8434fa88a8a97556","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Introduce OptiValue for failure propagation\n\nThis optimization value is a part of Boolean optimization implementation\nfor issue #100.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/f3b1ca7eafb9d9aa5abf384a8434fa88a8a97556"},{"sha":"8be176de0793517bb15c6f2415d00fd9e1950d92","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Gather common nodes for Boolean optimization\n\nThis is a part of issue #100.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/8be176de0793517bb15c6f2415d00fd9e1950d92"},{"sha":"65b3953e8dc7f3ae091288cf39c12c22c6bd503f","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Add failure propagation for common nodes\n\nThe Boolean optimization (issue #100) only runs for coherent trees for\nnow. The original description of the algorithm is for coherent trees.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/65b3953e8dc7f3ae091288cf39c12c22c6bd503f"},{"sha":"b5fcb725f38d6b83c62faa0c0129a9d467e375dd","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Collect failure destinations for common nodes\n\nThis operation is a part of Boolean optimization issue #100.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/b5fcb725f38d6b83c62faa0c0129a9d467e375dd"},{"sha":"1db7b235d06fd65b9c4e263ff2020305a85930a1","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Process node failure destinations and redundancies\n\nThis initial implementation works with only gates and not optimized.\nReducing redundancies is the main point of Boolean optimization\n(issue #100).","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/1db7b235d06fd65b9c4e263ff2020305a85930a1"},{"sha":"7fc047571b7420996cf981aa8cdda79005d704d9","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Implement Boolean Optimization for indexed nodes\n\nThe functions are made generic to accommodate both gates and basic\nevents. The current implementation only works for coherent trees. Final\npieces of the optimization are implemented, so this commit closes #100.\n\nThis optimization is sensitive to the initial structure of a fault\ntree; however, currently no attempt is made to specifically manipulate\nthe fault tree before calling this optimization because it is uncertain\nhow the order of the other optimization algorithms affect each other for\ncertain kinds of fault trees. The application of the algorithms requires\ncareful consideration of the trade-offs and side effects.\n\nAmong the performance test cases, the 200-event fault tree is\nthe only one that improved substantially (at least 10x).","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/7fc047571b7420996cf981aa8cdda79005d704d9"},{"sha":"7ea4ef56f16a68badaf8581b22532c59f1654214","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Update the bash scripts that automates test runs\n\nMore informative failure messages are added. Some formatting issues are\nfixed.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/7ea4ef56f16a68badaf8581b22532c59f1654214"},{"sha":"dd631b0d4b2323197c7baf4e1dacdf74c27c0046","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Disable 200-event tests failing on Ubuntu 12.04\n\nstd::bad_alloc is thrown for this test on Ubuntu 12.04.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/dd631b0d4b2323197c7baf4e1dacdf74c27c0046"},{"sha":"2e0b5a2d1a7d0c0b0ac762f393fde183eafe94c6","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Fix the uninitialized variable found by Coverity","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/2e0b5a2d1a7d0c0b0ac762f393fde183eafe94c6"},{"sha":"052f4ad3de4c6b4049d732b070a884601426f348","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Update CONTRIBUTING.md with CLA Assist\n\n[skip ci]","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/052f4ad3de4c6b4049d732b070a884601426f348"},{"sha":"68874972222edd0c29492ff2eca7cb5349512d51","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Update the reference list","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/68874972222edd0c29492ff2eca7cb5349512d51"},{"sha":"132ac9d82aad5da6c87fd406a48a40a646e3f7bf","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Add a note that every commit should pass tests\n\nThis is a good practice.","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/132ac9d82aad5da6c87fd406a48a40a646e3f7bf"},{"sha":"281e48cae9e3a9793fce461246d3b043819509bc","author":{"email":"49f286f948417fff7b3fb5e9475c023778fb9383@gmail.com","name":"rakhimov"},"message":"Format 'inline' consistently in the code\n\nThe 'inline' hint for the compiler must precede other adjectives for\nfunctions (\"virtual\", \"static\").","distinct":false,"url":"https://api.github.com/repos/rakhimov/scram/commits/281e48cae9e3a9793fce461246d3b043819509bc"}]}