Performance overhead of standard containers and boost [closed]
There are several rules that we are obeying in order to keep the performance high;
Avoid malloc(), calloc() or new
No free() or delete (and no need for tcmalloc)
No STL, boost etc.
Avoid locking as much as possible
# threads = # CPU cores (hyperthread is a trade-off between latency and throughput)
Languages with graph data structures and algorithms in standard library
I am trying to improve my knowledge and ability with graphs and graph algorithms and have noticed something curious: as far as I can tell no “mainstream” language contains support for graphs in its standard library. Trees yes, graphs no. The only language that comes even remotely close is C++ with Boost (which isn’t technically a “standard library”)
Why isn’t there a typeclass for functions?
In a learning problem I’ve been messing around with, I realised I needed a typeclass for functions with operations for applying, composing etc. Reasons…
Why do all functions take only ranges, not containers?
There are many useful functions in <algorithm>, but all of them operate on “sequences” – pairs of iterators. E.g., if I have a container and like to run std::accumulate on it, I need to write:
Why do all functions take only ranges, not containers?
There are many useful functions in <algorithm>, but all of them operate on “sequences” – pairs of iterators. E.g., if I have a container and like to run std::accumulate on it, I need to write:
Why do all functions take only ranges, not containers?
There are many useful functions in <algorithm>, but all of them operate on “sequences” – pairs of iterators. E.g., if I have a container and like to run std::accumulate on it, I need to write:
Why do all functions take only ranges, not containers?
There are many useful functions in <algorithm>, but all of them operate on “sequences” – pairs of iterators. E.g., if I have a container and like to run std::accumulate on it, I need to write:
Why do all functions take only ranges, not containers?
There are many useful functions in <algorithm>, but all of them operate on “sequences” – pairs of iterators. E.g., if I have a container and like to run std::accumulate on it, I need to write:
Is there a stricter strtoull() in any ubiquitous C library?
I want a function that will interpret a string as a strictly unsigned integer, failing when the string overflows, represents a negative number, or does not represent a number.
Is there a stricter strtoull() in any ubiquitous C library?
I want a function that will interpret a string as a strictly unsigned integer, failing when the string overflows, represents a negative number, or does not represent a number.