mirror of
https://github.com/linux-odyssey/linux-odyssey.git
synced 2026-11-08 03:20:12 +08:00
fix: jest. enable coverage
This commit is contained in:
wancat committed
1 parent
37b1bead28
commit
c0efce69f4
12 files changed
+281
-70
No files matched your search
@@ -0,0 +1,296 @@
|
||||
import { DuplicateItemError, ParentNotExistsError } from '../src/errors.js'
|
||||
import FileNode from '../src/fileNode.js'
|
||||
import { FileObject } from '../src/file.js'
|
||||
|
||||
function createNodeFromFiles(files: FileObject[]) {
|
||||
const node = new FileNode(files[0])
|
||||
files.slice(1).forEach((file) => node.addChild(file))
|
||||
return node
|
||||
}
|
||||
|
||||
function mergeTest(
|
||||
files1: FileObject[],
|
||||
files2: FileObject[],
|
||||
expectedFiles: FileObject[]
|
||||
) {
|
||||
const node1 = createNodeFromFiles(files1)
|
||||
const node2 = createNodeFromFiles(files2)
|
||||
const expectedNode = createNodeFromFiles(expectedFiles)
|
||||
|
||||
node1.merge(node2)
|
||||
|
||||
expect(node1.toString()).toBe(expectedNode.toString())
|
||||
}
|
||||
|
||||
function removeChildTest(
|
||||
files: FileObject[],
|
||||
fileToRemove: FileObject,
|
||||
expectedFiles: FileObject[]
|
||||
) {
|
||||
const node = createNodeFromFiles(files)
|
||||
const expectedNode = createNodeFromFiles(expectedFiles)
|
||||
|
||||
node.removeChild(fileToRemove)
|
||||
|
||||
expect(node.toString()).toBe(expectedNode.toString())
|
||||
}
|
||||
|
||||
describe('FileNode', () => {
|
||||
let rootNode: FileNode
|
||||
|
||||
beforeEach(() => {
|
||||
rootNode = new FileNode({
|
||||
path: '/home/rudeus',
|
||||
name: 'rudeus',
|
||||
type: 'folder',
|
||||
discovered: true,
|
||||
})
|
||||
})
|
||||
|
||||
test('should throw error when adding duplicate item', () => {
|
||||
const child = {
|
||||
path: '/home/rudeus/test',
|
||||
type: 'folder',
|
||||
discovered: true,
|
||||
}
|
||||
|
||||
// Adding the child for the first time
|
||||
rootNode.addChild(child)
|
||||
|
||||
expect(rootNode.children.length).toBe(1)
|
||||
|
||||
// Trying to add the same child again should throw an error
|
||||
expect(() => {
|
||||
rootNode.addChild(child)
|
||||
}).toThrow(DuplicateItemError)
|
||||
})
|
||||
|
||||
test('should throw error when parent does not exist', () => {
|
||||
const child = {
|
||||
path: '/home/rudeus/alphabet/test',
|
||||
name: 'test',
|
||||
type: 'folder',
|
||||
discovered: true,
|
||||
}
|
||||
|
||||
// Trying to add to a nonexistent parent should throw an error
|
||||
expect(() => {
|
||||
rootNode.addChild(child)
|
||||
}).toThrow(ParentNotExistsError)
|
||||
})
|
||||
|
||||
test('adds nested children to the tree', () => {
|
||||
const files = [
|
||||
{
|
||||
path: '/home/rudeus/forgotten_scroll.txt',
|
||||
name: 'forgotten_scroll.txt',
|
||||
type: 'file',
|
||||
discovered: true,
|
||||
},
|
||||
{
|
||||
path: '/home/rudeus/test',
|
||||
name: 'test',
|
||||
type: 'folder',
|
||||
discovered: true,
|
||||
},
|
||||
{
|
||||
path: '/home/rudeus/test/a',
|
||||
name: 'a',
|
||||
type: 'file',
|
||||
discovered: false,
|
||||
},
|
||||
]
|
||||
|
||||
files.forEach((file) => {
|
||||
rootNode.addChild(file)
|
||||
})
|
||||
|
||||
expect(rootNode.children.length).toBe(2)
|
||||
expect(rootNode.children[1].children.length).toBe(1)
|
||||
})
|
||||
|
||||
test('adds nested children to the tree with makeParents option', () => {
|
||||
const file = {
|
||||
path: '/home/rudeus/test/a/b/c/d/e',
|
||||
name: 'a',
|
||||
type: 'file',
|
||||
discovered: false,
|
||||
}
|
||||
|
||||
rootNode.addChild(file, { makeParents: true })
|
||||
|
||||
let currentNode = rootNode
|
||||
for (let i = 0; i < 5; i += 1) {
|
||||
expect(currentNode.children.length).toBe(1)
|
||||
// eslint-disable-next-line prefer-destructuring
|
||||
currentNode = currentNode.children[0]
|
||||
}
|
||||
})
|
||||
|
||||
test('merge-subtree', () => {
|
||||
const root = {
|
||||
path: '/',
|
||||
type: 'folder',
|
||||
discovered: true,
|
||||
}
|
||||
const files1 = [
|
||||
root,
|
||||
{ path: '/a', type: 'file', discovered: true },
|
||||
{ path: '/b', type: 'folder', discovered: true },
|
||||
{ path: '/b/c', type: 'folder', discovered: true },
|
||||
{ path: '/b/d', type: 'file', discovered: true },
|
||||
{ path: '/b/c/f', type: 'file', discovered: true },
|
||||
]
|
||||
|
||||
const files2 = [
|
||||
{ path: '/b', type: 'folder', discovered: true },
|
||||
{ path: '/b/c', type: 'folder', discovered: true },
|
||||
{ path: '/b/e', type: 'file', discovered: true },
|
||||
{ path: '/b/c/g', type: 'file', discovered: true },
|
||||
]
|
||||
|
||||
const expected = [
|
||||
root,
|
||||
{ path: '/a', type: 'file', discovered: true },
|
||||
{ path: '/b', type: 'folder', discovered: true },
|
||||
{ path: '/b/c', type: 'folder', discovered: true },
|
||||
{ path: '/b/e', type: 'file', discovered: true },
|
||||
{ path: '/b/c/g', type: 'file', discovered: true },
|
||||
]
|
||||
|
||||
mergeTest(files1, files2, expected)
|
||||
})
|
||||
|
||||
test('merge-middle-level', () => {
|
||||
// Test if the node to merge is only the middle part of the tree
|
||||
// (i.e. the node to merge doesn't contains all level of children)
|
||||
// The original tree should keep the children that are not in the node to merge
|
||||
const root = {
|
||||
path: '/',
|
||||
type: 'folder',
|
||||
discovered: true,
|
||||
}
|
||||
const files1 = [
|
||||
root,
|
||||
{ path: '/a', type: 'file', discovered: true },
|
||||
{ path: '/b', type: 'folder', discovered: true },
|
||||
{ path: '/b/c', type: 'folder', discovered: true },
|
||||
{ path: '/b/d', type: 'file', discovered: true },
|
||||
{ path: '/b/c/f', type: 'file', discovered: true },
|
||||
]
|
||||
|
||||
const files2 = [
|
||||
{ path: '/b', type: 'folder', discovered: true },
|
||||
{ path: '/b/c', type: 'folder', discovered: true },
|
||||
{ path: '/b/e', type: 'file', discovered: true },
|
||||
]
|
||||
|
||||
const expected = [
|
||||
root,
|
||||
{ path: '/a', type: 'file', discovered: true },
|
||||
{ path: '/b', type: 'folder', discovered: true },
|
||||
{ path: '/b/c', type: 'folder', discovered: true },
|
||||
{ path: '/b/e', type: 'file', discovered: true },
|
||||
{ path: '/b/c/f', type: 'file', discovered: true },
|
||||
]
|
||||
|
||||
mergeTest(files1, files2, expected)
|
||||
})
|
||||
|
||||
test('merge-hidden', () => {
|
||||
const root = {
|
||||
path: '/',
|
||||
type: 'folder',
|
||||
discovered: true,
|
||||
}
|
||||
const files1 = [
|
||||
root,
|
||||
{ path: '/a', type: 'file', discovered: true },
|
||||
{ path: '/.b', type: 'file', discovered: false },
|
||||
{ path: '/c', type: 'folder', discovered: true },
|
||||
{ path: '/c/.d', type: 'file', discovered: false },
|
||||
]
|
||||
|
||||
const files2 = [
|
||||
{ path: '/c', type: 'folder', discovered: true },
|
||||
{ path: '/c/.d', type: 'file', discovered: true },
|
||||
]
|
||||
|
||||
const expected = [
|
||||
root,
|
||||
{ path: '/a', type: 'file', discovered: true },
|
||||
{ path: '/.b', type: 'file', discovered: false },
|
||||
{ path: '/c', type: 'folder', discovered: true },
|
||||
{ path: '/c/.d', type: 'file', discovered: true },
|
||||
]
|
||||
|
||||
mergeTest(files1, files2, expected)
|
||||
})
|
||||
|
||||
test('remove-child', () => {
|
||||
const root = {
|
||||
path: '/',
|
||||
type: 'folder',
|
||||
discovered: true,
|
||||
}
|
||||
const files = [
|
||||
root,
|
||||
{ path: '/a', type: 'file', discovered: true },
|
||||
{ path: '/b', type: 'folder', discovered: true },
|
||||
{ path: '/b/c', type: 'folder', discovered: true },
|
||||
{ path: '/b/d', type: 'file', discovered: true },
|
||||
{ path: '/b/c/f', type: 'file', discovered: true },
|
||||
]
|
||||
|
||||
const fileToRemove = { path: '/b/c', type: 'folder', discovered: true }
|
||||
|
||||
const expected = [
|
||||
root,
|
||||
{ path: '/a', type: 'file', discovered: true },
|
||||
{ path: '/b', type: 'folder', discovered: true },
|
||||
{ path: '/b/d', type: 'file', discovered: true },
|
||||
]
|
||||
|
||||
removeChildTest(files, fileToRemove, expected)
|
||||
})
|
||||
})
|
||||
|
||||
test('load nested fileNode', () => {
|
||||
const data = {
|
||||
path: '/',
|
||||
type: 'folder',
|
||||
discovered: true,
|
||||
children: [
|
||||
{
|
||||
path: '/a',
|
||||
type: 'file',
|
||||
discovered: true,
|
||||
},
|
||||
{
|
||||
path: '/b',
|
||||
type: 'folder',
|
||||
discovered: true,
|
||||
children: [
|
||||
{
|
||||
path: '/b/c',
|
||||
type: 'folder',
|
||||
discovered: true,
|
||||
children: [
|
||||
{
|
||||
path: '/b/c/d',
|
||||
type: 'file',
|
||||
discovered: true,
|
||||
},
|
||||
],
|
||||
},
|
||||
],
|
||||
},
|
||||
],
|
||||
}
|
||||
|
||||
const node = new FileNode(data)
|
||||
|
||||
expect(node.children.length).toBe(2)
|
||||
expect(node.children[1].children.length).toBe(1)
|
||||
expect(node.children[1].children[0].children.length).toBe(1)
|
||||
})
|
||||
Reference in new issue
Block a user