• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

rakhimov / scram / 463

Builds Branch Commit Type Ran Committer Via Coverage
463 develop Minor documentation corrections before release 0.5.0 push 17 Nov 2014 08:27AM UTC rakhimov travis-ci pending completion   set done
461 develop Update performance tests and logs. push 17 Nov 2014 07:52AM UTC rakhimov travis-ci pending completion   set done
460 develop Separate functions that output to standard out from a file. push 17 Nov 2014 05:56AM UTC rakhimov travis-ci pending completion   set done
458 develop Update the test input running python script. push 16 Nov 2014 09:09PM UTC rakhimov travis-ci pending completion   set done
457 develop Pass and gather pointers to sets instead of copies. This improves running times for cut set generation but not minimization. push 15 Nov 2014 12:18AM UTC rakhimov travis-ci pending completion   set done
456 develop Adjust module creation for corner cases. Add logging. The corner case is when events are shared between gates so that there is chain of non-modularity due to this small group of events. The other case is when the gate itself is modular but there... push 14 Nov 2014 03:51PM UTC rakhimov travis-ci pending completion   set done
455 develop Add detection of local minimality for OR gate upon passing inputs to AND gate. push 13 Nov 2014 10:52PM UTC rakhimov travis-ci pending completion   set done
453 develop Decrease non-deterministic performance with the new algorithm. Provide speed recordings. Fixes #89. The new algorithm reduces non-determinism in comparison to the previous implementation of the MOCUS-like algorithm. push 13 Nov 2014 05:06AM UTC rakhimov travis-ci pending completion   set done
452 develop Apply the cut set minimization optimization from the previous algorithm. The code from the previous algorithm is used to minimize generated cut sets. This provides a bit of performance improvement. push 13 Nov 2014 03:27AM UTC rakhimov travis-ci pending completion   set done
451 develop Implement a new algorithm for cut set generation. A new walker algorithm is implemented that is supposed to generate cut sets from a fault tree faster than the previous algorithms. The minimality detection is not optimized. push 13 Nov 2014 02:18AM UTC rakhimov travis-ci pending completion   set done
450 develop Add benchmark tests for the Chinese fault tree from XFTA. push 12 Nov 2014 03:47PM UTC rakhimov travis-ci pending completion   set done
449 develop Add a test for constant gate propagation due to complement basic events. push 11 Nov 2014 05:38PM UTC rakhimov travis-ci pending completion   set done
448 develop Correct input files for name and definition clash detection. push 11 Nov 2014 03:52PM UTC rakhimov travis-ci pending completion   set done
447 develop Add a test for many house event propagation scenarios. push 11 Nov 2014 03:44PM UTC rakhimov travis-ci pending completion   set done
446 develop Use the general gate function for complex top gate expansion. Previously, top gates were treated in the UnrollGates() function while the same functionality exists in the general UnrollGate() function. push 11 Nov 2014 03:18PM UTC rakhimov travis-ci pending completion   set done
  • ← Previous
  • 1
  • 2
  • …
  • 33
  • 34
  • 35
  • 36
  • 37
  • 38
  • 39
  • 40
  • 41
  • 42
  • Next →
  • Back to Repo
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2025 Coveralls, Inc