Summary: 269 instances, 112 unique

Text	Count
* TODO: DOCUMENT AND TEST. ALSO TEST bool SPECIAL CASE	1
// TODO: REFINE THE INTERFACE	1
// TODO: MAKE IT FOUR WAY QUICK SORT??	1
* TODO: BIKE-SHED	1
// TODO: REPLACE char FOR value_type EVERYWHERE	1
* TODO: IT SHOULD INSERT AFTER A SPECIFIC KEY, OR END OF MAP IF NOT FOUND	1
// TODO: OPTIMIZE	1
// TODO: OPTIMIZE COMPILE TIMES	1
/* TODO: support multiple namespace scope definitions:	1
// TODO: INVERT COMPARER AND FILTER	1
// TODO: ACCEPT A CUSTOM PREDICATE	1
// TODO: ONLY IF traits HAS empty()	1
// TODO: RETURN SIZE?	1
// TODO: DOCUMENT AND TEST	35
// TODO: ADD FILTERED VARIANT	2
#include <fatal/type/fast_pass.h> // TODO: REMOVE AND FIX DEPENDENCIES	1
* TODO: DOCUMENT	52
// TODO: output date in an absolute format	1
::std::cerr << "TODO (aborting): " << Message << ::std::endl; \	1
// TODO: FIX PREDICATE FOR SEQUENCES	1
// TODO: implement find (sublist)	1
// TODO: split into pre, post and depth	1
(L < R) ? -1 : (R < L) ? 1 : 0 // TODO: USE PREDICATE	1
// TODO: DOCUMENT & PROPERLY TEST	1
// TODO: REMOVE name	1
// TODO: Implement a version for  sequences	2
// TODO: DOCUMENT REQUIREMENTS OF PREDICATE	1
// TODO: REMOVE THESE HEADERS WHEN A PROPER SORT FOR SEQUENCES IS IN	1
// TODO: IMPLEMENT `try_getter` (with has, should be data_member_getter's)	1
// TODO: Update docs	1
// TODO: speed up search using interpolation search	1
// TODO: make it a customizable container	1
// TODO: DOCUMENT AND TEST	8
// TODO: OFFER THIS LIST AS AN INTERNAL HIGHER ORDER MACRO	1
// TODO: ASSERT THE LIST IS SORTED	1
// TODO: DOCUMENT	2
// TODO: DOCUMENT, TEST AND BIKE-SHED	1
// TODO: document and test	1
// TODO: REVIEW / MOVE SOMEWHERE ELSE / GENERALIZE / ...	1
// TODO: SMARTER CALCULATION OF PADDING SIZE	1
* TODO: DOCUMENT AND TEST	16
* TODO: TEST	4
* TODO: Test additional args	1
// TODO: OPTIMIZE	2
// TODO: MOVE TO ANOTHER HEADER	2
// TODO: TEST DEFAULT METAFUNCTION	1
// TODO: use `non_negative(size)` to avoid tautological comparison error	1
// TODO: ADD MISSING noexcept DECLARATIONS	1
// TODO: Implement in logarithmic time	1
// TODO: REDUCE TEMPLATE INSTANTIATIONS	1
// TODO: OVERLOAD FOR ANY CONTAINER	2
// TODO: DOCUMENT THE NEED FOR A SORTED LIST	1
// TODO: IMPLEMENT USING fnv32	1
// TODO: PROPERLY DECLARE noexcept	3
counter check_interval = 1000 // TODO: smarter default value	1
// TODO: SKIP 2 AT A TIME	3
// TODO: MAKE IT CONFIGURABLE	2
* TODO: DOCUMENT	16
//* TODO: REMOVE WHEN compare() GETS OPTIMIZED	1
// TODO: IMPLEMENT `has`	1
// TODO: UPDATE DOCS AND SUPPORT MORE THAN TWO LISTS	1
// TODO: MOVE TO MATH	1
// TODO: MOVE THE CALLABLE OBJECTS OUT OF DATA_MEMBER_GETTER	1
// TODO: allow assumption on types that don't have an `out << value` overload	1
// TODO: use something other than std::vector ??	1
// TODO: REVIEW THIS IMPLEMENTATION	1
// TODO: uniquify?	1
* TODO: update docs and tests for multiple predicates	3
// TODO: OPTIMIZE BY EXPANDING THE q LIST INTO A PAIR(FILTERED, T)??	1
*  TODO: DOCUMENT AND TEST	1
* TODO: DOCUMENT AND TEST	6
// TODO: switch `char` piece with array+size, taking up the same space as the	1
// TODO: make it variadic	1
// TODO: write in terms of `recursive_transform`	1
// TODO: switch statement optimization	1
// TODO: do it in logarithmic time	5
// TODO: USE A BETTER PIVOT	2
// TODO: copy pieces which are single characters	1
// TODO: binary search for the given index	1
* TODO: TEST Default	1
// TODO: current compilers don't implement std::is_trivially_constructible<T>	1
// TODO: ADD THE ABILITY TO TURN VERBOSE LOGGING ON AND OFF	1
// TODO: USE source_info HERE	1
// TODO: shrink_to_fit, pop_back, prevent growth (T4534263)	1
* TODO: review recursive_transform now that we have this	1
// TODO: RE-CHECK AND REMOVE DEFINES	1
// TODO: RETURN SIZE?	1
// TODO: POPULATE WITH WELL KNOWN MEMBER TRANSFORMS	1
* NOTE: TODO: not supposed to be instantiated by the user	1
// TODO: IMPLEMENT CONVERSION FOR OTHER TYPES TOO	1
// TODO: HIGHER LOG BASE OPTIMIZATION (3 or 4 should be enough)	1
// TODO: DOCUMENT	5
* TODO: FIX DOCS	1
// TODO: SWITCH CASE OPTIMIZATION	1
//* TODO: CHOOSE AN IMPLEMENTATION	1
// TODO: BENCHMARK THE TEST FILE BY EXPLOITING TYPE DEDUCTION ON SPECIALIZATIONS	2
// TODO: HIDE operator == WHEN `T` DOESN'T SUPPORT IT	1
// TODO: SPECIALIZE FOR POWERS OF TWO ABOVE 64bits: USE HASH COMBIME	1
// TODO: TEST	4
// TODO: DOCUMENT AND PROPERLY TEST	2
// TODO: optimize this, either with a duff's device or some function	1
// TODO: after C++17, switch to param-pack folds	1
// TODO: IMPLEMENT USING fnv64	1
// TODO: IMPLEMENT `try_get` (with has, should be data_member_getter's)	1
// TODO: ALLOW SHORT-CIRCUITING	1
// TODO: MAKE IT POSSIBLE TO NEST AGGREGATORS	1
// TODO: PROPERLY FORMAT CODE	1
// TODO: bike-shed	1
// TODO: accept a variadic number of lists to concat	1
// TODO: ADD TESTS TO AVOID DOUBLE MOVES	1
* TODO: review member_transform_stack now that we have this	1
// TODO: ONLY IF traits HAS clear()	1