CLINL takes about 30 seconds lol

CLINL takes about 30 seconds lol

no, by looking at your code of course not. You would never memcpy an array. you copy a vector

clinl is fairly small

IT TAKES LONGER TO COMPILE

I std::move that ;)

Why is that a problem? A program(unless it's written by you, lol) is more often ran, than compiled. Therefore it's better to do AS MUCH AS YOU CAN at compile time. That's the whole idea behind constexpr, static casts, static assert, templates...

you barely have 1000 lines

Why is that a problem? A program(unless it's written by you, lol) is more often ran, than compiled. Therefore it's better to do AS MUCH AS YOU CAN at compile time. That's the whole idea behind constexpr, static casts, static assert, templates...

the code we write is already over 10 minute compile time

let it slide, he belongs to school

How many LoC?

I wish you were right, but there are so much people like him outside school :D

about 35k lines

*raises an eyebrow* 10 minutes?

about 35k lines

yes because we do use template metaprogramming

about 35k lines

wait aren'T you a C fanatic?

C++ is language I want to master. Should I work on creating simple programs or only study the booklet material?

C++ is language I want to master. Should I work on creating simple programs or only study the booklet material?

we even made our own hash maps because std::map was slow for us

you could have specialized its hashes and allocators to get it faster

Do you really need to compile all of this? I mean... you can just install the main project and recompile dlls you work with

std::map has no hashes

* unordered_map

only study what they tell you at university, else you might become better than the other students and we don't want that, right?

Which I hope is what he meant

yep it is an unordered map

I'm learning it alone. I learned how to compile my first few lines of code using GCC compiler. I guess that's a start.

What i meant was that i understood you found std::unordered_map slow

which is if i recall correctly an unordered map

std map is an ordered map

What about static maps? Do you have your own compile-time maps? Cause we do :D

well the insertion time was too slow

What about static maps? Do you have your own compile-time maps? Cause we do :D

std::map

compile time maps aren't always possible

Did you tried just using std::unordered_map ?

but i doubt it will make much of a difference

https://en.cppreference.com/w/cpp/container/unordered_map

it's rather slow as well. At cppcon there were severeal talks.

Not for insert in a very big thingy

"Google's Chandler Carruth explains this in his CppCon 2014 talk; in a nutshell: std::unordered_map is cache-unfriendly because it uses linked lists as buckets." [src](https://stackoverflow.com/a/42588384)

Google released their sparehash library several years ago. Unfortunately not updated for a long a time. However iirc they are working on a new one, which they presented partly at cppcon 2016 or 2017

ceres is fucking annoying ass fuck