dymons / dsac Goto Github PK

The current implementation of dsac::future does not have part of the required API

• Implement a specialization for dsac::future / dsac::promise / dsac::result
• Implement a specialization for dsac::mvar<T>::try_with_lock -> void

The algorithm should not know about the details of the binary tree implementation. It is necessary to create a concept in order to limit the scope of use of various implementations of the binary tree. Only for those who know how to work with duplicate values.

Each time an object is created, memory allocation is performed on the heap. Objects whose size is smaller than a machine word must be allocated on the stack with the use of technology Small Object Optimization

A dynamic array in its current implementation does not have the following functionality.

• move constructor
• assigns values to the container by using assign(...)
• access the first element
• access the last element
• direct access to the underlying array
• returns a reverse iterator to the beginning
• returns a reverse iterator to the end
• returns the maximum possible number of elements
• reserves storage
• reduces memory usage by freeing unused memory
• inserts elements
• constructs element in-place
• erases elements
• constructs an element in-place at the end
• removes the last element
• changes the number of elements stored
• swap method
• lexicographically compares the values in the vector

When the REQUIRED macro is used in multithreaded execution, this leads to a data race in the library. An example of such a performance can be reproduced within this test: