1. 20 Jun, 2018 1 commit
  2. 17 Jan, 2018 4 commits
  3. 26 Jan, 2016 1 commit
    • Mathieu Giraud's avatar
      core/affectanalyser.cpp: .getMaximum(), further simplify main test · f787d626
      Mathieu Giraud authored
      The condition on ratioMin is now strict (the default ratioMin is now 1.9 instead of 2.0),
      and obscure conditions are removed.
      A few borderline cases could now pass here (max_found), but they should anyway be discarded
      by the following e-values tests (and yield the same unsegmentation cause than before).
      
      The whole test is now cleaner and more symmetrical.
      f787d626
  4. 12 Dec, 2015 2 commits
    • Mathieu Giraud's avatar
      core/affectanalyser.cpp: better estimation of .max_found in .getMaximum(),... · 783d0b19
      Mathieu Giraud authored
      core/affectanalyser.cpp: better estimation of .max_found in .getMaximum(), more reads as UNSEG_AMBIGUOUS
      
      Since the new flexible heuristic, introduced more than one year ago (de008a24, version 2014-07),
      the idea behind the check of the segmentation point was:
        "Do we have enough affectations in good positions ('before' at the left and 'after' at the right) ?
         We tolerate some of them in bad positions, but there must be 'ratioMin' more in good positions."
      
      However, the actual implementation of this idea was rather partial.
      As a result, the 'ambiguous' sequence added in the previous commit was falsely segmented.
      
      The new code is more symmetrical, .max_found being set to true when there are both:
       - more V at the left than V at the right, and than J at the left
       - more J at the right than J at the left, and than V at the right
      "More" is defined by ratioMin and currently equals to 2.0.
      
      A few reads that were previously segmented will now appear as UNSEG_AMBIGUOUS.
      783d0b19
    • Mathieu Giraud's avatar
      a29ad45d
  5. 15 Jun, 2015 1 commit
  6. 07 Apr, 2015 2 commits
  7. 06 Apr, 2015 2 commits
  8. 01 Apr, 2015 1 commit
  9. 06 Mar, 2015 1 commit
  10. 06 Feb, 2015 1 commit
  11. 22 Nov, 2014 1 commit
  12. 01 Nov, 2014 1 commit
  13. 30 Oct, 2014 2 commits
  14. 24 Oct, 2014 1 commit
  15. 23 Sep, 2014 1 commit
  16. 11 Jul, 2014 2 commits
  17. 07 Jul, 2014 4 commits
  18. 01 Jul, 2014 1 commit
  19. 22 May, 2014 1 commit
  20. 15 Apr, 2014 5 commits
  21. 14 Apr, 2014 3 commits
  22. 25 Mar, 2014 1 commit
    • Mikael Salson's avatar
      AffectAnalyser: Provide a constant-time counting affectation solution · 03ada236
      Mikael Salson authored
      We count affectations in constant-time before or after a position. This will
      help improving the heuristic for finding the window
      
      firstMax and lastMax are the most useful functions since they provide the
      position of the first (resp. last) positions where the maximum is achieved for
      some affectations. So that gives us the range where we should center our
      window.
      03ada236
  23. 22 Mar, 2014 1 commit