1
0
mirror of synced 2025-12-21 10:57:10 -05:00
Files
docs/lib/create-tree.js

123 lines
4.2 KiB
JavaScript

import path from 'path'
import fs from 'fs/promises'
import Page from './page.js'
export default async function createTree(originalPath, rootPath, previousTree) {
const basePath = rootPath || originalPath
// On recursive runs, this is processing page.children items in `/<link>` format.
// If the path exists as is, assume this is a directory with a child index.md.
// Otherwise, assume it's a child .md file and add `.md` to the path.
let filepath
let mtime
// This kills two birds with one stone. We (attempt to) read it as a file,
// to find out if it's a directory or a file and whence we know that
// we also collect it's modification time.
try {
filepath = `${originalPath}.md`
mtime = await getMtime(filepath)
} catch (error) {
if (error.code !== 'ENOENT') {
throw error
}
filepath = `${originalPath}/index.md`
// Note, if this throws, that's quite fine. It usually means that
// there's a `index.md` whose `children:` entry lists something that
// doesn't exist on disk. So the writer who tries to preview the
// page will see the error and it's hopefully clear what's actually
// wrong.
try {
mtime = await getMtime(filepath)
} catch (error) {
if (error.code === 'ENOENT' && filepath.split(path.sep).includes('early-access')) {
// Do not throw an error if Early Access is not available.
console.warn(
`${filepath} could not be turned into a Page, but is ignored because it's early-access`
)
return
}
throw error
}
}
const relativePath = filepath.replace(`${basePath}/`, '')
// Reading in a file from disk is slow and best avoided if we can be
// certain it isn't necessary. If the previous tree is known and that
// tree's page node's `mtime` hasn't changed, we can use that instead.
let page
if (previousTree && previousTree.page.mtime === mtime) {
// A save! We can use the same exact Page instance from the previous
// tree because the assumption is that since the `.md` file it was
// created from hasn't changed (on disk) the instance object wouldn't
// change.
page = previousTree.page
} else {
// Either the previous tree doesn't exist yet or the modification time
// of the file on disk has changed.
page = await Page.init({
basePath,
relativePath,
languageCode: 'en',
mtime,
})
}
if (!page) {
throw Error(`Cannot initialize page for ${filepath}`)
}
// Create the root tree object on the first run, and create children recursively.
const item = {
page,
}
// Process frontmatter children recursively.
if (item.page.children) {
assertUniqueChildren(item.page)
item.childPages = (
await Promise.all(
item.page.children.map(
async (child, i) =>
await createTree(
path.posix.join(originalPath, child),
basePath,
previousTree && previousTree.childPages && previousTree.childPages[i]
)
)
)
).filter(Boolean)
}
return item
}
async function getMtime(filePath) {
// Use mtimeMs, which is a regular floating point number, instead of the
// mtime which is a Date based on that same number.
// Otherwise, if we use the Date instances, we have to compare
// them using `oneDate.getTime() === anotherDate.getTime()`.
const { mtimeMs } = await fs.stat(filePath)
// The `mtimeMs` is a number like `1669827766942.7954`
// From the docs:
// "The timestamp indicating the last time this file was modified expressed
// in nanoseconds since the POSIX Epoch."
// But the number isn't actually all that important. We just need it to
// later be able to know if it changed. We round it to the nearest
// millisecond.
return Math.round(mtimeMs)
}
function assertUniqueChildren(page) {
if (page.children.length !== new Set(page.children).size) {
const count = {}
page.children.forEach((entry) => (count[entry] = 1 + (count[entry] || 0)))
let msg = `${page.relativePath} has duplicates in the 'children' key.`
for (const [entry, times] of Object.entries(count)) {
if (times > 1) msg += ` '${entry}' is repeated ${times} times. `
}
throw new Error(msg)
}
}