I understand well about digits; ..but I don’t understand what you are trying! Put your code. It will describe clearly what you are doing!

I'm not trying anything. I just pointed that your code is too slow

It’s not my code! I used her code with clock(); that’s it! And modified to see primes with (if).. you may check again🙃

well, I copied the code you posted - why repost code?!

You need to understand the code first; she is “iterating” variable “rax”; ..she’s counting “rax” values ; and seeking time limit. What time-limit I don’t know!! That’s why I played the whole program. Hope you get this time😄

I know, and I told you that taking 18 seconds to compute the result for a 32bit value is too slow

It’s all because of iteration rax++

well, yes and no. The bounds are chosen poorly

Hello everyone, I have a little issue with regular expression, my intend is to have a full control of keyboard input in a field of form with ncurses. I need to impose the user input a valid phone number string, right now I have build this parameters "^\\+?[0-9]+ " Now the user can input a number with or without + at begin of string, and it's mandatory to input at least a digit, eg.: +3933525773 or 57437848648 Any alphabetical character it's forbidden, or to input + character in a different position to the begin of the string. But now my intention to improve the code is to add the possibility to have also # and * characters in the string wherever, for example: 335123#5*57 or +3935*#122#5663* And so on... Can someone help me please?

Hi! What should I do to avoid time limit? #include <stdio.h> long long int number; long long int rax = 2; int main() { scanf("%lld", &number); if (number != 1) { while (number % rax != 0) { rax++; } } else { rax = 1; } printf("%lld", rax); return 0; } Print the smallest divisor of the number n, other than 1.

Hi, it's correct code? // can i correct hash .c_str() ptr data or its UB? make_hash(std::string{"Hello"}.c_str());

It's not UB behaviour, but every string object will return different char*, even if strings are the same.

Example?

What example do you want?

i mean, what different? null terminator between different compiler?

i mean, what different? null terminator between different compiler?

No. It's not related to compilers. c_str returns pointer to internal string buffer. Every object has its own. So you'll get different results.

Doesn't the standard stipulate that c_str () must contain a null terminator?

string(".").c_str() != string(".").c_str()

strcmp, anyone?

I don't understand why would @r_mustang want to calculate hash of c_str in the first place. There is no need in strcmp when we have string class.

блин, так прикольно, когда несколько русских людей пытаются что-то писать на английском

I don't understand why would @r_mustang want to calculate hash of c_str in the first place. There is no need in strcmp when we have string class.

Im generate FNV hash from protocol, ip, port and use them for search in vector, it's faster than constantly comparing 3 variables with each other in find_if

^\+(?:[0-9]●?){6,14}[0-9]$

#include "../util/Timer.hpp" #include <atomic> #include <functional> #include <iostream> #include <thread> #include <pthread.h> using namespace std; class SpinLock { public: SpinLock () { _flag.store(false); } bool TryLock() { bool expect = false; return _flag.compare_exchange_weak(expect, true); } void Lock() { bool expect = false; while(!_flag.compare_exchange_weak(expect, true)) expect = false; } void UnLock() { _flag.store(false); } private: atomic<bool> _flag; }; pthread_spinlock_t g_lock = 0; void func(int &arg, int total) { while(total-- > 0) { pthread_spin_lock(&g_lock); ++arg; pthread_spin_unlock(&g_lock); } } SpinLock g_lock2; void func2(int &arg, int total) { while(total-- > 0) { g_lock2.Lock(); ++arg; g_lock2.UnLock(); } } const int kAddNum = 1000000; const int kRoundNum = 100; int main() { pthread_spin_init(&g_lock, PTHREAD_PROCESS_PRIVATE); Timer t; t.TimerBeg(); for(int i = 0; i < kRoundNum; i++) { int value = 0; thread a(func, ref(value), kAddNum); thread b(func, ref(value), kAddNum); a.join(); b.join(); } t.TimerEnd(); cout << t << endl; t.TimerBeg(); for(int i = 0; i < kRoundNum; i++) { int value2 = 0; thread c(func2, ref(value2), kAddNum); thread d(func2, ref(value2), kAddNum); c.join(); d.join(); } t.TimerEnd(); cout << t << endl; return 0; }

why pthread_spin_lock is almost 10 times faster than my implement

how can I allocate huge VLA in heap?

@ollirz Is there any framework you'd love to work with, alternative to Qt

It always depends on what you want to do. When it comes to UI in C++, I still think Qt is your best shot and don't see it changing anytime soon. Otherwise Poco is a really nice set of libraries and of course boost and Abseil-Cpp.

There is Copperspice You heard of it?!

Hey guys I'm a beginner at C++. Can you please suggest be an authentic youtube channel and a book for the same.

I have heard of it some time ago but I never used it. Wasn't the idea to have one set of libraries that basically can do everything? While the idea might be nice I always preferred libraries that are really great at what they want to do and not good at everything.

Yeah, CopperSpice tries to replace Qt by removing moc and depends on purely C++ feature to implement some reflections to support signal/slot mechanism CopperSpice can be treated as a set of independent libraries, you can even use a single one without the other libraries and it's under development by some of the brightest minds in the C++ community like Jan Wilmans and Odin Holmes

how can I allocate huge VLA in heap?

Yeah, CopperSpice tries to replace Qt by removing moc and depends on purely C++ feature to implement some reflections to support signal/slot mechanism CopperSpice can be treated as a set of independent libraries, you can even use a single one without the other libraries and it's under development by some of the brightest minds in the C++ community like Jan Wilmans and Odin Holmes

The best option would probably be to compute the required space and allocate it on the heap. Then have a helper function that converts your index into an offset into the flat buffer. Are you sure using a 10-dimensional array is your best choice?

Yeah, CopperSpice tries to replace Qt by removing moc and depends on purely C++ feature to implement some reflections to support signal/slot mechanism CopperSpice can be treated as a set of independent libraries, you can even use a single one without the other libraries and it's under development by some of the brightest minds in the C++ community like Jan Wilmans and Odin Holmes

Yeah, CopperSpice tries to replace Qt by removing moc and depends on purely C++ feature to implement some reflections to support signal/slot mechanism CopperSpice can be treated as a set of independent libraries, you can even use a single one without the other libraries and it's under development by some of the brightest minds in the C++ community like Jan Wilmans and Odin Holmes

While these ideas sound great from a C++ perspective, I don't see a lot of people and especially companies caring too much about these parts. Qt has a big advantage since it's widely used and well known and there exists so much documentation and tooling around it.

For tooling-plugin yeah The documentation CopperSpice has the offline documentation too, and nearly everything that Qt has, except for lack of support of some clases and android platform (which is planned for) Also it has a tool for converting Qt headers to the CopperSpice headers It was originally derived from Qt 4 so the code someone wrote wouldn't change so much

For tooling-plugin yeah The documentation CopperSpice has the offline documentation too, and nearly everything that Qt has, except for lack of support of some clases and android platform (which is planned for) Also it has a tool for converting Qt headers to the CopperSpice headers It was originally derived from Qt 4 so the code someone wrote wouldn't change so much

yeah sure, but I doubt the compatibility with the Qt tools would be great and afaik things like QML are not and won't be supported.

It's planned to support Qml

But I can see the Biggest advantage here(removing moc) would be pointless in the future since In their talk(The CopperSpice implementors) mentioned that Qt developers intends to remove moc but when the language support Reflections

Can we multiply a character by using a integer?

Can we multiply a character by using a integer?

But I can see the Biggest advantage here(removing moc) would be pointless in the future since In their talk(The CopperSpice implementors) mentioned that Qt developers intends to remove moc but when the language support Reflections

But do you actually think CopperSpice can succeed? How are a handful of people supposed to hold of with a company and tons of partners. Additionally most people move their UI work to web based stacks or React native anyway...

you can, but what will the result represent? what does it mean when you multiply 'A' by 3 ?

tbh I'm not sure, unless some kinda big jump happened because CopperSpice will have to carry a lot in order to catch up with Qt like Design Sudio, popularity..etc + as mentioned above their main drive(removing MOC) will be pointless at some time in the future, since reflections will land and Qt company will maintain their framework nicely that time

Int x=5; Printf("*" * x) Is this working??

Based on the fact that they announced it 4+ years ago, I was barely able to find screenshots of a CopperSpice UI makes me feel the project is basically dead. Also, do that many people actually dislike moc? I would assume most people don't care, they want good tooling and a fast inner dev-loop.

Int x=5; Printf("*" * x) Is this working??

Int x=5; Printf("*" * x) Is this working??