jofisaes - Tumblr blog

jofisaes · 2 days

Link

JDK 15 is going to be released in September 2020. Amongst the changes expected in JDK 15 - Build 24, there is 1 direct code related JEP. We'll talk about it here.

#java #java15 #jdk #jdk15

0 notes

jofisaes · 2 days

Link

On the 2020/06/06 I published my first Python module. It's a Geo Location calculator which uses the Haversine formula to calculate distances.

#python #geo #geolocation #haversine #formula

0 notes

jofisaes · 2 days

Link

5 lessons learned about seemingly strange things with Kotlin on the Job

#kotlin #spring #annotations #use-site #targets #null-safety #immutability

1 note · View note

jofisaes · 2 months

Video

Just reposting everyone! Enjoy the video!

youtube

Tailrec ThroughThe AgesUntil Kotlin - In this video I am discussing Tailrec through the ages. So what is tail recursivity? Tail recursivity is a different form of recursivity everyone. I explain all of this in the powerpoint I created for this presentation here: https://www.scribd.com/presentation/712473423/Exploring-Tailrec-Through-Time-Until-Kotlin. In any case what I tell in the video and show is the evolution of code regarding the evolution of recursivity from the end of the 1950′s up until the year of the inception of Kotlin in 2016. The idea is to show how the different implementations of he fibonacci sequence went through the years and how were they identified as recursive, tail-recurse and how something else that appeard in 1975 helped shape the way we look at tail call optimization. This was the year that TCO was going to be adopted by more and more languagesl like it is today by Kotlin. The principle is essentially to use the implementation provided by the developer and assess as a first step if the recursive function is also tail recursive. Tail recursive only means that the last call of the recursive method is the recursive method itself. That way one easy way to apply TCO is to, before the code gets translated to bytecode or assembly code, the compiler is then free to apply a transformation which could just mean turning the recursive function into a function that uses an iterative alternative to solve the problem. Iterative solutions are usually very efficient, but lots of developers complain that they are difficult to read and of course they mostly use mutable variables which is become increasingly something we don’t want to do. Any way better to watch the video to not miss out on the details! Have a good on everyone!

#kotlin #fortran #recursive #recursivity #listp #tailrec #tail recursive

1 note · View note

jofisaes · 2 months

Video