@lexho111/plainblog 0.5.28 → 0.6.0

package/model/datastructures/BinarySearchTree.js

@@ -0,0 +1,276 @@
+import createDebug from "debug";
+import Article from "../../Article.js";
+
+const debug = createDebug("plainblog:BinarySearchTree");
+
+class BlogNode {
+  constructor(article) {
+    this.article = article;
+    this.left = null;
+    this.right = null;
+  }
+}
+
+export class BinarySearchTree {
+  constructor() {
+    this.root = null;
+  }
+
+  // O(n) - Linear search (Base class has no HashMap)
+  contains(id) {
+    return this.find(id) !== null;
+  }
+
+  // Insert a new article
+  insert(article) {
+    // Note: The tree is now sorted by date. ID-based methods will not work correctly.
+    // if (!article.id) article.id = this.getNextID();
+    // Add to the Set
+    const newNode = new BlogNode(article);
+    if (!this.root) {
+      this.root = newNode;
+      return;
+    }
+    let current = this.root;
+    const newTime = newNode.article.createdAt;
+    while (true) {
+      // Using getTime() for numeric comparison. Duplicates go to the right.
+      if (newTime < current.article.createdAt) {
+        if (!current.left) {
+          current.left = newNode;
+          break;
+        }
+        current = current.left;
+      } else {
+        if (!current.right) {
+          current.right = newNode;
+          break;
+        }
+        current = current.right;
+      }
+    }
+  }
+
+  update(id, title, content) {
+    const article = this.find(id);
+    article.title = title;
+    article.content = content;
+  }
+
+  search(query) {
+    debug("search %s ", query);
+    const lower = query.toLowerCase();
+    return this.getAllArticles().filter(
+      (a) =>
+        a.title.toLowerCase().includes(lower) ||
+        a.content.toLowerCase().includes(lower),
+    );
+  }
+
+  _findMinNode(node) {
+    while (node.left) node = node.left;
+    return node;
+  }
+
+  // Search for a specific article by ID
+  find(id) {
+    // Tree is sorted by Date, so we must traverse all nodes to find by ID (O(n))
+    return this._findNodeDFS(this.root, id);
+  }
+
+  _findNodeDFS(node, id) {
+    if (!node) return null;
+    if (id === node.article.id) return node.article;
+    const leftResult = this._findNodeDFS(node.left, id);
+    if (leftResult) return leftResult;
+    return this._findNodeDFS(node.right, id);
+  }
+
+  // Get all articles in order (Sorted by ID)
+  getAllArticles(order = "newest") {
+    const articles = [];
+    if (this.root) {
+      this._inOrder(this.root, articles, order);
+    }
+    return articles;
+  }
+
+  _inOrder(node, articles, order) {
+    const stack = [];
+    let current = node;
+
+    if (order === "newest") {
+      while (current || stack.length > 0) {
+        while (current) {
+          stack.push(current);
+          current = current.right;
+        }
+        current = stack.pop();
+        articles.push(current.article);
+        current = current.left;
+      }
+    } else {
+      while (current || stack.length > 0) {
+        while (current) {
+          stack.push(current);
+          current = current.left;
+        }
+        current = stack.pop();
+        articles.push(current.article);
+        current = current.right;
+      }
+    }
+  }
+
+  getRange(startdate, enddate, limit) {
+    const results = [];
+    // Optimization: Convert to timestamps once to avoid Date object creation/coercion in recursion
+    const start = startdate
+      ? new Date(
+          startdate instanceof Date
+            ? startdate
+            : isNaN(startdate)
+              ? startdate
+              : parseInt(startdate),
+        ).getTime()
+      : 0;
+    const end = enddate
+      ? new Date(
+          enddate instanceof Date
+            ? enddate
+            : isNaN(enddate)
+              ? enddate
+              : parseInt(enddate),
+        ).getTime()
+      : Infinity;
+    this._rangeSearch(this.root, start, end, limit, results);
+    return results;
+  }
+
+  _rangeSearch(node, start, end, limit, results) {
+    // Stop if node is null or we have reached the limit
+    if (!node || (limit !== null && results.length >= limit)) return;
+
+    // This is an efficient reverse in-order traversal for a date-sorted tree.
+    // It prunes branches that are outside the specified date range.
+
+    // 1. Traverse right (newer posts) if there's a possibility of finding matches.
+    if (node.article.createdAt <= end) {
+      this._rangeSearch(node.right, start, end, limit, results);
+    }
+
+    if (limit !== null && results.length >= limit) return;
+
+    // 2. Check if the current node is within the range.
+    if (node.article.createdAt >= start && node.article.createdAt <= end) {
+      results.push(node.article);
+    }
+
+    if (limit !== null && results.length >= limit) return;
+
+    // 3. Traverse left (older posts) if there's a possibility of finding matches.
+    if (node.article.createdAt > start) {
+      this._rangeSearch(node.left, start, end, limit, results);
+    }
+  }
+
+  // Private recursive helper
+  _countNodes(node) {
+    // 1. Base Case: If the branch is empty, return 0
+    if (!node) {
+      return 0;
+    }
+
+    // 2. Recursive Step:
+    // Count the current node (1)
+    // PLUS whatever the left side has
+    // PLUS whatever the right side has
+    return 1 + this._countNodes(node.left) + this._countNodes(node.right);
+  }
+
+  remove(data) {
+    const id = data instanceof Article ? data.id : data;
+    const date = data instanceof Article ? data.createdAt : null;
+    this.root = this._removeIterative(this.root, id, date);
+  }
+
+  _removeIterative(root, id, date) {
+    let parent = null;
+    let current = root;
+    let isLeftChild = false;
+
+    // 1. Find the node
+    if (date !== null) {
+      // Optimized search using BST property (Date)
+      while (current) {
+        if (current.article.id == id) break;
+        parent = current;
+        if (date < current.article.createdAt) {
+          current = current.left;
+          isLeftChild = true;
+        } else {
+          current = current.right;
+          isLeftChild = false;
+        }
+      }
+    } else {
+      // Full scan required (Iterative DFS) if we don't have the date
+      const stack = [{ node: root, parent: null, isLeft: false }];
+      current = null;
+      while (stack.length > 0) {
+        const item = stack.pop();
+        if (item.node.article.id == id) {
+          current = item.node;
+          parent = item.parent;
+          isLeftChild = item.isLeft;
+          break;
+        }
+        if (item.node.right)
+          stack.push({
+            node: item.node.right,
+            parent: item.node,
+            isLeft: false,
+          });
+        if (item.node.left)
+          stack.push({ node: item.node.left, parent: item.node, isLeft: true });
+      }
+    }
+
+    if (!current) return root; // Not found
+
+    // 2. Delete node
+    if (!current.left && !current.right) {
+      if (!parent) return null; // Root was deleted
+      if (isLeftChild) parent.left = null;
+      else parent.right = null;
+    } else if (!current.right) {
+      if (!parent) return current.left;
+      if (isLeftChild) parent.left = current.left;
+      else parent.right = current.left;
+    } else if (!current.left) {
+      if (!parent) return current.right;
+      if (isLeftChild) parent.left = current.right;
+      else parent.right = current.right;
+    } else {
+      // Two children: Find successor (min in right subtree)
+      let successorParent = current;
+      let successor = current.right;
+      while (successor.left) {
+        successorParent = successor;
+        successor = successor.left;
+      }
+      current.article = successor.article;
+      if (successorParent === current) successorParent.right = successor.right;
+      else successorParent.left = successor.right;
+    }
+    return root;
+  }
+
+  clear() {
+    this.root = null;
+  }
+
+  size() {
+    return this._countNodes(this.root);
+  }
+}

package/model/datastructures/BinarySearchTreeHashMap.js

@@ -0,0 +1,89 @@
+import createDebug from "debug";
+import { BinarySearchTree } from "./BinarySearchTree.js";
+
+// Initialize the debugger with a specific namespace
+const debug = createDebug("plainblog:BinarySearchTreeHashMap");
+
+export class BinarySearchTreeHashMap extends BinarySearchTree {
+  constructor() {
+    super();
+    this.ids = new Map(); // Fast lookup storage (ID -> Article)
+  }
+
+  // O(1) - Instant lookup
+  contains(id) {
+    return this.ids.has(id);
+  }
+
+  // Insert a new article
+  insert(article) {
+    // Note: The tree is now sorted by date. ID-based methods will not work correctly.
+    // if (!article.id) article.id = this.getNextID();
+    // Add to the Map
+    this.ids.set(article.id, article);
+    super.insert(article);
+  }
+
+  update(id, title, content) {
+    // Check for both string and number ID
+    let article = this.ids.get(id);
+    if (!article) article = this.ids.get(parseInt(id));
+
+    if (article) {
+      article.title = title;
+      article.content = content;
+      return true;
+    }
+    return false;
+  }
+
+  search(query) {
+    debug("search %s ", query);
+    const lower = query.toLowerCase();
+    const results = this.getAllArticles().filter(
+      (a) =>
+        a.title.toLowerCase().includes(lower) ||
+        a.content.toLowerCase().includes(lower),
+    );
+    debug("%d results found", results.length);
+    return results;
+  }
+
+  // Search for a specific article by ID
+  find(id) {
+    return this.ids.get(id);
+  }
+
+  // Get all articles in order (Sorted by ID)
+  getAllArticles(order = "newest") {
+    return super.getAllArticles(order);
+  }
+
+  getRange(startdate, enddate, limit) {
+    return super.getRange(startdate, enddate, limit);
+  }
+
+  remove(data) {
+    const id = data && data.id ? data.id : data;
+
+    let article = this.ids.get(id);
+    if (!article) article = this.ids.get(parseInt(id));
+
+    if (article) {
+      this.ids.delete(article.id);
+      return super.remove(article); // Pass article to use optimized date-based removal
+    }
+
+    this.ids.delete(id);
+    return super.remove(data);
+  }
+
+  clear() {
+    super.clear();
+    this.ids.clear();
+  }
+
+  size() {
+    return super.size();
+  }
+}

package/model/datastructures/BinarySearchTreeTest.js

@@ -0,0 +1,16 @@
+import Article from "../../Article.js";
+import { BinarySearchTree } from "./BinarySearchTree.js";
+
+const bst = new BinarySearchTree();
+
+// Adding articles
+//myBlog.insert(new Article(101, "Hello World", "Welcome to my JS blog."));
+//myBlog.insert(new Article(50, "Intro to Trees", "Binary trees are useful..."));
+//myBlog.insert(new Article(150, "JavaScript in 2026", "The state of JS today."));
+
+// Find a specific article
+const post = bst.find(101);
+console.log("Found:", post.title);
+
+// List all articles (Sorted by ID)
+console.log("All Articles:", bst.getAllArticles());

package/model/datastructures/FileList.js

@@ -0,0 +1,53 @@
+import fs from "node:fs";
+import {
+  saveInfo,
+  loadInfo,
+  appendArticleSync, // Change to synchronous version
+  loadArticlesSync, // Change to synchronous version
+  initFiles,
+} from "../FileModel.js";
+
+export default class FileList {
+  constructor(filepath) {
+    this.filepath = filepath;
+  }
+
+  clear() {
+    // Optionally: fs.writeFileSync(this.filepath, "");
+  }
+
+  // Removed 'async'
+  insert(newArticle) {
+    /*if (!newArticle.createdAt) {
+      newArticle.createdAt = new Date().toISOString();
+    }
+    if (!newArticle.id) {
+      newArticle.id = Date.now();
+    }
+    // Must call a synchronous function here
+    appendArticleSync(this.filepath, newArticle);*/
+  }
+
+  remove(article) {}
+
+  contains(id) {}
+
+  // Removed 'async'
+  getAllArticles() {
+    return loadArticlesSync(this.filepath);
+  }
+
+  size() {
+    try {
+      const content = fs.readFileSync(this.filepath, "utf8");
+      // filter(Boolean) prevents empty last lines from being counted as articles
+      return content.split("\n").filter((line) => line.trim()).length;
+    } catch (err) {
+      return 0;
+    }
+  }
+
+  length() {
+    return this.size();
+  }
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@lexho111/plainblog",
-  "version": "0.5.28",
+  "version": "0.6.0",
   "description": "A tool for creating and serving a minimalist, single-page blog.",
   "main": "index.js",
   "type": "module",
@@ -8,6 +8,8 @@
     "dev": "node index.js",
     "postinstall": "node postinstall.js",
     "test": "node --experimental-vm-modules node_modules/jest/bin/jest.js",
+    "coverage": "node --experimental-vm-modules node_modules/jest/bin/jest.js --coverage & start coverage/lcov-report/index.html",
+    "view-coverage": "start coverage/lcov-report/index.html",
     "lint": "eslint ."
   },
   "keywords": [
@@ -18,6 +20,8 @@
   "author": "lexho111",
   "license": "ISC",
   "devDependencies": {
+    "@babel/core": "^7.28.6",
+    "@babel/preset-env": "^7.28.6",
     "@eslint/js": "^9.39.2",
     "@types/node": "^25.0.3",
     "autoprefixer": "^10.4.23",
@@ -30,8 +34,12 @@
     "pg-hstore": "^2.3.4",
     "postcss": "^8.5.6",
     "sequelize": "^6.37.7",
-    "sqlite3": "^5.1.7",
+    "sqlite3": "^5.0.2",
     "typescript": "^5.9.3",
+    "uglify-js": "^3.19.3",
     "w3c-css-validator": "^1.4.1"
+  },
+  "dependencies": {
+    "debug": "^4.4.3"
   }
 }

package/public/scripts.min.js

@@ -1 +1,2 @@
-function _createForOfIteratorHelper(e,t){var r,n,o,a,i="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(i)return o=!(n=!0),{s:function(){i=i.call(e)},n:function(){var e=i.next();return n=e.done,e},e:function(e){o=!0,r=e},f:function(){try{n||null==i.return||i.return()}finally{if(o)throw r}}};if(Array.isArray(e)||(i=_unsupportedIterableToArray(e))||t&&e&&"number"==typeof e.length)return i&&(e=i),a=0,{s:t=function(){},n:function(){return a>=e.length?{done:!0}:{done:!1,value:e[a++]}},e:function(e){throw e},f:t};throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}function _unsupportedIterableToArray(e,t){var r;if(e)return"string"==typeof e?_arrayLikeToArray(e,t):"Map"===(r="Object"===(r={}.toString.call(e).slice(8,-1))&&e.constructor?e.constructor.name:r)||"Set"===r?Array.from(e):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?_arrayLikeToArray(e,t):void 0}function _arrayLikeToArray(e,t){(null==t||t>e.length)&&(t=e.length);for(var r=0,n=Array(t);r<t;r++)n[r]=e[r];return n}function _regenerator(){var g,e="function"==typeof Symbol?Symbol:{},t=e.iterator||"@@iterator",r=e.toStringTag||"@@toStringTag";function n(e,t,r,n){var o,a,i,c,l,u,f,s,d,t=t&&t.prototype instanceof h?t:h,t=Object.create(t.prototype);return _regeneratorDefine2(t,"_invoke",(o=e,a=r,f=n||[],s=!1,d={p:u=0,n:0,v:g,a:p,f:p.bind(g,4),d:function(e,t){return i=e,c=0,l=g,d.n=t,y}},function(e,t,r){if(1<u)throw TypeError("Generator is already running");for(s&&1===t&&p(t,r),c=t,l=r;(m=c<2?g:l)||!s;){i||(c?c<3?(1<c&&(d.n=-1),p(c,l)):d.n=l:d.v=l);try{if(u=2,i){if(m=i[e=c?e:"next"]){if(!(m=m.call(i,l)))throw TypeError("iterator result is not an object");if(!m.done)return m;l=m.value,c<2&&(c=0)}else 1===c&&(m=i.return)&&m.call(i),c<2&&(l=TypeError("The iterator does not provide a '"+e+"' method"),c=1);i=g}else if((m=(s=d.n<0)?l:o.call(a,d))!==y)break}catch(e){i=g,c=1,l=e}finally{u=1}}return{value:m,done:s}}),!0),t;function p(e,t){for(c=e,l=t,m=0;!s&&u&&!r&&m<f.length;m++){var r,n=f[m],o=d.p,a=n[2];3<e?(r=a===t)&&(l=n[(c=n[4])?5:c=3],n[4]=n[5]=g):n[0]<=o&&((r=e<2&&o<n[1])?(c=0,d.v=t,d.n=n[1]):o<a&&(r=e<3||n[0]>t||a<t)&&(n[4]=e,n[5]=t,d.n=a,c=0))}if(r||1<e)return y;throw s=!0,t}}var y={};function h(){}function o(){}function a(){}var m=Object.getPrototypeOf,e=[][t]?m(m([][t]())):(_regeneratorDefine2(m={},t,function(){return this}),m),i=a.prototype=h.prototype=Object.create(e);function c(e){return Object.setPrototypeOf?Object.setPrototypeOf(e,a):(e.__proto__=a,_regeneratorDefine2(e,r,"GeneratorFunction")),e.prototype=Object.create(i),e}return _regeneratorDefine2(i,"constructor",o.prototype=a),_regeneratorDefine2(a,"constructor",o),_regeneratorDefine2(a,r,o.displayName="GeneratorFunction"),_regeneratorDefine2(i),_regeneratorDefine2(i,r,"Generator"),_regeneratorDefine2(i,t,function(){return this}),_regeneratorDefine2(i,"toString",function(){return"[object Generator]"}),(_regenerator=function(){return{w:n,m:c}})()}function _regeneratorDefine2(e,t,r,n){var a=Object.defineProperty;try{a({},"",{})}catch(e){a=0}(_regeneratorDefine2=function(e,t,r,n){function o(t,r){_regeneratorDefine2(e,t,function(e){return this._invoke(t,r,e)})}t?a?a(e,t,{value:r,enumerable:!n,configurable:!n,writable:!n}):e[t]=r:(o("next",0),o("throw",1),o("return",2))})(e,t,r,n)}function asyncGeneratorStep(e,t,r,n,o,a,i){try{var c=e[a](i),l=c.value}catch(e){return void r(e)}c.done?t(l):Promise.resolve(l).then(n,o)}function _asyncToGenerator(c){return function(){var e=this,i=arguments;return new Promise(function(t,r){var n=c.apply(e,i);function o(e){asyncGeneratorStep(n,t,r,o,a,"next",e)}function a(e){asyncGeneratorStep(n,t,r,o,a,"throw",e)}o(void 0)})}}var isLoading=!1;function handleScroll(){return _handleScroll.apply(this,arguments)}function _handleScroll(){return(_handleScroll=_asyncToGenerator(_regenerator().m(function e(){var t,r;return _regenerator().w(function(e){for(;;)switch(e.n){case 0:if(isLoading)return e.a(2);e.n=1;break;case 1:if(t=window.scrollY||document.documentElement.scrollTop||document.body.scrollTop,r=window.innerHeight||document.documentElement.clientHeight,(document.documentElement.scrollHeight||document.body.scrollHeight)-t-r<100)return e.n=2,loadMore();e.n=2;break;case 2:return e.a(2)}},e)}))).apply(this,arguments)}function loadMore(){return _loadMore.apply(this,arguments)}function _loadMore(){return(_loadMore=_asyncToGenerator(_regenerator().m(function e(){var t,r,n,o,a,i,c,l,u;return _regenerator().w(function(e){for(;;)switch(e.p=e.n){case 0:if(console.log("load more"),t=document.getElementById("articles"),t=t.querySelectorAll("article"),t=t[t.length-1],console.log("lastArticle",t),t){e.n=1;break}return e.a(2);case 1:if(r=parseInt(t.getAttribute("data-id")),console.log("lastId ".concat(r)),isNaN(r))return e.a(2);e.n=2;break;case 2:if((n=r-1)<1)return console.log("nextId < 1 ".concat(n<1)),window.removeEventListener("scroll",handleScroll),e.a(2);e.n=3;break;case 3:return o=!(isLoading=!0),a="/api/articles?startID=".concat(n,"&limit=5"),console.log("load more ".concat(a)),e.p=4,e.n=5,fetch(a);case 5:if((a=e.v).ok)return e.n=6,a.json();e.n=7;break;case 6:if((u=e.v).articles&&0<u.articles.length){i=_createForOfIteratorHelper(u.articles);try{for(i.s();!(c=i.n()).done;)fillWithContent((l=c.value).title,l.content,l.createdAt,l.id)}catch(e){i.e(e)}finally{i.f()}o=!0}case 7:e.n=9;break;case 8:e.p=8,u=e.v,console.error("Failed to load articles:",u);case 9:isLoading=!1,o&&handleScroll();case 10:return e.a(2)}},e,null,[[4,8]])}))).apply(this,arguments)}function getFormattedDate(e){var t=e.getFullYear(),r=String(e.getMonth()+1).padStart(2,"0"),n=String(e.getDate()).padStart(2,"0"),o=String(e.getHours()).padStart(2,"0"),e=String(e.getMinutes()).padStart(2,"0");return"".concat(t,"/").concat(r,"/").concat(n," ").concat(o,":").concat(e)}function fillWithContent(e,t,r,n){var o=document.createElement("article"),n=(n&&o.setAttribute("data-id",n),document.createElement("h2")),a=document.createElement("span"),i=document.createElement("p");n.textContent=e,a.textContent=getFormattedDate(new Date(r)),i.textContent=t,o.appendChild(n),o.appendChild(a),o.appendChild(i),document.getElementById("articles").appendChild(o)}function test(){console.log("123")}document.addEventListener("DOMContentLoaded",function(){window.addEventListener("scroll",handleScroll,{passive:!0}),handleScroll()});
+let isLoading=!1;async function handleScroll(){isLoading||document.documentElement.scrollHeight-window.innerHeight-window.scrollY<100&&await loadMore()}async function loadMore(){console.log("load more");var e=document.getElementById("articles"),t=Array.from(e.querySelectorAll("article"));let n=NaN;for(let e=t.length-1;0<=e;e--){var a=t[e].getAttribute("data-date");if(a){a=parseInt(a,10);if(!isNaN(a)){n=a;break}}}if(console.log("lastTimestamp "+n),isNaN(n))window.removeEventListener("scroll",handleScroll);else{var e=n,o=(isLoading=!0,`/api/articles?enddate=${e}&limit=51`);console.log("load more "+o),console.log("endDate: "+new Date(e));try{var l=await fetch(o);if(l.ok){var i=(await l.json()).articles||[];if(0<i.length){let e=0;for(var r of i)fillWithContent(r.title,r.content,r.createdAt,r.id)&&e++;e<50&&window.removeEventListener("scroll",handleScroll)}else window.removeEventListener("scroll",handleScroll)}}catch(e){console.error("Failed to load articles:",e)}isLoading=!1}}function getFormattedDate(e){return e.getFullYear()+`/${String(e.getMonth()+1).padStart(2,"0")}/${String(e.getDate()).padStart(2,"0")} ${String(e.getHours()).padStart(2,"0")}:`+String(e.getMinutes()).padStart(2,"0")}function fillWithContent(n,a,e,o){if(o&&document.querySelector(`#articles > article[data-id='${o}']`))return console.log("article found. not adding it."),console.log(o+` ${n} `+e),!1;let l=document.createElement("article");var t,i,r,d,e=new Date(e),c=(null!=o&&l.setAttribute("data-id",o),l.setAttribute("data-date",e.getTime()),document.createElement("h2")),s=document.createElement("span"),m=document.createElement("p");function u(e){var t;"delete"===e?confirm("Delete this article?")&&fetch("/api/articles?id="+o,{method:"DELETE"}).then(e=>{e.ok?l.remove():alert("Error: "+e.statusText)}):"edit"===e&&(e=prompt("New Title",n),t=prompt("New Content",a),e)&&t&&fetch("/api/articles?id="+o,{method:"PUT",body:JSON.stringify({title:e,content:t})}).then(e=>{e.ok?window.location.reload():alert("Error: "+e.statusText)})}return null!==document.querySelector('a[href="/logout"]')&&(t=document.createElement("div"),i=document.createElement("div"),r=document.createElement("div"),d=document.createElement("div"),t.setAttribute("class","buttons"),i.setAttribute("class","button edit"),r.setAttribute("class","button delete"),d.setAttribute("class","button delete"),i.textContent="edit",r.textContent="delete",d.textContent="something",t.appendChild(i),t.appendChild(r),t.appendChild(d),i.addEventListener("click",()=>u("edit")),r.addEventListener("click",()=>u("delete")),l.appendChild(t)),c.textContent=n,s.textContent=getFormattedDate(e),m.textContent=a,l.appendChild(c),l.appendChild(s),l.appendChild(m),document.getElementById("articles").appendChild(l),!0}document.addEventListener("DOMContentLoaded",()=>{window.addEventListener("scroll",handleScroll);var e=document.getElementById("search");e&&e.addEventListener("input",async e=>{var e=e.target.value;0<e.length?(e=await(await fetch("/api/articles?q="+encodeURIComponent(e))).json(),document.getElementById("articles").innerHTML="",e.articles.forEach(e=>fillWithContent(e.title,e.content,e.createdAt,e.id))):window.location.reload()})});
+/* source-hash: 2b1ef8919234bc5888e0b423e7411b07aab439a1feaebec95b729fe308f2fa32 */

package/public/styles.min.css

@@ -1 +1,2 @@
-body{font-family:Arial;margin:0}nav{margin-top:10px}.box,h1,nav{margin-left:10px}.grid{border:0 solid #000;display:grid;grid-gap:.25rem;gap:.25rem;grid-template-columns:1fr}.grid article{border:0 solid #ccc;border-radius:4px;min-width:0;word-wrap:break-word;padding:.25rem}.grid article h2{color:#353535;margin-bottom:5px}.grid article .datetime{color:#757575;margin:0}.grid article p{margin-bottom:0;margin-top:10px}article a,article a:visited,h1{color:#696969}nav a{color:#3b40c1;font-size:20px;-webkit-text-decoration:underline;text-decoration:underline}nav a:visited{color:#3b40c1;text-decoration-color:#3b40c1}#wrapper{max-width:500px;width:100%}.hide-image{display:none}@media screen and (max-width:1000px){*{font-size:4vw}#wrapper{box-sizing:border-box;max-width:100%;padding:0 10px;width:100%}}
+body{font-family:Arial,sans-serif}h1{color:#333}body{font-family:Arial;margin:0}nav{margin-top:10px}.box,h1,nav{margin-left:10px}.grid{border:0 solid #000;display:grid;gap:.25rem;grid-template-columns:1fr}.grid article{border:0 solid #ccc;border-radius:4px;min-width:0;overflow-wrap:break-word;padding:.25rem}.grid article h2{color:#353535;margin-bottom:5px}.grid article .datetime{color:#757575;margin:0}.grid article p{margin-bottom:0;margin-top:10px}article a,article a:visited,h1{color:#696969}nav a{color:#3b40c1;font-size:20px;text-decoration:underline}nav a:visited{color:#3b40c1;text-decoration-color:#3b40c1}#wrapper{max-width:500px;width:100%}.hide-image{display:none}@media screen and (max-width:1000px){*{font-size:4vw}#wrapper{box-sizing:border-box;max-width:100%;padding:0 10px;width:100%}}h2{margin-top:0}.buttons,h2{border:0 solid #000}.buttons{height:25px;margin-bottom:0;width:100%}.button{border:1px solid #000;cursor:pointer;float:left;height:19px;padding:2px;-webkit-user-select:none;-moz-user-select:none;user-select:none;width:100px}.button:focus{outline:2px solid orange}.edit{background-color:blue}.delete{background-color:red}
+/* source-hash: 22048a393d87cbbefd7a61fb300fff916360a30934da974ee2fd45739e446492 */