they are not superfluous! they help to read the logic of how the expression is formed!
does the number of brackets affect speed? - except perhaps for typing speed, but nobody watches that.... the number of brackets each user type in a day on the web is a prime example ))))
This is a guarantee of error-free and fast corrections in future.
You didn't need brackets around t and n - they couldn't be composite. All right, since we're having such a festive conversation, let's consider this ))))
#define B64(M,N) (( N ) < 32 \
? (( N ) < 16 \
? (( N ) < 8 \
? (( N ) < 4 \
? (( N ) < 2 \
? \
(( N ) < 1 ? M##0: M##1) \
: (( N ) < 3 ? M##2: M##3)) : (( N ) < 6 ? \
(( N ) < 5 ? M##4: M##5) \
: (( N ) < 7 ? M##6: M##7))) : (( N ) < 12 ? (( N ) < 10 ? \
(( N ) < 9 ? M##8: M##9) \
: (( N ) < 11 ? M##10: M##11)) : (( N ) < 14 ? \
(( N ) < 13 ? M##12: M##13) \
: (( N ) < 15 ? M##14: M##15)))) : (( N ) < 24 ? (( N ) < 20 ? (( N ) < 18 ? \
(( N ) < 17 ? M##16: M##17) \
: (( N ) < 19 ? M##18: M##19)) : (( N ) < 22 ? \
(( N ) < 21 ? M##20: M##21) \
: (( N ) < 23 ? M##22: M##23))) : (( N ) < 28 ? (( N ) < 26 ? \
(( N ) < 25 ? M##24: M##25) \
: (( N ) < 27 ? M##26: M##27)) : (( N ) < 30 ? \
(( N ) < 29 ? M##28: M##29) \
: (( N ) < 31 ? M##30: M##31))))) : (( N ) < 48 ? (( N ) < 40 ? (( N ) < 36 ? (( N ) < 34 ? \
(( N ) < 33 ? M##32: M##33) \
: (( N ) < 35 ? M##34: M##35)) : (( N ) < 38 ? \
(( N ) < 37 ? M##36: M##37) \
: (( N ) < 39 ? M##38: M##39))) : (( N ) < 44 ? (( N ) < 42 ? \
(( N ) < 41 ? M##40: M##41) \
: (( N ) < 43 ? M##42: M##43)) : (( N ) < 46 ? \
(( N ) < 45 ? M##44: M##45) \
: (( N ) < 47 ? M##46: M##47)))) : (( N ) < 56 ? (( N ) < 52 ? (( N ) < 50 ? \
(( N ) < 49 ? M##48: M##49) \
: (( N ) < 51 ? M##50: M##51)) : (( N ) < 54 ? \
(( N ) < 53 ? M##52: M##53) \
: (( N ) < 55 ? M##54: M##55))) : (( N ) < 60 ? (( N ) < 58 ? \
(( N ) < 57 ? M##56: M##57) \
: (( N ) < 59 ? M##58: M##59)) : (( N ) < 62 ? \
(( N ) < 61 ? M##60: M##61) \
: (( N ) < 63 ? M##62: M##63))))))
After that I realized ( long( 1 ) << N ) is 2 times faster, but that's not the point)
Another example of unnecessary brackets: in the pursuit of the numberof unnecessary brackets, the necessary ones are missed
You've put too many brackets in there as "unnecessary". If one sets a goal to remove as many parentheses as one can, so that the compiler does not start swearing, maybe you're right, but this goal is not worth when one wants to write code that will be at first sight as understandable to one and others (especially considering double parentheses highlighting in the editor).
they are not superfluous! they help to read the logic behind the formation of this expression!
Well, if they help you, then God be with you. Only your post was about "brevity is the sister of talent". So I'm asking how this statement can be combined with an abundance of excess brackets. I do not need them to understand the logic. Does it mean that I'm more talented? )
Allow the use of cookies to log in to the MQL5.com website.
Please enable the necessary setting in your browser, otherwise you will not be able to log in.
You are signed in. Two-factor authentication has been disabled. Set it up again and scan a new QR code, or continue with two-factor authentication disabled.
Here's the "right" define for you, since you like to pick on everything)))
#define POKE(t, i, b, n, v) ( i & ((( ~ MASK( t, n )) << t( b )) | (( v & MASK( t, n )) << t( b ))))they are not superfluous! they help to read the logic of how the expression is formed!
does the number of brackets affect speed? - except perhaps for typing speed, but nobody watches that.... the number of brackets each user type in a day on the web is a prime example ))))
This is a guarantee of error-free and fast corrections in future.
This is a guarantee of error-free and quick revisions in the future.
there! at least someone who can write in a short and formal way, i always complicate things and write many letters... oops, here we go again)))
Here's a "correct" define for you, since you like to pick on everything))))
Another example of unnecessary brackets: chasing the numberof unnecessary brackets - missing the necessary ones
So brackets are not a guarantee of such a thing, but on the contrary - relaxesYou didn't need brackets around t and n - they couldn't be composite. All right, since we're having such a festive conversation, let's consider this ))))
After that I realized ( long( 1 ) << N ) is 2 times faster, but that's not the point)
Another example of unnecessary brackets: in the pursuit of the numberof unnecessary brackets, the necessary ones are missed
You've put too many brackets in there as "unnecessary". If one sets a goal to remove as many parentheses as one can, so that the compiler does not start swearing, maybe you're right, but this goal is not worth when one wants to write code that will be at first sight as understandable to one and others (especially considering double parentheses highlighting in the editor).
(I'm not sure about this )))
A compile-time error. What was expected?
It was a compilation error. What was expected?
It's just for the beauty of it. There are 128 more defines attached to this define for it to work, but I'd better spare the branch readers )))
they are not superfluous! they help to read the logic behind the formation of this expression!
I don't need them to understand logic. Does that make me more talented? )
Another goal for the Adepts: yes, we beat them by a landslide.)