commit cef119dfac88fcaa131c0da45347be9d62c7aee4
parent 59c64963e312cc7981b3e7886dd5d0823f6c475a
Author: Amit Dutta <amitdutta4255@gmail.com>
Date: Sat, 20 Jun 2026 21:22:56 +0530
added sitemap
Diffstat:
11 files changed, 49 insertions(+), 174 deletions(-)
diff --git a/docs/docs/docs/index.md b/docs/docs/docs/index.md
@@ -1,10 +0,0 @@
-# Docs
-
-Files and sub-folders in **Docs**.
-
-## Folders
-
-| # | Folder | Link |
-|---|---|---|
-| 1 | Semester 2 | [Open](semester_2/index.md) |
-
diff --git a/docs/docs/docs/semester_2/algorithms/algo_01.md b/docs/docs/docs/semester_2/algorithms/algo_01.md
@@ -1,27 +0,0 @@
----
-title: '<svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" style="display:inline; margin-bottom:-2px; margin-right:6px;" class="lucide lucide-binary"><rect x="14" y="14" width="4" height="6" rx="2"/><rect x="6" y="4" width="4" height="6" rx="2"/><path d="M6 20h4"/><path d="M14 10h4"/><path d="M6 14h2v6"/><path d="M14 4h2v6"/></svg> algo_01'
-description: 'Algorithm — algo_01'
-source: 'docs/docs/semester_2/algorithms/algo_01.md'
----
-
-# algo_01
-
-::: tip Problem Statement
-Write an algorithm to traverse a singly linked list.
-:::
-
-## Algorithm
-```
-procedure traverce(head)
-begin
- if(head = NULL)
- write("List is empty");
- else
- ptr <- head;
- while(ptr != NULL)
- write(info(ptr));
- ptr <- next(ptr);
- end while
- end if
-end procedure
-```-
\ No newline at end of file
diff --git a/docs/docs/docs/semester_2/algorithms/index.md b/docs/docs/docs/semester_2/algorithms/index.md
@@ -1,10 +0,0 @@
-# Algorithms
-
-Files and sub-folders in **Algorithms**.
-
-## Files
-
-| # | File | Link |
-|---|---|---|
-| 1 | `algo_01` | [View Code](algo_01.md) |
-
diff --git a/docs/docs/docs/semester_2/index.md b/docs/docs/docs/semester_2/index.md
@@ -1,10 +0,0 @@
-# Semester 2
-
-Files and sub-folders in **Semester 2**.
-
-## Folders
-
-| # | Folder | Link |
-|---|---|---|
-| 1 | Algorithms | [Open](algorithms/index.md) |
-
diff --git a/docs/docs/index.md b/docs/docs/index.md
@@ -1,11 +0,0 @@
-# Docs
-
-Files and sub-folders in **Docs**.
-
-## Folders
-
-| # | Folder | Link |
-|---|---|---|
-| 1 | Docs | [Open](docs/index.md) |
-| 2 | Semester 2 | [Open](semester_2/index.md) |
-
diff --git a/docs/docs/semester_2/algorithms/algo_01.md b/docs/docs/semester_2/algorithms/algo_01.md
@@ -1,27 +0,0 @@
----
-title: '<svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" style="display:inline; margin-bottom:-2px; margin-right:6px;" class="lucide lucide-binary"><rect x="14" y="14" width="4" height="6" rx="2"/><rect x="6" y="4" width="4" height="6" rx="2"/><path d="M6 20h4"/><path d="M14 10h4"/><path d="M6 14h2v6"/><path d="M14 4h2v6"/></svg> algo_01'
-description: 'Algorithm — algo_01'
-source: 'docs/semester_2/algorithms/algo_01.md'
----
-
-# algo_01
-
-::: tip Problem Statement
-Write an algorithm to traverse a singly linked list.
-:::
-
-## Algorithm
-```
-procedure traverce(head)
-begin
- if(head = NULL)
- write("List is empty");
- else
- ptr <- head;
- while(ptr != NULL)
- write(info(ptr));
- ptr <- next(ptr);
- end while
- end if
-end procedure
-```-
\ No newline at end of file
diff --git a/docs/docs/semester_2/algorithms/algo_02.md b/docs/docs/semester_2/algorithms/algo_02.md
@@ -1,26 +0,0 @@
----
-title: '<svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" style="display:inline; margin-bottom:-2px; margin-right:6px;" class="lucide lucide-binary"><rect x="14" y="14" width="4" height="6" rx="2"/><rect x="6" y="4" width="4" height="6" rx="2"/><path d="M6 20h4"/><path d="M14 10h4"/><path d="M6 14h2v6"/><path d="M14 4h2v6"/></svg> algo_02'
-description: 'Algorithm — algo_02'
-source: 'docs/semester_2/algorithms/algo_02.md'
----
-
-# algo_02
-
-::: tip Problem Statement
-Write an algorithm to delete the first node of the list.
-:::
-
-## Algorithm
-```
-procedure delete_firstNode(head)
-begin
- if(head = NULL)
- write("List is empty, Deletion is not possible.")
- else
- p <- head
- head <- next(p)
- delete(p)
- endif
- return(head)
-end procedure
-```-
\ No newline at end of file
diff --git a/docs/docs/semester_2/algorithms/algo_03.md b/docs/docs/semester_2/algorithms/algo_03.md
@@ -1,27 +0,0 @@
----
-title: '<svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" style="display:inline; margin-bottom:-2px; margin-right:6px;" class="lucide lucide-binary"><rect x="14" y="14" width="4" height="6" rx="2"/><rect x="6" y="4" width="4" height="6" rx="2"/><path d="M6 20h4"/><path d="M14 10h4"/><path d="M6 14h2v6"/><path d="M14 4h2v6"/></svg> algo_01'
-description: 'Algorithm — algo_01'
-source: 'docs/semester_2/algorithms/algo_03.md'
----
-
-# algo_01
-
-::: tip Problem Statement
-Write an algorithm to traverse a singly linked list.
-:::
-
-## Algorithm
-```
-procedure traverce(head)
-begin
- if(head = NULL)
- write("List is empty");
- else
- ptr <- head;
- while(ptr != NULL)
- write(info(ptr));
- ptr <- next(ptr);
- end while
- end if
-end procedure
-```-
\ No newline at end of file
diff --git a/docs/docs/semester_2/algorithms/index.md b/docs/docs/semester_2/algorithms/index.md
@@ -1,12 +0,0 @@
-# Algorithms
-
-Files and sub-folders in **Algorithms**.
-
-## Files
-
-| # | File | Link |
-|---|---|---|
-| 1 | `algo_01` | [View Code](algo_01.md) |
-| 2 | `algo_02` | [View Code](algo_02.md) |
-| 3 | `algo_01` | [View Code](algo_03.md) |
-
diff --git a/docs/docs/semester_2/index.md b/docs/docs/semester_2/index.md
@@ -1,10 +0,0 @@
-# Semester 2
-
-Files and sub-folders in **Semester 2**.
-
-## Folders
-
-| # | Folder | Link |
-|---|---|---|
-| 1 | Algorithms | [Open](algorithms/index.md) |
-
diff --git a/docs/sitemap.md b/docs/sitemap.md
@@ -0,0 +1,48 @@
+---
+title: 'Sitemap'
+description: 'All pages available on BSc Code Index.'
+---
+
+# Sitemap
+
+<script setup>
+import { ref, onMounted } from 'vue'
+
+const pages = ref([])
+const loading = ref(true)
+const error = ref(false)
+
+function parseXml(text) {
+ const parser = new DOMParser()
+ const xml = parser.parseFromString(text, 'application/xml')
+ return Array.from(xml.querySelectorAll('loc'))
+ .map(loc => loc.textContent.replace('https://code.amit.is-a.dev', ''))
+ .sort()
+}
+
+onMounted(async () => {
+ try {
+ const res = await fetch('/sitemap.xml')
+ const text = await res.text()
+ if (!res.ok || !text.includes('<loc>')) throw new Error('local not valid')
+ pages.value = parseXml(text)
+ } catch {
+ try {
+ const res = await fetch('https://code.amit.is-a.dev/sitemap.xml')
+ pages.value = parseXml(await res.text())
+ } catch {
+ error.value = true
+ }
+ } finally {
+ loading.value = false
+ }
+})
+</script>
+
+<div v-if="loading">Loading sitemap...</div>
+<div v-else-if="error">Failed to load sitemap.</div>
+<ul v-else>
+ <li v-for="page in pages" :key="page">
+ <a :href="page">{{ page }}</a>
+ </li>
+</ul>+
\ No newline at end of file
