tcsenpai/obsidiangarden_netlify
1
0
Fork 0
mirror of https://github.com/tcsenpai/obsidiangarden_netlify.git synced 2025-06-07 05:05:20 +00:00
Code Issues 5 Packages Projects Releases Wiki Activity

allow hiding in graph

Browse Source
This commit is contained in:
Utsob Roy 2023-03-21 15:05:20 +06:00
parent 313dc50c95
commit db6aded023
2 changed files with 14 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/helpers/linkUtils.js
View File

@ -35,7 +35,7 @@ function getGraph(data) {
let links = []; let links = [];
let stemURLs = {}; let stemURLs = {};
let homeAlias = "/"; let homeAlias = "/";
(data.collections.note||[]).forEach((v, idx) => { (data.collections.note || []).forEach((v, idx) => {
let fpath = v.filePathStem.replace("/notes/", ""); let fpath = v.filePathStem.replace("/notes/", "");
let parts = fpath.split("/"); let parts = fpath.split("/");
let group = "none"; let group = "none";
@ -47,14 +47,21 @@ function getGraph(data) {
title: v.data.title || v.fileSlug, title: v.data.title || v.fileSlug,
url: v.url, url: v.url,
group, group,
home: v.data["dg-home"] || (v.data.tags && v.data.tags.indexOf("gardenEntry") > -1)|| false, home:
v.data["dg-home"] ||
(v.data.tags && v.data.tags.indexOf("gardenEntry") > -1) ||
false,
outBound: extractLinks(v.template.frontMatter.content), outBound: extractLinks(v.template.frontMatter.content),
neighbors: new Set(), neighbors: new Set(),
backLinks: new Set(), backLinks: new Set(),
noteIcon: v.data.noteIcon || process.env.NOTE_ICON_DEFAULT noteIcon: v.data.noteIcon || process.env.NOTE_ICON_DEFAULT,
hide: v.data.hideInGraph || false,
}; };
stemURLs[fpath] = v.url; stemURLs[fpath] = v.url;
if (v.data["dg-home"] || (v.data.tags && v.data.tags.indexOf("gardenEntry") > -1)) { if (
v.data["dg-home"] ||
(v.data.tags && v.data.tags.indexOf("gardenEntry") > -1)
) {
homeAlias = v.url; homeAlias = v.url;
} }
}); });

2
src/site/_includes/components/graphScript.njk
View File

@ -12,7 +12,9 @@
const keys = Object.values(existing).map((n) => n.neighbors).flat(); const keys = Object.values(existing).map((n) => n.neighbors).flat();
const n_remaining = Object.keys(remaining).reduce((acc, key) => { const n_remaining = Object.keys(remaining).reduce((acc, key) => {
if (keys.indexOf(key) != -1) { if (keys.indexOf(key) != -1) {
if (!remaining[key].hide) {
existing[key] = remaining[key]; existing[key] = remaining[key];
}
} else { } else {
acc[key] = remaining[key]; acc[key] = remaining[key];
} }