Nicholas Baron
aa4d41fe2c
AK+Kernel+LibELF: Remove the need for IteratorDecision::Continue
...
By constraining two implementations, the compiler will select the best
fitting one. All this will require is duplicating the implementation and
simplifying for the `void` case.
This constraining also informs both the caller and compiler by passing
the callback parameter types as part of the constraint
(e.g.: `IterationFunction<int>`).
Some `for_each` functions in LibELF only take functions which return
`void`. This is a minimal correctness check, as it removes one way for a
function to incompletely do something.
There seems to be a possible idiom where inside a lambda, a `return;` is
the same as `continue;` in a for-loop.
2021-05-16 10:36:52 +01:00
..
2021-05-08 19:15:54 +02:00
2021-05-14 23:32:10 +02:00
2021-05-16 10:36:52 +01:00
2021-05-15 17:43:45 +01:00
2021-05-16 10:36:52 +01:00
2021-05-15 16:30:14 +02:00
2021-05-05 18:48:26 +02:00
2021-04-22 11:22:27 +02:00
2021-05-15 09:46:50 +02:00
2021-05-01 21:25:06 +02:00
2021-05-15 19:45:44 +02:00
2021-05-16 10:36:52 +01:00
2021-04-22 11:22:27 +02:00
2021-05-15 18:08:41 +02:00
2021-05-16 10:36:52 +01:00
2021-05-15 23:29:03 +01:00
2021-05-16 10:36:52 +01:00
2021-04-22 21:15:54 +02:00
2021-04-22 21:15:54 +02:00
2021-04-22 11:22:27 +02:00
2021-05-13 18:52:48 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-05-13 23:28:40 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 22:51:19 +02:00
2021-04-22 11:22:27 +02:00
2021-05-14 13:28:21 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-04-29 08:09:53 +02:00
2021-04-29 08:09:53 +02:00
2021-04-22 11:22:27 +02:00
2021-04-29 00:59:26 +02:00
2021-04-29 00:59:26 +02:00
2021-04-29 20:26:36 +02:00
2021-04-22 11:22:27 +02:00
2021-05-13 16:21:53 +02:00
2021-05-13 16:21:53 +02:00
2021-05-13 08:27:42 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-04-28 22:14:32 +02:00
2021-04-22 11:22:27 +02:00
2021-03-04 18:25:01 +01:00
2021-04-25 09:38:27 +02:00
2021-04-25 09:38:27 +02:00
2021-04-29 00:59:26 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-05-16 10:36:52 +01:00
2021-05-14 00:35:57 +02:00
2021-05-14 00:35:57 +02:00
2021-04-22 11:22:27 +02:00
2021-05-16 10:36:52 +01:00
2021-05-16 10:36:52 +01:00
2021-04-23 16:46:57 +02:00
2021-04-22 11:22:27 +02:00
2021-04-25 09:38:27 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-05-16 10:36:52 +01:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-04-29 20:26:36 +02:00
2021-04-22 11:22:27 +02:00
2021-04-29 20:26:36 +02:00
2021-05-16 10:36:52 +01:00
2021-05-16 10:36:52 +01:00
2021-05-05 18:51:06 +02:00
2021-04-22 11:22:27 +02:00
2021-05-13 16:21:53 +02:00
2021-05-05 18:51:06 +02:00
2021-04-22 11:22:27 +02:00
2021-05-15 09:00:29 +02:00
2021-04-22 11:22:27 +02:00
2021-05-14 23:32:10 +02:00
2021-04-22 11:22:27 +02:00
2021-04-22 11:22:27 +02:00
2021-05-13 23:28:40 +02:00
2021-04-22 11:22:27 +02:00
2021-04-29 00:59:26 +02:00
2021-04-29 00:59:26 +02:00
2021-04-29 00:59:26 +02:00
2021-04-29 00:59:26 +02:00