store4 | Go package providing a fast in-memory quad store

The groups in this regex, as tested in https://regex101.com/, match the data in your column ward, as in your example. However, you may need to better define the patterns where each will appear since this regex only matches them as they appear in your example data. However, it may be enough for you to extrapolate and get the regex that you really need.

if you want to distribute it into columns instead of rows you can do:

You're using find_element_by_css_selector incorrectly. Try

This can be done using Array.prototype.flatMap.

Create a new special action which will dispatch all the others:

NOTE: The previous version of this answer tried (rather clumsily) to get around the limitations of the unusual data model. I think the following one is a better, clearer, approach.

The main issue here is that the data is not exactly normalized, especially with regards to the association between a store and an item type. My suggestion is to use two subqueries to obtain a clearer version of stores_item_types and items, and then make simple INNER JOINs.

Let's start with stores_item_types. We want our derived table to say explicitly that each store also carries the *A type, and that each store also carries its own *SP type. For example:

Good question! It turns out this is one of the current limitations of Vega-Lite. I found this note in the VL docs on Nearest Value

The nearest transform is not supported for continuous mark types (i.e., line and area). For these mark types, consider layering a discrete mark type (e.g., point) with a 0-value opacity

So for your example I would do something like this

try with this one, it may helps you