forked from mkurdej/bft
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTODO.txt
37 lines (29 loc) · 1.04 KB
/
TODO.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
* Docs.
* Examples.
* Tutorials.
* Change interface (can be based on Boost.Geometry)
* `fuse` and `return_fuse`
* allow using any container/range/iterator pair of size 2^N
* use tags (mass_tag, belief_tag, etc.)?
bft_function<fod> f(Container<T> values);
bft_function<fod> f(std::vector<T> values);
bft_function<fod> f(std::initializer_list<T> values); // C++11
#ifdef BOOST_BFT_CHECK
# ifndef BOOST_BFT_CHECK_PRECISION
# define BOOST_BFT_CHECK_PRECISION 1e-8
# endif // BOOST_BFT_CHECK_PRECISION
// TODO: check that sum(:) ~ 1.0 +- BOOST_BFT_CHECK_PRECISION
#endif // BOOST_BFT_CHECK
mass_array<fod> m1a(50, 50);
mass_array<fod> m2a(50, 50);
#if 0
namespace bft = namespace boost::bft;
typedef bft::mass_model< /*set_size = */5, /*value_type = */double > mass_type;
#endif
// TODO Boost.BFT wishlist:
// * conditioning
// * deconditioning
// * plausibility::is_condensable <=> Pl(A) = sup{Pl(B) | B \subset A and B is finite}
// * rule_zhang
// * reorganise bft_test1.cpp: split
// * permit the use of boost::numeric::interval and not only classes