It doesnt work

no error but why

That's not compiler

I seee GCC full form wht bro

Wht compiler this

Code block

I seee GCC full form wht bro

Code::blocks is not a COMPILER

Is this an automatic message?

Is this an automatic message?

Not sms but message

And yes

Code::blocks is not a COMPILER

GCC mins wht

And yes

Thanks, little teapot.

Hlo

Sorry bro just kidding

Hlo Mr klimi

Sry ya

Okay

Hlo Mr klimi

I saw it

I saw it

Just Iam kidding bro

Why lol bro

Nothing

K bye

Just Iam kidding bro

Ok

Give me one mini project of c

Go on github

Revive dead projs

Like mine!

谢谢

/cppbook

Its

Fucking hashtag

#cppbooo

#cppbooo

Ariana i sůl f ksifnskf keksoc

Ariana i sůl f ksifnskf keksoc

keksoc

.-.

我不知道你再说什么

/warn non-english

我不知道你再说什么

the last symbol reminds me something..

my sensors saw it sometime ago

Hi admin. I've gone through the rules and thank you😄

Hi admin. I've gone through the rules and thank you😄

No problem

@MissRose_bot

iam womdering if anyome knows how to use usb libraries with c++

What's wrong with it?

Hey admins here Is full of cos'era, i Need help and didn't find anything on Google, can i ask here about Linux?

Hello, I'm learning C and I have got the error * stack smashing detected *. The code is the following one. I have google about it and I have found that it could be something related to array bounds or the memory, but I don't know how to solve it. Could you please help me?

please format your code

by using tripple ` on the start and end

#include <stdio.h> #include <glib.h> #include <string.h> #define SIZE 64 int compute_hash(char *str, unsigned char mdString[SIZE+1]) { gchar *sha512; int i; sha512 = g_compute_checksum_for_string(G_CHECKSUM_SHA512, str, strlen(str)); // Print a gchar //g_print("%s\n", sha512); g_free(sha512); // Convert gchar* to char --> save in mdString sprintf(mdString, "%63s\n", sha512); return 0; } int main(int argc, char *argv[]) { char hashString[SIZE+1]; if (argc == 2) { compute_hash(argv[1], hashString); printf("SHA-512 hash: %s\n", hashString); } else { printf("Error, usage: %s <string>\n", argv[0]); return -1; } return 0; }

Thanks in advance!!

usually stack smashing error means that there's overflow. maybe because sha512 length exceeds size of mdstring?

Hello .. I was writing simple program with typedef enum.. Typedef enum{EXIT,ID,ACCOUNT,DETAILS,PIE_CHART}MENUOPERATIONS; I created one function MENUOPERATIONS mchoice() { MENUOPERATIONS pyc; Cout<<"Enter"<<endl; Cin>>pyc; } While calling from main complier gives me error .. Operator std::istream cin cannot identified I also put header file <iostream>.. Help me

so maybe I need to discover the length of sha512 and then put it after the % of the sptintf()??

Hello .. I was writing simple program with typedef enum.. Typedef enum{EXIT,ID,ACCOUNT,DETAILS,PIE_CHART}MENUOPERATIONS; I created one function MENUOPERATIONS mchoice() { MENUOPERATIONS pyc; Cout<<"Enter"<<endl; Cin>>pyc; } While calling from main complier gives me error .. Operator std::istream cin cannot identified I also put header file <iostream>.. Help me

..

does vector::resize allocate additional space in case of new size is bigger than old capacity as push_back does? or I need to manage this explicitly?

Call destructor explicitly

does vector::resize allocate additional space in case of new size is bigger than old capacity as push_back does? or I need to manage this explicitly?

http://www.cplusplus.com/reference/vector/vector/resize/

Hello .. I was writing simple program with typedef enum.. Typedef enum{EXIT,ID,ACCOUNT,DETAILS,PIE_CHART}MENUOPERATIONS; I created one function MENUOPERATIONS mchoice() { MENUOPERATIONS pyc; Cout<<"Enter"<<endl; Cin>>pyc; } While calling from main complier gives me error .. Operator std::istream cin cannot identified I also put header file <iostream>.. Help me

Show code in pastebin

http://www.cplusplus.com/reference/vector/vector/resize/

yeah, I read that before asking the question didn't find there any mention of this

Hello, I'm learning C and I have got the error * stack smashing detected *. The code is the following one. I have google about it and I have found that it could be something related to array bounds or the memory, but I don't know how to solve it. Could you please help me?

Have you read https://stackoverflow.com/questions/1345670/stack-smashing-detected?

yeah, I read that before asking the question didn't find there any mention of this

Quoting from that link If n is greater than the current container size, the content is expanded by inserting at the end as many elements as needed to reach a size of n. If val is specified, the new elements are initialized as copies of val, otherwise, they are value-initialized.

std::vector will never need a manual size change

Quoting from that link If n is greater than the current container size, the content is expanded by inserting at the end as many elements as needed to reach a size of n. If val is specified, the new elements are initialized as copies of val, otherwise, they are value-initialized.

they're talking about garantees about the size, not about capacity

they're talking about garantees about the size, not about capacity

What do you mean?

What I'm talking about, do I need to call reserve here? if (componentsVector.size() <= entity.id) { if (componentsVector.capacity() <= entity.id) { componentsVector.reserve(entity.id * 2); } componentsVector.resize(entity.id + 1); } componentsVector[entity.id] = component;

You have the size of the vector, not it's maximum capacity. The latter is managed by the lib

Or vector will take care of it itself

Or vector will take care of it itself

std::vector will always take care of its capacity if you use it properly

std::vector will always take care of its capacity if you use it properly

with push_back

yes

however, when you need speed, you reserve manually

saving you n comparisons and log n reallocations

std::vector will always take care of its capacity if you use it properly

I just worry that it will not increase capacity additionaly itself and leave it equal to size. so I will end up with reallocation on every resize, which will be bad

I just worry that it will not increase capacity additionaly itself and leave it equal to size. so I will end up with reallocation on every resize, which will be bad

push back doesnt allocate on every resize

(in bad implementations maybe)

it allocates in log n of the cases

I just worry that it will not increase capacity additionaly itself and leave it equal to size. so I will end up with reallocation on every resize, which will be bad

It will increase capacity if new asked size is bigger than the threshold

Have you read https://stackoverflow.com/questions/1345670/stack-smashing-detected?

It works, thank you!!!!

It will increase capacity if new asked size is bigger than the threshold

yes, but my question is, will it set new capacity (allocated size) equal to new size or set it bigger (e.g. size*2) as with push_back?

yes, but my question is, will it set new capacity (allocated size) equal to new size or set it bigger (e.g. size*2) as with push_back?

when you reserve, it will set its size to its size + the "reserved" size

Sorry guys I just forgot myself

And rules too

Sorry guys I just forgot myself

Remember yourself next time

Sorry guys I just forgot myself

Damn, who would have thunk that a group called "C++/C" is not a python group?