hm, then it will be Container<int>::U, same as we need to change typedef T value_type to typedef U value_type now. And same as we need to change value_type everywhere outside template if we rename it for example to type_value. I still don't see any reason for the forbid that. Unless, as you say, the parser will be more complicated

hm, then it will be Container<int>::U, same as we need to change typedef T value_type to typedef U value_type now. And same as we need to change value_type everywhere outside template if we rename it for example to type_value. I still don't see any reason for the forbid that. Unless, as you say, the parser will be more complicated

قَيسٌ sent a huge message, it has been re-uploaded as a file Hi, How can implement polymorphic variable? class Base{ public: myVariable; }; class C1: ..

Hey guys! Does anybody have experience developing for the RISC-V? I’m awaiting for this minibeast to arrive soon which has a 2.5TOPS matrix processor onboard. Good thing is Ubuntu and Fedora have RISC-V builds, gcc and clang are able to compile for this arch, and the nncase compiler supports popular DL ops, so im not starting from scratch. The goal is to implement real-time processing audio and video onboard. I’m looking for someone to share their experience and passion. Hit me in pm if you like. Have a nice day everyone😎🌞

Chill admin I'm not bot Just feeling bored that's why i text that

This is not a group to text to when you bored

Hey guys! Does anybody have experience developing for the RISC-V? I’m awaiting for this minibeast to arrive soon which has a 2.5TOPS matrix processor onboard. Good thing is Ubuntu and Fedora have RISC-V builds, gcc and clang are able to compile for this arch, and the nncase compiler supports popular DL ops, so im not starting from scratch. The goal is to implement real-time processing audio and video onboard. I’m looking for someone to share their experience and passion. Hit me in pm if you like. Have a nice day everyone😎🌞

Hi guys, i'm using clang-tidy to check some code that i did using this command: clang-tidy —checks=all -header-filter=.* (pretty generic i know) And he keeps pushing me to put (void) before some functions, after some research i saw that its due to some functions returning values or pointers that "would not have anywhere to go", per example: 152 // Clean memory and populate it 153 (void)memset(path_src, 0, sizeof(path_src)); 154 (void)memset(path_build, 0, sizeof(path_build)); 155 (void)sprintf(path_src, "%s/src", *path_main); 156 (void)sprintf(path_build, "%s/build", *path_main); These memset and sprintf functions return a pointer and a byte number respectively, so theoretically without these (void) before the functions would cause the returned values to be lost I don't know if i misunderstood it or if it's even worth it to really put these '(void)' before some functions, can someone en-light me about that? I know that these values should be used to do some error handling but even a fprintf has a return value, so how can i know when i can ignore it?

Enabling all checks is not a wise solution because there's a lot of specific checks for the specific projects like linux kernel or llvm

Well the question gives you just an array as input. So I don't quite understand what cycle you are trying to detect unless you are building your own graph or Linked list from the input array. From the question it is clear that they want to test how you work around overflows. So a simple solution would be to sum all the numbers in the array and also sum the squares. If the input is from 1 to n, the sum of the numbers should be n*(n+1)/2 and that of the squares will be n(n+1)(2n+1)/6. For the given input, both the sums would either be less or more. This information should be enough to determine what the repeating and the missing numbers are. Think about it. Now given that n can be as large as 10^5, n(n+1)/2 and also the running sum can overflow. If you cast the ints to a long long and keep the running sum in a long long, it shouldn't overflow

Is there any detailed description of the AI Accelerator? @valankin

Sure look up kendryte 510k

I'm interested in detailed architecture overview

Ok, seems like i have to learn about it as cli tool

Hi! I have a code which has something like segfault and i know approximate location in code but the problem is that i cannot debug it - it suddenly crash with error and did not hit any breakpoint which located before bad code. However if i comment bad code - breakpoints work very well. Is there some "pre"-run of program before debug or what? I use CLion, maybe CLion misunderstood gdb..

Hi What customizable cli linter do you suggest?

clang-tidy

Hi! I have my own implementation of vector for polymorphic types which has one buffer for all of the objects in heap(aligned by max size of derived class). I read about custom allocators and tried to do same thing for std::vector + custom allocator but realized that i can do this sort of buffer just for array of pointers but not for storage where real objects are. Am i right that own allocator does not solve this problem(put objects in one memory area)?

I need help in a c++ multithread implementation

Can I use gnu indent as linter and not beautifier?

Hello everyone, i have a project in c++ object oriented. What i need to do is to make a program where i have 4 up to 6 structures in it (struct) does anyone have a helpful source of projects or something that might help? Thank you in advance

Good luck :-) (if you just want to cheat your ass you could use GPT3.5)

Can anyone help me with a full c/c++ course. I can learn from

I want to learn the programming language

Just need the resources

Just need the resources

Buy the book The C++ Programming Language from Bjarne Stroustrup and do all the exercises. ALL OF THEM!!

Hello! Is there's a way I can create template function with enable_if, which can work with vector, list and tuple? Like is_arithmetic for arithmetic types, but in this case, for, kind of, collections? Say do_smth(std::vector<double>{1.0, 2.0}) do_smth(std::list... do_smth(std::make_tuple...

std::tuple is not a container

so the only possibility is to compose vector and list? How can I achieve that? UPD Seems like I've found it, thanks template<typename T> struct is_container : std::integral_constant<bool, has_const_iterator<T>::value && has_begin_end<T>::beg_value && has_begin_end<T>::end_value> { };

How many total study hours would that take for a noob to C/C++ do you think