## Does a Huntsman only exist for the span of a single dream?

In Changeling the Lost: Second Edition, it is said that a Huntsman’s heart resides within a Bastion. It even specifies that

the heart can found within the tempestuous mortal Bastion

So, the Bastion is one of a mortal dreamer. It is also said that

A Bastion only exists for the span of a single dream. When the dreamer wakes, whether naturally or because a paradigm shift jarred them awake, the Bastion crumbles and disappears

What happens when the Bastion containing the Huntsman’s heart crumbles? Does it destroy the heart, which implies that a Huntsman only exist for the span of a single dream? That would seem to contradict the "Wild Hunt" paragraph

so long as their heart beats in their stolen Bastion, they reform somewhere in the Hedge within a month’s time to start again. And even when the heart itself is destroyed and the Huntsman is no more, the animating Title’s fire flits back to the Keeper whence it came

It seems clear that the designers intended for the Huntsman’s existence to last longer than a dream, but the rules don’t seem to support that.

Does the True Fae move the heart to a different Bastion every night? That would seem very… tedious to do for one of the Gentry. It doesn’t really make sense to me.

So, how can a Huntsman exist for longer than a single dream?

## Is there an easy way to remove the data-preserver-spaces span from blocks?

I converted a page from Classic to Guttenberg and now all the blocks have this span in them:

<p><span data-preserver-spaces="true">...</span></p> 

This means that all the blocks appear on a grey background, which makes it harder to edit, see links, etc.

I know how to edit the HTML and remove the <span> tag like so:

<p>...</p> 

but over 100 blocks, that’s definitely tedious. Is there a way to do that automatically? (like a "clear all formatting" like I’ve see in other editors?)

Here is an example of the effect I’m talking about:

Note that it also happens when text is Italic or Bold or some other such format (which I think is also annoying).

## How to compute the number of occurrences of a cron schedule over a time span?

For example, given a cron schedule such as: 0 * 1 7 6 and a time span, like the next year, can you directly compute the number of times the schedule will fire? It can be brute forced pretty trivially but I’d like to use this to sort a list so I’d rather not just brute force it. It’s pretty easy to compute the trivial cron patterns:

fn('* * * * *', 1 day) -> 60 * 24 fn('0,30 * * * *', 1 day) -> 2 * 24 

It’s easy up until the calendar gets involved with different length months and then you have to worry about days or the week coinciding with days of the month.

## What is up with 5e Yuan-ti pure blood life span?

The 5e playable race states that they live about as long as humans in rare cases up to 120 years. But all the lore I can find on them says they live up to 2000 years. I am not to familiar with the D&D universe but did they retcon it in 5e or something?

## Nodes in a binary search tree that span a range

I have a binary search tree of height $$h$$ with an integer in each leaf. I also have a range $$[\ell,u]$$. I want to find a set of nodes that span the range $$[\ell,u]$$, i.e., a set $$S$$ of nodes such that the leaves under $$S$$ form all (and only) those leaves containing integers in the range $$[\ell,u]$$. How large does $$S$$ need to be, in the worst case, as a function of the height $$h$$? How do I find such a set explicitly?

## Scroll google calendar month view one week at a time, to span 2 months partially – “vertical scrolling”?

Since years, I’m annoyed when trying to scroll in month view. It always jumps to the beginning of the next month. This feels really bad and sometimes makes it hard to visualize and understand how several events are arranged in relation to each other (or to today)… Hard to describe 🙂

I know, there is a custom 2, 3 or 4 week setting, where you can have a view across a month border. It could be nice, but it still doesn’t scroll by a week.

Today I wanted to drag-and-drop multiple events from June 30th to somewhere in July – First I couldn’t, because even my 3-week-view happened to have the border at the same spot… I modified the settings to get the 2-week-view and was lucky (50% chance) – there I could see the 2 weeks I wanted on the same screen.

## How can I align span text with text in other columns?

I have a row with six columns of image and text here: https://i.imgur.com/UKGGCrX.png

I want to align the two-line text (e.g. Resources and Reserves) with “Exploration” and “Geological Data”. https://i.imgur.com/Tplzivb.png

Adding a margin below the image doesn’t do the trick, nor does adding a margin above the text… also tried setting a min-height for the icon, but that doesn’t do it either.

How can I accomplish this?

## Qual é a diferença entre span e string_view em c++20?

As duas classes fazem basicamente o mesmo, possuem um ponteiro para o primeiro elemento do array e o tamanho do array. Eu sei que string_view é usado para arrays de caracteres, mas não se poderia usar span para o mesmo? Gostaria de saber:

• Porque a redundância?
• Quando devo usar uma ou ao invés outra?

## A question about the span of a sequence of polynomials satisfying a linear recurrence

Let F be a finite field and A(n) in F[t], n in N, be defined by a linear recurrence with coefficients in F[t], together with initial conditions. Is there a decision procedure for determining whether the A(n) span F[t] over F? — Example 1: F=Z/2. $$A(n+6)= t^6A(n) + tA(n+1) + t^4A(n+2) + t^2A(n+4)$$. The initial values are: $$A(0) = A(1) = A(2) = A(3) = A(4) = 0$$, $$A(5) = 1$$.

— Example 2: F=Z/2. $$A(n+4)=t^4A(n) + t^2A(n+1) + tA(n+2)$$. Initial values: $$A(0) = A(1) =0, A(2) = 1, A(3) = t$$.

Example 1 arises from the theory of level 1 elliptic modular forms over Z/2. The A(n) do span–there is a proof using the theory of the Hecke operator T5 on this space of forms, due to Nicolas and Serre, which involves a lot of messy computation as well. (There’s also an elementary not as messy proof I’ve concocted).

My guess is that the A(n) of the ad hoc Example 2 span as well, even though there is no underlying Hecke theory. But I’ve no idea how to handle such questions in general. To illustrate the difficulties note that in Example 2, the smallest n such that $$t^{43}$$ is a sum of A(k) with k at most n is 2192. And the smallest n such that $$t^{107}$$ is a sum of A(k) with k at most n is 3989.