Variadic template class to add numbers recursively during compilation

The idea of having a class to add numbers (variable parameters) during compilation time recursively. Also wanted to restrict types to a single type while sending parameters to class member function. That said, if we mix int, float and double types to add function shall result in compilation error. How do we achieve this.

The below is the code which actually helps to achieve this:

<code>

#include <fmt/format.h>

template<typename T>
class MyVarSumClass{
    private:
        T _sum = 0;
    public:
        template<typename... TRest>
        T add(T num, TRest... nums){
            static_assert(std::conjunction<std::is_same<TRest, T>...>{}); /* Assert fails 
            if types are different */
            _sum += num;
            return add(nums...); // Next parameter packs gets picked recursively
        }

        // Base case
        T add(T num){
            _sum += num;
            return _sum;
        }
};

int main() 
{
    MyVarSumClass<float> objAdd;
    fmt::print("{}\n", objAdd.add(1.1f,1.2f,1.3f,1.4f,1.5f));
    return 0;
}

</code>

Check here

Comments

XOR (Exclusive OR) for branchless coding

The following example shows the array reversing using the XOR operator . No need to take any additional variable to reverse the array. int main(int argc, _TCHAR* argv[]) { char str[] = "I AM STUDENT"; int length = strlen(str); for(int i = 0; i < ((length/2)); i++) { str[i] ^= str[length - (1+i)]; str[length - (1+i)] ^= str[i]; str[i] ^= str[length - (1+i)]; } cout << str << endl; return 0; } The above example is one of the uses of XOR but XOR comes in handy when we can do branchless coding methods like butterfly switch etc. Sometimes this is very effective in speeding up the execution. Let's see one of the uses of XOR in branchless coding. I am taking a simple example of Y = | X |. Yes, I am generating abs of a supplied number. So, my function signature/definition in C++ looks like below: int absoluteBranch( int x) { if (x < 0 ) { return ...

strcpy / strcmp implementation

In C/C++ we have a library function called strcpy to copy the source character array to the destination character array. The C++ function details have been documented here . Today I tried to implement it in my own way. I have put forth a few conditions to implement this function, which are described below. 1. I don't want to pass the size of arrays as function parameters. I mean, the parameter gets passed implicitly 2. I don't want the program shall compile if any of the array sizes or both array sizes are zero or one. 3. There shall be no operation if source and destination arrays are the same. 4. No overflow happens if the destination array size is smaller than the source. 5. The destination array must be null-terminated after a successful copy. Below is the client code to test the implementation: int main() { // Case 1: Source and destination arrays are of the same size char src[] = "Hello World"; char dest[12] = {}; // n - 1 chars will be copied and the las...

Reversing char array without splitting the array to tokens

I was reading about strdup, a C++ function and suddenly an idea came to my mind if this can be leveraged to aid in reversing a character array without splitting the array into words and reconstructing it again by placing spaces and removing trailing spaces. Again, I wanted an array to be passed as a function argument and an array size to be passed implicitly with the array to the function. Assumed, a well-formed char array has been passed into the function. No malformed array checking is done inside the function. So, the function signature and definition are like below: Below is the call from the client code to reverse the array without splitting tokens and reconstructing it. Finally, copy the reversed array to the destination. For GNU C++, we should use strdup instead _strdup . On run, we get the following output: Demo code

Notebook

Search This Blog