Cache Mr

Somebody once told me the world is loop unrolling

[Cache Mr @moskupols]

@Roniakia @gaan_onder в русском есть такое нарицательное, но конечно непонятно, причём здесь оно https://t.co/s5W1iqWzoO

[Cache Mr @moskupols]

@lemire Another approach is to pass a generic lambda to itself as continuation:
auto fact = [](auto self, int n) {
if (n == 0) {
return 1;
} else {
return n * self(self, n - 1);
}
};
fact(fact, 10)

[Cache Mr @moskupols]

@Nekrolm std::to_array<T>({A, B, C})

[Cache Mr @moskupols]

@nikitonsky set cursorcolumn enables that in vim

[Cache Mr @moskupols]

@alphyna

[Cache Mr @moskupols]

@norpadon @Nekrolm https://t.co/sTvEOoSMqQ

[Cache Mr @moskupols]

@Nekrolm усиливаем:
const std::same_as<Data> auto& data = data_;

[Cache Mr @moskupols]

@__phantomderp Right, I forgot that we may want to support value_type that is not char, and so is not blessed to alias other types

[Cache Mr @moskupols]

@__phantomderp I believe folly strings do that in short mode

[Cache Mr @moskupols]

@__phantomderp You can probably save up on space for that 0-terminator if instead of size you maintain (capacity-size) right after the data. This way once size reaches capacity, a zero byte after data will be both a terminator and part of correct (capacity-size)

[Cache Mr @moskupols]

@AyxanHaqverdili @shafikyaghmour To add some cursedness, I believe there's no need for immediately invoked lambda, a conditional operator should work as well

[Cache Mr @moskupols]

@rationaleks @outofcontextlog если интересно, вот вики glibc https://t.co/JjKjFs4KxB , а вот лекция Фёдора Короткого про jemalloc https://t.co/qn0RLJqSfI

[Cache Mr @moskupols]

@rationaleks @outofcontextlog Аллокаторы редко делают сисколл, даже glibc

[Cache Mr @moskupols]

@janwilmans division of positive integers, rounding up?

[Cache Mr @moskupols]

@ursofuckinghot хороший семпл получился

[Cache Mr @moskupols]

@Nekrolm а memset(this, 0, sizeof(*this)); было бы UB даже для Trivial типов?

[Cache Mr @moskupols]

@norpadon в Амстердаме в пекарнях есть

[Cache Mr @moskupols]

@turbojedi hell of a rig you got there brother

[Cache Mr @moskupols]

@PeterSommerlad For example, something like boost's static vector may employ this optimization when the elements are trivial

[Cache Mr @moskupols]

@PeterSommerlad Something like static_vector<std::array<int, N>, M>
It's trivially destructible yet may be expensive to move all the elements

[Cache Mr @moskupols]

@PeterSommerlad I feel like I should elaborate. There may be cases when default destructor is O(1) because the members are trivially destructible. We may however want an optimized implementation for move when we expect that usually only a part of the members need to be moved/copied