k

I'll debug it and watch all the variables till it crashes.. I'll update you @TheLonelyAdventurer

does it close or something like that

Anyway if you have a while(true) kind of loop, you could expect NOMEM related errors if you didn't clean something

yea I do

Bruh

Is there any c# group i can join?

Yes you can. It's called operator precedence

hey Longest Substring Without Repeating Characters in c can anyone please guide me

First one

Google operator precedence

What?

What are you trying to achieve

Then this will work

Guys can anyone help me with this

I'm looking for a good project to jump back to cpp. Any suggestions?

I have a question for programmers can i copy the .cpp code and put it in .h ?

I do not want to use more than three .cpp

I have a question for programmers can i copy the .cpp code and put it in .h ?

why not copying .h files into a single .cpp file?

can I do this ?

yes but is a bad practice for large projects

if yours is small enough then its okay

but entry point must be in cxx file, as I know

Thanks dima

I have a question for programmers can i copy the .cpp code and put it in .h ?

You can, but if you can separate them, it's better as you avoid recompilations

Sometimes you can't separate them, as it happens with template and constexpr code

Quick Question: Which one of these is easier to understand and use: SFML or Qt GUI libraries?

is above ans is correct for this ques?

No, it shouldn't be. Check the warnings you get when compiling.

quick question... i do auto it = map.begin(); it--; NEED TO CHECK HERE IF ITERATOR IS STILL VALID

can i do this somehow? i have hashmap of lower-upper bounds and I only store upper bound, getting lowerbound as previous items upper bound so i can do it—;

quick question... i do auto it = map.begin(); it--; NEED TO CHECK HERE IF ITERATOR IS STILL VALID

Do you know that decrementing the begin iterator is probably undefined behaviour?

hmm it works doe

any other way i could approach this?

But what do you want to achieve by decrementing a begin iterator?

i don't want to decrement begin iterator -> i am doing this, look

Weird

I did what he asked for

quick question... i do auto it = map.begin(); it--; NEED TO CHECK HERE IF ITERATOR IS STILL VALID

It will never be valid

let's say i have a table filled up with data char <> upper_bound i want to retreive upper bound of char? simple map.find(given_char)... i want to retreive lower bound? I know, that lowerbound is upper bound of previous item and since its unordered map i can do... auto it = map.find(given_char) it—; it->second; MY SEARCHED LOWER BOUND

but what if I am going for first element that has upperbound of lets say 0.2 and lower bound of 0 of course... in this situation, it'll do first_element_iterator— and that's not valid

and i wan't to check for this situation somehow to simply return 0

The heck

Whats type of map?

just (ordered) std::map

No, it has a type

lets say <char, float>

Ok, so how do you store lower bound of first char?

just (ordered) std::map

There're like 4 different map containers in the STL, so just a map is not enough info

https://en.cppreference.com/w/cpp/container/map just this one, and it doesn't even matter if it's map / dictionary call it whatever you want and it's ordered

Ok, so how do you store lower bound of first char?

i do not, i am getting it from previous entry, that's what this si all about

https://en.cppreference.com/w/cpp/container/map just this one, and it doesn't even matter if it's map / dictionary call it whatever you want and it's ordered

Okay, now we're talking

but what if I am going for first element that has upperbound of lets say 0.2 and lower bound of 0 of course... in this situation, it'll do first_element_iterator— and that's not valid

Maybe you could add another element which will always be first in map

Like \0

Maybe you could add another element which will always be first in map

hmmm yeah that kinda makes sense

but isn't there something "nicer"?

what if'll need to use map.size() somehow and this will mess it up

Without comparing with map.begin()? No

of course ~ i can do -1 but still

well but how would you compare it to map.begin()

Just write a function to get lower bound

like it—; if(it < map.begin()) return 0;

like it—; if(it < map.begin()) return 0;

First check, then decrement

hmm okay, makes sense

yup i guess i can do that thanks

also i may store lower bound and do it++ while checking for map.end()

since i know that the top bound will always be 1

thanks tho

In C89, at the beginning, otherwise you're free to do it anywhere you want.

I'm not sure about style, though.

it says a pointer that it is the same when you’ll try to use it, not modified so it won’t be load’d again

if I remember it properly..

microoptimizations

it says a pointer that it is the same when you’ll try to use it, not modified so it won’t be load’d again

no

restrict pointers to a range of memory will mever overlap

but I am kinda correct too

but I am kinda correct too

no, restrict is about overlap. memcpy(void *restrict, void *restrict, size_t); memmove(void *, void *, size_t);

no, restrict is about overlap. memcpy(void *restrict, void *restrict, size_t); memmove(void *, void *, size_t);

use memcpy when you are sure that areas doesn't overlap; otherwise use memmove

no, restrict is about overlap. memcpy(void *restrict, void *restrict, size_t); memmove(void *, void *, size_t);

oh, gotta recall this stuff:)

Hello everyone i have a question , should i start learnning C language or go directly to C++ ???

Hello everyone i have a question , should i start learnning C language or go directly to C++ ???

some will recommend c, some will recommend c++