![]() |
VOOZH | about |
In this article, we will learn about infix notation used in Kotlin functions. In Kotlin, a function marked with infix keyword can also be called using infix notation means calling without using parenthesis and dot.
There are two types of infix function notation in Kotlin
When we call operators like and, or , shr, shl etc then compiler looks for the function and calls the desired one. There is a number of standard library infix notations functions but we will discuss here some of them.
Let's discuss some of the infix notations one by one.
Output:
Boolean result1 = true
Boolean result1 = true
Explanation:
Here, we have called the a.and(b) function using infix (a and b). Both produce the same result in the standard output.
Output:
Signed shift right by 2 bit: 2
Signed shift right by 1 bit: 4
Explanation:
In the above program, we have used signed shift operator. First, performed the operation using the infix notation then performed using dot and parenthesis.
If we signed shift the value by 2 bits, then 23=8 becomes 2(3-2=1)=2.
Output:
9
10
3
2
Explanation:
Here, we have used increment and decrement operators using infix notation.
++a represents a(8) + 1 so it prints 9
a.inc() also represents a(9) + 1 so it prints 10
--b represents b(4) - 1 = 3
b.dec() also represents b(3)- 1 = 2
We can create a function with infix notation if the function satisfies the following requirements:
Output:
The square of a number is: 9Explanation:
In the above program, we have created our infix notation function (m square 3).
square(n : Int):IntThen, we create an object for the class math() and called the function using infix notation-
m square 3It calculates the square of the number and returns the value 9.
Output:
Double
Explanation:
We have created an infix notation function to find the datatype of a variable. The datatype has been passed as an argument in an infix call-
chk dataType 3.3When checking the data type for the passing parameter, and returns the desired value. Here, it returns a Double to the standard output.
Precedence matters at the time of execution of an instruction. Infix function calls have lower precedence than the arithmetic operators, type casts, and the rangeTo operator.
The following expressions are equivalent:
2 shr 1 + 2 and 2 shr (1 + 2)
1 until n * 2 and 0 until (n * 2)
xs union ys as Set<*> and xs union (ys as Set<*>)
On the other hand, infix function call have higher precedence than the boolean operators && and ||, is- and in-checks, and some other operators.
The following expressions are equivalent as well:
a xor b || c and a xor (b || c)
a in b xor c and a in (b xor c)