Update the search index and graph view

This commit is contained in:
Danila Fedorin 2022-04-10 13:07:06 -07:00
parent 6145d9e804
commit 85751ba294
2 changed files with 52 additions and 54 deletions

View File

@ -305,20 +305,18 @@ export const nodes = [
"value": 5815
},
{
"id": 30,
"name": "Rendering Mathematics On The Back End",
"id": 29,
"name": "Declaratively Deploying Multiple Blog Versions with NixOS and Flakes",
"group": 1,
"tags": [
"Website",
"Nix",
"Ruby",
"KaTeX"
"Hugo",
"Nix"
],
"url": "https://danilafe.com/blog/./backend_math_rendering",
"value": 13994
"url": "https://danilafe.com/blog/blog_with_nix",
"value": 18269
},
{
"id": 31,
"id": 30,
"name": "How Many Values Does a Boolean Have?",
"group": 5,
"tags": [
@ -330,7 +328,7 @@ export const nodes = [
"value": 12955
},
{
"id": 32,
"id": 31,
"name": "Pleasant Code Includes with Hugo",
"group": 1,
"tags": [
@ -340,7 +338,7 @@ export const nodes = [
"value": 11846
},
{
"id": 33,
"id": 32,
"name": "Formalizing Dawn in Coq",
"group": 3,
"tags": [
@ -352,7 +350,7 @@ export const nodes = [
"value": 20615
},
{
"id": 34,
"id": 33,
"name": "A Verified Evaluator for the Untyped Concatenative Calculus",
"group": 3,
"tags": [
@ -364,7 +362,7 @@ export const nodes = [
"value": 31852
},
{
"id": 35,
"id": 34,
"name": "Formalizing Dawn in Coq",
"group": 3,
"tags": [
@ -376,7 +374,7 @@ export const nodes = [
"value": 20615
},
{
"id": 37,
"id": 36,
"name": "Proof of Inductive Palindrome Definition in Coq",
"group": 3,
"tags": [
@ -386,7 +384,7 @@ export const nodes = [
"value": 8177
},
{
"id": 38,
"id": 37,
"name": "Building a Basic Crystal Project with Nix",
"group": 6,
"tags": [
@ -397,7 +395,7 @@ export const nodes = [
"value": 5981
},
{
"id": 39,
"id": 38,
"name": "Building a Crystal Project with Nix, Revisited",
"group": 6,
"tags": [
@ -408,7 +406,7 @@ export const nodes = [
"value": 9141
},
{
"id": 40,
"id": 39,
"name": "Setting Up Crystal on ARM",
"group": 6,
"tags": [
@ -419,7 +417,7 @@ export const nodes = [
"value": 5414
},
{
"id": 41,
"id": 40,
"name": "DELL Is A Horrible Company And You Should Avoid Them At All Costs",
"group": 1,
"tags": [
@ -429,7 +427,7 @@ export const nodes = [
"value": 21686
},
{
"id": 42,
"id": 41,
"name": "Haskell Error Checking and Autocompletion With LSP",
"group": 5,
"tags": [
@ -440,7 +438,7 @@ export const nodes = [
"value": 10468
},
{
"id": 43,
"id": 42,
"name": "Using GHC IDE for Haskell Error Checking and Autocompletion",
"group": 5,
"tags": [
@ -451,7 +449,7 @@ export const nodes = [
"value": 4758
},
{
"id": 44,
"id": 43,
"name": "Time Traveling In Haskell: How It Works And How To Use It",
"group": 5,
"tags": [
@ -461,7 +459,7 @@ export const nodes = [
"value": 25280
},
{
"id": 45,
"id": 44,
"name": "Approximating Custom Functions in Hugo",
"group": 1,
"tags": [
@ -471,7 +469,7 @@ export const nodes = [
"value": 4034
},
{
"id": 46,
"id": 45,
"name": "Introducing Matrix Highlight",
"group": 1,
"tags": [
@ -483,7 +481,7 @@ export const nodes = [
"value": 7481
},
{
"id": 47,
"id": 46,
"name": "Local Development Environment for JOS and CS 444",
"group": 1,
"tags": [
@ -494,7 +492,7 @@ export const nodes = [
"value": 4839
},
{
"id": 48,
"id": 47,
"name": "Lambda Calculus and Church Encoded Integers",
"group": 1,
"tags": [
@ -504,7 +502,7 @@ export const nodes = [
"value": 10351
},
{
"id": 49,
"id": 48,
"name": "Digit Sum Patterns and Modular Arithmetic",
"group": 1,
"tags": [
@ -515,7 +513,7 @@ export const nodes = [
"value": 39663
},
{
"id": 50,
"id": 49,
"name": "New Look, New Features!",
"group": 1,
"tags": [
@ -525,7 +523,7 @@ export const nodes = [
"value": 727
},
{
"id": 52,
"id": 51,
"name": "JavaScript-Free Sidenotes in Hugo",
"group": 1,
"tags": [
@ -537,7 +535,7 @@ export const nodes = [
"value": 7762
},
{
"id": 53,
"id": 52,
"name": "Creating Recursive Functions in a Stack Based Language",
"group": 4,
"tags": [
@ -547,7 +545,7 @@ export const nodes = [
"value": 15694
},
{
"id": 54,
"id": 53,
"name": "A Look Into Starbound's File Formats",
"group": 1,
"tags": [
@ -557,7 +555,7 @@ export const nodes = [
"value": 11817
},
{
"id": 55,
"id": 54,
"name": "Switching to a Static Site Generator",
"group": 1,
"tags": [
@ -567,7 +565,7 @@ export const nodes = [
"value": 3402
},
{
"id": 57,
"id": 56,
"name": "A Typesafe Representation of an Imperative Language",
"group": 4,
"tags": [
@ -578,7 +576,7 @@ export const nodes = [
"value": 20619
},
{
"id": 58,
"id": 57,
"name": "Meaningfully Typechecking a Language in Idris",
"group": 4,
"tags": [
@ -590,7 +588,7 @@ export const nodes = [
"value": 13655
},
{
"id": 59,
"id": 58,
"name": "Meaningfully Typechecking a Language in Idris, Revisited",
"group": 4,
"tags": [
@ -601,7 +599,7 @@ export const nodes = [
"value": 16100
},
{
"id": 60,
"id": 59,
"name": "Meaningfully Typechecking a Language in Idris, With Tuples",
"group": 4,
"tags": [
@ -612,7 +610,7 @@ export const nodes = [
"value": 10235
},
{
"id": 61,
"id": 60,
"name": "Type-Safe Event Emitter in TypeScript",
"group": 1,
"tags": [
@ -788,39 +786,39 @@ export const edges = [
"to": 27
},
{
"from": 32,
"from": 31,
"to": 2
},
{
"from": 34,
"to": 35
"from": 33,
"to": 34
},
{
"from": 39,
"to": 38
"from": 38,
"to": 37
},
{
"from": 43,
"to": 42
"from": 42,
"to": 41
},
{
"from": 45,
"to": 32
"from": 44,
"to": 31
},
{
"from": 52,
"from": 51,
"to": 2
},
{
"from": 58,
"to": 57
},
{
"from": 59,
"to": 57
},
{
"from": 59,
"to": 58
},
{
"from": 60,
"to": 58
},
{
"from": 60,
"to": 59
}
];

Binary file not shown.