In the last post we looked at plugging in Thymeleaf into a Spark Java application for view rendering.  The concept was pretty simple: using the Thymeleaf engine, render a view with a map of variables to use as the model.  But in reality, our applications need a bit more complexity.  They need reusable layouts.  In this post we’ll take a look at how to handle that with Thymeleaf.  

Reusable layouts include things like headers, footers, scripts and other things like nav menus that are common across the application.  Thymeleaf accommodates these by using what they call “fragments” - reusable blocks of code defined by the th:fragment attribute that can be called from your templates using the th:replace, th:insert or th:include attributes.  You can read all about it in their docs, but let’s take a look at a practical example below.

I’ve been using IntelliJ IDEA Community Edition on my personal machine to work with some of the demos that I’ve been using for my series on using Groovy to program on the Raspberry Pi.  One of the features I’ve missed most from Ultimate Edition is the ability to remotely deploy to the Pi to keep the code in sync.  I’ve worked around it by using SCP every time I change something, but it’s a bit tedious to do that every time, so I sought out additional options and found the Source Sync plugin.  It’s pretty easy to install and so far I’ve found that it works pretty much identically to the Remote Deploy feature in Ultimate Edition (with the exception that it doesn’t provide feedback that it is syncing).  I’ll use this plugin going forward so if you plan on following along with the series it would be a good idea to install it!
\

When I first saw this challenge I thought it would be a lot more difficult than it turned out to be.  Here is the challenge:

Here’s a list with numbers from 1-250 in random order, but it’s missing one number. How will you find the missed number?

I generated the list of numbers on the fly each time:

// first, create the list 
List listWithNumbersInRandomOrder = (1..250).toList()

// randomize it
Collections.shuffle(listWithNumbersInRandomOrder, new Random(System.nanoTime()))

// remove 1 of the items
Integer removed = listWithNumbersInRandomOrder.remove(0)

// have we removed one?
assert listWithNumbersInRandomOrder.size() == 249

But if you’d rather work from a static set, here’s a list for you:

As I mentioned in a previous post, sorting algorithms typically play a large role in programming interviews.  Those who follow the traditional path into the programming world and obtain a CIS degree are typically exposed to algorithms.  Those among us who follow a less traditional path into this world are less familiar with them.  

\

I decided to take a deeper dive into sorting algorithms and implement some of them to see: