[*] Formatting

[*] Revert-revert formatting
This commit is contained in:
Reece Wilson 2022-03-25 18:08:26 +00:00
parent c0b0be52b1
commit 6fd844dae8
3 changed files with 17 additions and 17 deletions

View File

@ -13,27 +13,27 @@
#include "auIntegerSequence.hpp" #include "auIntegerSequence.hpp"
#if !defined(AURORA_RUNTIME_MAKE_PAIR) #if !defined(AURORA_RUNTIME_MAKE_PAIR)
#define AURORA_RUNTIME_MAKE_PAIR std::make_pair #define AURORA_RUNTIME_MAKE_PAIR std::make_pair
#endif #endif
#if !defined(AURORA_RUNTIME_MAKE_TUPLE) #if !defined(AURORA_RUNTIME_MAKE_TUPLE)
#define AURORA_RUNTIME_MAKE_TUPLE std::make_tuple #define AURORA_RUNTIME_MAKE_TUPLE std::make_tuple
#endif #endif
#if !defined(AURORA_RUNTIME_GET_TUPLE) #if !defined(AURORA_RUNTIME_GET_TUPLE)
#define AURORA_RUNTIME_GET_TUPLE std::get # define AURORA_RUNTIME_GET_TUPLE std::get
#endif #endif
#if !defined(AURORA_RUNTIME_TUPLE_CAT) #if !defined(AURORA_RUNTIME_TUPLE_CAT)
#define AURORA_RUNTIME_TUPLE_CAT std::tuple_cat #define AURORA_RUNTIME_TUPLE_CAT std::tuple_cat
#endif #endif
#if !defined(AURORA_RUNTIME_TUPLE_SIZE) #if !defined(AURORA_RUNTIME_TUPLE_SIZE)
#define AURORA_RUNTIME_TUPLE_SIZE std::tuple_size #define AURORA_RUNTIME_TUPLE_SIZE std::tuple_size
#endif #endif
#if !defined(AURORA_RUNTIME_APPLY) #if !defined(AURORA_RUNTIME_APPLY)
#define AURORA_RUNTIME_APPLY std::apply #define AURORA_RUNTIME_APPLY std::apply
#endif #endif
template<typename... Args> template<typename... Args>

View File

@ -9,9 +9,8 @@
/** /**
It is not unusual for one to desire a unit-conversion constant when the developer understands It is not unusual for one to desire a unit-conversion constant when the developer understands
[*] FPU isn't available [*] An FPU isn't available
[*] Can be done quickly without a framework [*] Using a framework to normalize to a base unit(?), apply a translation, and return the desired reuslt is considered overkill
[*] Using a framework to normalize to a base unit, apply a translation, and return the desired reuslt is considered overkill
These functions are not to be converted into such a convoluted templated potentially-constexpr castable mess These functions are not to be converted into such a convoluted templated potentially-constexpr castable mess
The intention is to keep these utility functions as simple as the dumb operations they implement The intention is to keep these utility functions as simple as the dumb operations they implement
*/ */

View File

@ -196,14 +196,15 @@ POSIX:
## Loop ## Loop
The Aurora Runtime implements a loop concept similar to macos's RunLoop or BSD's kevent. On Mach platforms, kevent objects can The Aurora Runtime implements a kernel-scheduler optimized IO subsystem for managing Window, Network, File, IPC, and thread
be passed to loop sources. On BSD platforms, kevent objects can be used to synchronize against a wait any condition. On Linux, synchronization objects through loop the loop subsystem.
io_submit with epoll semantics can be used instead. NT, surpisingly where WaitForMultipleObjects is common, has the worst
abstraction. Either way, all modern platforms provide a way to join file handles, an object from which you can derive any othe Loop sources are an interface defined by the loop subsystem for objects with a signalable state. Attached to a LoopQueue, the
thread primitive from, semaphores, mutexes, network sockets, and asynchronous file transactions together. Aurora Runtime is LoopQueue will provide a Wait-on related functions and subscription notifications of signal state change - allowing for optimized
implementing a loop source object and wait for any utility to solve this fiddly and complex abstraction. This should allow for loop source removal or reinsert hints from the return values of the subscription interface. In addition, the ILoopSource interface
non-bruteforced low thread count work groups to work on queues of ipcable objects across platforms with low synchronization permits arbitrary is-signaled-and-latch (TryLock) queries.
overhead.
## Thread Primitives ## Thread Primitives