LUMIERA.clone/tests/basics
Ichthyostega fef0c05b64 Job-Planning: base implementation of job instance creation
* using a simplified preliminary implementation of hash chaining (see #1293)
 * simplistic implementation of hashing for time values (half-rotation)
 * for now just hashing the time into the upper part of the LUID

Maybe we can even live with that implementation for some time,
depending on how important uniform distribution of hash values is
for proper usage of the frame cache.

Needless to say, various further fine points need more consideration,
especially questions of portability (32bit anyone?). Moreover, since
frame times are typically quantised, the search space for the hashed
time values is drastically reduced; conceivably we should rather
research and implement a good hash function for 128bit and then combine
all information into a single hash key....
2023-04-30 22:33:42 +02:00
..
time
call-queue-test.cpp
dependency-configuration-test.cpp
dependency-factory-test.cpp
diagnostic-context-test.cpp
DIR_INFO
singleton-subclass-test.cpp
singleton-test.cpp
singleton-testmock-test.cpp
stream-type-basics-test.cpp
stream-type-lifecycle-test.cpp
test-target-obj.hpp
teststreamtypes.hpp
typed-counter-test.cpp
typed-family-member-id-test.cpp
visitingtool-concept.cpp
visitingtool-extended-test.cpp
visitingtool-test.cpp
zombie-check-test.cpp