113. Introducing the Skip List data structure The Skip List data structure is a probabilistic data structure built on top of a linked list. A Skip List uses an underlying [...]
115. Introducing the Zipper data structure The Zipper data structure is meant to facilitate cursor-like navigation capabilities over another data structure such as a tree. Moreover, it may provide capabilities [...]
117. Introducing the Fibonacci Heaps data structure A Fibonacci Heap is a flavor of Binomial Heap with excellent performance in amortized time for operations such as insert, extract minimum and [...]
122. Introducing the Unrolled Linked List data structure An Unrolled Linked List is a flavor of a linked list that stores arrays (multiple items). Each node of an Unrolled Linked [...]
124. Serializing objects to byte arrays In chapter 4, Problem X, we talked about the serialization/deserialization of Java records, so you should be pretty familiar with these operations. In a [...]
127. Introducing JDK 9 deserialization filter As you know from Chapter 4, Problem X, deserialization is exposed to vulnerabilities that may cause serious security issues. In other words, between a [...]
130. Implementing a custom method ObjectInputFilter Let’s assume that we already have the Melon class and the helper methods for serializing/deserializing objects to/from byte arrays from Problem 124.An ObjectInputFilter can [...]
134. Introducing JDK 17 easy filter creation Starting with JDK 17, we can express filters more intuitively and readable via two convenient methods named allowFilter() and rejectFilter(). And, since the [...]
136. Monitoring Deserialization via JFR JFR stands for Java Flight Recorder and it is an event-based tool for diagnosis and profiling Java applications. This tool was initially added in JDK [...]
137. Introducing Java Native Interface (JNI) Java Native Interface (JNI) was the first Java API meant to act as a bridge between JVM bytecode and the native code written in [...]