[CoinUtils-tickets] [COIN-OR Common Utilities] #62: Bug in factorSparseSmall (CoinFactorization2.cpp)

[COIN-OR Common Utilities]

#62: Bug in factorSparseSmall (CoinFactorization2.cpp)
-------------------+--------------------------------------------------------
Reporter:  sssiii  |       Type:  defect
  Status:  new     |   Priority:  major 
 Version:          |   Keywords:        
-------------------+--------------------------------------------------------

Comment(by sssiii):

 Unfortunately, printing this out every time the loop is executed gives way
 too much output. Is there a way to find the rare cases where the array
 bounds are actually exceeded? put is frequently larger than lengthU_, so
 that is clearly not the way...

-- 
Ticket URL: <https://projects.coin-or.org/CoinUtils/ticket/62#comment:8>
COIN-OR Common Utilities <http://projects.coin-or.org/CoinUtils>
Common data structures and linear algebra functions for COIN-OR projects