this repo has no description
more
+107
-255
+48
-1
aggregate_feeds.py
+48
-1
aggregate_feeds.py
···
4
4
# "feedparser",
5
5
# "feedgenerator",
6
6
# "requests",
7
+
# "beautifulsoup4",
7
8
# ]
8
9
# ///
9
10
# Do not delete the above as its needed for `uv run`
···
17
18
import requests
18
19
import sys
19
20
import os
21
+
import re
22
+
from html import unescape
23
+
from bs4 import BeautifulSoup
20
24
21
25
def load_feed_urls(file_path):
22
26
with open(file_path, 'r') as f:
···
48
52
print(f"Error fetching {url}: {e}", file=sys.stderr)
49
53
return None
50
54
55
+
def create_plain_text_preview(html_content, max_length=500):
56
+
"""
57
+
Create a plain text preview from HTML content, preserving hyperlinks
58
+
in the format: text [link_url]
59
+
"""
60
+
if not html_content:
61
+
return ""
62
+
63
+
# Parse HTML
64
+
soup = BeautifulSoup(html_content, 'html.parser')
65
+
66
+
# Extract text and hyperlinks
67
+
text_parts = []
68
+
69
+
# Process all elements
70
+
for element in soup.descendants:
71
+
if element.name == 'a' and element.get('href'):
72
+
# For hyperlinks, preserve the URL
73
+
text = element.get_text(strip=True)
74
+
if text:
75
+
url = element['href']
76
+
text_parts.append(f"{text} [{url}]")
77
+
elif element.string and element.string.strip():
78
+
# For regular text nodes
79
+
text_parts.append(element.string.strip())
80
+
81
+
# Join all text parts with spaces
82
+
preview = ' '.join(text_parts)
83
+
84
+
# Clean up extra whitespace
85
+
preview = re.sub(r'\s+', ' ', preview).strip()
86
+
87
+
# Truncate if needed
88
+
if len(preview) > max_length:
89
+
preview = preview[:max_length] + "..."
90
+
91
+
return preview
92
+
51
93
def extract_entries(feeds):
52
94
all_entries = []
53
95
for feed_data in feeds:
···
87
129
else:
88
130
content = entry.get('summary', '')
89
131
132
+
# Create plain text preview
133
+
preview = create_plain_text_preview(content)
134
+
90
135
# Get unique ID
91
136
entry_id = entry.get('id', link)
92
137
···
94
139
'title': title,
95
140
'link': link,
96
141
'content': content,
142
+
'preview': preview,
97
143
'author': author_name,
98
144
'pub_date': pub_date,
99
145
'feed_title': feed_title,
···
132
178
categories=[entry['feed_title']], # Use feed title as category for attribution
133
179
# Add formatted date as extra field
134
180
updateddate=entry['pub_date'],
135
-
formatted_date=formatted_date
181
+
formatted_date=formatted_date,
182
+
preview=entry['preview'] # Add the plain text preview
136
183
)
137
184
138
185
return feed
+1
-159
eeg.xml
+1
-159
eeg.xml
···
71
71
<li>10 x Kingston 7.68TB SSD</li>
72
72
</ul>
73
73
74
-
<p><a href="https://www.dell.com/support/manuals/en-uk/poweredge-r640/per640_ism_pub/general-memory-module-installation-guidelines?guid=guid-acbc0f13-dedb-492b-a0b0-18303ded565a&amp;lang=en-us">Dell R640 has 24 DIMM slots</a></p></summary><category term="Tunbury.ORG"></category></entry><entry><title>Weeknotes 2025-W15</title><link href="https://www.jonmsterling.com/2025-W15/" rel="alternate"></link><published>2025-04-09T13:53:56Z</published><updated>2025-04-09T13:53:56Z</updated><author><name>JonS</name></author><id>https://www.jonmsterling.com/2025-W15/</id><summary type="html"><p>I have a lot to say this week, so strap in.</p>
75
-
<section>
76
-
<header>
77
-
<h2><a href="https://www.forester-notes.org/jms-011P/">Forester 5.0</a> development: canonical URLs, atom feeds, and LSP</h2>
78
-
</header>
79
-
<p>Work on <a href="https://www.forester-notes.org/jms-011P/">Forester 5.0</a> proceeds apace, generously supported by <a href="https://www.jonmsterling.com/jms-00XB/">ARIA</a> who have engaged <a href="https://www.jonmsterling.com/kentookura/">Kento Okura</a> and myself on a consulting basis to support their internal use of Forester. My recent goals have been to bring Forester closer in line with the architecture of the World Wide Web; to that end, I have made two big improvements.</p>
80
-
<section>
81
-
<header>
82
-
<h3>First cut at canonical URLs</h3>
83
-
</header>
84
-
<p>Trees are addressed by “canonical URLs” that are meant to be the place where they will ultimately be published. See <a href="https://www.forester-notes.org/JVIT/">my blog post</a> on the design for more details. Canonical URLs are of the form <code>https://www.my-host.net/tree-name/</code>; the handling is a little fragile right now and you can expect bugs (but please write to me about them).</p>
85
-
</section>
86
-
<section>
87
-
<header>
88
-
<h3>First cut at atom syndication</h3>
89
-
</header>
90
-
<p>It is now possible to syndicate the children of a tree as an Atom feed. This is done currently by including the following directive in the tree you wish to syndicate:</p>
91
-
<pre>\syndicate-current-tree-as-atom-feed</pre>
92
-
<p>Then, if your tree is located at <code>https://www.my-host.net/tree-name/</code>, you will find that there is an atom feed at <code>https://www.my-host.net/tree-name/atom.xml</code>. There are many subtleties to this, and the atom support will continue to evolve and improve. One thing I need to deal with is the fact that Forester produces nested hyperlinks—which are not valid in HTML! I came up with a pretty slick way to <a href="https://git.sr.ht/~jonsterling/forester-base-theme/commit/a251f9cf19b0ff42f4553d315df5181b985c79cb">handle this in XSLT</a>, but that Atom renderer is intended to bypass that entirely.</p>
93
-
<p>As a side note, I am very happy to see that I am <a href="https://patrick.sirref.org/weekly-2025-03-31/">not the only person</a> using the new support for Atom feeds. Patrick’s fork of Forester is looking pretty cool, and I am excited to learn more from what he is doing. I’m also relieved that he was able to get rebased atop the ever-changing <code>forester-5.0-dev</code> branch.</p>
94
-
</section>
95
-
<section>
96
-
<header>
97
-
<h3>Federation is still janky</h3>
98
-
</header>
99
-
<p>One thing I want to start designing soon is how best to handle federated forests. Right now, Forester bundles all the imported material under a <code>foreign/my-friends-host/</code> directory and routes all links accordingly, but in many (but not all!) cases one would want to not bundle things at all and instead have links routed directly to the canonical URLs as published on the World Wide Web. I am not sure of the best design for this, so I welcome feedback. In the meanwhile, enjoy the janky prototype feel.</p>
100
-
</section>
101
-
<section>
102
-
<header>
103
-
<h3>Language server; code completion via effects and handlers</h3>
104
-
</header>
105
-
<p><a href="https://www.jonmsterling.com/kentookura/">Kento</a> is hard at work hardening Forester’s language server. I am hoping that we will have something to show on the scale of a week.</p>
106
-
<p>There were some subtleties about how to provide completion information at a source location—which is at least as complex as the expander itself, since scope emerges from the expansion process. We had something fairly broken in place, which I have spent Thursday and Friday morning replacing with something cool using OCaml 5’s effects and handlers. The idea is to instrument the expander with an effect that notifies observes that it has entered a source range; this can be handled as a no-op, <em>or</em> by querying the scope’s available symbols when it enters the desired range and throwing away the continuation, and resuming the continuation otherwise to keep searching. This approach allows all the scope-handling code to be unified into a single routine, whose behaviour is controlled by effect handlers on the outside.</p>
107
-
<p>As a side note, I am looking forward to when the next version of <a href="https://topiary.tweag.io/">Topiary</a> is released, which should contain support for formatting OCaml’s effect handlers. Right now we don’t use the nice notation because we are stuck on Topiary 0.6.0.</p>
108
-
</section>
109
-
</section>
110
-
<section>
111
-
<header>
112
-
<h2><a href="https://www.jonmsterling.com/jms-019E/">Project Pterosaur</a>: yes, I’m building a new proof assistant</h2>
113
-
</header>
114
-
<p>I swore after building <a href="https://github.com/RedPRL/cooltt">cooltt</a>, <a href="https://github.com/RedPRL/redtt">redtt</a>, and <a href="https://github.com/RedPRL/sml-redprl">RedPRL</a> that I would never build another proof assistant, as the experience burned around four years of my PhD and resulted (at least directly) in very little publishable work—but, to be fair, I probably would not have made the <a href="https://www.jonmsterling.com/jms-0014/">key mathematical discovery</a> of my <a href="https://www.jonmsterling.com/sterling-2021-thesis/">PhD thesis</a> if it were not for these engineering experiments. But I’m back on my bullshit, as the young people say, and hard at work building a new interactive proof assistant that I have code-named <a href="https://www.jonmsterling.com/jms-019E/">Project Pterosaur</a>.</p>
115
-
<section>
116
-
<header>
117
-
<h3>Locales in dependent type theory?</h3>
118
-
</header>
119
-
<p>The goal of Pterosaur is to explore the adaptation of <em>locales</em> from Isabelle to dependent type theory, as a lightweight but extremely expressive alternative to type classes. My colleague <a href="https://www.jonmsterling.com/lawrencepaulson/">Larry Paulson</a> has written <a href="https://lawrencecpaulson.github.io/tag/locales">some great blog posts about locales in Isabelle</a>, and I strongly recommend reading Ballarin’s <a href="https://www21.in.tum.de/~ballarin/publications/jar2019.pdf">Exploring the Structure of an Algebra Text with Locales</a> to get a feel for what is possible. Here is what locales do:</p>
120
-
<ol><li>Locales appear to completely solve the pain involved when building up hierarchies of mathematical structures and notations, allowing you to effortlessly combine theories along a common core (e.g. defining rings in terms of a multiplicative monoid and an Abelian group sharing the same carrier).</li>
121
-
<li>Locales allow you to <em>add new methods</em> to a theory after the fact, and they will magically be available on anything that extended that theory. You can also add new links in the theory graph, and both cycles and diamonds are allowed so long as they are coherent; this is useful if you want to silently regard (e.g.) the space of endomaps on a set as a monoid, etc.</li></ol>
122
-
<p>In comparison to modules and type classes, the strength of locales is that you don’t have to decide ahead of time whether you want to “bundle” fields with their carriers, etc. In contrast, a great deal of the difficult work of mathematical library design and maintainance in tools like Rocq, Agda, and <a href="https://www.jonmsterling.com/jms-019G/">Lean</a> is figuring out just what things to bundle, and fixing things when your choices inevitably lead to breakage, etc. Locales avoid these problems entirely.</p>
123
-
<p>Finally, a reasonably usable locale implementation can be obtained <em>without any higher-order unification whatsoever</em>. I have a feeling that will be extremely important, given how unreliable (and <a href="https://github.com/agda/agda/issues/5837">incorrect</a>!) most implementations of higher-order unification are; the situation is so bad that it is actually an open problem to define a correct higher-order unification algorithm in the presence of singleton types (such as the unit type). I do think that this can be solved (and may have already been solved by Andras Kovacs), but my point is that the prognosis for unification in dependent type theory is bad.</p>
124
-
</section>
125
-
<section>
126
-
<header>
127
-
<h3>Experimental implementation in <a href="https://www.jonmsterling.com/jms-019G/">Lean</a></h3>
128
-
</header>
129
-
<p>The other interesting thing about Pterosaur is that I am implementing it in <a href="https://www.jonmsterling.com/jms-019G/">Lean</a>; I am not verifying anything, and am making free use of Lean’s <code>partial</code> keyword (which hides potentially divergent code from definitional equality). Instead, I am thinking of Lean as a “better OCaml”: I can’t speak to the quality of the compiler and code generator, but I can absolutely say that from the perspective of day-to-day programming, Lean has a lot of affordances that make it extremely nice to use. On the other hand, Lean’s story for modularity is not so good; but I hope they don’t “fix” it any time soon, because I think that something like locales could be a good option for Lean itself in the future if I am able to demonstrate their potential in the context of Pterosaur’s clean-room implementation.</p>
130
-
</section>
131
-
<section>
132
-
<header>
133
-
<h3>A taste of code</h3>
134
-
</header>
135
-
<p>I will have more to say about Pterosaur in the future, but let me leave you with a bit of demo code.</p>
136
-
<pre>locale Magma { A =&gt;
137
-
car : Type,
138
-
car.isSet : isSet A·car,
139
-
cmp : (x y : A·car) → A·car
140
-
}
141
-
142
-
locale Magma.Hom { f =&gt;
143
-
dom : Magma,
144
-
cod : Magma,
145
-
car : (x : f·dom·car) → f·cod·car,
146
-
cmp : (x y : f·dom·car) → Id f·cod·car (f·car (f·dom·cmp x y)) (f·cod·cmp (f·car x) (f·car y))
147
-
}
148
-
149
-
locale Semigroup { A =&gt;
150
-
splice magma : Magma,
151
-
cmp.assoc : (x y z : A·car) → Id A·car (A·cmp (A·cmp x y) z) (A·cmp x (A·cmp y z))
152
-
}
153
-
154
-
locale Semigroup.Hom {f =&gt;
155
-
dom : Semigroup,
156
-
cod : Semigroup,
157
-
splice magma.hom : Magma.Hom / {dom := f·dom·magma, cod := f·cod·magma}
158
-
}
159
-
160
-
locale Monoid { A =&gt;
161
-
splice semigroup : Semigroup,
162
-
unit : A·car,
163
-
cmp.leftUnit : (x : A·car) → Id A·car (A·cmp A·unit x) x,
164
-
cmp.rightUnit : (x : A·car) → Id A·car (A·cmp x A·unit) x
165
-
}
166
-
167
-
locale Monoid.Hom {f =&gt;
168
-
dom : Monoid,
169
-
cod : Monoid,
170
-
splice semigroup.hom : Semigroup.Hom / {dom := f·dom·semigroup, cod := f·cod·semigroup},
171
-
unit : Id f·cod·car (f·car f·dom·unit) f·cod·unit
172
-
}
173
-
174
-
locale Group { G =&gt;
175
-
splice monoid : Monoid,
176
-
inv : (x : G·car) → G·car,
177
-
inv.inv : (x : G·car) → Id G·car (G·inv (G·inv x)) x
178
-
}
179
-
180
-
locale AbelianGroup { A =&gt;
181
-
splice group : Group,
182
-
splice commutativeOperation : CommutativeOperation / {car := A·car, cmp := A·cmp}
183
-
}</pre>
184
-
</section>
185
-
</section>
186
-
<section>
187
-
<header>
188
-
<h2>Two papers to appear in <a href="https://www.jonmsterling.com/lics-2025/">LICS ’25</a></h2>
189
-
</header>
190
-
<p>This week I have had two papers accepted at <a href="https://www.jonmsterling.com/lics-2025/">LICS ’25</a>; I’m excited about both of them.</p>
191
-
<section>
192
-
<header>
193
-
<h3>With <a href="https://www.jonmsterling.com/leonipugh/">Leoni Pugh</a>: <a href="https://www.jonmsterling.com/pugh-sterling-2025/">When is the partial map classifier a Sierpiński cone?</a></h3>
194
-
</header>
195
-
<p><a href="https://www.jonmsterling.com/leonipugh/">Leoni Pugh</a> is my old Part III student from 2023–2024, and this work builds on her Part III dissertation. The goal of our paper was to better understand the relationship between two approaches to partial functions in denotational semantics:</p>
196
-
<ol><li><strong>“Geometrical” partiality / “the Sierpiński cone”</strong>: freely add a lowest element to the space representing a given data type. This is useful for defining functions whose <em>inputs</em> are partially defined, because you can do a case-analysis on the definedness of the input.</li>
197
-
<li><strong>“Logical” partiality / “the partial map classifier”</strong>: representing partially defined elements of a space <math xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi></math> by pairs
198
-
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
199
-
<mo fence="true">(</mo>
200
-
<mi>p</mi><mo>,</mo><mi>x</mi>
201
-
<mo fence="true">)</mo>
202
-
</mrow></math>
203
-
where <math xmlns="http://www.w3.org/1998/Math/MathML"><mi>p</mi></math> is a proposition and <math xmlns="http://www.w3.org/1998/Math/MathML"><mi>x</mi></math> is a function from <math xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>isTrue</mi>
204
-
<mrow>
205
-
<mo fence="true">(</mo>
206
-
<mi>p</mi>
207
-
<mo fence="true">)</mo>
208
-
</mrow>
209
-
</mrow></math> to <math xmlns="http://www.w3.org/1998/Math/MathML"><mi>X</mi></math>. This is useful for defining functions whose <em>outputs</em> are partially defined.</li></ol>
210
-
<p>In traditional domain theory as developed by <a href="https://www.jonmsterling.com/danascott/">Scott</a>, the two kinds of partiality coincide—<a href="https://www.jonmsterling.com/sterling-2024-lifting/">even constructively</a>. I am, however, interested in <a href="https://www.jonmsterling.com/hyland-1991/"><em>synthetic domain theory</em></a> which abstracts away from continuity and limits and lets you just use sets and functions rather than cpos and continuous functions—provided that you avoid non-constructive principles like the Axiom of Choice or the Law of Excluded Middle. The starting point of our work is my observation that the two notions cannot coincide <em>absolutely</em> in synthetic domain theory, but that there may be restricted subuniverses in which they do coincide. The main result of our paper is to define such a subuniverse, made possible by my discovery of the <em>based Segal condition</em>—a strengthening of the usual Segal condition for higher categories.</p>
211
-
<p>A broader motivation of this work is to develop synthetic domain theory and synthetic higher category theory within the same framework. Whereas synthetic domain theory traditionally concerned itself with spaces that behaved like ω-complete partial orders (but where all functions are automatically monotone and continuous), the same ideas (if applied within <a href="https://www.jonmsterling.com/hottbook/">homotopy type theory</a>) allow you to consider spaces that behave like <em>∞-categories</em> with colimits of ω-chains (but where all functions are automatically ∞-functorial and ω-continuous). I believe that unifying domain theory and higher category theory will prove useful for studying things like the denotational semantics of concurrency, which is inherently higher-dimensional.</p>
212
-
</section>
213
-
<section>
214
-
<header>
215
-
<h3>With <a href="https://www.jonmsterling.com/andrewslattery/">Andrew Slattery</a>: <a href="https://www.jonmsterling.com/slattery-sterling-2025/">Hofmann–Streicher lifting of fibred categories</a></h3>
216
-
</header>
217
-
<p>This year, <a href="https://www.jonmsterling.com/thomasstreicher/">Thomas Streicher</a> (born 1958) passed away from cancer. Thomas was one of the Greats of dependent type theory and he also wrote an <a href="https://www.abebooks.co.uk/9789812701428/Domain-theoretic-Foundations-Functional-Programming-Streicher-9812701427/plp">excellent textbook on domain theory for denotational semantics</a>, but much more importantly he was kind and curious and patient and always made time for young people. While I was still finding my place in the community, Thomas was very generous to me with his time and advice, and he sent me many papers to referee.</p>
218
-
<p>Although Thomas made many contributions to dependent type theory, domain theory, realisability theory, and category theory, he is most known to type theorists for two things—both in collaboration with the late <a href="https://www.jonmsterling.com/martinhofmann/">Martin Hofmann</a>: the <a href="https://www.jonmsterling.com/hofmann-streicher-1998/">groupoid interpretation of type theory</a> and the eponymous <a href="https://www.jonmsterling.com/hofmann-streicher-1997/">Hofmann–Streicher universe lifting construction</a>. Andrew and my paper pertains to the latter.</p>
219
-
<p>The idea of Hofmann–Streicher lifting has to do with universes, which are “types of types” (typically defined in such a way as to avoid paradoxes). Martin-Löf type theory usually includes universes in order to be able to quantify over (small enough) types; in the simplest models of Martin-Löf type theory, types are interpreted as sets and so Martin-Löf’s universes are interpreted as certain sets of sets, such as <a href="https://www.jonmsterling.com/sga-4/">Grothendieck universes</a>. But it is important to be able to interpret the language of type theory in more sophisticated worlds than set theory: for example, in <em>presheaves</em> (which are functors from a fixed category <math xmlns="http://www.w3.org/1998/Math/MathML"><mi>C</mi></math> into <math xmlns="http://www.w3.org/1998/Math/MathML"><mi>Set</mi></math>). What <a href="https://www.jonmsterling.com/hofmann-streicher-1997/">Hofmann and Streicher</a> did is show how to transform any universe of sets into a universe of presheaves!</p>
220
-
<p>Although Hofmann and Streicher’s construction worked well and had good properties, they did not find a <em>universal property</em> for it—which is an abstract description of the object that determines it uniquely up to isomorphism, usually in terms of how it relates to other objects. Recently <a href="https://www.jonmsterling.com/awodey-2024-universes/">Awodey</a> found a 1-dimensional universal property, which was the starting point of our work. What Andrew and I wanted to do is generalise Awodey’s analysis in two directions:</p>
221
-
<ol><li>We wanted a <em>2-dimensional</em> version, which is useful because it captures more about the universe than can be said in just one dimension: for example, with a 2-dimensional version, you can see immediately (by “abstract nonsense”) that Hofmann–Streicher lifting preserves structures like monads, adjunctions, etc. that might be used for modelling computational effects, etc.</li>
222
-
<li>We wanted a <em>relative</em> version, which would make it easier to iterate the Hofmann–Streicher lifting construction: the purpose of this is to be able to define presheaf models of type theory <em>internal</em> to other presheaf models. These kind of situations actually happen in practice! For example, the model of <a href="https://www.jonmsterling.com/bbcgsv-2019/">guarded cubical type theory</a> that combines step-indexing with univalence ought to be an example of this.</li></ol>
223
-
<p>To develop this two-fold generalisation of Hofmann–Streicher lifting, we resituated the theory in terms of another of Thomas’s favourite topics: the theory of <em>fibrations</em>, on which Thomas had written <a href="https://www.jonmsterling.com/streicher-fcjb/">the most wonderful lecture notes</a>.</p>
224
-
<p>We dedicated our paper to Thomas’s memory. May he rest in peace.</p>
225
-
</section>
226
-
</section>
227
-
<section>
228
-
<header>
229
-
<h2>Personal, reading</h2>
230
-
</header>
231
-
<p>I recently read Arthur C. Clarke’s <a href="https://www.jonmsterling.com/clarke-1979/">The Fountains of Paradise</a>; although it was a pretty good read, I found that like many science fiction books of that era, one has to look past a lot in order to enjoy it. I wrote some commentary in my post entitled <a href="https://www.jonmsterling.com/jms-019W/">Ventriloquy of the Mid-Century Man</a> on my culture blog <a href="https://www.jonmsterling.com/jms-015X/">The Jon Sterling Review of Books</a>.</p>
232
-
</section></summary><category term="Jon Sterling › Weeknotes"></category></entry><entry><title>Coping and Capping</title><link href="https://mort.io/blog/coping-and-capping/" rel="alternate"></link><published>2025-04-08T01:00:00Z</published><updated>2025-04-08T01:00:00Z</updated><author><name>RichardM</name></author><id>https://mort.io/blog/coping-and-capping/</id><summary type="html"><p>Well that was fun! Quite high up there in the set of things that I never even
74
+
<p><a href="https://www.dell.com/support/manuals/en-uk/poweredge-r640/per640_ism_pub/general-memory-module-installation-guidelines?guid=guid-acbc0f13-dedb-492b-a0b0-18303ded565a&amp;lang=en-us">Dell R640 has 24 DIMM slots</a></p></summary><category term="Tunbury.ORG"></category></entry><entry><title>Coping and Capping</title><link href="https://mort.io/blog/coping-and-capping/" rel="alternate"></link><published>2025-04-08T01:00:00Z</published><updated>2025-04-08T01:00:00Z</updated><author><name>RichardM</name></author><id>https://mort.io/blog/coping-and-capping/</id><summary type="html"><p>Well that was fun! Quite high up there in the set of things that I never even
233
75
considered I might do would’ve been awarding degrees. But by dint of being
234
76
President and thus standing in for
235
77
<a href="https://en.wikipedia.org/wiki/Simon_McDonald%2C_Baron_McDonald_of_Salford">Simon</a>,
+56
-2
index.html
+56
-2
index.html
···
414
414
max-height: none;
415
415
display: inline;
416
416
margin-left: 8px;
417
+
opacity: 1;
417
418
}
418
419
419
420
.preview-links,
···
1273
1274
const firstLine = getFirstLine(contentHtml);
1274
1275
const textPreview = getTextPreview(contentHtml);
1275
1276
1277
+
// Get preview from the entry directly (if available)
1278
+
const preview = entry.getElementsByTagName('preview')[0]?.textContent || '';
1279
+
1276
1280
// Store the entry data
1277
1281
entriesById[id] = {
1278
1282
id,
···
1280
1284
title,
1281
1285
link,
1282
1286
contentHtml,
1283
-
firstLine,
1287
+
firstLine: preview || firstLine, // Use preview field if available, otherwise fallback to firstLine
1284
1288
textPreview,
1285
1289
published,
1286
1290
author,
···
1431
1435
<div class="feed-item-date">${getDayWithOrdinal(date)}</div>
1432
1436
<div class="feed-item-author">${entry.author}</div>
1433
1437
<div class="feed-item-content-wrapper">
1434
-
<div class="feed-item-title"><a href="${entry.link}" target="_blank">${entry.title}</a></div><div class="feed-item-preview">${entry.textPreview}</div>
1438
+
<div class="feed-item-title"><a href="${entry.link}" target="_blank">${entry.title}</a></div><div class="feed-item-preview">${entry.firstLine}</div>
1435
1439
1436
1440
${entry.externalLinks && entry.externalLinks.length > 0 ? `
1437
1441
<div class="preview-links">
···
1660
1664
header.style.visibility = index === 0 ? 'visible' : 'hidden';
1661
1665
});
1662
1666
1667
+
// If we have entries, set the most recent (first) entry's date as active in the timeline
1668
+
if (entriesArray.length > 0) {
1669
+
const mostRecentEntry = entriesArray[0];
1670
+
const date = new Date(mostRecentEntry.published);
1671
+
const year = date.getFullYear();
1672
+
const month = date.getMonth();
1673
+
1674
+
// Set most recent date as the active period in the timeline
1675
+
const yearEl = document.querySelector(`.timeline-year[data-year="${year}"]`);
1676
+
const monthEl = document.querySelector(`.timeline-month[data-year="${year}"][data-month="${month}"]`);
1677
+
1678
+
// Clear all active classes first
1679
+
document.querySelectorAll('.timeline-year.active, .timeline-month.active').forEach(el => {
1680
+
el.classList.remove('active');
1681
+
});
1682
+
1683
+
// Add active classes to the appropriate year/month
1684
+
if (yearEl) {
1685
+
yearEl.classList.add('active');
1686
+
lastActiveYear = year;
1687
+
}
1688
+
if (monthEl) {
1689
+
monthEl.classList.add('active');
1690
+
lastActiveMonth = month;
1691
+
}
1692
+
1693
+
// Show the month header for the most recent month
1694
+
document.querySelectorAll('.month-year-header').forEach(header => {
1695
+
header.style.visibility = 'hidden';
1696
+
});
1697
+
const recentHeader = document.querySelector(`.month-year-header[data-year="${year}"][data-month="${month}"]`);
1698
+
if (recentHeader) {
1699
+
recentHeader.style.visibility = 'visible';
1700
+
}
1701
+
}
1702
+
1663
1703
// Helper function to observe all items with date attributes
1664
1704
function observeAllDateItems() {
1665
1705
// Observe all feed items for scroll tracking
···
1915
1955
linkMonthHeaders.forEach((header, index) => {
1916
1956
header.style.visibility = index === 0 ? 'visible' : 'hidden';
1917
1957
});
1958
+
1959
+
// If we have links, set the most recent link's date as active in the timeline for the links tab
1960
+
if (dedupedLinks.length > 0) {
1961
+
const mostRecentLink = dedupedLinks[0];
1962
+
const linkDate = mostRecentLink.date;
1963
+
const linkYear = linkDate.getFullYear();
1964
+
const linkMonth = linkDate.getMonth();
1965
+
1966
+
// Add a flag to remember we've set a most recent link
1967
+
window.mostRecentLinkSet = {
1968
+
year: linkYear,
1969
+
month: linkMonth
1970
+
};
1971
+
}
1918
1972
1919
1973
// Process people data
1920
1974
const peopleContainer = document.querySelector('.people-container');
+2
-93
threads.json
+2
-93
threads.json
···
29
29
}
30
30
]
31
31
},
32
-
"https://www.jonmsterling.com/2025-W15/": {
33
-
"id": "https://www.jonmsterling.com/2025-W15/",
34
-
"title": "Weeknotes 2025-W15",
35
-
"link": "https://www.jonmsterling.com/2025-W15/",
36
-
"feed_title": "Jon Sterling \u203a Weeknotes",
37
-
"references": [
38
-
{
39
-
"id": "https://www.forester-notes.org/JVIT/",
40
-
"link": "https://www.forester-notes.org/JVIT/",
41
-
"title": "Towards Forester 5.0 II: a design for canonical URLs",
42
-
"feed_title": "Forester Blog",
43
-
"in_feed": true
44
-
},
45
-
{
46
-
"id": "https://patrick.sirref.org/weekly-2025-03-31/",
47
-
"link": "https://patrick.sirref.org/weekly-2025-03-31/",
48
-
"title": "Shelter, Hazel and More!",
49
-
"feed_title": "Weeklies",
50
-
"in_feed": true
51
-
}
52
-
],
53
-
"referenced_by": [],
54
-
"external_links": [
55
-
{
56
-
"url": "https://www.forester-notes.org/jms-011P/",
57
-
"normalized_url": "https://forester-notes.org/jms-011P",
58
-
"in_feed": false
59
-
},
60
-
{
61
-
"url": "https://git.sr.ht/~jonsterling/forester-base-theme/commit/a251f9cf19b0ff42f4553d315df5181b985c79cb",
62
-
"normalized_url": "https://git.sr.ht/~jonsterling/forester-base-theme/commit/a251f9cf19b0ff42f4553d315df5181b985c79cb",
63
-
"in_feed": false
64
-
},
65
-
{
66
-
"url": "https://topiary.tweag.io/",
67
-
"normalized_url": "https://topiary.tweag.io",
68
-
"in_feed": false
69
-
},
70
-
{
71
-
"url": "https://github.com/RedPRL/cooltt",
72
-
"normalized_url": "https://github.com/RedPRL/cooltt",
73
-
"in_feed": false
74
-
},
75
-
{
76
-
"url": "https://github.com/RedPRL/redtt",
77
-
"normalized_url": "https://github.com/RedPRL/redtt",
78
-
"in_feed": false
79
-
},
80
-
{
81
-
"url": "https://github.com/RedPRL/sml-redprl",
82
-
"normalized_url": "https://github.com/RedPRL/sml-redprl",
83
-
"in_feed": false
84
-
},
85
-
{
86
-
"url": "https://lawrencecpaulson.github.io/tag/locales",
87
-
"normalized_url": "https://lawrencecpaulson.github.io/tag/locales",
88
-
"in_feed": false
89
-
},
90
-
{
91
-
"url": "https://www21.in.tum.de/~ballarin/publications/jar2019.pdf",
92
-
"normalized_url": "https://www21.in.tum.de/~ballarin/publications/jar2019.pdf",
93
-
"in_feed": false
94
-
},
95
-
{
96
-
"url": "https://github.com/agda/agda/issues/5837",
97
-
"normalized_url": "https://github.com/agda/agda/issues/5837",
98
-
"in_feed": false
99
-
},
100
-
{
101
-
"url": "https://www.abebooks.co.uk/9789812701428/Domain-theoretic-Foundations-Functional-Programming-Streicher-9812701427/plp",
102
-
"normalized_url": "https://abebooks.co.uk/9789812701428/Domain-theoretic-Foundations-Functional-Programming-Streicher-9812701427/plp",
103
-
"in_feed": false
104
-
}
105
-
]
106
-
},
107
32
"https://mort.io/blog/coping-and-capping/": {
108
33
"id": "https://mort.io/blog/coping-and-capping/",
109
34
"title": "Coping and Capping",
···
983
908
"link": "https://patrick.sirref.org/weekly-2025-03-31/",
984
909
"feed_title": "Weeklies",
985
910
"references": [],
986
-
"referenced_by": [
987
-
{
988
-
"id": "https://www.jonmsterling.com/2025-W15/",
989
-
"link": "https://www.jonmsterling.com/2025-W15/",
990
-
"title": "Weeknotes 2025-W15",
991
-
"feed_title": "Jon Sterling \u203a Weeknotes",
992
-
"in_feed": true
993
-
}
994
-
],
911
+
"referenced_by": [],
995
912
"external_links": [
996
913
{
997
914
"url": "https://github.com/quantifyearth/shark",
···
1408
1325
"in_feed": true
1409
1326
}
1410
1327
],
1411
-
"referenced_by": [
1412
-
{
1413
-
"id": "https://www.jonmsterling.com/2025-W15/",
1414
-
"link": "https://www.jonmsterling.com/2025-W15/",
1415
-
"title": "Weeknotes 2025-W15",
1416
-
"feed_title": "Jon Sterling \u203a Weeknotes",
1417
-
"in_feed": true
1418
-
}
1419
-
],
1328
+
"referenced_by": [],
1420
1329
"external_links": [
1421
1330
{
1422
1331
"url": "https://web.archive.org/",