mirror of
https://github.com/RGBCube/serenity
synced 2025-05-15 08:34:59 +00:00
aa4d41fe2c
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. |
||
|---|---|---|
| .. | ||
| CPU.h | ||
| DescriptorTable.h | ||
| Interrupts.h | ||
| ISRStubs.h | ||
| PageDirectory.h | ||
| ProcessorInfo.h | ||
| SafeMem.h | ||
| SmapDisabler.h | ||
| TSS.h | ||