Hi here, need some help please. Here is a segment of code, i want it to run while waiting for user to press a key but it loops just once and stops. Any idea on what i should do? please (I want it to keep printing '1' till the key is entered. #include <ncurses.h> int main (void){ char press; while(press != 'q'){ printf("1"); press = getch(); } printf("You pressed 'q'"); } Thank you

or your code is mistyped lol

corrected the message. 😶

Hi here, need some help please. Here is a segment of code, i want it to run while waiting for user to press a key but it loops just once and stops. Any idea on what i should do? please (I want it to keep printing '1' till the key is entered. #include <ncurses.h> int main (void){ char press; while(press != 'q'){ printf("1"); press = getch(); } printf("You pressed 'q'"); } Thank you

try 'do while { }' instead also

try 'do while { }' instead also

yeah it was as example

Youre reading uninitialized variable

In which office? Moscow? USA? Israel?

'\0' sufffice

Then either find a nonblocking function or setup the library to make getch() nonblocking. I remembered ncurses lib has that capability.

wow thanks but that's way over my ability at the moment. so...💤

Can anyone help me decode the meaning of chrono::steady_clock::now().time_since_epoch().count(); What I read that is steady_clock acts like a stop watch and does not tell the current time time_since_epoch means that the no. of seconds that have passed since 1jan, 1970(count() simply returns the no. of seconds) But, I don't get its meaning when combined.

std::chrono::steady_clock::now() returns a std::chrono::time_point<std::chrono::steady_clock> https://en.cppreference.com/w/cpp/chrono/time_point

yeah, I understand that but don't get the meaning of the line in totality. I mean what does time_since_epoch().count() mean in addition to this?

Hi, I'm new of language C, have one tutorial free good for begginers?

std::chrono::steady_clock is a clock. clocks have an epoch (which is probably not the UNIX epoch, as you have assumed) and a tick rate. std::chrono::time_point<std::chrono::steady_clock> stores a particular moment of the clock. time_since_epoch() produces the duration between the captured state (time_point) and the epoch of steady_clock. count() casts the duration to number of ticks of the steady_clock.

Perfect, great code. Especially I like a,b,c,d,e,f but g is missing. why?

Hex?

What do you mean by that?

Hex is 0-9 and a-f only

Hex is 0-9 and a-f only

Was it sarcastic?

No? 🤔

Cmon, do not give any variable name like alphabet.

Ohhh, I didn't really read the context

Hex?

It was sarcastic ofc.

Can I search for the element in unordered_map but if it's not found have an iterator that I can use as a hint for the insertion instead of end iterator?

Can I search for the element in unordered_map but if it's not found have an iterator that I can use as a hint for the insertion instead of end iterator?

can I get some help?

How to better achieve this behavior: I need to add element to unordered_map if it's not there But if it is already there I need to perform some specific logic with the value in the map (possibly remove it from the map, to change the key). I wan't to make as less searches as possible. I tried to use emplace and use the returned iterator and bool, but it turned out that if the element was there and no insertion happened, then the iterator doesn't point to the element in the container (at least I can't delete the element with the iterator).

How to better achieve this behavior: I need to add element to unordered_map if it's not there But if it is already there I need to perform some specific logic with the value in the map (possibly remove it from the map, to change the key). I wan't to make as less searches as possible. I tried to use emplace and use the returned iterator and bool, but it turned out that if the element was there and no insertion happened, then the iterator doesn't point to the element in the container (at least I can't delete the element with the iterator).

In C++17 theres try_emplace

👍 wonder why they didn't just change behaviour of emplace regarding this is it not to break existing code that depends on the fact that the rvalue object passed to emplace always getting moved 🤔

guys is there a reason why vscode with gcc on linux (ubuntu) would not show the line where a segmentation fault happened? I'm using gdb as debugger, the program execution halts when it reaces the line that causes the seg fault, but it doesn't highlight it. The call stack says paused on exception, I kinda know why there is that issue: I had linked lists, but the list was not initialized to NULL at first, at a certain point I was trying to use a printf with a string and obviously broke when it reached the garbage data, halting the program. If I run the executable directly I get in the terminal "Segmentation Fault", but vscode halts without the usual notice. There is no reason why it should hide the highlight and banner since anything else like another type of segmentation fault (trying to read a non allocated memory, dividing by zero, ect..) all give out the right banner/highlight

Meyers once explained that, you may search on yt if interested

Did you pass -g flag to gcc?

sorry for the wall of text

It's much better than sending bunch of short messages or asking with too little information.