mirror of
https://github.com/Start9Labs/start-os.git
synced 2026-03-30 20:14:49 +00:00
create version graph to handle migrations (#2708)
* create version graph to handle migrations * Fix some version alpha test * connect dataVersion api * rename init fns * improve types and add tests * set data version after backup restore * chore: Add some types tests for version info * wip: More changes to versionInfo tests * wip: fix my stupid * update mocks * update runtime * chore: Fix the loop --------- Co-authored-by: Jade <2364004+Blu-J@users.noreply.github.com> Co-authored-by: J H <dragondef@gmail.com>
This commit is contained in:
Aiden McClelland
@@ -72,6 +72,23 @@ export class Overlay implements ExecSpawnable {
|
||||
return new Overlay(effects, id, rootfs, guid)
|
||||
}
|
||||
|
||||
static async with<T>(
|
||||
effects: T.Effects,
|
||||
image: { id: T.ImageId; sharedRun?: boolean },
|
||||
mounts: { options: MountOptions; path: string }[],
|
||||
fn: (overlay: Overlay) => Promise<T>,
|
||||
): Promise<T> {
|
||||
const overlay = await Overlay.of(effects, image)
|
||||
try {
|
||||
for (let mount of mounts) {
|
||||
await overlay.mount(mount.options, mount.path)
|
||||
}
|
||||
return await fn(overlay)
|
||||
} finally {
|
||||
await overlay.destroy()
|
||||
}
|
||||
}
|
||||
|
||||
async mount(options: MountOptions, path: string): Promise<Overlay> {
|
||||
path = path.startsWith("/")
|
||||
? `${this.rootfs}${path}`
|
||||
|
||||
244
sdk/lib/util/graph.ts
Normal file
244
sdk/lib/util/graph.ts
Normal file
@@ -0,0 +1,244 @@
|
||||
import { boolean } from "ts-matches"
|
||||
|
||||
export type Vertex<VMetadata = void, EMetadata = void> = {
|
||||
metadata: VMetadata
|
||||
edges: Array<Edge<EMetadata, VMetadata>>
|
||||
}
|
||||
|
||||
export type Edge<EMetadata = void, VMetadata = void> = {
|
||||
metadata: EMetadata
|
||||
from: Vertex<VMetadata, EMetadata>
|
||||
to: Vertex<VMetadata, EMetadata>
|
||||
}
|
||||
|
||||
export class Graph<VMetadata = void, EMetadata = void> {
|
||||
private readonly vertices: Array<Vertex<VMetadata, EMetadata>> = []
|
||||
constructor() {}
|
||||
addVertex(
|
||||
metadata: VMetadata,
|
||||
fromEdges: Array<Omit<Edge<EMetadata, VMetadata>, "to">>,
|
||||
toEdges: Array<Omit<Edge<EMetadata, VMetadata>, "from">>,
|
||||
): Vertex<VMetadata, EMetadata> {
|
||||
const vertex: Vertex<VMetadata, EMetadata> = {
|
||||
metadata,
|
||||
edges: [],
|
||||
}
|
||||
for (let edge of fromEdges) {
|
||||
const vEdge = {
|
||||
metadata: edge.metadata,
|
||||
from: edge.from,
|
||||
to: vertex,
|
||||
}
|
||||
edge.from.edges.push(vEdge)
|
||||
vertex.edges.push(vEdge)
|
||||
}
|
||||
for (let edge of toEdges) {
|
||||
const vEdge = {
|
||||
metadata: edge.metadata,
|
||||
from: vertex,
|
||||
to: edge.to,
|
||||
}
|
||||
edge.to.edges.push(vEdge)
|
||||
vertex.edges.push(vEdge)
|
||||
}
|
||||
this.vertices.push(vertex)
|
||||
return vertex
|
||||
}
|
||||
findVertex(
|
||||
predicate: (vertex: Vertex<VMetadata, EMetadata>) => boolean,
|
||||
): Generator<Vertex<VMetadata, EMetadata>, void> {
|
||||
const veritces = this.vertices
|
||||
function* gen() {
|
||||
for (let vertex of veritces) {
|
||||
if (predicate(vertex)) {
|
||||
yield vertex
|
||||
}
|
||||
}
|
||||
}
|
||||
return gen()
|
||||
}
|
||||
addEdge(
|
||||
metadata: EMetadata,
|
||||
from: Vertex<VMetadata, EMetadata>,
|
||||
to: Vertex<VMetadata, EMetadata>,
|
||||
): Edge<EMetadata, VMetadata> {
|
||||
const edge = {
|
||||
metadata,
|
||||
from,
|
||||
to,
|
||||
}
|
||||
edge.from.edges.push(edge)
|
||||
edge.to.edges.push(edge)
|
||||
return edge
|
||||
}
|
||||
breadthFirstSearch(
|
||||
from:
|
||||
| Vertex<VMetadata, EMetadata>
|
||||
| ((vertex: Vertex<VMetadata, EMetadata>) => boolean),
|
||||
): Generator<Vertex<VMetadata, EMetadata>, void> {
|
||||
const visited: Array<Vertex<VMetadata, EMetadata>> = []
|
||||
function* rec(
|
||||
vertex: Vertex<VMetadata, EMetadata>,
|
||||
): Generator<Vertex<VMetadata, EMetadata>, void> {
|
||||
if (visited.includes(vertex)) {
|
||||
return
|
||||
}
|
||||
visited.push(vertex)
|
||||
yield vertex
|
||||
let generators = vertex.edges
|
||||
.filter((e) => e.from === vertex)
|
||||
.map((e) => rec(e.to))
|
||||
while (generators.length) {
|
||||
let prev = generators
|
||||
generators = []
|
||||
for (let gen of prev) {
|
||||
const next = gen.next()
|
||||
if (!next.done) {
|
||||
generators.push(gen)
|
||||
yield next.value
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (from instanceof Function) {
|
||||
let generators = this.vertices.filter(from).map(rec)
|
||||
return (function* () {
|
||||
while (generators.length) {
|
||||
let prev = generators
|
||||
generators = []
|
||||
for (let gen of prev) {
|
||||
const next = gen.next()
|
||||
if (!next.done) {
|
||||
generators.push(gen)
|
||||
yield next.value
|
||||
}
|
||||
}
|
||||
}
|
||||
})()
|
||||
} else {
|
||||
return rec(from)
|
||||
}
|
||||
}
|
||||
reverseBreadthFirstSearch(
|
||||
to:
|
||||
| Vertex<VMetadata, EMetadata>
|
||||
| ((vertex: Vertex<VMetadata, EMetadata>) => boolean),
|
||||
): Generator<Vertex<VMetadata, EMetadata>, void> {
|
||||
const visited: Array<Vertex<VMetadata, EMetadata>> = []
|
||||
function* rec(
|
||||
vertex: Vertex<VMetadata, EMetadata>,
|
||||
): Generator<Vertex<VMetadata, EMetadata>, void> {
|
||||
if (visited.includes(vertex)) {
|
||||
return
|
||||
}
|
||||
visited.push(vertex)
|
||||
yield vertex
|
||||
let generators = vertex.edges
|
||||
.filter((e) => e.to === vertex)
|
||||
.map((e) => rec(e.from))
|
||||
while (generators.length) {
|
||||
let prev = generators
|
||||
generators = []
|
||||
for (let gen of prev) {
|
||||
const next = gen.next()
|
||||
if (!next.done) {
|
||||
generators.push(gen)
|
||||
yield next.value
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (to instanceof Function) {
|
||||
let generators = this.vertices.filter(to).map(rec)
|
||||
return (function* () {
|
||||
while (generators.length) {
|
||||
let prev = generators
|
||||
generators = []
|
||||
for (let gen of prev) {
|
||||
const next = gen.next()
|
||||
if (!next.done) {
|
||||
generators.push(gen)
|
||||
yield next.value
|
||||
}
|
||||
}
|
||||
}
|
||||
})()
|
||||
} else {
|
||||
return rec(to)
|
||||
}
|
||||
}
|
||||
shortestPath(
|
||||
from:
|
||||
| Vertex<VMetadata, EMetadata>
|
||||
| ((vertex: Vertex<VMetadata, EMetadata>) => boolean),
|
||||
to:
|
||||
| Vertex<VMetadata, EMetadata>
|
||||
| ((vertex: Vertex<VMetadata, EMetadata>) => boolean),
|
||||
): Array<Edge<EMetadata, VMetadata>> | void {
|
||||
const isDone =
|
||||
to instanceof Function
|
||||
? to
|
||||
: (v: Vertex<VMetadata, EMetadata>) => v === to
|
||||
const path: Array<Edge<EMetadata, VMetadata>> = []
|
||||
const visited: Array<Vertex<VMetadata, EMetadata>> = []
|
||||
function* check(
|
||||
vertex: Vertex<VMetadata, EMetadata>,
|
||||
path: Array<Edge<EMetadata, VMetadata>>,
|
||||
): Generator<undefined, Array<Edge<EMetadata, VMetadata>> | undefined> {
|
||||
if (isDone(vertex)) {
|
||||
return path
|
||||
}
|
||||
if (visited.includes(vertex)) {
|
||||
return
|
||||
}
|
||||
visited.push(vertex)
|
||||
yield
|
||||
let generators = vertex.edges
|
||||
.filter((e) => e.from === vertex)
|
||||
.map((e) => check(e.to, [...path, e]))
|
||||
while (generators.length) {
|
||||
let prev = generators
|
||||
generators = []
|
||||
for (let gen of prev) {
|
||||
const next = gen.next()
|
||||
if (next.done === true) {
|
||||
if (next.value) {
|
||||
return next.value
|
||||
}
|
||||
} else {
|
||||
generators.push(gen)
|
||||
yield
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (from instanceof Function) {
|
||||
let generators = this.vertices.filter(from).map((v) => check(v, []))
|
||||
while (generators.length) {
|
||||
let prev = generators
|
||||
generators = []
|
||||
for (let gen of prev) {
|
||||
const next = gen.next()
|
||||
if (next.done === true) {
|
||||
if (next.value) {
|
||||
return next.value
|
||||
}
|
||||
} else {
|
||||
generators.push(gen)
|
||||
}
|
||||
}
|
||||
}
|
||||
} else {
|
||||
const gen = check(from, [])
|
||||
while (true) {
|
||||
const next = gen.next()
|
||||
if (next.done) {
|
||||
return next.value
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user