Functions.cpp

Gn 6.5k ppl

Gn 6.5k ppl

Gn

Gn

<3

Functions.cpp

So what function should I look at?

So what function should I look at?

gameMechanics is the main part of the game

And it takes values returned from fillInLetters function

The generateRapperNames chooses a Rappers name randomly using rand function , then the gameMechanic functions allows users to guess the name

don't use rand()

don't use rand()

Why

because the c++ standard library has got better stuff

<random>

a full fucking header just for random numbers

because the c++ standard library has got better stuff

True , I think in few months I gonna read some better books I have about the standard library

a full fucking header just for random numbers

Lol

The generateRapperNames chooses a Rappers name randomly using rand function , then the gameMechanic functions allows users to guess the name

And where do you "need" this empty char?

And where do you "need" this empty char?

For example , if you look where the names of the Rappers are stored is in an string array

Some of the names have two words

So there is a space in between the names

But the game doesn’t recognize a space as an option ,

Because it accepts characters as a user input

Because it accepts characters as a user input

You can use std::getline

So that it'll store the whole name with the spaces

You can use std::getline

Wow 😮

Is that what you're asking?

Is that what you're asking?

Ima give it a shot

Ima give it a shot

https://en.cppreference.com/w/cpp/string/basic_string/getline here is a reference

https://en.cppreference.com/w/cpp/string/basic_string/getline here is a reference

Would this work with a char

Aren't you guessing whole names?

Wait so the issue is that cin will not input past a space, right?

I think I didn't understand you correctly

getline

I think that isn't what he's trying to tell me tho

Well I have to go to sleep now

So gn

Wait so the issue is that cin will not input past a space, right?

Yea I need it to be able to accept just a space

You guess one letter at a time

Yea I need it to be able to accept just a space

getline

getline

I tried but doesn’t work , maybe cuz it’s accepting input for a char

lmao, dude

getline works on strings

getline works on strings

Yea guy

It’s a char

just do string.c_str()

just do string.c_str()

I will look into it

just do string.c_str()

STD::cin.get

Smh

That works

I think that isn't what he's trying to tell me tho

std::cin.sync(); std::cin.get(letter);

That worked the sync

https://www.geeksforgeeks.org/create-dynamic-2d-array-inside-class-c/amp/

https://www.geeksforgeeks.org/create-dynamic-2d-array-inside-class-c/amp/

Can anybody explain this clearly?

Not a good practice to do that in C++ I guess. YOu’re proposed to use vector instead

Not a good practice to do that in C++ I guess. YOu’re proposed to use vector instead

And the code on g4g has memleak.

https://www.geeksforgeeks.org/find-the-next-lexicographically-greater-word-than-a-given-word/

can anybody explain the logic behind the code snippet for without using STL.

which one?

which one?

Sorry , that's by mistake posted.

can anybody explain the logic behind the code snippet for without using STL.

1. scaning from the back to the front of the string, try to find the first pair of two adjacent elements, say <*i, *ii>, statisfied *i < *ii. 1.1 if such pair was found, scanning from the back to the front of the string, try to find the first element statisfied *j > *i, and swap them, then, reverse [ii, last) and return true. 1.2 if such pair was not found, then, reverse [first, last) and return false.

1. scaning from the back to the front of the string, try to find the first pair of two adjacent elements, say <*i, *ii>, statisfied *i < *ii. 1.1 if such pair was found, scanning from the back to the front of the string, try to find the first element statisfied *j > *i, and swap them, then, reverse [ii, last) and return true. 1.2 if such pair was not found, then, reverse [first, last) and return false.

A easier impl of next_permutation show the above algorithm: template <typename BidirIter> bool next_permutation(BidirIter first, BidirIter last) { if (first == last or std::next(first) == last) { return false; } else /* lbi */; BidirIter i = std::prev(last); while (true) { BidirIter ii = i; --i; if (*i < *ii) { BidirIter j = last; while (!(*i < *--j)) /* lbi */; // using bsearch could be faster for random access iter. std::iter_swap(i, j); std::reverse(ii, last); return true; } if (i == first) { std::reverse(first, last); return false; } } }

😊

Lol he has left the group

-.-

Fail achieved

Fail achieved

muhahaha

he spammed it 4 times

.-:

.-:

MDR 9000

1. scaning from the back to the front of the string, try to find the first pair of two adjacent elements, say <*i, *ii>, statisfied *i < *ii. 1.1 if such pair was found, scanning from the back to the front of the string, try to find the first element statisfied *j > *i, and swap them, then, reverse [ii, last) and return true. 1.2 if such pair was not found, then, reverse [first, last) and return false.

Thank you , that's a clear explanation

https://developers.redhat.com/blog/2019/03/08/usability-improvements-in-gcc-9/

https://developers.redhat.com/blog/2019/03/08/usability-improvements-in-gcc-9/

Wow

So gn

Hey

hey bros

how you doing?

i ask you something on c++/qt

i created a function that copy html/tables to export excel in clipboard

google PoCo

but my problem is when i want to copy it, if i got any element this doesn't copy to the clipboard

it's my code

generator = QGuiApplication::clipboard(); QMimeData *d = new QMimeData(); Data = header + completeData + footer; d->setHtml(Data); generator->setMimeData(d);