Problems107. Introducing parallel computations with arrays108. Covering the Vector API’s structure and terminologyThe vector element typeThe vector shapeThe vector speciesVector lanesVector operationsCreating vectorsCreating vectors of zerosCreating vectors of the same primitive valueCreating vectors from Java arraysCreating vectors from memory segments109. Summing two arrays via the Vector API110. Summing two arrays unrolled via the Vector API111. Benchmarking the Vector API112. Applying the Vector API to compute FMA113. Multiplying matrices via the Vector API114. Hooking the image negative filter with the Vector API115. Dissecting factory methods for collectionsFactory methods for mapsFactory methods for listsFactory methods for sets116. Getting a list from a stream117. Handling map capacity118. Tackling Sequenced CollectionsApplying the Sequenced Collections API to listsApplying the Sequenced Collections API to ArrayList and LinkedListApplying the Sequenced Collections API to setsApplying the Sequenced Collections API to HashSetApplying the Sequenced Collections API to LinkedHashSetApplying the Sequenced Collections API to TreeSetApplying the Sequenced Collections API to mapsApplying the Sequenced Collections API to LinkedHashMapApplying the Sequenced Collections API to SortedMap (TreeMap)119. Introducing the Rope data structureImplementing indexAt(Node node, int index)Implementing concat(Node node1, Node node2)Implementing insert(Node node, int index, String str)Implementing delete(Node node, int start, int end)Implementing split(Node node, int index)120. Introducing the Skip List data structureImplementing contains(Integer data)Implementing insert(Integer data)Implementing delete(Integer data)121. Introducing the K-D Tree data structureInserting into a K-D TreeFinding the nearest neighbor122. Introducing the Zipper data structure123. Introducing the Binomial Heap data structureImplementing insert(int key)Implementing findMin()Implementing extractMin()Implementing decreaseKey(int key, int newKey)Implementing delete(int key)Implementing unionHeap(BinomialHeap heap)124. Introducing the Fibonacci Heap data structure125. Introducing the Pairing Heap data structure126. Introducing the Huffman Coding data structureEncoding the stringDecoding the string127. Introducing the Splay Tree data structure128. Introducing the Interval Tree data structureImplementing insert(Interval interval)129. Introducing the Unrolled Linked List data structure130. Implementing join algorithmsNested Loop JoinHash JoinSort Merge JoinSummary