Milena (Olena): Todo List

File fun/v2v/wrap.hh: Prefer not to cast towards 'unsigned long'; use a procedure such as enc(l) that can work on 'unsigned', 'int_u8', 'label<n>', and also other label types.

File gaussian.hh: Add a clean reference Rachid Deriche Recursively implementing the gaussian and its derivatives (1993)

File gaussian_1d.hh: This is experimental code to be merged with regular code...

File gaussian_directional_2d.hh: This is experimental code to be merged with regular code...

File general.hh: Have infimum and supremum for value types, apart from morphology!

File geom/bbox.hh

Re-activate precondition so introduce "set::nsites(Site_Set)"...

Add a static check "domain is ok for bbox (like grid)".

Add the weighted_window case.

File git/oln/milena/mln/core/internal/data.hh: Rename as image_data (more explicit!)

File git/oln/milena/mln/morpho/tree/data.hh: Think about site iterator (using image site iterator instead of S container iterator) to go faster.

File gradient.hh: Save memory.

File gradient_external.hh: Fix the extension issue (see todo in like_ero_fun and _set).

File gradient_internal.hh: Fix the extension issue (see todo in like_ero_fun and _set).

File graph_elt_window_if.hh: Allow to pass a function instead of an image.

File graph_first_search.hh: Code "next(const S& stack)".

File graph_iter_base.hh: Have special types for ids (vertex_id) to disambiguate the conversion op.

File graph_psite_base.hh: Do not compile when id_t is unsigned (so the conversion operator is defined twice!)

File hit_or_miss.hh: Save memory.

File hsl_to_rgb.hh: Etienne: Remove the global variables!

File icp.hh: encode distances on 12 bits.

File image/props.hh: Remove space_from_point and fwd decls at EOF.

File image1d.hh: Rewrite from_to(histo, image1d) after Etienne's work.

File image_identity.hh: Move "fastest impl" elsewhere; it can be used by some other classes.

File image_morpher.hh: Add the appropriate checks in .rw().

File index.hh

Remove coord and dim, then make window<dindex> work.

Add inheritance to Object so add operators and traits.

File influence_zone_adjacency_graph.hh

Add dispatch for fast images.

Use an adjacency matrix when available in the library.

File internal/check/image_fastest.hh: Check and convert p in index_of_point towards E::psite.

File interpolated.hh: think having has(algebra::vec v) as a method

File interval.hh: Likewise, code value::not_equal(t), less_than, etc.

File is_separator.hh: Make it work in n-D.

File labeling/all.hh: Many files in this directory have to be updated with the test and dispatch mechanisms.

File labeling/compute.hh: write fastest version.

File land_basic.hh: Have land_basic be parameterized.

File laplacian.hh: Save memory.

File like_ero_fun.hh: Add a choice between adjust_fill and adjust_duplicate.

File like_ero_set.hh: Add a choice between adjust_fill and adjust_duplicate.

File linear/gaussian/filter.hh: Add a clean reference Rachid Deriche Recursively implementing the gaussian and its derivatives (1993)

File linear/gaussian/impl.hh: Add a clean reference Rachid Deriche Recursively implementing the gaussian and its derivatives (1993)

File lor_basic.hh: Have lor_basic be parameterized.

File lut_vec.hh: Use fun::saturate in lut_vec ctor.

File magick/save.hh: At the moment it works; is it a miracle?

File make/box2d.hh: Accept long int as args and test overflow (out of def::coord bounds).

File make/image.hh: I guess that we should modify V into mln_unconst(V); test with C arrays being "const int[]" and run g++-2.95...

File make/image2d.hh: Think about removing make::image2d since it is redundant with convert::to and convert::from_to.

File make/image3d.hh: Think about removing make::image3d since it is redundant with convert::to and convert::from_to.

File make/neighb2d.hh: Add overload with 'when_*' being Neighborhood<N>...

File max_site.hh: Use accu::pair just like in accu::stat::min_max.

File mean_values.hh

handle mean value for label 0 correctly.

merge rgb and generic version.

File median.hh: Add versions for fastest and semi-linear images.

File memcpy_.hh: Overload with images and points; Cf. memset_.

File metal/math/sqrt.hh: Rely on nth-root.

Namespace mln

Complete those definitions (...) + Overload for const (?)

Optimize deduced ops to eliminate object creation. E.g. in the unary minus op: literal::zero_t* p_zero = 0; return O(*p_zero) - exact(rhs); can become: static O zero =... return zero - exact(rhs);

Address the remark in op/=.

Rename 'front' because it is ambiguous for C++ users; we have:

'p_queuepop' means 'dequepop_front'
'p_queuepop_front' means 'return deque::front and run deque::pop_front'

Implements parameter support

try not to use tracked_ptr.

try not to call T::plus_infty(). This is not generic enough but it works with mln::point<>.

File mln/core/concept/site_set.hh: Add a "composite" property.

File mln/core/neighb.hh: See if the impl of from_to is fine. What about removing the origin? etc.

File mln/trait/images.hh

Split this file into many.

the 'nature' prop is not set yet in image types.

The image list is not up-to-date (and move it elsewhere !)

Class mln::accu::internal::couple< A1, A2, R, E >: Check that, when T is not provided, A1 and A2 have the same value.

Class mln::accu::pair< A1, A2, T >: Check that, when T is not provided, A1 and A2 have the same value.

Member mln::border::duplicate (const Image &ima): Optimize with memcpy if possible.

Member mln::border::fill (const Image &ima, const typename I::value &v): Optimize with memset if possible.

Member mln::border::mirror (const Image &ima): Implement 3d version + optimize with memset if possible.

Member mln::data::apply (Image &input, const Function_v2v< F > &f): Add versions for lowq images.

Member mln::extension::fill (const Image &ima, const typename I::value &val): Optimize with memset if possible.

Class mln::Generalized_Pixel< E >: (later) Add an access to the targetted image.

Class mln::internal::set_of_< E >: Add a remove method.

Member mln::operator<= (const p_complex< D, G > &lhs, const p_complex< D, G > &rhs): Refine this later, when we are able to express subcomplex relations.

Member mln::operator<= (const p_edges< G, F > &lhs, const p_edges< G, F > &rhs): Refine this later, when we are able to express subgraph relations.

Member mln::operator<= (const p_faces< N, D, P > &lhs, const p_faces< N, D, P > &rhs): Refine this later, when we are able to express subcomplex relations.

Member mln::operator<= (const p_vertices< G, F > &lhs, const p_vertices< G, F > &rhs): Refine this later, when we are able to express subgraph relations.

Member mln::p_faces< N, D, P >::p_faces (const p_complex< D, P > &pc): When available, get location information from pc.

Class mln::p_run: Test if P being a Point_Site is ok.

Class mln::util::lazy_set_< E >: Add a remove method.

File morpho/attribute/card.hh: Add a static check in the accumulator concept so that when_pix::use_none => take_as_init() is provided.

File morpho/attribute/count_adjacent_vertices.hh: Check that the image is based on a graph.

File morpho/closing/height.hh: The test result looks very weird... Debug!

File multiple.hh: Implementation of the bkd_qiter (see FIXME).

File multiple_size.hh: Use n for tests and code!!!

File neighborhood_base.hh: Complete conditional implementation inheritance w.r.t. properties.

File operators.hh: Fix code for multi-sets.

File p_array.hh

Add a facade to index_of_in so that it dispatches when calling it with Object<p_array_site>.

Use util::index (instead of int) as many times as possible.

See also the 'todo' entry in mln/core/concept/pseudo_site.hh.

File p_centered.hh

Add the bkd iter.

Code is_valid() and change_target() for the site set.

File p_double.hh

Document!

Add tests about validity of compounded site sets (?)

File p_if.hh: Change s_ attribute type to S*.

File p_image.hh: Add an init method (deferred initialization).

File p_key.hh: Be more verbose in run_().

File p_mutable_array_of.hh

Zed: Add another version (p_array_of) of this class that can inherit, when possible, nsites and bbox (just like in p_vaccess). It is a different class since such a feature is incompatible with the "op[] mutable".

Zed: Add element browsing.

File p_queue_fast.hh: Add insert.

File p_run.hh: Use a lazy approach (in subj) like in p_array psite.

File p_set_of.hh: Zed: Add element browsing.

File p_vaccess.hh: Fix the FIXMEs.

File piter_adaptor.hh

Rename as site_iterator_adaptor_base.

Distinguish between adaptors of site_set_iterator, site_relative_iterator, etc. (?)

File pixel_impl.hh: Clean-up code.

File point.hh: the structure subject_point_impl is useless: first it is only used for 3D points (and it can be usefull for other points); second there is a room for the couple of methods (in the subject_impl specializations defined in core/alias/point*d.hh).

File primary.hh: We also need to get the extension image to handle border routines.

File println.hh: Revamp.

File pseudo_site.hh: Inconsistency: "if_possible::change_target" expects "::target_t" from a pseudo-site, whereas the concept checks for "::target".

File quat.hh: Inline computations in rotate routine.

File rag_and_labeled_wsl.hh: Do not use mln_max() as background label!

File rank.hh: It should be renamed as rank_h since it relies on histogram (thus low quantization).

File rank_bool.hh

There is no-arg-ctor so this accumulator does not support deferred initialization!

Add untake routines...

File rank_filter.hh: Rely on the same mechanism as erosion/dilation.

File Rd.hh: Reform code! Also go and see sandbox/theo/Rd.

File rectangle2d.hh: Reactivate includes at EOF.

File region_adjacency_graph.hh: add dispatch.

File resize.hh: This code is not complete: an image can be composed of several images whose multiple borders have to be resized! For instance an image extended by an image, or a stack of images.

File revert.hh: Add static assertion and save one iterator in in-place version.

File root.hh: Have consistent writing of math meta-routines.

File rotation.hh: store the quaternion instead of (axis, alpha) => better precision while composing two rotation matrices.

File safe.hh: Use 'instant' as the routine safe returns.

File separator_to_pixels.hh: Generalize to n-D.

File set/diff.hh: Add a diff(Site_Set& in_place, Function_v2b).

File set/get.hh: Layout and specialize.

File set/has.hh: Layout and specialize.

File site_iterator.hh: Fix mln/core/concept/doc/site_iterator.hh

File site_relative_iterator_base.hh

Add a method to get the site set (if the center is defined) or the site set at a given center.

In start_ and next_, think about the commented code...

File site_set/props.hh: Precise the differences (?) between dynamic, growing, and free...

File skeleton_constrained.hh: Add an extension handling policy for the user to set it.

File slice_image.hh: Write init_.

File sobel_2d.hh: Extends to the case of other dimensions (only the 2-d case is handled here).

File sort_offsets.hh: Factor code + optimize.

File sort_psites.hh: Factor code + optimize.

File stretch.hh

Make it work with other types than scalars (e.g., vectors).

Think about adding a stretch_inplace(?)

File sub_image.hh: Add a special case for "ima | box"; think about some other special cases...

File sub_image_if.hh: Activate preconditions.

File take_n_times.hh: Add versions with n as unsigned.

File templated_by.hh: : make it more generic, make it work on g++-2.95 (where templated_by< X, Y >check() compile)

File thru_image.hh

Debug constness of thru_image

File tiff/load.hh

Add support for several tiles.

Use ReadScanline instead of ReadRGBAImage in order to avoid a dispatch and share the same code whatever is the value type.

File to.hh

Prefer a static check that fails in the "unknown" case.

File to_p_array.hh

Move these conversion in from_to related mechanisms.

File top_hat.hh

Save memory.

File trait/op/lor.hh

Add land (for logical and).

File trait/value/internal/comp.hh

Revamp to directly access to the most internal helper instead of bumping from one helper to another.

File transform_diagonal.hh

Split dispatch and impl.

Pass the accumulator to the function-object.

File transform_directional.hh

Split dispatch and impl.

Pass the accumulator to the function-object.

File transform_inplace.hh

Take into account more properties; see data/transform.hh.

File transform_line.hh

Import code from sandox/geraud/browsing/fwd.cc to handle the case of no-domain-extension.

Specialize for fastest images.

File transform_snake.hh

Make it n-D.

Split dispatch and impl.

Pass the accumulator to the function-object.

File transformed_image.hh

It is a rough code.

File unqualif.hh

Handle (or not) 'T*'.

File util/array.hh

Zed: Add a lazy removal method (based on an extra attribute std::vector<bool> has_). Then add a purge/compress method.

File util/couple.hh

revamp and refactor with util::site_pair or ord_pair.

File util/pix.hh

Rename as util::pixel.

Think about separating this class between util::pixel<"mutable" I> and util::pixel<const I>.

Look at the todo entry of mln/core/pixel.hh.

File util/set.hh

Clean code and test!

Zed: Group methods into 2 categories: when frozen, when not.

File utils.hh

Remove this file after ./data.hh is completed!

File value/all.hh

Incomplete list of files.

File viter.hh

Proxify it!

File weighted_window.hh

Make sym() be optional.

File win_chamfer.hh

Revamp!

File window.hh

Make naming coherent: we have window (without '_') but point_, neighb_, etc.

Code other comparisons (< and <=).

Add static checks in insert methods.

Rename dps_hook_ as util_set_.

File window/props.hh

Precise the differences (?) between dynamic, growing, and free...

File zero.hh

Macro-ification of similar code (when no trivial conversion ops are involved).