pretty sure that I love somebody else 🤔

❤️

❤️

mhh I don't remember wether it was you 💜

purple

you are a good boy anyway

#friendzoned >:D

UwU blue is best tho

#friendzoned >:D

im glad tho

💙

ot af

meh lets not care for once

"ONCE"

¯\_(ツ)_/¯

xD

IMAGINE YOUR NEXT C++ LOOK LIKE: auto tup = std::make_tuple(0, ‘a’); for... (auto& elem : tup) // Expansion statements elem += 1; [[assert: tup == make_tuple(1, ‘b’)]]; // Contracts

wait

what would for ... do?

what would you do with [[ assert: ]]? would that be a kind of static asser thing?

what would you do with [[ assert: ]]? would that be a kind of static asser thing?

It's called Contracts

It's called Contracts

contracts?

contracts?

https://dlang.org/spec/contracts.html

2 minutes read

i mean C++ has asserts already

or static asserts

i mean C++ has asserts already

But i doesn't have [[expects: f > 2]] void open(int f) { }

https://dlang.org/spec/contracts.html

C++ needs them

But i doesn't have [[expects: f > 2]] void open(int f) { }

it doesnt

which

is sad

WE NEED CONTRACTS

WELKRFJ YALÖSWOKDJHFPÖ-OU

WE NEED FUCKING CONTRACTS

IMAGINE YOUR NEXT C++ LOOK LIKE: auto tup = std::make_tuple(0, ‘a’); for... (auto& elem : tup) // Expansion statements elem += 1; [[assert: tup == make_tuple(1, ‘b’)]]; // Contracts

for... ?

WE NEED FUCKING CONTRACTS

You understand it now ?

You understand it now ?

WE NEED FUCKING CONTRACTS RIGHT NOW

for... ?

what does for... do?

what does for... do?

It's called "Expansion statements", just added in recent San Diego meeting.

what does it do?

Wait a minute

okay

This paper proposes a new kind of statement that enables the compile­time repetition of a statement for each element of a tuple, array, class, parameter pack, or range.

Any facility that needs to traverse the elements of a heterogeneous container inevitably duplicates this kind of repetition using recursively instantiated templates, which allows some part of the repeated statement to vary (e.g., by type or constant) in each instantiation.

While this behavior can be encapsulated in a single operation (e.g., Boost.Hana’s for_each template), there are a number of reasons we would prefer language support. First, repetition is a fundamental building block of algorithms. We should be able to express that concept directly rather than through recursively instantiated templates.. Second, we’d like that repetition to be as inexpensive as possible. Recursively instantiating templates generates a large number of template specializations, which can end up consuming a lot of compiler memory and compile time. Finally, we’d like the ability to “iterate” over both destructible classes and parameter packs, and both effectively require language support to implement correctly.

PARAMETER PACK LOOPSSSS

❤️❤️❤️❤️❤️❤️❤️❤️

would make this wayy less ugly

Haha

Let me give u the cookie

i want cookie too

for... (auto x : make_tuple(0, ‘a’, 3.14)) std::cout << x;

i

love

this

this

is

so

beautiful

❤️❤️❤️❤️

read the full paper here: https://wg21.link/P1306

This is one of the better things THE COMMITTE has done in the last few years

if only they could fucking add network

if only they could fucking add network

C++23, I'm pissed

same

Any twitch canal c++ is recommended?

What is the best option recursivity or loops

Thank q

Hi

hi, how i can read the spaces from a string?

hey

can i use c in web development

can i use c in web development

You can write code that generates websites in any language. The output must be HTML.

Thanks.....

which is the best ide for c/c++

VSC

If you want only the editor or VS C++ for C++.

Community edition is free.

thanks

Hello. Am I able to ask anything about C language in this group. I mean to help me find the solution if I got error on my code. The pinned message look really strict 🤐

Hello. Am I able to ask anything about C language in this group. I mean to help me find the solution if I got error on my code. The pinned message look really strict 🤐

You can ask as long as the question/problem isn't too dumb and can be solved via a simple google search