November 14th, 2011, 3:33 pm
QuoteOriginally posted by: outrunQuoteOriginally posted by: CuchulainnQuoteOriginally posted by: outrunQuoteOriginally posted by: CuchulainnEASTL seems very extensive; a simple matrix<V, int R, int C> along the lines of boost::array<V,N>.What is also needed (I have one using NumericMatrix and STL) is associative matrixThey are very useful, e.g. lookup tables on 2 parameters for NonCentral ChiSquared Distribution. Thijs,Are the index sets all of integral type?I think we have different concepts and specialized containers to keep performace high, ..so we might have different interfaces for matrices and grids (integral types) and lookup tables (floats, sorted). Right?I think the requirement is Functionality here, since the lookup tables are not so big.I can think if 3 ways to do lookups:* std::map* boost::multi_index* a static sorted list, and a std:binary)searchThe first one is very standard, the second one flexible and fancy, and the third standard and fast.Maybe leave this open until we actually run into it? Picking any if the three methods above (and others) doesn't even need to be discussed I would say: * we can use whatever we want from STL and maybe boost behind our interfaces.The requirement is an associative matrix, as in the link. On the lines of
Last edited by
Cuchulainn on November 13th, 2011, 11:00 pm, edited 1 time in total.