Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Advanced Search Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Programming Kotlin
  • Table Of Contents Toc
  • Feedback & Rating feedback
Programming Kotlin

Programming Kotlin

By : Samuel, Bocutiu
3.4 (7)
Buy this Book
close
close
Programming Kotlin

Programming Kotlin

3.4 (7)
By: Samuel, Bocutiu
Buy this Book

Overview of this book

Quickly learn the fundamentals of the Kotlin language and see it in action on the web. Easy to follow and covering the full set of programming features, this book will get you fluent in Kotlin for Android.
Table of Contents (14 chapters)
close
close
close
Preface
Preface
What this book covers
What you need for this book
Who this book is for
Conventions
Reader feedback
Customer support
Free Chapter
1
1. Getting Started with Kotlin
1. Getting Started with Kotlin
Using the command line to compile and run Kotlin code
Kotlin runtime
The REPL
Kotlin for scripting
Kotlin with Gradle
Kotlin with Maven
IntelliJ and Kotlin
Eclipse and Kotlin
Mixing Kotlin and Java in a project
Summary
2
2. Kotlin Basics
2. Kotlin Basics
Vals and vars
Type inference
Basic types
Comments
Packages
Imports
String templates
Ranges
Loops
Exception handling
Instantiating classes
Referential equality and structural equality
This expression
Visibility modifiers
Control flow as expressions
Null syntax
When expression
Type hierarchy
Summary
3
3. Object-Oriented Programming in Kotlin
3. Object-Oriented Programming in Kotlin
Classes
Interfaces
Inheritance
Visibility modifiers
Abstract classes
Interface or abstract class
Polymorphism
Overriding rules
Inheritance versus composition
Class delegation
Sealed classes
Summary
4
4. Functions in Kotlin
chevron up
4. Functions in Kotlin
Defining functions
Single expression functions
Member functions
Local functions
Top-level functions
Named parameters
Default parameters
Extension functions
Operators
Function literals
Tail recursive functions
Varargs
Standard library functions
Generic functions
Pure functions
Java from Kotlin
Kotlin from Java
Summary
5
5. Higher Order Functions and Functional Programming
5. Higher Order Functions and Functional Programming
Higher order functions
Closures
Anonymous functions
Function references
Function-literal receivers
Functions in the JVM
Function composition
Inline functions
Currying and partial application
Memoization
Type alias
Either
Custom DSLs
Validation and error accumulation
Summary
6
6. Properties
6. Properties
Why use properties?
Syntax and variations
Visibility
Late initialization
Delegated properties
Lazy initializations
Lateinit versus lazy
Observables
A non-null property delegate
Properties or methods?
Summary
7
7. Null Safety, Reflection, and Annotations
7. Null Safety, Reflection, and Annotations
Nullable types
Smart cast
Safe null access
Elvis operator
Safe casting
Optionals
Reflection
Constructors
Objects and companions
Useful KClass properties
Reflective functions and properties
Annotations
Standard annotations
Runtime annotation discovery
Summary
8
8. Generics
8. Generics
Parameterised functions
Parameterized types
Bounded polymorphism
Type variance
Nothing type
Type projection
Type erasure
Type reification
Recursive type bounds
Algebraic data types
Summary
9
9. Data Classes
9. Data Classes
Automatic creation of getters and setters
The copy method
toString out of the box
hashCode and equals methods generated for you
Destructed declarations
Destructing types
Data class definition rules
Limitations
Summary
10
10. Collections
10. Collections
Class hierarchy
Arrays
Lists
Maps
Sets
Read-only views
Indexed access
Sequences
Summary
11
11. Testing in Kotlin
11. Testing in Kotlin
Getting started
Choosing a spec
Matchers
Inspectors
Interceptors
Project config
Property testing
Table-driven testing
Tags, conditions, and config
Summary
12
12. Microservices with Kotlin
12. Microservices with Kotlin
Definition
Drawbacks
Why microservices?
Lagom
Defining services
Implementing a Lagom service
Summary
13
13. Concurrency
13. Concurrency
Threads
Deadlocks and livelocks
Executors
Race conditions
Summary

Tail recursive functions

Recursion is a powerful functional programming tool that most programmers have come across before. A recursive function is one that, when certain conditions are held, invokes itself. An idiomatic example of a recursive function is often the Fibonacci sequence, which in English is defined as follows: the next value is the sum of the previous two values. In code, we can define Fibonacci as follows:

    fun fib(k: Int): Int = when (k) { 
      0 -> 1 
      1 -> 1 
      else -> fib(k - 1) + fib(k - 2) 
    }

Notice that for 0 and 1, we define the base case, which does not use recursion. However, for higher values, the function itself is called with the previous two values of k, and so on.

This is very succinct code, but it isn't the most efficient. Each time the fib function is invoked from within itself, the runtime must keep the existing stack frame so that the execution could continue once it returns. We can demonstrate this with...

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech
Start a 7-day FREE trial
End of Section 14
Next Section
bookmark search playlist download
font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected
Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete

Confirmation

Modal Close icon
claim successful
Order Page Read Now

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY