v2.4

Gemfile

@@ -12,4 +12,6 @@ group :jekyll_plugins do
     gem 'jekyll-sitemap'
     gem 'jekyll-feed'
     gem 'jekyll-seo-tag'
-end
+end
+
+gem "webrick"

README.md

@@ -6,24 +6,26 @@
 
 <!-- LOGO -->
 <br />
+
 <p align="center">
   <a href="https://github.com/akiritsu/pRoJEct-VeXEd">
     <img src="src/assets/img/favicon.png" alt="Logo" width="80" height="80">
   </a>
 
   <h3 align="center">pRoJEct-VeXEd</h3>
-    <h5  align="center">v 2.3<h5
+    <h5 align="center">v 2.4</h5>
     <br />
   <p align="center">
     pRoJEct-NeGYa is a hacker-like, highly-customizable theme for note-keeping, personal-website or CV.
     <br />
     <br />
     <a href="https://akiritsu.github.io/pRoJEct-VeXEd/">View Demo</a>
     ·
-    <a href="https://akiritsu.github.io/pRoJEct-VeXEd/issues">Report Bug</a>
+    <a href="https://github.com/akiritsu/pRoJEct-VeXEd/issues">Report Bug</a>
     ·
-    <a href="https://akiritsu.github.io/pRoJEct-VeXEd/issues">Request Feature</a>
+    <a href="https://github.com/akiritsu/pRoJEct-VeXEd/issues">Request Feature</a>
   </p>
+
 </p>
 
 <!-- TABLE OF CONTENTS -->
@@ -78,6 +80,7 @@ This jekyll theme is a content-oriented blog, cv or learning notes, aimed at pro
 * Font Awesome
 * Sjcl
 * Disqus
+* Mermaid
 
 ## Getting Started
 
@@ -110,6 +113,12 @@ gem install bundler
 bundler install jekyll
 ```
 
+* jekyll plugins
+
+```bash
+gem install jekyll-sitemap jekyll-feed jekyll-seo-tag jekyll-mermaid
+```
+
 ### Installation
 
 1. Fork this project on [github](https://github.com/akiritsu/pRoJEct-VeXEd), change project settings, and clone your own repository into your local disk.

_config.yml

@@ -113,6 +113,8 @@ plugins:
   - jekyll-sitemap
   - jekyll-seo-tag
 
+gems: [jekyll-mermaid]
+
 # 8. Others
 # Cross-Origin Resource Sharing header
 webrick:

collections/_posts/2019-7-16-readme-zhcn.md

@@ -6,13 +6,11 @@ date: 2019-7-16
 comment: ture
 ---
 
-{{page.comment}}
-
 # PRoJEct-VeXEd
 
 黑客帝国掉字母儿风格的个人主页模板。
 
-版本： v2.3
+版本： v2.4
 
 ## 特性
 
@@ -22,6 +20,7 @@ comment: ture
 4. 文章归档及索引
 5. 高度可定制化
 6. 加密内容
+7. Mermaid绘图
 
 ## 使用方法
 
@@ -58,6 +57,8 @@ comment: ture
 
 ## 更新日志
 
+2021.8.21： v2.4 增加Mermaid绘图功能，重新安排布局
+
 2020.11.18： v2.3 增加评论功能
 
 2020.11.16： v2.2 完善基础样式

pages/index.md

@@ -11,79 +11,63 @@ author: ""
 encrypted_text: true
 permalink: /
 ---
-{{site.collection_order[0]}}
+
 # PROJECT VeXEd - HACKER-STYLE PERSONAL HOMEPAGE
 
 <br>
 > pRoJEct-NeGYa is a hacker-like, highly-customizable theme for note-keeping, personal-website or CV.
 
+## Features
+
+- Highly customizable with user-friendly hacker-like design.
+- Easy to gather your notes or portfolios with multiple collection design.
+- Supports formula insertion with `MathJax`.
 
-##  Features
-* Highly customizable with user-friendly hacker-like design.
-* Easy to gather your notes or portfolios with multiple collection design.
-* Supports formula insertion with `MathJax`.
-<div style="color: rgb(233, 32, 32)">
 $$
-NADH+Q+5\;H_{matrix}^{+}\rightarrow NAD^{+}+QH_{2}+4\;H_{intermembrane}^{+}\!
+\mathbf{V}_1 \times \mathbf{V}_2 =  \begin{vmatrix}
+\mathbf{i} & \mathbf{j} & \mathbf{k} \\
+\frac{\partial X}{\partial u} &  \frac{\partial Y}{\partial u} & 0 \\
+\frac{\partial X}{\partial v} &  \frac{\partial Y}{\partial v} & 0 \\
+\end{vmatrix}
 $$
-</div>
-* Supports code highlight with `Rouge`.
+
+- Supports code highlight with `Rouge`.
 
 ```python
-# Function to do Quick sort 
-def quickSort(arr,low,high): 
-    if low < high: 
-
-        # pi is partitioning index, arr[p] is now 
-        # at right place 
-        pi = partition(arr,low,high) 
-
-        # Separately sort elements before 
-        # partition and after partition 
-        quickSort(arr, low, pi-1) 
-        quickSort(arr, pi+1, high) 
-
-# Driver code to test above 
-arr = [10, 7, 8, 9, 1, 5] 
-n = len(arr) 
-quickSort(arr,0,n-1) 
-print ("Sorted array is:") 
-for i in range(n): 
-    print ("%d" %arr[i]), 
+arr = [10, 7, 8, 9, 1, 5]
+n = len(arr)
+quickSort(arr,0,n-1)
+print ("Sorted array is:")
+for i in range(n):
+    print ("%d" %arr[i]),
 ```
 
-* Decrypt and encrypt text (access token: 233): 
-  * secret msg example: 
+- Decrypt and encrypt text (access token: 233):
+  - secret msg example:
   <p class="encrypted" id="/MZAf/PKx9jpw8/Jnp7XQQFki2ibGnArZP46W+keVThXquhWwFROEFnbY8eC57Tw==">Encrypted content!</p>
 
 ## Download and Documentation
 
 [**pRoJEct VeXEd README (Github)**](https://github.com/akiritsu/pRoJEct-VeXEd)
 
-[Download .zip files](https://codeload.github.com/akiritsu/pRoJEct-VeXEd/zip/master)
+[Download ZIP files](https://codeload.github.com/akiritsu/pRoJEct-VeXEd/zip/master)
 
-[中文自述及使用教程](https://akiritsu.github.io/pRoJEct-VeXEd/posts/readme/)
+[中文自述及使用教程](https://akiritsu.github.io/pRoJEct-VeXEd/readme-zhcn/)
 
 ## More Samples
 
 ### Font style and link
-* normal
-* **bold**
-* *italic*
-* ~~strikethrough~~
-* `keyword`
-* [Link to Google](www.google.com)
+
+normal **bold** _italic_ ~~strikethrough~~ `keyword` [Link to Google](www.google.com)
 
 ### List
+
 1. ordered list item 1
-2. ordered list item 2
    1. sublist
-   2. sublist 2
       1. subsublist
-
-* unordered list 
-* unordered list
-  * sublist
+
+- unordered list
+  - sublist
 
 ### Table
 
@@ -94,6 +78,44 @@ for i in range(n):
 | Nov 13, 2018 | v2.14c    | 12kb    | No irreversible damage |
 | Nov 15, 2018 | v1.99 LTS | 4kb     | Irreversible damage    |
 
+### Diagram and Chart
+
+#### Pie Chart
+
+```mermaid
+pie
+    title Pie Chart
+    "Dogs" : 36
+    "Cats" : 85
+    "Rats" : 150
+    "Pheonix" : 120
+    "Elephant" : 330 
+```
+
+#### Sequence Diagram
+
+```mermaid
+sequenceDiagram
+    Alice->>Bob: Hello Bob, how are you?
+    alt is sick
+    Bob->>Alice: Not so good :(
+    else is well
+    Bob->>Alice: Feeling fresh like a daisy
+    end
+    opt Extra response
+    Bob->>Alice: Thanks for asking
+    end
+```
+
+#### Flow Chart
+
+```mermaid
+graph LR
+A[Hard edge] -->B(Round edge)
+    B --> C{Decision}
+    C -->|One| D[Result one]
+    C -->|Two| E[Result two]
+```
 
 ### More Texts
 
@@ -104,55 +126,55 @@ for i in range(n):
 ### More Codes
 
 ```python
-# Python program for implementation of Quicksort Sort 
-  
-# This function takes last element as pivot, places 
-# the pivot element at its correct position in sorted 
-# array, and places all smaller (smaller than pivot) 
-# to left of pivot and all greater elements to right 
-# of pivot 
-def partition(arr,low,high): 
-    i = ( low-1 )         # index of smaller element 
-    pivot = arr[high]     # pivot 
-  
-    for j in range(low , high): 
-  
-        # If current element is smaller than or 
-        # equal to pivot 
-        if   arr[j] <= pivot: 
-          
-            # increment index of smaller element 
-            i = i+1 
-            arr[i],arr[j] = arr[j],arr[i] 
-  
-    arr[i+1],arr[high] = arr[high],arr[i+1] 
-    return ( i+1 ) 
-  
-# The main function that implements QuickSort 
-# arr[] --> Array to be sorted, 
-# low  --> Starting index, 
-# high  --> Ending index 
-  
-# Function to do Quick sort 
-def quickSort(arr,low,high): 
-    if low < high: 
-  
-        # pi is partitioning index, arr[p] is now 
-        # at right place 
-        pi = partition(arr,low,high) 
-  
-        # Separately sort elements before 
-        # partition and after partition 
-        quickSort(arr, low, pi-1) 
-        quickSort(arr, pi+1, high) 
-  
-# Driver code to test above 
-arr = [10, 7, 8, 9, 1, 5] 
-n = len(arr) 
-quickSort(arr,0,n-1) 
-print ("Sorted array is:") 
-for i in range(n): 
-    print ("%d" %arr[i]), 
-  
-# This code is contributed by Mohit Kumra 
-```
+# Python program for implementation of Quicksort Sort
+
+# This function takes last element as pivot, places
+# the pivot element at its correct position in sorted
+# array, and places all smaller (smaller than pivot)
+# to left of pivot and all greater elements to right
+# of pivot
+def partition(arr,low,high):
+    i = ( low-1 )         # index of smaller element
+    pivot = arr[high]     # pivot
+
+    for j in range(low , high):
+
+        # If current element is smaller than or
+        # equal to pivot
+        if   arr[j] <= pivot:
+
+            # increment index of smaller element
+            i = i+1
+            arr[i],arr[j] = arr[j],arr[i]
+
+    arr[i+1],arr[high] = arr[high],arr[i+1]
+    return ( i+1 )
+
+# The main function that implements QuickSort
+# arr[] --> Array to be sorted,
+# low  --> Starting index,
+# high  --> Ending index
+
+# Function to do Quick sort
+def quickSort(arr,low,high):
+    if low < high:
+
+        # pi is partitioning index, arr[p] is now
+        # at right place
+        pi = partition(arr,low,high)
+
+        # Separately sort elements before
+        # partition and after partition
+        quickSort(arr, low, pi-1)
+        quickSort(arr, pi+1, high)
+
+# Driver code to test above
+arr = [10, 7, 8, 9, 1, 5]
+n = len(arr)
+quickSort(arr,0,n-1)
+print ("Sorted array is:")
+for i in range(n):
+    print ("%d" %arr[i]),
+
+# This code is contributed by Mohit Kumra
+```

src/_includes/collection_list.html

@@ -1,6 +1,7 @@
 <!-- collection list, shown by click "archive" buttom in header -->
-
-<div class="collection_list" id="the_collection_list">
+<div class="collection_list_container"  id="the_collection_list">
+<div class="collection_list_background"  onclick="close_collection_list()"></div>
+<div class="collection_list" onload="none">
     <div class="collection_list_header">
         <!-- TODO: search post -->
                                             <!-- <a class="search_btn">
@@ -139,3 +140,4 @@
         {% endfor %}
     </div>
 </div>
+</div>

src/_includes/head.html

@@ -32,7 +32,8 @@
     <script src="{{site.url}}{{site.baseurl}}/src/assets/js/main.js" async></script>
     <!-- mathjax 2.7.5 -->
     <script async src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/MathJax.js?config=TeX-MML-AM_CHTML"></script>
-
+    <!-- mermaid 8.11.5-->
+    <script async src="https://cdnjs.cloudflare.com/ajax/libs/mermaid/8.11.5/mermaid.min.js"></script>
     {% feed_meta %}
     {% seo %}
 </head>

src/_includes/header.html

@@ -106,7 +106,7 @@
   toclv = 3 %} {% endif %}
   <!-- generate toc -->
   {% include toc.html html=content sanitize=true class="ul_toc" id="ul_toc"
-  h_min=1 h_max=toclv %}
+  h_min=2 h_max=toclv %}
 </div>
 {% endif %}
 <!-- toggle maximize -->