How to code a modulo operator in C C Obj-C that handles negative numbers

As a mathematician, one of my pet peeves of C-derived languages is :

(-1) % 8 // comes out as -1, and not 7

fmodf(-1,8) // fails similarly

What is the most effective solution?

Templates and operator overloading are both possible in C++, but both are unfamiliar to me.

Thank you for providing examples.

Jul 27, 2022 in C++ by Nicholas
• 7,760 points • 266 views

No answer to this question. Be the first to respond.

Your answer

Your name to display (optional):

Email me at this address if my answer is selected or commented on:

Privacy: Your email address will only be used for sending these notifications.

How to use new[ ] and delete[ ] operator in C++

int main(){ char *str; ...READ MORE

answered Jun 20, 2022 in C++ by Damon
• 4,960 points • 363 views

0 votes

0 answers

How to find if a given key exists in a C++ std::map

I'm trying to check if a given ...READ MORE

Jul 14, 2022 in C++ by Nicholas
• 7,760 points • 614 views

0 votes

0 answers

How to generate a random number in C++?

I'm attempting to develop a dice game, and I need random numbers to represent the sides of the die. I can make a number between 1 and 6). Using #include <cstdlib> #include <ctime> #include <iostream> using namespace ...READ MORE

Aug 11, 2022 in C++ by Nicholas
• 7,760 points • 256 views

0 votes

1 answer

How to use std::sort to sort an array in C++

We receive std::begin and std::end in C++0x/11, which are overloaded for arrays: #include <algorithm> int main(){ int v[2000]; ...READ MORE

answered Jun 1, 2022 in C++ by Damon
• 4,960 points • 897 views

0 votes

0 answers

How to traverse stack in C++?

Is traversing std::stack possible in C++? It is not possible to traverse using the following method. Because there is no member end in std::stack. std::stack<int> foo; // .. for (__typeof(foo.begin()) it = foo.begin(); ...READ MORE

Jun 1, 2022 in C++ by Nicholas
• 7,760 points • 1,646 views

0 votes

1 answer

What is the best way to use a HashMap in C++?

The ordered and unordered map containers (std::map and std::unordered map) are included in the standard library. The items in an ordered map are sorted by key, and insert and access are in O (log n). For ordered maps, the standard library often use red black trees. However, this is only an implementation detail. Insert and access are in O in an unordered map (1). It is simply another term for a hashtable. An illustration using (ordered) std::map: #include <map> #include <iostream> #include <cassert> int main(int argc, char ...READ MORE