about summary refs log tree commit diff homepage
diff options
context:
space:
mode:
authorNguyễn Gia Phong <mcsinyx@disroot.org>2021-11-24 16:09:04 +0700
committerNguyễn Gia Phong <mcsinyx@disroot.org>2021-11-24 16:09:04 +0700
commitd6b00e54d2c6765b59242044b6dba36531edd660 (patch)
tree7ac6d856a8c52143e7ec722e72e1070db8710967
parent6c2602852739dcd62b3c6484e21bcb8e580a42cc (diff)
downloadsite-d6b00e54d2c6765b59242044b6dba36531edd660.tar.gz
Improve note styling
-rw-r--r--_css/style.css2
-rw-r--r--blog/2020/gsoc/index.md2
-rw-r--r--blog/conseq.md20
-rw-r--r--blog/threa.md2
4 files changed, 14 insertions, 12 deletions
diff --git a/_css/style.css b/_css/style.css
index 1ed8623..283ac2e 100644
--- a/_css/style.css
+++ b/_css/style.css
@@ -158,6 +158,8 @@ body { margin: 0 1rem }
 
 .franklin-content blockquote p, .note p { margin: 1ex 0 }
 
+.note p:first-child { font-weight: bold }
+
 .franklin-content blockquote {
     background: var(--block-bg);
     border-left: 0.25rem solid var(--fade-fg);
diff --git a/blog/2020/gsoc/index.md b/blog/2020/gsoc/index.md
index 823ed98..e345cd1 100644
--- a/blog/2020/gsoc/index.md
+++ b/blog/2020/gsoc/index.md
@@ -2,7 +2,7 @@
 title = "Google Summer of Code 2020"
 rss = "GSoC 2020 final report"
 date = Date(2020, 8, 31)
-tags = ["fun", "gsoc", "pip"]
+tags = ["fun", "gsoc", "packaging", "pip"]
 internship = "https://summerofcode.withgoogle.com/archive/2020/projects/6238594655584256"
 benchmark = "/blog/2020/gsoc/article/7/#the_benchmark"
 python_gsoc = "https://blogs.python-gsoc.org/en/mcsinyxs-blog"
diff --git a/blog/conseq.md b/blog/conseq.md
index 5b843eb..b9ea570 100644
--- a/blog/conseq.md
+++ b/blog/conseq.md
@@ -65,17 +65,17 @@ but since we will only evaluate the first few terms
 8
 ```
 
-@@note
-The `fibo_seq` above is just to demonstrate how `itertools.count`
-can be use to create an infinite sequence defined by a function.
-For better performance, this should be used instead:
+!!! note "Note"
 
-```python
-def fibonacci_sequence(a=0, b=1):
-    yield a
-    yield from fibonacci_sequence(b, a + b)
-```
-@@
+    The `fibo_seq` above is just to demonstrate how `itertools.count`
+    can be use to create an infinite sequence defined by a function.
+    For better performance, the following should be used instead:
+
+    ```python
+    def fibonacci_sequence(a=0, b=1):
+        yield a
+        yield from fibonacci_sequence(b, a+b)
+    ```
 
 It is noticable that the elements having been iterated through (using `next`)
 will disappear forever in the void (oh no!), but that is the cost we are
diff --git a/blog/threa.md b/blog/threa.md
index 9cad466..8a6ea45 100644
--- a/blog/threa.md
+++ b/blog/threa.md
@@ -5,7 +5,7 @@ date = Date(2021, 7, 3)
 tags = ["clipboard", "fun", "raku"]
 +++
 
-!!! note "A word of protest:"
+!!! note "A word of protest"
 
     This was intended to be presented in [The Raku Conference],
     however the organizers insisted on using [Zoom] and [Skype],